bsdrks / graaf / 9319824059

100%

push

github

release: 0.52.7

Added

- Add trait `IsSuperdigraph`.
- Implement `IsSubdigraph` for `[BTreeMap<usize, W>]`.
- Implement `IsSubdigraph` for `[HashMap<usize, W>]`.
- Implement and test `IsSubdigraph` for `[BTreeSet<usize>]`.
- Implement and test `IsSubdigraph` for `[HashSet<usize>]`.
- Implement and test `IsSuperdigraph` for `BTreeMap<usize, BTreeMap<usize, W>>`.
- Implement and test `IsSuperdigraph` for `BTreeMap<usize, BTreeSet<usize>>`.
- Implement and test `IsSuperdigraph` for `HashMap<usize, HashMap<usize, W>>`.
- Implement and test `IsSuperdigraph` for `HashMap<usize, HashSet<usize>>`.
- Implement and test `IsSuperdigraph` for `Vec<BTreeMap<usize, W>>`.
- Implement and test `IsSuperdigraph` for `Vec<BTreeSet<usize>>`.
- Implement and test `IsSuperdigraph` for `Vec<HashMap<usize, W>>`.
- Implement and test `IsSuperdigraph` for `Vec<HashSet<usize>>`.
- Implement and test `IsSuperdigraph` for `[BTreeMap<usize, W>; V]`.
- Implement and test `IsSuperdigraph` for `[BTreeMap<usize, W>]`.
- Implement and test `IsSuperdigraph` for `[BTreeSet<usize>; V]`.
- Implement and test `IsSuperdigraph` for `[BTreeSet<usize>]`.
- Implement and test `IsSuperdigraph` for `[HashMap<usize, W>; V]`.
- Implement and test `IsSuperdigraph` for `[HashMap<usize, W>]`.

27 of 27 new or added lines in 1 file covered. (100.0%)

8318 of 8318 relevant lines covered (100.0%)

58739.3 hits per line