On Tue, Jan 31, 2017 at 10:08 PM, Henrik Johansson <dahankz...@gmail.com> wrote: > What makes strings harder than for example []byte?
Sorry, I'm not sure who you are asking, or, really what you are asking. []byte doesn't have a small-slice-optimization either. Ian > On Wed, Feb 1, 2017, 06:15 Ian Lance Taylor <i...@golang.org> wrote: >> >> On Tue, Jan 31, 2017 at 9:10 PM, Eliot Hedeman >> <eliot.d.hede...@gmail.com> wrote: >> > I was writing up a proposal about adding the small string >> > optimization(putting strings on the heap if they will fit within the >> > sringStruct)to the go runtime, and I realized there might be good reason >> > why >> > this has not been done yet. Are there any glaring reasons you can think >> > of? >> > Here is the really rough draft of the proposal. Thanks for the feedback! >> >> The problem is that the concurrent garbage collector needs to be able >> to determine reliably and safely whether a word in memory, including >> on the stack, contains a pointer or not. It's not OK to have a word >> in memory that might or might contain a pointer. It's a good thing >> that Go doesn't have unions in the language, because they would be >> very difficult to implement in the garbage collector. -- You received this message because you are subscribed to the Google Groups "golang-nuts" group. To unsubscribe from this group and stop receiving emails from it, send an email to golang-nuts+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
