Go's Equivalent to C 's memset: How to Efficiently Initialize Arrays with Non-Zero Values?

Go Equivalent to C 's memset

Original Question:

Is there a method in Go that is analogous to C 's memset function, which allows for efficient initialization of arrays with non-zero values?

Answer:

Go does not offer a direct equivalent to memset in its standard library. However, there are several approaches that can achieve similar functionality:

Loop-Based Solution:

func memsetLoop(a []int, v int) {
    for i := range a {
        a[i] = v
    }
}

This simple loop iterates over an array and assigns the value v to each element.

Optimized Solution Using copy():

Go's copy() function is highly optimized and can be utilized for this purpose:

func memsetRepeat(a []int, v int) {
    if len(a) == 0 {
        return
    }
    a[0] = v
    for bp := 1; bp < len(a); bp *= 2 {
        copy(a[bp:], a[:bp])
    }
}

This solution sets the first element manually and then repeatedly copies the initialized portion of the array onto the remaining elements.

Performance Comparison:

Benchmarks show that the memsetRepeat solution outperforms the loop-based approach for larger arrays due to the optimized copy() function.

To summarize, Go programmers can use either the loop-based solution for simplicity or the optimized memsetRepeat solution for improved performance when initializing arrays with non-zero values.

The above is the detailed content of Go's Equivalent to C 's memset: How to Efficiently Initialize Arrays with Non-Zero Values?. For more information, please follow other related articles on the PHP Chinese website!