< Summary

Class:Microsoft.FSharp.Collections.SetTreeModule
Assembly:FSharp.Core
File(s):F:\workspace\_work\1\s\src\fsharp\FSharp.Core\set.fs
Covered lines:0
Uncovered lines:204
Coverable lines:204
Total lines:0
Line coverage:0% (0 of 204)
Covered branches:0
Total branches:128
Branch coverage:0% (0 of 128)
Tag:24_1835905959

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity NPath complexity Sequence coverage
countAux(...)0%12300%
height(...)0%12300%
mk(...)0%20420%
rebalance(...)0%9092560%
add(...)0%567160%
balance(...)0%909320%
split(...)0%567160%
spliceOutSuccessor(...)0%20420%
remove(...)0%728320%
mem(...)0%30540%
iter(...)0%12300%
foldBackOpt(...)0%12300%
foldOpt(...)0%12300%
forall(...)0%30500%
exists(...)0%30500%
subset(...)0%2100%
Invoke(...)0%2100%
Invoke(...)0%2100%
filterAux(...)0%30540%
diffAux(...)0%20440%
union(...)0%72880%
intersectionAux(...)0%30540%
partition1(...)0%6220%
partitionAux(...)0%12300%
minimumElementAux(...)0%12300%
minimumElementOpt(...)0%12300%
maximumElementAux(...)0%12300%
maximumElementOpt(...)0%12300%
minimumElement(...)0%6220%
maximumElement(...)0%6220%
collapseLHS(...)0%20400%
mkIterator(...)0%2100%
notStarted()0%2100%
alreadyFinished()0%2100%
current(...)0%20480%
moveNext(...)0%20480%
mkIEnumerator(...)0%2100%
System.Collections.Generic.IEnumerator<'a>.get_Current()0%2100%
System.Collections.IEnumerator.get_Current()0%2100%
System.Collections.IEnumerator.MoveNext()0%2100%
System.Collections.IEnumerator.Reset()0%2100%
System.IDisposable.Dispose()0%2100%
compareStacks(...)0%46221122880%
compare(...)0%20420%
loop@481-44(...)0%12300%
toList(...)0%2100%
copyToArray(...)0%2100%
Invoke(...)0%2100%
toArray(...)0%2100%
mkFromEnumerator(...)0%6220%
ofSeq(...)0%6200%
ofArray(...)0%2100%
Invoke(...)0%2100%

File(s)

F:\workspace\_work\1\s\src\fsharp\FSharp.Core\set.fs

File 'F:\workspace\_work\1\s\src\fsharp\FSharp.Core\set.fs' does not exist (any more).

Generated by: ReportGenerator 4.8.4.0
02/13/2022 - 05:30:11
GitHub | www.palmmedia.de

Methods/Properties

countAux(Microsoft.FSharp.Collections.SetTree`1<a>,System.Int32)
height(Microsoft.FSharp.Collections.SetTree`1<a>)
mk(Microsoft.FSharp.Collections.SetTree`1<a>,a,Microsoft.FSharp.Collections.SetTree`1<a>)
rebalance(Microsoft.FSharp.Collections.SetTree`1<a>,a,Microsoft.FSharp.Collections.SetTree`1<a>)
add(System.Collections.Generic.IComparer`1<T>,T,Microsoft.FSharp.Collections.SetTree`1<T>)
balance(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,a,Microsoft.FSharp.Collections.SetTree`1<a>)
split(System.Collections.Generic.IComparer`1<T>,T,Microsoft.FSharp.Collections.SetTree`1<T>)
spliceOutSuccessor(Microsoft.FSharp.Collections.SetTree`1<a>)
remove(System.Collections.Generic.IComparer`1<T>,T,Microsoft.FSharp.Collections.SetTree`1<T>)
mem(System.Collections.Generic.IComparer`1<T>,T,Microsoft.FSharp.Collections.SetTree`1<T>)
iter(Microsoft.FSharp.Core.FSharpFunc`2<a,Microsoft.FSharp.Core.Unit>,Microsoft.FSharp.Collections.SetTree`1<a>)
foldBackOpt(Microsoft.FSharp.Core.OptimizedClosures/FSharpFunc`3<a,b,b>,Microsoft.FSharp.Collections.SetTree`1<a>,b)
foldOpt(Microsoft.FSharp.Core.OptimizedClosures/FSharpFunc`3<a,b,a>,a,Microsoft.FSharp.Collections.SetTree`1<b>)
forall(Microsoft.FSharp.Core.FSharpFunc`2<a,System.Boolean>,Microsoft.FSharp.Collections.SetTree`1<a>)
exists(Microsoft.FSharp.Core.FSharpFunc`2<a,System.Boolean>,Microsoft.FSharp.Collections.SetTree`1<a>)
subset(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
Invoke(a)
Invoke(a)
filterAux(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Core.FSharpFunc`2<a,System.Boolean>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
diffAux(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
union(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
intersectionAux(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
partition1(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Core.FSharpFunc`2<a,System.Boolean>,a,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
partitionAux(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Core.FSharpFunc`2<a,System.Boolean>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
minimumElementAux(Microsoft.FSharp.Collections.SetTree`1<a>,a)
minimumElementOpt(Microsoft.FSharp.Collections.SetTree`1<a>)
maximumElementAux(Microsoft.FSharp.Collections.SetTree`1<a>,a)
maximumElementOpt(Microsoft.FSharp.Collections.SetTree`1<a>)
minimumElement(Microsoft.FSharp.Collections.SetTree`1<a>)
maximumElement(Microsoft.FSharp.Collections.SetTree`1<a>)
collapseLHS(Microsoft.FSharp.Collections.FSharpList`1<Microsoft.FSharp.Collections.SetTree`1<a>>)
mkIterator(Microsoft.FSharp.Collections.SetTree`1<a>)
notStarted()
alreadyFinished()
current(Microsoft.FSharp.Collections.SetTreeModule/SetIterator`1<a>)
moveNext(Microsoft.FSharp.Collections.SetTreeModule/SetIterator`1<a>)
mkIEnumerator(Microsoft.FSharp.Collections.SetTree`1<a>)
System.Collections.Generic.IEnumerator<'a>.get_Current()
System.Collections.IEnumerator.get_Current()
System.Collections.IEnumerator.MoveNext()
System.Collections.IEnumerator.Reset()
System.IDisposable.Dispose()
compareStacks(System.Collections.Generic.IComparer`1<T>,Microsoft.FSharp.Collections.FSharpList`1<Microsoft.FSharp.Collections.SetTree`1<T>>,Microsoft.FSharp.Collections.FSharpList`1<Microsoft.FSharp.Collections.SetTree`1<T>>)
compare(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>)
loop@481-44(Microsoft.FSharp.Collections.SetTree`1<b>,Microsoft.FSharp.Collections.FSharpList`1<b>)
toList(Microsoft.FSharp.Collections.SetTree`1<a>)
copyToArray(Microsoft.FSharp.Collections.SetTree`1<a>,a[],System.Int32)
Invoke(a)
toArray(Microsoft.FSharp.Collections.SetTree`1<a>)
mkFromEnumerator(System.Collections.Generic.IComparer`1<a>,Microsoft.FSharp.Collections.SetTree`1<a>,System.Collections.Generic.IEnumerator`1<a>)
ofSeq(System.Collections.Generic.IComparer`1<a>,System.Collections.Generic.IEnumerable`1<a>)
ofArray(System.Collections.Generic.IComparer`1<a>,a[])
Invoke(Microsoft.FSharp.Collections.SetTree`1<a>,a)