There is no safe way to get a reference to the underlying array of a slice. So how do you check if two slices share the same array?
If the slices overlapped we could look for an element with the same memory address (which we can get using the & operator).
Since there is no guarantee the slices overlap we need to do a bit more work: we need to re-slice them up to their capacity. This gives us two new slices that will overlap if they share the same backing array.
We can then compare the addresses of their last elements to check if they share a backing array.
The diagram shows this procedure.
And the example code below shows a generic SameArray function that implements this check.
package main
import (
"fmt"
)
func main() {
a := [6]string{"", "🍕", "🍔", "🍒", "🍋", ""}
food := a[1:3]
fruits := a[3:5]
other := []string{"", ""}
fmt.Println("do food and fruits share an array?", SameArray(food, fruits))
fmt.Println("do food and other share an array?", SameArray(food, other))
fmt.Println("do fruits and other share an array?", SameArray(fruits, other))
}
// SameArray checks if two slices reference the same backing array.
func SameArray[T any](s1, s2 []T) bool {
cap1 := cap(s1)
cap2 := cap(s2)
// nil slices will never have the same array.
if cap1 == 0 || cap2 == 0 {
return false
}
// compare the address of the last element in each backing array.
return &s1[0:cap1][cap1-1] == &s2[0:cap2][cap2-1]
}
Make privacy claims you can back up
Join 800+ subscribers.
One email every few weeks.
I share what I learn building privacy-friendly systems. From confidential computing to Verbond and the occasional Go tip or trick. You can unsubscribe at any time.
Written by Willem Schots
I help teams prove what happens to their users' data, and I'm building Verbond, which shows where data can go before third-party code runs.
This site started as a place to learn Go. Most posts are now about privacy-friendly and verifiable systems, with the occasional Go post in between.
Want to talk about your system? Book a 30-minute call, or follow me on Bluesky and LinkedIn.