(dAtA []byte)
| 9120 | } |
| 9121 | |
| 9122 | func (m *Function) MarshalToSizedBuffer(dAtA []byte) (int, error) { |
| 9123 | i := len(dAtA) |
| 9124 | _ = i |
| 9125 | var l int |
| 9126 | _ = l |
| 9127 | if len(m.Args) > 0 { |
| 9128 | for iNdEx := len(m.Args) - 1; iNdEx >= 0; iNdEx-- { |
| 9129 | i -= len(m.Args[iNdEx]) |
| 9130 | copy(dAtA[i:], m.Args[iNdEx]) |
| 9131 | i = encodeVarintPb(dAtA, i, uint64(len(m.Args[iNdEx]))) |
| 9132 | i-- |
| 9133 | dAtA[i] = 0x1a |
| 9134 | } |
| 9135 | } |
| 9136 | if len(m.Key) > 0 { |
| 9137 | i -= len(m.Key) |
| 9138 | copy(dAtA[i:], m.Key) |
| 9139 | i = encodeVarintPb(dAtA, i, uint64(len(m.Key))) |
| 9140 | i-- |
| 9141 | dAtA[i] = 0x12 |
| 9142 | } |
| 9143 | if len(m.Name) > 0 { |
| 9144 | i -= len(m.Name) |
| 9145 | copy(dAtA[i:], m.Name) |
| 9146 | i = encodeVarintPb(dAtA, i, uint64(len(m.Name))) |
| 9147 | i-- |
| 9148 | dAtA[i] = 0xa |
| 9149 | } |
| 9150 | return len(dAtA) - i, nil |
| 9151 | } |
| 9152 | |
| 9153 | func (m *FilterTree) Marshal() (dAtA []byte, err error) { |
| 9154 | size := m.Size() |
no test coverage detected