mirror of
https://github.com/golang/go
synced 2024-11-21 14:14:40 -07:00
bytes, strings: add Replace
This is the Replace I suggested in the review of CL 1114041. It's true that we already have regexp.MustCompile(regexp.QuoteMeta(old)).ReplaceAll(s, new) but because this Replace is doing a simpler job it is simpler to call and inherently more efficient. I will add the bytes implementation and tests to the CL after the strings one has been reviewed. R=r, cw CC=golang-dev https://golang.org/cl/1731048
This commit is contained in:
parent
269df58270
commit
0bf413ab8e
@ -462,3 +462,36 @@ func Runes(s []byte) []int {
|
||||
}
|
||||
return t
|
||||
}
|
||||
|
||||
// Replace returns a copy of the slice s with the first n
|
||||
// non-overlapping instances of old replaced by new.
|
||||
// If n <= 0, there is no limit on the number of replacements.
|
||||
func Replace(s, old, new []byte, n int) []byte {
|
||||
// Compute number of replacements.
|
||||
if m := Count(s, old); m == 0 {
|
||||
return s // avoid allocation
|
||||
} else if n <= 0 || m < n {
|
||||
n = m
|
||||
}
|
||||
|
||||
// Apply replacements to buffer.
|
||||
t := make([]byte, len(s)+n*(len(new)-len(old)))
|
||||
w := 0
|
||||
start := 0
|
||||
for i := 0; i < n; i++ {
|
||||
j := start
|
||||
if len(old) == 0 {
|
||||
if i > 0 {
|
||||
_, wid := utf8.DecodeRune(s[start:])
|
||||
j += wid
|
||||
}
|
||||
} else {
|
||||
j += Index(s[start:], old)
|
||||
}
|
||||
w += copy(t[w:], s[start:j])
|
||||
w += copy(t[w:], new)
|
||||
start = j + len(old)
|
||||
}
|
||||
w += copy(t[w:], s[start:])
|
||||
return t[0:w]
|
||||
}
|
||||
|
@ -645,3 +645,39 @@ func TestTrimFunc(t *testing.T) {
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
type ReplaceTest struct {
|
||||
in string
|
||||
old, new string
|
||||
n int
|
||||
out string
|
||||
}
|
||||
|
||||
var ReplaceTests = []ReplaceTest{
|
||||
ReplaceTest{"hello", "l", "L", 0, "heLLo"},
|
||||
ReplaceTest{"hello", "x", "X", 0, "hello"},
|
||||
ReplaceTest{"", "x", "X", 0, ""},
|
||||
ReplaceTest{"radar", "r", "<r>", 0, "<r>ada<r>"},
|
||||
ReplaceTest{"", "", "<>", 0, "<>"},
|
||||
ReplaceTest{"banana", "a", "<>", 0, "b<>n<>n<>"},
|
||||
ReplaceTest{"banana", "a", "<>", 1, "b<>nana"},
|
||||
ReplaceTest{"banana", "a", "<>", 1000, "b<>n<>n<>"},
|
||||
ReplaceTest{"banana", "an", "<>", 0, "b<><>a"},
|
||||
ReplaceTest{"banana", "ana", "<>", 0, "b<>na"},
|
||||
ReplaceTest{"banana", "", "<>", 0, "<>b<>a<>n<>a<>n<>a<>"},
|
||||
ReplaceTest{"banana", "", "<>", 10, "<>b<>a<>n<>a<>n<>a<>"},
|
||||
ReplaceTest{"banana", "", "<>", 6, "<>b<>a<>n<>a<>n<>a"},
|
||||
ReplaceTest{"banana", "", "<>", 5, "<>b<>a<>n<>a<>na"},
|
||||
ReplaceTest{"banana", "", "<>", 1, "<>banana"},
|
||||
ReplaceTest{"banana", "a", "a", 0, "banana"},
|
||||
ReplaceTest{"banana", "a", "a", 1, "banana"},
|
||||
ReplaceTest{"☺☻☹", "", "<>", 0, "<>☺<>☻<>☹<>"},
|
||||
}
|
||||
|
||||
func TestReplace(t *testing.T) {
|
||||
for _, tt := range ReplaceTests {
|
||||
if s := string(Replace([]byte(tt.in), []byte(tt.old), []byte(tt.new), tt.n)); s != tt.out {
|
||||
t.Errorf("Replace(%q, %q, %q, %d) = %q, want %q", tt.in, tt.old, tt.new, tt.n, s, tt.out)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -459,3 +459,51 @@ func TrimRight(s string, cutset string) string {
|
||||
func TrimSpace(s string) string {
|
||||
return TrimFunc(s, unicode.IsSpace)
|
||||
}
|
||||
|
||||
// Replace returns a copy of the string s with the first n
|
||||
// non-overlapping instances of old replaced by new.
|
||||
// If n <= 0, there is no limit on the number of replacements.
|
||||
func Replace(s, old, new string, n int) string {
|
||||
if old == new {
|
||||
return s // avoid allocation
|
||||
}
|
||||
|
||||
// Compute number of replacements.
|
||||
if m := Count(s, old); m == 0 {
|
||||
return s // avoid allocation
|
||||
} else if n <= 0 || m < n {
|
||||
n = m
|
||||
}
|
||||
|
||||
// Apply replacements to buffer.
|
||||
t := make([]byte, len(s)+n*(len(new)-len(old)))
|
||||
w := 0
|
||||
start := 0
|
||||
for i := 0; i < n; i++ {
|
||||
j := start
|
||||
if len(old) == 0 {
|
||||
if i > 0 {
|
||||
_, wid := utf8.DecodeRuneInString(s[start:])
|
||||
j += wid
|
||||
}
|
||||
} else {
|
||||
j += Index(s[start:], old)
|
||||
}
|
||||
w += copyString(t[w:], s[start:j])
|
||||
w += copyString(t[w:], new)
|
||||
start = j + len(old)
|
||||
}
|
||||
w += copyString(t[w:], s[start:])
|
||||
return string(t[0:w])
|
||||
}
|
||||
|
||||
func copyString(dst []byte, src string) int {
|
||||
n := len(dst)
|
||||
if n > len(src) {
|
||||
n = len(src)
|
||||
}
|
||||
for i := 0; i < n; i++ {
|
||||
dst[i] = src[i]
|
||||
}
|
||||
return n
|
||||
}
|
||||
|
@ -700,3 +700,39 @@ func TestReadRune(t *testing.T) {
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
type ReplaceTest struct {
|
||||
in string
|
||||
old, new string
|
||||
n int
|
||||
out string
|
||||
}
|
||||
|
||||
var ReplaceTests = []ReplaceTest{
|
||||
ReplaceTest{"hello", "l", "L", 0, "heLLo"},
|
||||
ReplaceTest{"hello", "x", "X", 0, "hello"},
|
||||
ReplaceTest{"", "x", "X", 0, ""},
|
||||
ReplaceTest{"radar", "r", "<r>", 0, "<r>ada<r>"},
|
||||
ReplaceTest{"", "", "<>", 0, "<>"},
|
||||
ReplaceTest{"banana", "a", "<>", 0, "b<>n<>n<>"},
|
||||
ReplaceTest{"banana", "a", "<>", 1, "b<>nana"},
|
||||
ReplaceTest{"banana", "a", "<>", 1000, "b<>n<>n<>"},
|
||||
ReplaceTest{"banana", "an", "<>", 0, "b<><>a"},
|
||||
ReplaceTest{"banana", "ana", "<>", 0, "b<>na"},
|
||||
ReplaceTest{"banana", "", "<>", 0, "<>b<>a<>n<>a<>n<>a<>"},
|
||||
ReplaceTest{"banana", "", "<>", 10, "<>b<>a<>n<>a<>n<>a<>"},
|
||||
ReplaceTest{"banana", "", "<>", 6, "<>b<>a<>n<>a<>n<>a"},
|
||||
ReplaceTest{"banana", "", "<>", 5, "<>b<>a<>n<>a<>na"},
|
||||
ReplaceTest{"banana", "", "<>", 1, "<>banana"},
|
||||
ReplaceTest{"banana", "a", "a", 0, "banana"},
|
||||
ReplaceTest{"banana", "a", "a", 1, "banana"},
|
||||
ReplaceTest{"☺☻☹", "", "<>", 0, "<>☺<>☻<>☹<>"},
|
||||
}
|
||||
|
||||
func TestReplace(t *testing.T) {
|
||||
for _, tt := range ReplaceTests {
|
||||
if s := Replace(tt.in, tt.old, tt.new, tt.n); s != tt.out {
|
||||
t.Errorf("Replace(%q, %q, %q, %d) = %q, want %q", tt.in, tt.old, tt.new, tt.n, s, tt.out)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
Loading…
Reference in New Issue
Block a user