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.

Sign up for GitHub

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

improve @hashmap.to_array performance #1723

Merged
merged 1 commit into from
Mar 6, 2025
Merged

improve @hashmap.to_array performance #1723

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
30 changes: 24 additions & 6 deletions hashmap/utils.mbt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -211,15 +211,33 @@ pub fn T::from_iter[K : Hash + Eq, V](iter : Iter[(K, V)]) -> T[K, V] {
/// }
/// ```
pub fn to_array[K, V](self : T[K, V]) -> Array[(K, V)] {
let arr = []
let len = self.entries.length()
for i = 0; i < len; i = i + 1 {
let mut i = 0
let res = while i < self.capacity {
match self.entries[i] {
Some({ key, value, .. }) => arr.push((key, value))
None => continue
Some({ key, value, .. }) => {
i += 1
break Array::make(self.size, (key, value))
}
_ => ()
}
i += 1
} else {
[]
}
if not(res.is_empty()) {
let mut res_idx = 1
while res_idx < res.length() && i < self.capacity {
match self.entries[i] {
Some({ key, value, .. }) => {
res[res_idx] = (key, value)
res_idx += 1
}
_ => ()
}
i += 1
}
}
arr
res
}

///|
Expand Down
Loading