(a, b valueString)
| 177 | } |
| 178 | |
| 179 | func concatStrings(a, b valueString) valueString { |
| 180 | aLen := a.length() |
| 181 | bLen := b.length() |
| 182 | if aLen == 0 { |
| 183 | return b |
| 184 | } else if bLen == 0 { |
| 185 | return a |
| 186 | } else if aLen+bLen < extendedStringMinLength { |
| 187 | runesA := a.getRunes() |
| 188 | runesB := b.getRunes() |
| 189 | result := make([]rune, 0, aLen+bLen) |
| 190 | result = append(result, runesA...) |
| 191 | result = append(result, runesB...) |
| 192 | return makeStringFromRunes(result) |
| 193 | } else { |
| 194 | return &valueStringTree{ |
| 195 | left: a, |
| 196 | right: b, |
| 197 | len: aLen + bLen, |
| 198 | } |
| 199 | } |
| 200 | } |
| 201 | |
| 202 | func stringCmp(a, b valueString) int { |
| 203 | runesA := a.getRunes() |
no test coverage detected
searching dependent graphs…