(s valueString, buf *[]rune)
| 124 | } |
| 125 | |
| 126 | func buildFullString(s valueString, buf *[]rune) { |
| 127 | switch s := s.(type) { |
| 128 | case *valueFlatString: |
| 129 | *buf = append(*buf, s.value...) |
| 130 | case *valueStringTree: |
| 131 | buildFullString(s.left, buf) |
| 132 | buildFullString(s.right, buf) |
| 133 | } |
| 134 | } |
| 135 | |
| 136 | func (s *valueStringTree) flattenToLeft() { |
| 137 | if s.right != nil { |
no outgoing calls
no test coverage detected
searching dependent graphs…