bsdrks / graaf / 8680430476

100%

push

github

release: 0.12.1

Added

- Implement `CountAllEdges` for `BTreeMap<K, BTreeMap<K, W>>`.
- Implement `CountAllEdges` for `BTreeMap<K, BTreeSet<T>>`.
- Implement `CountAllEdges` for `BTreeMap<K, Vec<T>>`.
- Implement `CountAllEdges` for `Vec<BTreeMap<K, W>>`.
- Implement `CountAllEdges` for `Vec<BTreeSet<T>>`.
- Implement `CountAllEdges` for `[BTreeMap<K, W>; V]`.
- Implement `CountAllEdges` for `[BTreeMap<K, W>]`.
- Implement `CountAllEdges` for `[BTreeSet<T>; V]`.
- Implement `CountAllEdges` for `[BTreeSet<T>]`.
- Implement `IsEdge` for `Vec<HashMap<usize, W>>`.
- Implement `IsEdge` for `[HashMap<usize, W>; V]`.

Removed

- Remove `Ord` bound from trait implementations where possible.

124 of 124 new or added lines in 3 files covered. (100.0%)

4662 of 4689 relevant lines covered (99.42%)

6.9 hits per line