Hi Oleg, Use an unrolled list: https://en.wikipedia.org/wiki/Unrolled_linked_list
In computer programming, an unrolled linked list is a variation on the > linked list which stores multiple elements in each node. It can > dramatically increase cache performance, while decreasing the memory > overhead associated with storing list metadata such as references. It is > related to the B-tree. Basically store a slice of strings instead of a single string. It's a simple enough idea that you can easily write your own, but if you want an example: https://github.com/badgerodon/container/blob/master/unrolledlist.go On Monday, February 27, 2017 at 8:04:10 AM UTC-5, Oleg Puchinin wrote: > > Hello ! > I have a million strings. The ever-expanding array is not for me. The > element on the line, too, is not it. Is there anything more powerful c > ontainer.List? > > Oleg. > -- 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.
