Documentation about bulk load

[jerabaul29]

rstar/rstar/src/rtree.rs

Lines 98 to 101 in c7d53c8

	/// # Bulk loading
	/// In many scenarios, insertion is only carried out once for many points. In this case,
	/// [RTree::bulk_load] will be considerably faster. Its total run time
	/// is still `O(log(n))`. **Note the performance caveat related to the computation of the envelope**.

is still `O(log(n)): should that not be is still `O(n log(n)) for inserting n points, though the scaling factor is significantly improved?

[jerabaul29]

(since this inserts n elements at once?)

[rmanoka]

Yes, the author probably meant O(log n) per element amortized.

[jerabaul29]

I will open a PR to clarify :) .

[grovesNL]

@jerabaul29 looks like this is fixed now

[jerabaul29]

Thanks, I just forgot to close this. Closing as solved through #156 .