(r randyThetest, easy bool)
| 26758 | } |
| 26759 | |
| 26760 | func NewPopulatedNidRepNative(r randyThetest, easy bool) *NidRepNative { |
| 26761 | this := &NidRepNative{} |
| 26762 | if r.Intn(5) != 0 { |
| 26763 | v17 := r.Intn(10) |
| 26764 | this.Field1 = make([]float64, v17) |
| 26765 | for i := 0; i < v17; i++ { |
| 26766 | this.Field1[i] = float64(r.Float64()) |
| 26767 | if r.Intn(2) == 0 { |
| 26768 | this.Field1[i] *= -1 |
| 26769 | } |
| 26770 | } |
| 26771 | } |
| 26772 | if r.Intn(5) != 0 { |
| 26773 | v18 := r.Intn(10) |
| 26774 | this.Field2 = make([]float32, v18) |
| 26775 | for i := 0; i < v18; i++ { |
| 26776 | this.Field2[i] = float32(r.Float32()) |
| 26777 | if r.Intn(2) == 0 { |
| 26778 | this.Field2[i] *= -1 |
| 26779 | } |
| 26780 | } |
| 26781 | } |
| 26782 | if r.Intn(5) != 0 { |
| 26783 | v19 := r.Intn(10) |
| 26784 | this.Field3 = make([]int32, v19) |
| 26785 | for i := 0; i < v19; i++ { |
| 26786 | this.Field3[i] = int32(r.Int31()) |
| 26787 | if r.Intn(2) == 0 { |
| 26788 | this.Field3[i] *= -1 |
| 26789 | } |
| 26790 | } |
| 26791 | } |
| 26792 | if r.Intn(5) != 0 { |
| 26793 | v20 := r.Intn(10) |
| 26794 | this.Field4 = make([]int64, v20) |
| 26795 | for i := 0; i < v20; i++ { |
| 26796 | this.Field4[i] = int64(r.Int63()) |
| 26797 | if r.Intn(2) == 0 { |
| 26798 | this.Field4[i] *= -1 |
| 26799 | } |
| 26800 | } |
| 26801 | } |
| 26802 | if r.Intn(5) != 0 { |
| 26803 | v21 := r.Intn(10) |
| 26804 | this.Field5 = make([]uint32, v21) |
| 26805 | for i := 0; i < v21; i++ { |
| 26806 | this.Field5[i] = uint32(r.Uint32()) |
| 26807 | } |
| 26808 | } |
| 26809 | if r.Intn(5) != 0 { |
| 26810 | v22 := r.Intn(10) |
| 26811 | this.Field6 = make([]uint64, v22) |
| 26812 | for i := 0; i < v22; i++ { |
| 26813 | this.Field6[i] = uint64(uint64(r.Uint32())) |
| 26814 | } |
| 26815 | } |
| 26816 | if r.Intn(5) != 0 { |
| 26817 | v23 := r.Intn(10) |
searching dependent graphs…