(in []byte)
| 605 | var bigOne = big.NewInt(1) |
| 606 | |
| 607 | func parseString(in []byte) (out, rest []byte, ok bool) { |
| 608 | if len(in) < 4 { |
| 609 | return |
| 610 | } |
| 611 | length := binary.BigEndian.Uint32(in) |
| 612 | in = in[4:] |
| 613 | if uint32(len(in)) < length { |
| 614 | return |
| 615 | } |
| 616 | out = in[:length] |
| 617 | rest = in[length:] |
| 618 | ok = true |
| 619 | return |
| 620 | } |
| 621 | |
| 622 | var ( |
| 623 | comma = []byte{','} |
no outgoing calls
searching dependent graphs…