Skip to content
This repository was archived by the owner on Jul 10, 2023. It is now read-only.

Implement HeapSizeOf for BTreeSet #96

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Implement HeapSizeOf for BTreeSet #96

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
11 changes: 10 additions & 1 deletion src/lib.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ extern crate winapi;
use winapi::um::heapapi::{GetProcessHeap, HeapSize, HeapValidate};
use std::borrow::Cow;
use std::cell::{Cell, RefCell};
use std::collections::{BTreeMap, HashSet, HashMap, LinkedList, VecDeque};
use std::collections::{BTreeMap, BTreeSet, HashSet, HashMap, LinkedList, VecDeque};
use std::hash::BuildHasher;
use std::hash::Hash;
use std::marker::PhantomData;
Expand Down Expand Up @@ -305,6 +305,15 @@ impl<K: HeapSizeOf, V: HeapSizeOf> HeapSizeOf for BTreeMap<K, V> {
}
}

impl<T: HeapSizeOf> HeapSizeOf for BTreeSet<T> {
fn heap_size_of_children(&self) -> usize {
let size = self.len() * (size_of::<T>() + size_of::<usize>());
self.iter().fold(size, |n, value| {
n + value.heap_size_of_children()
})
}
}

impl<T> HeapSizeOf for Range<T>
where
T: HeapSizeOf,
Expand Down