(dst jsWriter, src *Reader)
| 189 | } |
| 190 | |
| 191 | func rwArray(dst jsWriter, src *Reader) (n int, err error) { |
| 192 | err = dst.WriteByte('[') |
| 193 | if err != nil { |
| 194 | return |
| 195 | } |
| 196 | // This is potentially a recursive call. |
| 197 | if done, err := src.recursiveCall(); err != nil { |
| 198 | return 0, err |
| 199 | } else { |
| 200 | defer done() |
| 201 | } |
| 202 | |
| 203 | var sz uint32 |
| 204 | var nn int |
| 205 | sz, err = src.ReadArrayHeader() |
| 206 | if err != nil { |
| 207 | return |
| 208 | } |
| 209 | comma := false |
| 210 | for i := uint32(0); i < sz; i++ { |
| 211 | if comma { |
| 212 | err = dst.WriteByte(',') |
| 213 | if err != nil { |
| 214 | return |
| 215 | } |
| 216 | n++ |
| 217 | } |
| 218 | nn, err = rwNext(dst, src) |
| 219 | n += nn |
| 220 | if err != nil { |
| 221 | return |
| 222 | } |
| 223 | comma = true |
| 224 | } |
| 225 | |
| 226 | err = dst.WriteByte(']') |
| 227 | if err != nil { |
| 228 | return |
| 229 | } |
| 230 | n++ |
| 231 | return |
| 232 | } |
| 233 | |
| 234 | func rwNil(dst jsWriter, src *Reader) (int, error) { |
| 235 | err := src.ReadNil() |
nothing calls this directly
no test coverage detected
searching dependent graphs…