Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update the scaling discussion for bulk_load #156

Merged
merged 2 commits into from
Jan 23, 2024
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion rstar/src/rtree.rs
Original file line number Diff line number Diff line change
Expand Up @@ -98,7 +98,10 @@ where
/// # 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(nlog(n))`, i.e. `O(log(n))` per element inserted, but the scaling
/// factor is, on average, significantly improved compared with performing single
/// insertion n times in a row. **Note the performance caveat
/// related to the computation of the envelope**.
///
/// # Element distribution
/// The tree's performance heavily relies on the spatial distribution of its elements.
Expand Down