On Sat, Sep 4, 2021 at 9:38 PM tapi...@gmail.com <tapir....@gmail.com> wrote:
> Why? That is an undocumented implementation detail. Furthermore, the >> length of "x1" and "x2" at the time when they are appended to, in >> combination with the value being appended, are reasonable predictors of the >> capacity of the new slice. It is up to you to prove that a different >> heuristic performs better. >> > > Are there some evidences to prove the current algorithm is better? > It is your responsibility to show that a different heuristic (not "algorithm"). is better. -- Kurtis Rader Caretaker of the exceptional canines Junior and Hank -- 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. To view this discussion on the web visit https://groups.google.com/d/msgid/golang-nuts/CABx2%3DD9gN5Qw%3D3txpcoBtsm565REmyOOSzLX3kiB-CAbpdoBgA%40mail.gmail.com.
