improve @immut/array::from_iter

[illusory0x0]

That is exactly what Clojure’s persistent vector does, and it is done through balanced, ordered trees.

persistent vector is implemented using balanced tree and share Path during update/insert/remove, using Array as buffer avoids creating a lot of @immut/array[T].

• [Performance] @immut/array::from_iter #1583

[coveralls]

Pull Request Test Coverage Report for Build 5628

Details

• 15 of 16 (93.75%) changed or added relevant lines in 1 file are covered.
• No unchanged relevant lines lost coverage.
• Overall coverage increased (+0.002%) to 92.55%

---

Changes Missing Coverage	Covered Lines	Changed/Added Lines	%
immut/array/array.mbt	15	16	93.75%

Totals
Change from base Build 5623:	0.002%
Covered Lines:	6025
Relevant Lines:	6510

---

💛 - Coveralls

[peter-jerry-ye]

This is not ideal when handling large Array as this would also introduce resizing.

It would be better to allocate an FixedArray of size branching_factor, and then insert it to the tree.

[illusory0x0]

This is not ideal when handling large Array as this would also introduce resizing.

It would be better to allocate an FixedArray of size branching_factor, and then insert it to the tree.

The new_by_leaves implementation will do this