zoukankan      html  css  js  c++  java
  • eslint 配置

    {
      "editor.tabSize": 2,
      "standard.validate": [
        "javascript",
        "javascriptreact",
        {
          "language": "vue",
          "autoFix": true
        }
      ],
      "standard.options": {
        "plugin": [
          "html"
        ]
      },
      "editor.formatOnSave": true,
      // 添加 vue 支持
      "eslint.validate": [
        "javascript",
        "javascriptreact",
        {
          "language": "vue",
          "autoFix": true
        }
      ],
      // "backgroung.enable": true,
      // "background.useDefault": false,
      // "background.customImages": [
      //   "file:///C:/Users/Administrator/Pictures/timg (4).jpg"
      // ],
      "background.style": {
        "content": "''",
        "pointer-events": "none",
        "position": "absolute",
        "top": "0",
        "right": "0",
        "width": "100%",
        "height": "100%",
        "z-index": "99999",
        "background.repeat": "no-repeat",
        "background-size": "contain",
        "opacity": 0.1
      },
      // 使用插件格式化 html
      "vetur.format.defaultFormatter.html": "js-beautify-html",
      "vetur.format.defaultFormatter.js": "none",
      "prettier.semi": false,
      "search.followSymlinks": false,
      "explorer.confirmDragAndDrop": false,
      "workbench.editor.enablePreview": false,
      "window.zoomLevel": 0,
      "files.autoSave": "afterDelay",
      "javascript.updateImportsOnFileMove.enabled": "always",
      "eslint.autoFixOnSave": true
    }
    

      

  • 相关阅读:
    24点游戏算法
    汉诺塔算法
    台阶算法
    质因数分解算法
    全排列递归算法
    DFS 深度优先搜索例题
    容器
    数细胞
    C++栈和队列
    C++STL中vector容器 begin()与end()函数、front()与back()的用法
  • 原文地址:https://www.cnblogs.com/dhsz/p/11770207.html
Copyright © 2011-2022 走看看