(b []byte)
| 42 | } |
| 43 | |
| 44 | func skipSpacesN(b []byte) ([]byte, int) { |
| 45 | for i := range b { |
| 46 | switch b[i] { |
| 47 | case sp, ht, nl, cr: |
| 48 | default: |
| 49 | return b[i:], i |
| 50 | } |
| 51 | } |
| 52 | return nil, 0 |
| 53 | } |
| 54 | |
| 55 | func trimTrailingSpaces(b []byte) []byte { |
| 56 | if len(b) > 0 && b[len(b)-1] <= 0x20 { |
no outgoing calls
no test coverage detected
searching dependent graphs…