The reserve method optimizes memory allocation by preallocating space for the expected number of elements (nNodes), reducing reallocations and improving performance. The upper bound ensures efficient memory usage based on the input constraints.
before:
0| ns/op | op/s | err% | total | benchmark
1|--------------------:|--------------------:|--------:|----------:|:----------
2| 76,852.79 | 13,011.89 | 0.4% | 1.07 | `AddrManGetAddr`
3| 76,598.21 | 13,055.14 | 0.2% | 1.07 | `AddrManGetAddr`
4| 76,296.32 | 13,106.79 | 0.1% | 1.07 | `AddrManGetAddr`
after:
0| ns/op | op/s | err% | total | benchmark
1|--------------------:|--------------------:|--------:|----------:|:----------
2| 65,966.97 | 15,159.10 | 0.3% | 1.07 | `AddrManGetAddr`
3| 66,075.40 | 15,134.23 | 0.2% | 1.06 | `AddrManGetAddr`
4| 66,306.34 | 15,081.51 | 0.3% | 1.06 | `AddrManGetAddr`