Your array is allocated on the heap, and the ints are not boxed. The source of your confusion is likely because people have said that reference types are allocated on the heap, and value types are allocated on the stack. This is not an entirely accurate representation. All local variables and parameters are allocated on … Read more
vector<Type> vect; will allocate the vector, i.e. the header info, on the stack, but the elements on the free store (“heap”). vector<Type> *vect = new vector<Type>; allocates everything on the free store. vector<Type*> vect; will allocate the vector on the stack and a bunch of pointers on the free store, but where these point is … Read more
A static two-dimensional array looks like an array of arrays – it’s just laid out contiguously in memory. Arrays are not the same thing as pointers, but because you can often use them pretty much interchangeably it can get confusing sometimes. The compiler keeps track properly, though, which makes everything line up nicely. You do … Read more
Upon comparing test code with Sam, I determined that we are both right! However, about different things: Accessing memory (reading and writing) is just as fast wherever it is – stack, global or heap. Allocating it, however, is fastest on stack and slowest on heap. It goes like this: stack < global < heap. (allocation … Read more
It’s worth noting that the words “stack” and “heap” do not appear anywhere in the language spec. Your question is worded with “…is declared on the stack,” and “…declared on the heap,” but note that Go declaration syntax says nothing about stack or heap. That technically makes the answer to all of your questions implementation … Read more