()
| 40 | } |
| 41 | |
| 42 | func GetInnerBase3() *example3.InnerBase { |
| 43 | in := example3.NewInnerBase() |
| 44 | in.Binary = []byte{0xff, 0xff, 0xff, 0xff} |
| 45 | in.Bool = true |
| 46 | in.Byte = math.MaxInt8 |
| 47 | in.Int16 = math.MinInt16 |
| 48 | in.Int32 = math.MaxInt32 |
| 49 | in.Int64 = math.MinInt64 |
| 50 | in.Double = math.MaxFloat64 |
| 51 | in.String_ = "hello" |
| 52 | in.ListInt32 = []int32{math.MinInt32, 0, math.MaxInt32} |
| 53 | in.SetInt32 = []int32{math.MinInt32, 0, math.MaxInt32} |
| 54 | in.MapStringString = map[string]string{"a": "A", "c": "C", "b": "B"} |
| 55 | in.Foo = 1 |
| 56 | in.MapInt8String = map[int8]string{1: "A", 2: "B", 3: "C"} |
| 57 | in.MapInt16String = map[int16]string{1: "A", 2: "B", 3: "C"} |
| 58 | in.MapInt32String = map[int32]string{1: "A", 2: "B", 3: "C"} |
| 59 | in.MapInt64String = map[int64]string{1: "A", 2: "B", 3: "C"} |
| 60 | in.InnerQuery = "中文" |
| 61 | |
| 62 | innerx := GetEmptyInnerBase3() |
| 63 | innerx.Base = GetBase() |
| 64 | in.ListInnerBase = []*example3.InnerBase{ |
| 65 | innerx, |
| 66 | } |
| 67 | in.MapStringInnerBase = map[string]*example3.InnerBase{ |
| 68 | "innerx": innerx, |
| 69 | } |
| 70 | |
| 71 | in.Base = GetBase() |
| 72 | in.Base.LogID = "log_id_inner" |
| 73 | in.Base.TrafficEnv = &base.TrafficEnv{ |
| 74 | Open: true, |
| 75 | Env: "env_inner", |
| 76 | } |
| 77 | return in |
| 78 | } |
| 79 | |
| 80 | func GetExample3Req() *example3.ExampleReq { |
| 81 | obj := example3.NewExampleReq() |
no test coverage detected
searching dependent graphs…