zoukankan      html  css  js  c++  java
  • 前后端接口对接汇总

    /**
     * 查询所有用户信息
     * @GetMapping(value = "/all/users")
     */
    export function list () {
      return request({
        url: BASE_URL + '/all/users',
        method: 'get'
      })
    }
    
    /**
     * 保存用户信息
     * @param {Object} user
     * @PostMapping(value = "/save/user/info")
     	public Integer saveUserInfo(@RequestBody User user)
     */
    export function saveUserInfo (user) {
      return request({
        url: BASE_URL + '/save/user/info',
        method: 'post',
        headers: { 'Content-Type': 'application/json;charset=UTF-8' },
        // 扩展运算符(spread)是三个点(...)。它将一个数组或对象转为用逗号分隔的参数序列。
        data: { ...user }
      })
    }
    
    /**
     * 根据用户id删除用户信息
     * @param id
     * @GetMapping(value = "/delete/user/info")
     	public Integer deleteUserInfo(@RequestParam("id") Integer id)
     */
    export function deleteUserInfo (id) {
      return request({
        url: BASE_URL + '/delete/user/info?id=' + id,
        method: 'get'
      })
    }
    
    /**
     * 修改用户信息
     * @param {Object} user
     * @PostMapping(value = "/update/user/info")
     	public Integer updateUserInfo(@RequestBody User user)
     */
    export function updateUserInfo (user) {
      return request({
        url: BASE_URL + '/update/user/info',
        method: 'post',
        headers: { 'Content-Type': 'application/json;charset=UTF-8' },
        data: { ...user }
      })
    }
    
    /**
     * 根据URL输入用户名查询用户信息
     * @GetMapping(value = "/query/{username}")
     	public R<User> getUserInfoByName(@PathVariable String username)
     */
    export function searchUserInfo (username) {
      return request({
        url: BASE_URL + '/query/' + username,
        method: 'get'
      })
    }
    
    
  • 相关阅读:
    x64 平台开发 Mapxtreme 编译错误
    hdu 4305 Lightning
    Ural 1627 Join(生成树计数)
    poj 2104 Kth Number(可持久化线段树)
    ural 1651 Shortest Subchain
    hdu 4351 Digital root
    hdu 3221 Bruteforce Algorithm
    poj 2892 Tunnel Warfare (Splay Tree instead of Segment Tree)
    hdu 4031 Attack(BIT)
    LightOJ 1277 Looking for a Subsequence
  • 原文地址:https://www.cnblogs.com/code-duck/p/13843059.html
Copyright © 2011-2022 走看看