CODEWITHSUNDEEP
go
loonyuni
loonyuni

Reputation: 1483

Recursively index arbitrarily nested slice/array

I'm looking for the go equivalent of something like the below python snippet

indexes = [0,4]
nestedArray = [[1,2,3,4,5],[6,7,8]] # could be [][][]string, [][][][]float.. etc
def getNestedIndex(nestedArray, indexes):
  curr = nestedArray
  while indexes {
    curr = nestedArray[indexes.pop(0)]
  }
return curr # should be 5

I tried something like this

func nestedArrayIndex(slice []interface{}, indexes []int) interface{} {
    if len(indexes) == 1 {
        return slice[indexes[0]]
    }
    var newSlice []interface{}
    newSlice = slice[indexes[0]]
    return nestedArrayIndex(newSlice, indexes[1:])
}

but two things occur here - []Type != []interface{} and [][]..Type definitely won't work here.

Wondering if there's a way to achieve this in go?

Upvotes: 0

Views: 404

Answers (1)

leaf bebop
leaf bebop

Reputation: 8232

You can do that with reflect. reflect.Value has a method Index for getting the item of the index in the slice underlying the Value.

func nestedArrayIndex(slice interface{}, indexes []int) interface{} {
    v := reflect.ValueOf(slice)
    for _, i := range indexes {
        v = v.Index(i)
    }
    return v.Interface()
}

Playground: https://play.golang.org/p/Tmdomx18qPg

Upvotes: 2

Related Questions