大蟒蛇python教程共享python自动化测试用例全对偶组合与全覆盖组合比较

import itertools

import metacomm.combinatorics.all_pairs2 as all_pairs

test = """{      "a": [{"a": "string"}],      "b": ["string"],      "c": "string",      "d": "bool",      "e": "int",      "f": {"ff": "string", "gg": "int"}  }"""  

def get_data_list(_type, request_type=0):      """      0表示对偶算法；1表示全匹配组合      返回参数的取值范围      """      if _type == 'string':          return ["", none, "abc123"]      elif _type == 'time':          return ["1900-01-01", time.strftime("%y-%m-%d %h:%m:%s", time.localtime())]      elif _type == 'int':          return [-1, 0, 1]      elif _type == 'decimal':          return [-0.50, 0.0, 0.50]      elif _type == 'bool':          return [true, false]      elif isinstance(_type, dict):          if request_type == 0:              return dual_test_case(_type)          elif request_type == 1:              return itertools_case_list(_type)      elif isinstance(_type, list):          new_list = []          c_list = []          if isinstance(_type[0], dict):   # 字典集合,递归取得自己的取值范围              if request_type == 0:                  c_list = dual_test_case(_type[0])  # 对偶算法              elif request_type == 1:                  c_list = itertools_case_list(_type[0])  # 全匹配算法              for case in c_list:                  new_list.append([case])          else:  # 数组集合              v_list = get_data_list(_type[0])              for case in v_list:                  new_list.append([case])              new_list.append(v_list)  # 补全一下多个值的数组          return new_list  def all_assemble(dic):      """返回每个参数的取值范围组成的二维数据，用于求笛卡尔积"""      return_list = []      for k, v in dic.items():          k_list = []          for _value in get_data_list(v, 1):              di = {}              di[k] = _value              k_list.append(di)          return_list.append(k_list)      return return_list  def itertools_case_list(dic):      """笛卡尔积"""      _list = all_assemble(dic)      case_list = []      for item in itertools.product(*_list):          d3 = {}          for di in item:              d3.update(di)          case_list.append(d3)      return case_list  def dual_test_case(_base):      """对偶生成测试用例"""      if not isinstance(_base, dict):          return []      key_list = list()      value_list = list()      case_list = list()      for k, v in _base.items():          key_list.append(k)          value_list.append(get_data_list(v))      # print(key_list, value_list)      if value_list.__len__() >= 2:          res = all_pairs.all_pairs2(value_list)          for i, b in enumerate(res):              # print i, b              dic = dict()              for n in range(b.__len__()):                  dic[key_list[n]] = b[n]              case_list.append(dic)      else:          for v in value_list[0]:              dic = dict()              dic[key_list[0]] = v              case_list.append(dic)      return case_list

case_list1 = dual_test_case(json.loads(test))  print(case_list1.__len__())  for case in case_list1:      print(str(json.dumps(case)))  case_list2 = itertools_case_list(json.loads(test))  print(case_list2.__len__())  for case in case_list2:      print(str(json.dumps(case)))