zoukankan      html  css  js  c++  java
  • restful 规范

    接口

    1.根据method不同,进行不同操作

      GET/POST/PUT/DELETE/PATCH

    2.面向资源编程

      http://www.luffycity.com/salary

    3.提现版本

      建议用:

      http://www.luffycity.com/v1/salary

      http://www.luffycity.com/v2/salary

      不建议用:

      http://www.luffycity.com/v1/salary

      http://www.luffycity.com/v2/salary

    4. 体现是API

      http://www.luffycity.com/api/v1/salary

      http://www.luffycity.com/api/v2/salary

      http://api.luffycity.com/v1/salary

      http://api.luffycity.com/v2/salary

    5.https

      http://www.luffycity.com/api/v1/salary

      http://www.luffycity.com/api/v2/salary

    6.响应式设置状态码

      200

      300

      400

      500

      return HttpResponse("adfasdf",status=300)

    7.条件

      https://www.luffy.com/apiv2/salary?page=1&size=10

    8.返回值

      https://www.luffy.com/api/v2/salary

      GET:

        [

          {"id":1,"title":"高亮"},

          {"id":2,"title":"龙泰"},

          {"id":3,"title":"小东北"}

        ]

      POST:返回新增的数据

        {"id":1."title":"高亮"}

      https://www.luffycity.com/api/v2/salary/1/

      GET:获取单条数据

        {"id":1."title":"高亮"}

      PUT:更新

        {"id":1."title":"高亮"}

      PATCH:局部更新

        {"id":1."title":"高亮"}

      DELETE:删除

    9.返回错误信息

      {

        code:100001,

        error:"xxx错误"

      }

    10. Hypermedia API

      ret={

        code:1000,

        data:{

          id:1,

          name:"小强",

          depart__id:http://www.luffycity.com/api/v1/depart/8/

          }

         }

  • 相关阅读:
    hdu 5100 n*n棋盘放k*1长方条最多覆盖面积
    poj 3635/hdu 1676 Full Tank? 车辆加油+最短路
    poj 3613 经过k条边最短路 floyd+矩阵快速幂
    2014上海全国邀请赛 解题报告
    漫谈程序员系列:看看你离优秀有多远
    C2第七次作业解题报告
    C++ STL
    hdu 5098 双队列拓扑排序
    深度学习数据集 近百个开源数据集
    helper工具包——基于cifar10数据集的cnn分类模型的模块
  • 原文地址:https://www.cnblogs.com/pengpengge/p/9683483.html
Copyright © 2011-2022 走看看