Executive summary
shayanhabibi/fickl falls short of our standard for production, held back most by its Code Health lens, the quality of the code itself. It scores 67.3 out of 100 and is rated Adequate, and 100 of its 114 critical findings are security problems.
Code Health, at 63.1, is the weakest lens and counts most in the score. The best first step for the work it takes is fixing the test command with no tests behind it, worth about 1.6 points. Removing the copied code would lift Code Health itself, worth about 3.0 points. Raising Code Health to 70 would lift the score to about 69.8.
Ninety-two pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Three secrets can leak from the build pipeline, and eight parts of the code are no longer understood by anyone working on it. Pinning each tool to an exact version, limiting each secret to its own step and having someone learn the forgotten files would close these risks. Fixing the weaknesses the scanner points to would fix the two security weaknesses in the code, and setting a waiting period for automatic updates would deal with the automatic dependency update that takes a new release at once. The four sets of files in separate parts that keep changing together need that dependency made explicit.
The product code is 418,319 lines, about €600,000 to rebuild.
If Code Health rose from 63.1 to 70, the lowest score rated Strong, the score would rise from 67.3 to about 69.8.
Rebuild cost: about €600,000 · Estimate
| Cost to rebuild | €200,000 to €1,000,000, for 3,304 to 10,481 hours of work, about 4.1 person-years for 2 to 8 engineers |
|---|---|
| Difficulty of the problem | Low, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write. |
| Quality factor | ×0.9 at a score of 67. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it. |
| Size | Large: 418,319 lines of product code |
| What it is not | Not a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one. |
Top priorities
Diagnosis: what the measurements show together
Architecture — bounded-context dependency graph
Architecture: which parts of the code depend on which
| uses → | 1 (global) | 2 System.Collections | 3 src.fable-library-ts | 4 System.Collections.Generic | 5 fable_library_rust.LrcPtr | 6 fable_library_rust.Mutable.NonSyncCell | 7 System | 8 FSharp.Compiler.Text | 9 Fable.AST | 10 Fable.Transforms.Rust.AST.Types | 11 Internal.Utilities.Collections.Tagged | 12 Internal.Utilities.Library | 13 FSharp.Compiler.AbstractIL.IL | 14 FSharp.Compiler.Syntax | 15 Fable.AST.Babel | 16 Fable.AST.Fable | 17 Fable.Transforms.Python.AST | 18 Internal.Utilities.Text.Lexing | 19 FSharp.Compiler.TypedTree | 20 FSharp.Compiler.TcGlobals | 21 FSharp.Compiler.Import | 22 FSharp.Compiler.InfoReader | 23 FSharp.Compiler.NameResolution | 24 FSharp.Compiler.Symbols | 25 FSharp.Compiler.Diagnostics | 26 FSharp.Compiler.DiagnosticsLogger | 27 FSharp.Compiler.CompilerConfig | 28 FSharp.Compiler.TypedTreeOps | 29 FSharp.Compiler.Infos | 30 FSharp.Compiler.AccessibilityLogic | 31 FSharp.Compiler.ConstraintSolver | 32 FSharp.Compiler.EditorServices | 33 FSharp.Compiler.CheckBasics | 34 FSharp.Compiler.CodeAnalysis | 35 Fable | 36 Fable.Compiler.Util | 37 Fable.Transforms.FSharp2Fable | 38 Fable.Transforms.Fable2Babel | 39 Fable.Transforms.Printer | 40 Fable.Standalone.Main |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 (global) | ||||||||||||||||||||||||||||||||||||||||
| 2 System.Collections | ||||||||||||||||||||||||||||||||||||||||
| 3 src.fable-library-ts | ||||||||||||||||||||||||||||||||||||||||
| 4 System.Collections.Generic | 5 | 2 | ||||||||||||||||||||||||||||||||||||||
| 5 fable_library_rust.LrcPtr | 1 | |||||||||||||||||||||||||||||||||||||||
| 6 fable_library_rust.Mutable.NonSyncCell | 1 | |||||||||||||||||||||||||||||||||||||||
| 7 System | 2 | 2 | ||||||||||||||||||||||||||||||||||||||
| 8 FSharp.Compiler.Text | 8 | 6 | ||||||||||||||||||||||||||||||||||||||
| 9 Fable.AST | 14 | 21 | ||||||||||||||||||||||||||||||||||||||
| 10 Fable.Transforms.Rust.AST.Types | 159 | 213 | ||||||||||||||||||||||||||||||||||||||
| 11 Internal.Utilities.Collections.Tagged | 2 | 3 | 2 | |||||||||||||||||||||||||||||||||||||
| 12 Internal.Utilities.Library | 3 | 6 | 2 | |||||||||||||||||||||||||||||||||||||
| 13 FSharp.Compiler.AbstractIL.IL | 98 | 2 | 106 | 6 | ||||||||||||||||||||||||||||||||||||
| 14 FSharp.Compiler.Syntax | 28 | 19 | 66 | |||||||||||||||||||||||||||||||||||||
| 15 Fable.AST.Babel | 42 | 52 | 13 | |||||||||||||||||||||||||||||||||||||
| 16 Fable.AST.Fable | 73 | 5 | 108 | 7 | ||||||||||||||||||||||||||||||||||||
| 17 Fable.Transforms.Python.AST | 73 | 85 | 21 | |||||||||||||||||||||||||||||||||||||
| 18 Internal.Utilities.Text.Lexing | 2 | 1 | 2 | 2 | ||||||||||||||||||||||||||||||||||||
| 19 FSharp.Compiler.TypedTree | 48 | 2 | 46 | 22 | 2 | 3 | 26 | 32 | ||||||||||||||||||||||||||||||||
| 20 FSharp.Compiler.TcGlobals | 2 | 2 | 1 | 5 | ||||||||||||||||||||||||||||||||||||
| 21 FSharp.Compiler.Import | 2 | 1 | 7 | 6 | 1 | |||||||||||||||||||||||||||||||||||
| 22 FSharp.Compiler.InfoReader | 2 | 2 | 2 | 10 | 2 | 2 | 11 | 2 | ||||||||||||||||||||||||||||||||
| 23 FSharp.Compiler.NameResolution | 28 | 25 | 13 | 2 | 4 | 31 | 4 | 2 | 3 | 7 | 12 | 3 | ||||||||||||||||||||||||||||
| 24 FSharp.Compiler.Symbols | 4 | 2 | 2 | 14 | 2 | 23 | 6 | 1 | 1 | 1 | 1 | 1 | ||||||||||||||||||||||||||||
| 25 FSharp.Compiler.Diagnostics | 5 | 5 | 3 | 1 | 2 | |||||||||||||||||||||||||||||||||||
| 26 FSharp.Compiler.DiagnosticsLogger | 22 | 13 | 15 | 1 | 2 | |||||||||||||||||||||||||||||||||||
| 27 FSharp.Compiler.CompilerConfig | 30 | 1 | 24 | 7 | 9 | 1 | 2 | 2 | 4 | 6 | ||||||||||||||||||||||||||||||
| 28 FSharp.Compiler.TypedTreeOps | 15 | 4 | 15 | 5 | 2 | 1 | 12 | 11 | 72 | 5 | 1 | |||||||||||||||||||||||||||||
| 29 FSharp.Compiler.Infos | 5 | 5 | 10 | 23 | 2 | 52 | 11 | 8 | 1 | |||||||||||||||||||||||||||||||
| 30 FSharp.Compiler.AccessibilityLogic | 1 | 1 | 8 | 2 | 1 | 6 | ||||||||||||||||||||||||||||||||||
| 31 FSharp.Compiler.ConstraintSolver | 3 | 2 | 5 | 19 | 1 | 1 | 30 | 5 | 2 | 2 | 1 | 16 | 1 | 1 | ||||||||||||||||||||||||||
| 32 FSharp.Compiler.EditorServices | 1 | 51 | 40 | 18 | 2 | 1 | 2 | 3 | 7 | 2 | 2 | |||||||||||||||||||||||||||||
| 33 FSharp.Compiler.CheckBasics | 2 | 1 | 2 | 2 | 1 | 4 | 22 | 1 | 1 | 1 | 3 | 1 | 1 | 2 | 1 | 2 | ||||||||||||||||||||||||
| 34 FSharp.Compiler.CodeAnalysis | 1 | 10 | 1 | 6 | 7 | 1 | 1 | 9 | 2 | 8 | 13 | 4 | 6 | 1 | 2 | 8 | ||||||||||||||||||||||||
| 35 Fable | 13 | 1 | 21 | 2 | 13 | 1 | 1 | |||||||||||||||||||||||||||||||||
| 36 Fable.Compiler.Util | 5 | 4 | 4 | |||||||||||||||||||||||||||||||||||||
| 37 Fable.Transforms.FSharp2Fable | 2 | 4 | 3 | 1 | 40 | 15 | 2 | |||||||||||||||||||||||||||||||||
| 38 Fable.Transforms.Fable2Babel | 6 | 1 | 8 | 1 | 7 | 8 | 1 | |||||||||||||||||||||||||||||||||
| 39 Fable.Transforms.Printer | 2 | 5 | 2 | 2 | ||||||||||||||||||||||||||||||||||||
| 40 Fable.Standalone.Main | 1 | 3 | 1 | 1 | 1 | 1 | 2 | 1 | 6 | 5 | 2 | 1 |
4→2 System.Collections.Generic uses System.Collections✕
- Connections
- 5 pairs of types, where a type in System.Collections.Generic uses a type in System.Collections.
- The types involved
System.Collections.Generic.IEnumerable`1→System.Collections.IEnumerableSystem.Collections.Generic.IEnumerator`1→System.Collections.IEnumeratorSystem.Collections.Generic.LinkedList`1→System.Collections.IEnumeratorSystem.Collections.Generic.Queue`1→System.Collections.IEnumeratorSystem.Collections.Generic.Stack`1→System.Collections.IEnumerator
- Direction
- System.Collections.Generic uses System.Collections, so a change to System.Collections can break System.Collections.Generic, while a change to System.Collections.Generic can't break System.Collections.
- Position
- Below the diagonal: System.Collections.Generic uses a module listed above it, which is the healthy direction.
4→7 System.Collections.Generic uses System part of a loop✕
- Connections
- 2 pairs of types, where a type in System.Collections.Generic uses a type in System.
- The types involved
System.Collections.Generic.IEnumerator`1→System.IDisposableSystem.Collections.Generic.KeyNotFoundException→System.Exception
- Direction
- System.Collections.Generic uses System, so a change to System can break System.Collections.Generic, while a change to System.Collections.Generic can't break System.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
5→1 fable_library_rust.LrcPtr uses (global)✕
- Connections
- 1 pair of types, where a type in fable_library_rust.LrcPtr uses a type in (global).
- The types involved
fable_library_rust.LrcPtr.LrcPtr→Result
- Direction
- fable_library_rust.LrcPtr uses (global), so a change to (global) can break fable_library_rust.LrcPtr, while a change to fable_library_rust.LrcPtr can't break (global).
- Position
- Below the diagonal: fable_library_rust.LrcPtr uses a module listed above it, which is the healthy direction.
6→1 fable_library_rust.Mutable.NonSyncCell uses (global)✕
- Connections
- 1 pair of types, where a type in fable_library_rust.Mutable.NonSyncCell uses a type in (global).
- The types involved
fable_library_rust.Mutable.NonSyncCell.MutCell→Result
- Direction
- fable_library_rust.Mutable.NonSyncCell uses (global), so a change to (global) can break fable_library_rust.Mutable.NonSyncCell, while a change to fable_library_rust.Mutable.NonSyncCell can't break (global).
- Position
- Below the diagonal: fable_library_rust.Mutable.NonSyncCell uses a module listed above it, which is the healthy direction.
7→2 System uses System.Collections✕
- Connections
- 2 pairs of types, where a type in System uses a type in System.Collections.
- The types involved
System.Exception→System.Collections.IEqualityComparerSystem.Exception→System.Collections.IStructuralEquatable
- Direction
- System uses System.Collections, so a change to System.Collections can break System, while a change to System can't break System.Collections.
- Position
- Below the diagonal: System uses a module listed above it, which is the healthy direction.
7→4 System uses System.Collections.Generic✕
- Connections
- 2 pairs of types, where a type in System uses a type in System.Collections.Generic.
- The types involved
System.StringComparer→System.Collections.Generic.IComparer`1System.StringComparer→System.Collections.Generic.IEqualityComparer`1
- Direction
- System uses System.Collections.Generic, so a change to System.Collections.Generic can break System, while a change to System can't break System.Collections.Generic.
- Position
- Below the diagonal: System uses a module listed above it, which is the healthy direction.
8→2 FSharp.Compiler.Text uses System.Collections✕
- Connections
- 8 pairs of types, where a type in FSharp.Compiler.Text uses a type in System.Collections.
- The types involved
FSharp.Compiler.Text.Joint→System.Collections.IStructuralEquatableFSharp.Compiler.Text.NoResult→System.Collections.IStructuralComparableFSharp.Compiler.Text.NoResult→System.Collections.IStructuralEquatableFSharp.Compiler.Text.NoState→System.Collections.IStructuralComparableFSharp.Compiler.Text.NoState→System.Collections.IStructuralEquatableFSharp.Compiler.Text.NotedSourceConstruct→System.Collections.IStructuralComparableFSharp.Compiler.Text.NotedSourceConstruct→System.Collections.IStructuralEquatableFSharp.Compiler.Text.TextTag→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.Text uses System.Collections, so a change to System.Collections can break FSharp.Compiler.Text, while a change to FSharp.Compiler.Text can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.Text uses a module listed above it, which is the healthy direction.
8→7 FSharp.Compiler.Text uses System✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.Text uses a type in System.
- The types involved
FSharp.Compiler.Text.NoResult→System.IComparableFSharp.Compiler.Text.NoResult→System.IComparable`1FSharp.Compiler.Text.NoState→System.IComparableFSharp.Compiler.Text.NoState→System.IComparable`1FSharp.Compiler.Text.NotedSourceConstruct→System.IComparableFSharp.Compiler.Text.NotedSourceConstruct→System.IComparable`1
- Direction
- FSharp.Compiler.Text uses System, so a change to System can break FSharp.Compiler.Text, while a change to FSharp.Compiler.Text can't break System.
- Position
- Below the diagonal: FSharp.Compiler.Text uses a module listed above it, which is the healthy direction.
9→2 Fable.AST uses System.Collections✕
- Connections
- 14 pairs of types, where a type in Fable.AST uses a type in System.Collections.
- The types involved
Fable.AST.BinaryOperator→System.Collections.IStructuralComparableFable.AST.BinaryOperator→System.Collections.IStructuralEquatableFable.AST.LogicalOperator→System.Collections.IStructuralComparableFable.AST.LogicalOperator→System.Collections.IStructuralEquatableFable.AST.NumberKind→System.Collections.IStructuralComparableFable.AST.NumberKind→System.Collections.IStructuralEquatableFable.AST.Position→System.Collections.IStructuralComparableFable.AST.Position→System.Collections.IStructuralEquatableFable.AST.RegexFlag→System.Collections.IStructuralComparableFable.AST.RegexFlag→System.Collections.IStructuralEquatableFable.AST.SourceLocation→System.Collections.IStructuralComparableFable.AST.SourceLocation→System.Collections.IStructuralEquatableFable.AST.UnaryOperator→System.Collections.IStructuralComparableFable.AST.UnaryOperator→System.Collections.IStructuralEquatable
- Direction
- Fable.AST uses System.Collections, so a change to System.Collections can break Fable.AST, while a change to Fable.AST can't break System.Collections.
- Position
- Below the diagonal: Fable.AST uses a module listed above it, which is the healthy direction.
9→7 Fable.AST uses System✕
- Connections
- 21 pairs of types, where a type in Fable.AST uses a type in System.
- The types involved
Fable.AST.BinaryOperator→System.IComparableFable.AST.BinaryOperator→System.IComparable`1Fable.AST.BinaryOperator→System.IEquatable`1Fable.AST.LogicalOperator→System.IComparableFable.AST.LogicalOperator→System.IComparable`1Fable.AST.LogicalOperator→System.IEquatable`1Fable.AST.NumberKind→System.IComparableFable.AST.NumberKind→System.IComparable`1Fable.AST.NumberKind→System.IEquatable`1Fable.AST.Position→System.IComparableFable.AST.Position→System.IComparable`1Fable.AST.Position→System.IEquatable`1Fable.AST.RegexFlag→System.IComparableFable.AST.RegexFlag→System.IComparable`1Fable.AST.RegexFlag→System.IEquatable`1Fable.AST.SourceLocation→System.IComparableFable.AST.SourceLocation→System.IComparable`1Fable.AST.SourceLocation→System.IEquatable`1Fable.AST.UnaryOperator→System.IComparableFable.AST.UnaryOperator→System.IComparable`1Fable.AST.UnaryOperator→System.IEquatable`1
- Direction
- Fable.AST uses System, so a change to System can break Fable.AST, while a change to Fable.AST can't break System.
- Position
- Below the diagonal: Fable.AST uses a module listed above it, which is the healthy direction.
10→2 Fable.Transforms.Rust.AST.Types uses System.Collections✕
- Connections
- 159 pairs of types, where a type in Fable.Transforms.Rust.AST.Types uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.Transforms.Rust.AST.Types.AngleBracketedArg→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AngleBracketedArgs→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AnonConst→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.Arm→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AssocItemKind→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AssocTyConstraint→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AssocTyConstraintKind→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.Asyncness→System.Collections.IStructuralComparableFable.Transforms.Rust.AST.Types.Asyncness→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AttrItem→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AttrKind→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.AttrStyle→System.Collections.IStructuralComparableFable.Transforms.Rust.AST.Types.AttrStyle→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.Attribute→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.BareFnTy→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.BinOpKind→System.Collections.IStructuralComparableFable.Transforms.Rust.AST.Types.BinOpKind→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.BindingMode→System.Collections.IStructuralComparableFable.Transforms.Rust.AST.Types.BindingMode→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.Block→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.BlockCheckMode→System.Collections.IStructuralComparableFable.Transforms.Rust.AST.Types.BlockCheckMode→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.BorrowKind→System.Collections.IStructuralComparableFable.Transforms.Rust.AST.Types.BorrowKind→System.Collections.IStructuralEquatableFable.Transforms.Rust.AST.Types.CaptureBy→System.Collections.IStructuralComparable
- Direction
- Fable.Transforms.Rust.AST.Types uses System.Collections, so a change to System.Collections can break Fable.Transforms.Rust.AST.Types, while a change to Fable.Transforms.Rust.AST.Types can't break System.Collections.
- Position
- Below the diagonal: Fable.Transforms.Rust.AST.Types uses a module listed above it, which is the healthy direction.
10→7 Fable.Transforms.Rust.AST.Types uses System✕
- Connections
- 213 pairs of types, where a type in Fable.Transforms.Rust.AST.Types uses a type in System. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.Transforms.Rust.AST.Types.AngleBracketedArg→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AngleBracketedArgs→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AnonConst→System.IEquatable`1Fable.Transforms.Rust.AST.Types.Arm→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AssocItemKind→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AssocTyConstraint→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AssocTyConstraintKind→System.IEquatable`1Fable.Transforms.Rust.AST.Types.Asyncness→System.IComparableFable.Transforms.Rust.AST.Types.Asyncness→System.IComparable`1Fable.Transforms.Rust.AST.Types.Asyncness→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AttrItem→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AttrItem→System.Lazy`1Fable.Transforms.Rust.AST.Types.AttrKind→System.IEquatable`1Fable.Transforms.Rust.AST.Types.AttrKind→System.Lazy`1Fable.Transforms.Rust.AST.Types.AttrStyle→System.IComparableFable.Transforms.Rust.AST.Types.AttrStyle→System.IComparable`1Fable.Transforms.Rust.AST.Types.AttrStyle→System.IEquatable`1Fable.Transforms.Rust.AST.Types.Attribute→System.IEquatable`1Fable.Transforms.Rust.AST.Types.BareFnTy→System.IEquatable`1Fable.Transforms.Rust.AST.Types.BinOpKind→System.IComparableFable.Transforms.Rust.AST.Types.BinOpKind→System.IComparable`1Fable.Transforms.Rust.AST.Types.BinOpKind→System.IEquatable`1Fable.Transforms.Rust.AST.Types.BindingMode→System.IComparableFable.Transforms.Rust.AST.Types.BindingMode→System.IComparable`1Fable.Transforms.Rust.AST.Types.BindingMode→System.IEquatable`1
- Direction
- Fable.Transforms.Rust.AST.Types uses System, so a change to System can break Fable.Transforms.Rust.AST.Types, while a change to Fable.Transforms.Rust.AST.Types can't break System.
- Position
- Below the diagonal: Fable.Transforms.Rust.AST.Types uses a module listed above it, which is the healthy direction.
11→2 Internal.Utilities.Collections.Tagged uses System.Collections✕
- Connections
- 2 pairs of types, where a type in Internal.Utilities.Collections.Tagged uses a type in System.Collections.
- The types involved
Internal.Utilities.Collections.Tagged.Map`3→System.Collections.IEnumerableInternal.Utilities.Collections.Tagged.Set`2→System.Collections.IEnumerable
- Direction
- Internal.Utilities.Collections.Tagged uses System.Collections, so a change to System.Collections can break Internal.Utilities.Collections.Tagged, while a change to Internal.Utilities.Collections.Tagged can't break System.Collections.
- Position
- Below the diagonal: Internal.Utilities.Collections.Tagged uses a module listed above it, which is the healthy direction.
11→4 Internal.Utilities.Collections.Tagged uses System.Collections.Generic✕
- Connections
- 3 pairs of types, where a type in Internal.Utilities.Collections.Tagged uses a type in System.Collections.Generic.
- The types involved
Internal.Utilities.Collections.Tagged.Map`3→System.Collections.Generic.IEnumerable`1Internal.Utilities.Collections.Tagged.Set`2→System.Collections.Generic.ICollection`1Internal.Utilities.Collections.Tagged.Set`2→System.Collections.Generic.IEnumerable`1
- Direction
- Internal.Utilities.Collections.Tagged uses System.Collections.Generic, so a change to System.Collections.Generic can break Internal.Utilities.Collections.Tagged, while a change to Internal.Utilities.Collections.Tagged can't break System.Collections.Generic.
- Position
- Below the diagonal: Internal.Utilities.Collections.Tagged uses a module listed above it, which is the healthy direction.
11→7 Internal.Utilities.Collections.Tagged uses System✕
- Connections
- 2 pairs of types, where a type in Internal.Utilities.Collections.Tagged uses a type in System.
- The types involved
Internal.Utilities.Collections.Tagged.Map`3→System.IComparableInternal.Utilities.Collections.Tagged.Set`2→System.IComparable
- Direction
- Internal.Utilities.Collections.Tagged uses System, so a change to System can break Internal.Utilities.Collections.Tagged, while a change to Internal.Utilities.Collections.Tagged can't break System.
- Position
- Below the diagonal: Internal.Utilities.Collections.Tagged uses a module listed above it, which is the healthy direction.
12→2 Internal.Utilities.Library uses System.Collections✕
- Connections
- 3 pairs of types, where a type in Internal.Utilities.Library uses a type in System.Collections.
- The types involved
Internal.Utilities.Library.ResultOrException`1→System.Collections.IStructuralEquatableInternal.Utilities.Library.UndefinedException→System.Collections.IStructuralEquatableInternal.Utilities.Library.ValueOrCancelled`1→System.Collections.IStructuralEquatable
- Direction
- Internal.Utilities.Library uses System.Collections, so a change to System.Collections can break Internal.Utilities.Library, while a change to Internal.Utilities.Library can't break System.Collections.
- Position
- Below the diagonal: Internal.Utilities.Library uses a module listed above it, which is the healthy direction.
12→4 Internal.Utilities.Library uses System.Collections.Generic✕
- Connections
- 6 pairs of types, where a type in Internal.Utilities.Library uses a type in System.Collections.Generic.
- The types involved
Internal.Utilities.Library.DelayInitArrayMap`3→System.Collections.Generic.IDictionary`2Internal.Utilities.Library.IPartialEqualityComparer`1→System.Collections.Generic.IEqualityComparer`1Internal.Utilities.Library.MemoizationTable`2→System.Collections.Generic.IEqualityComparer`1Internal.Utilities.Library.StampedDictionary`2→System.Collections.Generic.IEnumerable`1Internal.Utilities.Library.StampedDictionary`2→System.Collections.Generic.IEqualityComparer`1Internal.Utilities.Library.UniqueStampGenerator`1→System.Collections.Generic.ICollection`1
- Direction
- Internal.Utilities.Library uses System.Collections.Generic, so a change to System.Collections.Generic can break Internal.Utilities.Library, while a change to Internal.Utilities.Library can't break System.Collections.Generic.
- Position
- Below the diagonal: Internal.Utilities.Library uses a module listed above it, which is the healthy direction.
12→7 Internal.Utilities.Library uses System✕
- Connections
- 2 pairs of types, where a type in Internal.Utilities.Library uses a type in System.
- The types involved
Internal.Utilities.Library.LazyWithContextFailure→System.ExceptionInternal.Utilities.Library.ResultOrException`1→System.Exception
- Direction
- Internal.Utilities.Library uses System, so a change to System can break Internal.Utilities.Library, while a change to Internal.Utilities.Library can't break System.
- Position
- Below the diagonal: Internal.Utilities.Library uses a module listed above it, which is the healthy direction.
13→2 FSharp.Compiler.AbstractIL.IL uses System.Collections✕
- Connections
- 98 pairs of types, where a type in FSharp.Compiler.AbstractIL.IL uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.AbstractIL.IL.ILAlignment→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILAlignment→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILArgConvention→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILArgConvention→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILArrayShape→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILArrayShape→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILAssemblyLongevity→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILAssemblyLongevity→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILAttribElem→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILAttribElem→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILAttribute→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILAttribute→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILBasicType→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILBasicType→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILBoxity→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILBoxity→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILCallingConv→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILCallingConv→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILCallingSignature→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILCallingSignature→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILComparisonInstr→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILComparisonInstr→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILConst→System.Collections.IStructuralComparableFSharp.Compiler.AbstractIL.IL.ILConst→System.Collections.IStructuralEquatableFSharp.Compiler.AbstractIL.IL.ILDefaultPInvokeEncoding→System.Collections.IStructuralComparable
- Direction
- FSharp.Compiler.AbstractIL.IL uses System.Collections, so a change to System.Collections can break FSharp.Compiler.AbstractIL.IL, while a change to FSharp.Compiler.AbstractIL.IL can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.AbstractIL.IL uses a module listed above it, which is the healthy direction.
13→4 FSharp.Compiler.AbstractIL.IL uses System.Collections.Generic✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.AbstractIL.IL uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.AbstractIL.IL.ILMethodDefs→System.Collections.Generic.IEnumerable`1FSharp.Compiler.AbstractIL.IL.ILTypeDefs→System.Collections.Generic.IEnumerable`1
- Direction
- FSharp.Compiler.AbstractIL.IL uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.AbstractIL.IL, while a change to FSharp.Compiler.AbstractIL.IL can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.AbstractIL.IL uses a module listed above it, which is the healthy direction.
13→7 FSharp.Compiler.AbstractIL.IL uses System✕
- Connections
- 106 pairs of types, where a type in FSharp.Compiler.AbstractIL.IL uses a type in System. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.AbstractIL.IL.IL→System.Lazy`1FSharp.Compiler.AbstractIL.IL.ILAlignment→System.IComparableFSharp.Compiler.AbstractIL.IL.ILAlignment→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILArgConvention→System.IComparableFSharp.Compiler.AbstractIL.IL.ILArgConvention→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILArrayShape→System.IComparableFSharp.Compiler.AbstractIL.IL.ILArrayShape→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILAssemblyLongevity→System.IComparableFSharp.Compiler.AbstractIL.IL.ILAssemblyLongevity→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILAssemblyRef→System.IComparableFSharp.Compiler.AbstractIL.IL.ILAttribElem→System.IComparableFSharp.Compiler.AbstractIL.IL.ILAttribElem→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILAttribute→System.IComparableFSharp.Compiler.AbstractIL.IL.ILAttribute→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILBasicType→System.IComparableFSharp.Compiler.AbstractIL.IL.ILBasicType→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILBoxity→System.IComparableFSharp.Compiler.AbstractIL.IL.ILBoxity→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILCallingConv→System.IComparableFSharp.Compiler.AbstractIL.IL.ILCallingConv→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILCallingSignature→System.IComparableFSharp.Compiler.AbstractIL.IL.ILCallingSignature→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILComparisonInstr→System.IComparableFSharp.Compiler.AbstractIL.IL.ILComparisonInstr→System.IComparable`1FSharp.Compiler.AbstractIL.IL.ILConst→System.IComparable
- Direction
- FSharp.Compiler.AbstractIL.IL uses System, so a change to System can break FSharp.Compiler.AbstractIL.IL, while a change to FSharp.Compiler.AbstractIL.IL can't break System.
- Position
- Below the diagonal: FSharp.Compiler.AbstractIL.IL uses a module listed above it, which is the healthy direction.
13→12 FSharp.Compiler.AbstractIL.IL uses Internal.Utilities.Library✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.AbstractIL.IL uses a type in Internal.Utilities.Library.
- The types involved
FSharp.Compiler.AbstractIL.IL.IL→Internal.Utilities.Library.InterruptibleLazy`1FSharp.Compiler.AbstractIL.IL.ILMethodDef→Internal.Utilities.Library.InterruptibleLazy`1FSharp.Compiler.AbstractIL.IL.ILMethodDefs→Internal.Utilities.Library.DelayInitArrayMap`3FSharp.Compiler.AbstractIL.IL.ILTypeDef→Internal.Utilities.Library.InterruptibleLazy`1FSharp.Compiler.AbstractIL.IL.ILTypeDefs→Internal.Utilities.Library.DelayInitArrayMap`3FSharp.Compiler.AbstractIL.IL.MethodBody→Internal.Utilities.Library.InterruptibleLazy`1
- Direction
- FSharp.Compiler.AbstractIL.IL uses Internal.Utilities.Library, so a change to Internal.Utilities.Library can break FSharp.Compiler.AbstractIL.IL, while a change to FSharp.Compiler.AbstractIL.IL can't break Internal.Utilities.Library.
- Position
- Below the diagonal: FSharp.Compiler.AbstractIL.IL uses a module listed above it, which is the healthy direction.
14→2 FSharp.Compiler.Syntax uses System.Collections✕
- Connections
- 28 pairs of types, where a type in FSharp.Compiler.Syntax uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.Syntax.DebugPointAtBinding→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtFinally→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtFor→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtInOrTo→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtLeafExpr→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtSequential→System.Collections.IStructuralComparableFSharp.Compiler.Syntax.DebugPointAtSequential→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtTarget→System.Collections.IStructuralComparableFSharp.Compiler.Syntax.DebugPointAtTarget→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtTry→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtWhile→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.DebugPointAtWith→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.ParserDetail→System.Collections.IStructuralComparableFSharp.Compiler.Syntax.ParserDetail→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.SeqExprOnly→System.Collections.IStructuralComparableFSharp.Compiler.Syntax.SeqExprOnly→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.SynAccess→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.SynBindingKind→System.Collections.IStructuralComparableFSharp.Compiler.Syntax.SynBindingKind→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.SynByteStringKind→System.Collections.IStructuralComparableFSharp.Compiler.Syntax.SynByteStringKind→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.SynMemberKind→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.SynModuleOrNamespaceKind→System.Collections.IStructuralComparableFSharp.Compiler.Syntax.SynModuleOrNamespaceKind→System.Collections.IStructuralEquatableFSharp.Compiler.Syntax.SynStringKind→System.Collections.IStructuralComparable
- Direction
- FSharp.Compiler.Syntax uses System.Collections, so a change to System.Collections can break FSharp.Compiler.Syntax, while a change to FSharp.Compiler.Syntax can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.Syntax uses a module listed above it, which is the healthy direction.
14→7 FSharp.Compiler.Syntax uses System✕
- Connections
- 19 pairs of types, where a type in FSharp.Compiler.Syntax uses a type in System.
- The types involved
FSharp.Compiler.Syntax.DebugPointAtSequential→System.IComparableFSharp.Compiler.Syntax.DebugPointAtSequential→System.IComparable`1FSharp.Compiler.Syntax.DebugPointAtTarget→System.IComparableFSharp.Compiler.Syntax.DebugPointAtTarget→System.IComparable`1FSharp.Compiler.Syntax.ExprAtomicFlag→System.EnumFSharp.Compiler.Syntax.ParserDetail→System.IComparableFSharp.Compiler.Syntax.ParserDetail→System.IComparable`1FSharp.Compiler.Syntax.SeqExprOnly→System.IComparableFSharp.Compiler.Syntax.SeqExprOnly→System.IComparable`1FSharp.Compiler.Syntax.SynBindingKind→System.IComparableFSharp.Compiler.Syntax.SynBindingKind→System.IComparable`1FSharp.Compiler.Syntax.SynByteStringKind→System.IComparableFSharp.Compiler.Syntax.SynByteStringKind→System.IComparable`1FSharp.Compiler.Syntax.SynModuleOrNamespaceKind→System.IComparableFSharp.Compiler.Syntax.SynModuleOrNamespaceKind→System.IComparable`1FSharp.Compiler.Syntax.SynStringKind→System.IComparableFSharp.Compiler.Syntax.SynStringKind→System.IComparable`1FSharp.Compiler.Syntax.TyparStaticReq→System.IComparableFSharp.Compiler.Syntax.TyparStaticReq→System.IComparable`1
- Direction
- FSharp.Compiler.Syntax uses System, so a change to System can break FSharp.Compiler.Syntax, while a change to FSharp.Compiler.Syntax can't break System.
- Position
- Below the diagonal: FSharp.Compiler.Syntax uses a module listed above it, which is the healthy direction.
14→8 FSharp.Compiler.Syntax uses FSharp.Compiler.Text✕
- Connections
- 66 pairs of types, where a type in FSharp.Compiler.Syntax uses a type in FSharp.Compiler.Text. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.Syntax.DebugPointAtBinding→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.DebugPointAtFinally→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.DebugPointAtFor→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.DebugPointAtInOrTo→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.DebugPointAtLeafExpr→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.DebugPointAtTry→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.DebugPointAtWhile→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.DebugPointAtWith→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.Ident→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.NamePatPairField→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.ParsedHashDirective→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.ParsedHashDirectiveArgument→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.ParsedImplFileFragment→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.ParsedInput→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.ParsedScriptInteraction→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.ParsedSigFileFragment→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.QualifiedNameOfFile→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynAccess→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynArgPats→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynAttribute→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynAttributeList→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynBinding→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynBindingReturnInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynComponentInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Syntax.SynConst→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.Syntax uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.Syntax, while a change to FSharp.Compiler.Syntax can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.Syntax uses a module listed above it, which is the healthy direction.
15→2 Fable.AST.Babel uses System.Collections✕
- Connections
- 42 pairs of types, where a type in Fable.AST.Babel uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.AST.Babel.AbstractMember→System.Collections.IStructuralEquatableFable.AST.Babel.AccessModifier→System.Collections.IStructuralComparableFable.AST.Babel.AccessModifier→System.Collections.IStructuralEquatableFable.AST.Babel.AssignmentOperator→System.Collections.IStructuralComparableFable.AST.Babel.AssignmentOperator→System.Collections.IStructuralEquatableFable.AST.Babel.BlockStatement→System.Collections.IStructuralEquatableFable.AST.Babel.CatchClause→System.Collections.IStructuralEquatableFable.AST.Babel.ClassMember→System.Collections.IStructuralEquatableFable.AST.Babel.ClassMethodKind→System.Collections.IStructuralEquatableFable.AST.Babel.Declaration→System.Collections.IStructuralEquatableFable.AST.Babel.DirectivePrologue→System.Collections.IStructuralComparableFable.AST.Babel.DirectivePrologue→System.Collections.IStructuralEquatableFable.AST.Babel.ExportSpecifier→System.Collections.IStructuralComparableFable.AST.Babel.ExportSpecifier→System.Collections.IStructuralEquatableFable.AST.Babel.Expression→System.Collections.IStructuralEquatableFable.AST.Babel.FunctionTypeParam→System.Collections.IStructuralEquatableFable.AST.Babel.Identifier→System.Collections.IStructuralComparableFable.AST.Babel.Identifier→System.Collections.IStructuralEquatableFable.AST.Babel.ImportSpecifier→System.Collections.IStructuralComparableFable.AST.Babel.ImportSpecifier→System.Collections.IStructuralEquatableFable.AST.Babel.JsxProp→System.Collections.IStructuralEquatableFable.AST.Babel.Literal→System.Collections.IStructuralEquatableFable.AST.Babel.ModuleDeclaration→System.Collections.IStructuralEquatableFable.AST.Babel.ObjectMember→System.Collections.IStructuralEquatableFable.AST.Babel.ObjectMethodKind→System.Collections.IStructuralComparable
- Direction
- Fable.AST.Babel uses System.Collections, so a change to System.Collections can break Fable.AST.Babel, while a change to Fable.AST.Babel can't break System.Collections.
- Position
- Below the diagonal: Fable.AST.Babel uses a module listed above it, which is the healthy direction.
15→7 Fable.AST.Babel uses System✕
- Connections
- 52 pairs of types, where a type in Fable.AST.Babel uses a type in System. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.AST.Babel.AbstractMember→System.IEquatable`1Fable.AST.Babel.AccessModifier→System.IComparableFable.AST.Babel.AccessModifier→System.IComparable`1Fable.AST.Babel.AccessModifier→System.IEquatable`1Fable.AST.Babel.AssignmentOperator→System.IComparableFable.AST.Babel.AssignmentOperator→System.IComparable`1Fable.AST.Babel.AssignmentOperator→System.IEquatable`1Fable.AST.Babel.BlockStatement→System.IEquatable`1Fable.AST.Babel.CatchClause→System.IEquatable`1Fable.AST.Babel.ClassMember→System.IEquatable`1Fable.AST.Babel.ClassMethodKind→System.IEquatable`1Fable.AST.Babel.Declaration→System.IEquatable`1Fable.AST.Babel.DirectivePrologue→System.IComparableFable.AST.Babel.DirectivePrologue→System.IComparable`1Fable.AST.Babel.DirectivePrologue→System.IEquatable`1Fable.AST.Babel.ExportSpecifier→System.IComparableFable.AST.Babel.ExportSpecifier→System.IComparable`1Fable.AST.Babel.ExportSpecifier→System.IEquatable`1Fable.AST.Babel.Expression→System.IEquatable`1Fable.AST.Babel.FunctionTypeParam→System.IEquatable`1Fable.AST.Babel.Identifier→System.IComparableFable.AST.Babel.Identifier→System.IComparable`1Fable.AST.Babel.Identifier→System.IEquatable`1Fable.AST.Babel.ImportSpecifier→System.IComparableFable.AST.Babel.ImportSpecifier→System.IComparable`1
- Direction
- Fable.AST.Babel uses System, so a change to System can break Fable.AST.Babel, while a change to Fable.AST.Babel can't break System.
- Position
- Below the diagonal: Fable.AST.Babel uses a module listed above it, which is the healthy direction.
15→9 Fable.AST.Babel uses Fable.AST✕
- Connections
- 13 pairs of types, where a type in Fable.AST.Babel uses a type in Fable.AST.
- The types involved
Fable.AST.Babel.CatchClause→Fable.AST.SourceLocationFable.AST.Babel.ClassMember→Fable.AST.SourceLocationFable.AST.Babel.Declaration→Fable.AST.SourceLocationFable.AST.Babel.Expression→Fable.AST.SourceLocationFable.AST.Babel.Identifier→Fable.AST.SourceLocationFable.AST.Babel.Literal→Fable.AST.SourceLocationFable.AST.Babel.ModuleDeclaration→Fable.AST.SourceLocationFable.AST.Babel.ObjectMember→Fable.AST.SourceLocationFable.AST.Babel.Statement→Fable.AST.SourceLocationFable.AST.Babel.StringLiteral→Fable.AST.SourceLocationFable.AST.Babel.SwitchCase→Fable.AST.SourceLocationFable.AST.Babel.VariableDeclaration→Fable.AST.SourceLocationFable.AST.Babel.VariableDeclarator→Fable.AST.SourceLocation
- Direction
- Fable.AST.Babel uses Fable.AST, so a change to Fable.AST can break Fable.AST.Babel, while a change to Fable.AST.Babel can't break Fable.AST.
- Position
- Below the diagonal: Fable.AST.Babel uses a module listed above it, which is the healthy direction.
16→2 Fable.AST.Fable uses System.Collections✕
- Connections
- 73 pairs of types, where a type in Fable.AST.Fable uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.AST.Fable.ActionDecl→System.Collections.IStructuralComparableFable.AST.Fable.ActionDecl→System.Collections.IStructuralEquatableFable.AST.Fable.ArrayKind→System.Collections.IStructuralComparableFable.AST.Fable.ArrayKind→System.Collections.IStructuralEquatableFable.AST.Fable.CallInfo→System.Collections.IStructuralComparableFable.AST.Fable.CallInfo→System.Collections.IStructuralEquatableFable.AST.Fable.ClassDecl→System.Collections.IStructuralComparableFable.AST.Fable.ClassDecl→System.Collections.IStructuralEquatableFable.AST.Fable.Constraint→System.Collections.IStructuralComparableFable.AST.Fable.Constraint→System.Collections.IStructuralEquatableFable.AST.Fable.Declaration→System.Collections.IStructuralComparableFable.AST.Fable.Declaration→System.Collections.IStructuralEquatableFable.AST.Fable.EmitInfo→System.Collections.IStructuralComparableFable.AST.Fable.EmitInfo→System.Collections.IStructuralEquatableFable.AST.Fable.EntityPath→System.Collections.IStructuralComparableFable.AST.Fable.EntityPath→System.Collections.IStructuralEquatableFable.AST.Fable.EntityRef→System.Collections.IStructuralComparableFable.AST.Fable.EntityRef→System.Collections.IStructuralEquatableFable.AST.Fable.Expr→System.Collections.IStructuralComparableFable.AST.Fable.Expr→System.Collections.IStructuralEquatableFable.AST.Fable.ExtendedSet→System.Collections.IStructuralComparableFable.AST.Fable.ExtendedSet→System.Collections.IStructuralEquatableFable.AST.Fable.FableError→System.Collections.IStructuralEquatableFable.AST.Fable.FieldInfo→System.Collections.IStructuralComparableFable.AST.Fable.FieldInfo→System.Collections.IStructuralEquatable
- Direction
- Fable.AST.Fable uses System.Collections, so a change to System.Collections can break Fable.AST.Fable, while a change to Fable.AST.Fable can't break System.Collections.
- Position
- Below the diagonal: Fable.AST.Fable uses a module listed above it, which is the healthy direction.
16→4 Fable.AST.Fable uses System.Collections.Generic✕
- Connections
- 5 pairs of types, where a type in Fable.AST.Fable uses a type in System.Collections.Generic.
- The types involved
Fable.AST.Fable.Entity→System.Collections.Generic.IEnumerable`1Fable.AST.Fable.GeneratedMember→System.Collections.Generic.IEnumerable`1Fable.AST.Fable.MemberFunctionOrValue→System.Collections.Generic.IEnumerable`1Fable.AST.Fable.Parameter→System.Collections.Generic.IEnumerable`1Fable.AST.Fable.UnionCase→System.Collections.Generic.IEnumerable`1
- Direction
- Fable.AST.Fable uses System.Collections.Generic, so a change to System.Collections.Generic can break Fable.AST.Fable, while a change to Fable.AST.Fable can't break System.Collections.Generic.
- Position
- Below the diagonal: Fable.AST.Fable uses a module listed above it, which is the healthy direction.
16→7 Fable.AST.Fable uses System✕
- Connections
- 108 pairs of types, where a type in Fable.AST.Fable uses a type in System. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.AST.Fable.ActionDecl→System.IComparableFable.AST.Fable.ActionDecl→System.IComparable`1Fable.AST.Fable.ActionDecl→System.IEquatable`1Fable.AST.Fable.ArrayKind→System.IComparableFable.AST.Fable.ArrayKind→System.IComparable`1Fable.AST.Fable.ArrayKind→System.IEquatable`1Fable.AST.Fable.CallInfo→System.IComparableFable.AST.Fable.CallInfo→System.IComparable`1Fable.AST.Fable.CallInfo→System.IEquatable`1Fable.AST.Fable.ClassDecl→System.IComparableFable.AST.Fable.ClassDecl→System.IComparable`1Fable.AST.Fable.ClassDecl→System.IEquatable`1Fable.AST.Fable.Constraint→System.IComparableFable.AST.Fable.Constraint→System.IComparable`1Fable.AST.Fable.Constraint→System.IEquatable`1Fable.AST.Fable.Declaration→System.IComparableFable.AST.Fable.Declaration→System.IComparable`1Fable.AST.Fable.Declaration→System.IEquatable`1Fable.AST.Fable.EmitInfo→System.IComparableFable.AST.Fable.EmitInfo→System.IComparable`1Fable.AST.Fable.EmitInfo→System.IEquatable`1Fable.AST.Fable.EntityPath→System.IComparableFable.AST.Fable.EntityPath→System.IComparable`1Fable.AST.Fable.EntityPath→System.IEquatable`1Fable.AST.Fable.EntityRef→System.IComparable
- Direction
- Fable.AST.Fable uses System, so a change to System can break Fable.AST.Fable, while a change to Fable.AST.Fable can't break System.
- Position
- Below the diagonal: Fable.AST.Fable uses a module listed above it, which is the healthy direction.
16→9 Fable.AST.Fable uses Fable.AST✕
- Connections
- 7 pairs of types, where a type in Fable.AST.Fable uses a type in Fable.AST.
- The types involved
Fable.AST.Fable.Expr→Fable.AST.SourceLocationFable.AST.Fable.Ident→Fable.AST.SourceLocationFable.AST.Fable.OperationKind→Fable.AST.BinaryOperatorFable.AST.Fable.OperationKind→Fable.AST.LogicalOperatorFable.AST.Fable.OperationKind→Fable.AST.UnaryOperatorFable.AST.Fable.Type→Fable.AST.NumberKindFable.AST.Fable.ValueKind→Fable.AST.RegexFlag
- Direction
- Fable.AST.Fable uses Fable.AST, so a change to Fable.AST can break Fable.AST.Fable, while a change to Fable.AST.Fable can't break Fable.AST.
- Position
- Below the diagonal: Fable.AST.Fable uses a module listed above it, which is the healthy direction.
17→2 Fable.Transforms.Python.AST uses System.Collections✕
- Connections
- 73 pairs of types, where a type in Fable.Transforms.Python.AST uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.Transforms.Python.AST.AST→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Alias→System.Collections.IStructuralComparableFable.Transforms.Python.AST.Alias→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.AnnAssign→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Arg→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Arguments→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Assert→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Assign→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.AsyncFor→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.AsyncFunctionDef→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Attribute→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.BinOp→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.BoolOp→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.BoolOperator→System.Collections.IStructuralComparableFable.Transforms.Python.AST.BoolOperator→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Call→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.ClassDef→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Compare→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.ComparisonOperator→System.Collections.IStructuralComparableFable.Transforms.Python.AST.ComparisonOperator→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Dict→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Emit→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.ExceptHandler→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Expr→System.Collections.IStructuralEquatableFable.Transforms.Python.AST.Expression→System.Collections.IStructuralEquatable
- Direction
- Fable.Transforms.Python.AST uses System.Collections, so a change to System.Collections can break Fable.Transforms.Python.AST, while a change to Fable.Transforms.Python.AST can't break System.Collections.
- Position
- Below the diagonal: Fable.Transforms.Python.AST uses a module listed above it, which is the healthy direction.
17→7 Fable.Transforms.Python.AST uses System✕
- Connections
- 85 pairs of types, where a type in Fable.Transforms.Python.AST uses a type in System. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.Transforms.Python.AST.AST→System.IEquatable`1Fable.Transforms.Python.AST.Alias→System.IComparableFable.Transforms.Python.AST.Alias→System.IComparable`1Fable.Transforms.Python.AST.Alias→System.IEquatable`1Fable.Transforms.Python.AST.AnnAssign→System.IEquatable`1Fable.Transforms.Python.AST.Arg→System.IEquatable`1Fable.Transforms.Python.AST.Arguments→System.IEquatable`1Fable.Transforms.Python.AST.Assert→System.IEquatable`1Fable.Transforms.Python.AST.Assign→System.IEquatable`1Fable.Transforms.Python.AST.AsyncFor→System.IEquatable`1Fable.Transforms.Python.AST.AsyncFunctionDef→System.IEquatable`1Fable.Transforms.Python.AST.Attribute→System.IEquatable`1Fable.Transforms.Python.AST.BinOp→System.IEquatable`1Fable.Transforms.Python.AST.BoolOp→System.IEquatable`1Fable.Transforms.Python.AST.BoolOperator→System.IComparableFable.Transforms.Python.AST.BoolOperator→System.IComparable`1Fable.Transforms.Python.AST.BoolOperator→System.IEquatable`1Fable.Transforms.Python.AST.Call→System.IEquatable`1Fable.Transforms.Python.AST.ClassDef→System.IEquatable`1Fable.Transforms.Python.AST.Compare→System.IEquatable`1Fable.Transforms.Python.AST.ComparisonOperator→System.IComparableFable.Transforms.Python.AST.ComparisonOperator→System.IComparable`1Fable.Transforms.Python.AST.ComparisonOperator→System.IEquatable`1Fable.Transforms.Python.AST.Dict→System.IEquatable`1Fable.Transforms.Python.AST.Emit→System.IEquatable`1
- Direction
- Fable.Transforms.Python.AST uses System, so a change to System can break Fable.Transforms.Python.AST, while a change to Fable.Transforms.Python.AST can't break System.
- Position
- Below the diagonal: Fable.Transforms.Python.AST uses a module listed above it, which is the healthy direction.
17→9 Fable.Transforms.Python.AST uses Fable.AST✕
- Connections
- 21 pairs of types, where a type in Fable.Transforms.Python.AST uses a type in Fable.AST.
- The types involved
Fable.Transforms.Python.AST.BinOp→Fable.AST.SourceLocationFable.Transforms.Python.AST.BoolOp→Fable.AST.SourceLocationFable.Transforms.Python.AST.Call→Fable.AST.SourceLocationFable.Transforms.Python.AST.ClassDef→Fable.AST.SourceLocationFable.Transforms.Python.AST.Compare→Fable.AST.SourceLocationFable.Transforms.Python.AST.Emit→Fable.AST.SourceLocationFable.Transforms.Python.AST.ExceptHandler→Fable.AST.SourceLocationFable.Transforms.Python.AST.Expression→Fable.AST.SourceLocationFable.Transforms.Python.AST.If→Fable.AST.SourceLocationFable.Transforms.Python.AST.IfExp→Fable.AST.SourceLocationFable.Transforms.Python.AST.Match→Fable.AST.SourceLocationFable.Transforms.Python.AST.Name→Fable.AST.SourceLocationFable.Transforms.Python.AST.NamedExpr→Fable.AST.SourceLocationFable.Transforms.Python.AST.ParamSpecParam→Fable.AST.SourceLocationFable.Transforms.Python.AST.Try→Fable.AST.SourceLocationFable.Transforms.Python.AST.Tuple→Fable.AST.SourceLocationFable.Transforms.Python.AST.TypeAlias→Fable.AST.SourceLocationFable.Transforms.Python.AST.TypeVarParam→Fable.AST.SourceLocationFable.Transforms.Python.AST.TypeVarTupleParam→Fable.AST.SourceLocationFable.Transforms.Python.AST.UnaryOp→Fable.AST.SourceLocationFable.Transforms.Python.AST.While→Fable.AST.SourceLocation
- Direction
- Fable.Transforms.Python.AST uses Fable.AST, so a change to Fable.AST can break Fable.Transforms.Python.AST, while a change to Fable.Transforms.Python.AST can't break Fable.AST.
- Position
- Below the diagonal: Fable.Transforms.Python.AST uses a module listed above it, which is the healthy direction.
18→2 Internal.Utilities.Text.Lexing uses System.Collections✕
- Connections
- 2 pairs of types, where a type in Internal.Utilities.Text.Lexing uses a type in System.Collections.
- The types involved
Internal.Utilities.Text.Lexing.Position→System.Collections.IStructuralComparableInternal.Utilities.Text.Lexing.Position→System.Collections.IStructuralEquatable
- Direction
- Internal.Utilities.Text.Lexing uses System.Collections, so a change to System.Collections can break Internal.Utilities.Text.Lexing, while a change to Internal.Utilities.Text.Lexing can't break System.Collections.
- Position
- Below the diagonal: Internal.Utilities.Text.Lexing uses a module listed above it, which is the healthy direction.
18→4 Internal.Utilities.Text.Lexing uses System.Collections.Generic✕
- Connections
- 1 pair of types, where a type in Internal.Utilities.Text.Lexing uses a type in System.Collections.Generic.
- The types involved
Internal.Utilities.Text.Lexing.LexBuffer`1→System.Collections.Generic.IDictionary`2
- Direction
- Internal.Utilities.Text.Lexing uses System.Collections.Generic, so a change to System.Collections.Generic can break Internal.Utilities.Text.Lexing, while a change to Internal.Utilities.Text.Lexing can't break System.Collections.Generic.
- Position
- Below the diagonal: Internal.Utilities.Text.Lexing uses a module listed above it, which is the healthy direction.
18→7 Internal.Utilities.Text.Lexing uses System✕
- Connections
- 2 pairs of types, where a type in Internal.Utilities.Text.Lexing uses a type in System.
- The types involved
Internal.Utilities.Text.Lexing.Position→System.IComparableInternal.Utilities.Text.Lexing.Position→System.IComparable`1
- Direction
- Internal.Utilities.Text.Lexing uses System, so a change to System can break Internal.Utilities.Text.Lexing, while a change to Internal.Utilities.Text.Lexing can't break System.
- Position
- Below the diagonal: Internal.Utilities.Text.Lexing uses a module listed above it, which is the healthy direction.
18→8 Internal.Utilities.Text.Lexing uses FSharp.Compiler.Text✕
- Connections
- 2 pairs of types, where a type in Internal.Utilities.Text.Lexing uses a type in FSharp.Compiler.Text.
- The types involved
Internal.Utilities.Text.Lexing.LexBuffer`1→FSharp.Compiler.Text.ISourceTextInternal.Utilities.Text.Lexing.LexBuffer`1→FSharp.Compiler.Text.Range
- Direction
- Internal.Utilities.Text.Lexing uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break Internal.Utilities.Text.Lexing, while a change to Internal.Utilities.Text.Lexing can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: Internal.Utilities.Text.Lexing uses a module listed above it, which is the healthy direction.
19→2 FSharp.Compiler.TypedTree uses System.Collections✕
- Connections
- 48 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.TypedTree.Accessibility→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.CcuTypeForwarderTable→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.CcuTypeForwarderTree→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.CompilationPath→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.Const→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.Const→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.EntityFlags→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.EntityFlags→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.ForLoopStyle→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.ForLoopStyle→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.InternalUndefinedItemRef→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.LValueOperation→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.LValueOperation→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.NullnessInfo→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.NullnessInfo→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.PublicPath→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.PublicPath→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.RecordConstructionInfo→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.RecordConstructionInfo→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.SequentialOpKind→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.SequentialOpKind→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.SpecialWhileLoopMarker→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.SpecialWhileLoopMarker→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTree.SyntaxAccess→System.Collections.IStructuralComparableFSharp.Compiler.TypedTree.SyntaxAccess→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.TypedTree uses System.Collections, so a change to System.Collections can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
19→4 FSharp.Compiler.TypedTree uses System.Collections.Generic✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.TypedTree.FreeTyvars→System.Collections.Generic.IComparer`1FSharp.Compiler.TypedTree.FreeVars→System.Collections.Generic.IComparer`1
- Direction
- FSharp.Compiler.TypedTree uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
19→7 FSharp.Compiler.TypedTree uses System✕
- Connections
- 46 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in System. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.TypedTree.CcuTypeForwarderTable→System.Lazy`1FSharp.Compiler.TypedTree.CcuTypeForwarderTree→System.Lazy`1FSharp.Compiler.TypedTree.Const→System.IComparableFSharp.Compiler.TypedTree.Const→System.IComparable`1FSharp.Compiler.TypedTree.EntityFlags→System.IComparableFSharp.Compiler.TypedTree.EntityFlags→System.IComparable`1FSharp.Compiler.TypedTree.ForLoopStyle→System.IComparableFSharp.Compiler.TypedTree.ForLoopStyle→System.IComparable`1FSharp.Compiler.TypedTree.LValueOperation→System.IComparableFSharp.Compiler.TypedTree.LValueOperation→System.IComparable`1FSharp.Compiler.TypedTree.NamedDebugPointKey→System.IComparableFSharp.Compiler.TypedTree.NullnessInfo→System.IComparableFSharp.Compiler.TypedTree.NullnessInfo→System.IComparable`1FSharp.Compiler.TypedTree.PublicPath→System.IComparableFSharp.Compiler.TypedTree.PublicPath→System.IComparable`1FSharp.Compiler.TypedTree.RecordConstructionInfo→System.IComparableFSharp.Compiler.TypedTree.RecordConstructionInfo→System.IComparable`1FSharp.Compiler.TypedTree.SequentialOpKind→System.IComparableFSharp.Compiler.TypedTree.SequentialOpKind→System.IComparable`1FSharp.Compiler.TypedTree.SpecialWhileLoopMarker→System.IComparableFSharp.Compiler.TypedTree.SpecialWhileLoopMarker→System.IComparable`1FSharp.Compiler.TypedTree.SyntaxAccess→System.IComparableFSharp.Compiler.TypedTree.SyntaxAccess→System.IComparable`1FSharp.Compiler.TypedTree.TraitWitnessInfo→System.IComparableFSharp.Compiler.TypedTree.TupInfo→System.IComparable
- Direction
- FSharp.Compiler.TypedTree uses System, so a change to System can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break System.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
19→8 FSharp.Compiler.TypedTree uses FSharp.Compiler.Text✕
- Connections
- 22 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.TypedTree.ArgReprInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.Attrib→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.CheckedImplFile→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.Construct→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.DecisionTree→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.DecisionTreeTest→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.Entity→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.EntityRef→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.Expr→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.Measure→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.ModuleOrNamespaceContents→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.NamedDebugPointKey→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.ObjExprMethod→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.OpenDeclaration→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.RecdField→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.RecdFieldRef→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.Typar→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.TyparConstraint→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.UnionCase→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.UnionCaseRef→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.Val→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTree.ValRef→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.TypedTree uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
19→11 FSharp.Compiler.TypedTree uses Internal.Utilities.Collections.Tagged✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in Internal.Utilities.Collections.Tagged.
- The types involved
FSharp.Compiler.TypedTree.FreeTyvars→Internal.Utilities.Collections.Tagged.Set`2FSharp.Compiler.TypedTree.FreeVars→Internal.Utilities.Collections.Tagged.Set`2
- Direction
- FSharp.Compiler.TypedTree uses Internal.Utilities.Collections.Tagged, so a change to Internal.Utilities.Collections.Tagged can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break Internal.Utilities.Collections.Tagged.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
19→12 FSharp.Compiler.TypedTree uses Internal.Utilities.Library✕
- Connections
- 3 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in Internal.Utilities.Library.
- The types involved
FSharp.Compiler.TypedTree.Construct→Internal.Utilities.Library.LazyWithContext`2FSharp.Compiler.TypedTree.Entity→Internal.Utilities.Library.LazyWithContext`2FSharp.Compiler.TypedTree.ModuleOrNamespaceType→Internal.Utilities.Library.LayeredMultiMap`2
- Direction
- FSharp.Compiler.TypedTree uses Internal.Utilities.Library, so a change to Internal.Utilities.Library can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break Internal.Utilities.Library.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
19→13 FSharp.Compiler.TypedTree uses FSharp.Compiler.AbstractIL.IL✕
- Connections
- 26 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in FSharp.Compiler.AbstractIL.IL. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.TypedTree.Accessibility→FSharp.Compiler.AbstractIL.IL.ILMemberAccessFSharp.Compiler.TypedTree.Accessibility→FSharp.Compiler.AbstractIL.IL.ILTypeDefAccessFSharp.Compiler.TypedTree.AnonRecdTypeInfo→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.TypedTree.AttribKind→FSharp.Compiler.AbstractIL.IL.ILMethodRefFSharp.Compiler.TypedTree.CcuData→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.TypedTree.CcuThunk→FSharp.Compiler.AbstractIL.IL.ILModuleDefFSharp.Compiler.TypedTree.CcuThunk→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.TypedTree.CompilationPath→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.TypedTree.CompiledTypeRepr→FSharp.Compiler.AbstractIL.IL.ILBoxityFSharp.Compiler.TypedTree.CompiledTypeRepr→FSharp.Compiler.AbstractIL.IL.ILTypeFSharp.Compiler.TypedTree.CompiledTypeRepr→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.TypedTree.Construct→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.TypedTree.Construct→FSharp.Compiler.AbstractIL.IL.ILTypeDefFSharp.Compiler.TypedTree.Entity→FSharp.Compiler.AbstractIL.IL.ILTypeDefFSharp.Compiler.TypedTree.Entity→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.TypedTree.EntityRef→FSharp.Compiler.AbstractIL.IL.ILTypeDefFSharp.Compiler.TypedTree.EntityRef→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.TypedTree.ExceptionInfo→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.TypedTree.TILObjectReprData→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.TypedTree.TILObjectReprData→FSharp.Compiler.AbstractIL.IL.ILTypeDefFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.AbstractIL.IL.ILInstrFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.AbstractIL.IL.ILMethodRefFSharp.Compiler.TypedTree.TraitConstraintSln→FSharp.Compiler.AbstractIL.IL.ILMethodRefFSharp.Compiler.TypedTree.TraitConstraintSln→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.TypedTree.TyconRepresentation→FSharp.Compiler.AbstractIL.IL.ILType
- Direction
- FSharp.Compiler.TypedTree uses FSharp.Compiler.AbstractIL.IL, so a change to FSharp.Compiler.AbstractIL.IL can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break FSharp.Compiler.AbstractIL.IL.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
19→14 FSharp.Compiler.TypedTree uses FSharp.Compiler.Syntax✕
- Connections
- 32 pairs of types, where a type in FSharp.Compiler.TypedTree uses a type in FSharp.Compiler.Syntax. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.TypedTree.AnonRecdTypeInfo→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.ArgReprInfo→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.Binding→FSharp.Compiler.Syntax.DebugPointAtBindingFSharp.Compiler.TypedTree.CheckedImplFile→FSharp.Compiler.Syntax.QualifiedNameOfFileFSharp.Compiler.TypedTree.CompilationPath→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.Construct→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.Construct→FSharp.Compiler.Syntax.SynTyparFSharp.Compiler.TypedTree.Entity→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.EntityRef→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.Expr→FSharp.Compiler.Syntax.DebugPointAtBindingFSharp.Compiler.TypedTree.Expr→FSharp.Compiler.Syntax.DebugPointAtLeafExprFSharp.Compiler.TypedTree.ObjExprMethod→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.OpenDeclaration→FSharp.Compiler.Syntax.SynOpenDeclTargetFSharp.Compiler.TypedTree.RecdField→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.Syntax.DebugPointAtFinallyFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.Syntax.DebugPointAtForFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.Syntax.DebugPointAtInOrToFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.Syntax.DebugPointAtTryFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.Syntax.DebugPointAtWhileFSharp.Compiler.TypedTree.TOp→FSharp.Compiler.Syntax.DebugPointAtWithFSharp.Compiler.TypedTree.TraitConstraintInfo→FSharp.Compiler.Syntax.SynMemberFlagsFSharp.Compiler.TypedTree.TraitConstraintInfo→FSharp.Compiler.Syntax.SynMemberKindFSharp.Compiler.TypedTree.TraitWitnessInfo→FSharp.Compiler.Syntax.SynMemberFlagsFSharp.Compiler.TypedTree.Typar→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTree.Typar→FSharp.Compiler.Syntax.TyparStaticReq
- Direction
- FSharp.Compiler.TypedTree uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.TypedTree, while a change to FSharp.Compiler.TypedTree can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.TypedTree uses a module listed above it, which is the healthy direction.
20→2 FSharp.Compiler.TcGlobals uses System.Collections✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.TcGlobals uses a type in System.Collections.
- The types involved
FSharp.Compiler.TcGlobals.CompilationMode→System.Collections.IStructuralComparableFSharp.Compiler.TcGlobals.CompilationMode→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.TcGlobals uses System.Collections, so a change to System.Collections can break FSharp.Compiler.TcGlobals, while a change to FSharp.Compiler.TcGlobals can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.TcGlobals uses a module listed above it, which is the healthy direction.
20→7 FSharp.Compiler.TcGlobals uses System✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.TcGlobals uses a type in System.
- The types involved
FSharp.Compiler.TcGlobals.CompilationMode→System.IComparableFSharp.Compiler.TcGlobals.CompilationMode→System.IComparable`1
- Direction
- FSharp.Compiler.TcGlobals uses System, so a change to System can break FSharp.Compiler.TcGlobals, while a change to FSharp.Compiler.TcGlobals can't break System.
- Position
- Below the diagonal: FSharp.Compiler.TcGlobals uses a module listed above it, which is the healthy direction.
20→13 FSharp.Compiler.TcGlobals uses FSharp.Compiler.AbstractIL.IL✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.TcGlobals uses a type in FSharp.Compiler.AbstractIL.IL.
- The types involved
FSharp.Compiler.TcGlobals.BuiltinAttribInfo→FSharp.Compiler.AbstractIL.IL.ILTypeRef
- Direction
- FSharp.Compiler.TcGlobals uses FSharp.Compiler.AbstractIL.IL, so a change to FSharp.Compiler.AbstractIL.IL can break FSharp.Compiler.TcGlobals, while a change to FSharp.Compiler.TcGlobals can't break FSharp.Compiler.AbstractIL.IL.
- Position
- Below the diagonal: FSharp.Compiler.TcGlobals uses a module listed above it, which is the healthy direction.
20→19 FSharp.Compiler.TcGlobals uses FSharp.Compiler.TypedTree✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.TcGlobals uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.TcGlobals.BuiltinAttribInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.TcGlobals.IntrinsicValRef→FSharp.Compiler.TypedTree.NonLocalEntityRefFSharp.Compiler.TcGlobals.IntrinsicValRef→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.TcGlobals.IntrinsicValRef→FSharp.Compiler.TypedTree.ValLinkageFullKeyFSharp.Compiler.TcGlobals.TcGlobals→FSharp.Compiler.TypedTree.ValRef
- Direction
- FSharp.Compiler.TcGlobals uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.TcGlobals, while a change to FSharp.Compiler.TcGlobals can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.TcGlobals uses a module listed above it, which is the healthy direction.
21→8 FSharp.Compiler.Import uses FSharp.Compiler.Text✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.Import uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.Import.AssemblyLoader→FSharp.Compiler.Text.RangeFSharp.Compiler.Import.Import→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.Import uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.Import, while a change to FSharp.Compiler.Import can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.Import uses a module listed above it, which is the healthy direction.
21→12 FSharp.Compiler.Import uses Internal.Utilities.Library✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Import uses a type in Internal.Utilities.Library.
- The types involved
FSharp.Compiler.Import.AssemblyLoader→Internal.Utilities.Library.CompilationThreadToken
- Direction
- FSharp.Compiler.Import uses Internal.Utilities.Library, so a change to Internal.Utilities.Library can break FSharp.Compiler.Import, while a change to FSharp.Compiler.Import can't break Internal.Utilities.Library.
- Position
- Below the diagonal: FSharp.Compiler.Import uses a module listed above it, which is the healthy direction.
21→13 FSharp.Compiler.Import uses FSharp.Compiler.AbstractIL.IL✕
- Connections
- 7 pairs of types, where a type in FSharp.Compiler.Import uses a type in FSharp.Compiler.AbstractIL.IL.
- The types involved
FSharp.Compiler.Import.AssemblyLoader→FSharp.Compiler.AbstractIL.IL.ILAssemblyRefFSharp.Compiler.Import.Import→FSharp.Compiler.AbstractIL.IL.ILExportedTypesAndForwardersFSharp.Compiler.Import.Import→FSharp.Compiler.AbstractIL.IL.ILGenericParameterDefFSharp.Compiler.Import.Import→FSharp.Compiler.AbstractIL.IL.ILModuleDefFSharp.Compiler.Import.Import→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.Import.Import→FSharp.Compiler.AbstractIL.IL.ILTypeFSharp.Compiler.Import.Import→FSharp.Compiler.AbstractIL.IL.ILTypeRef
- Direction
- FSharp.Compiler.Import uses FSharp.Compiler.AbstractIL.IL, so a change to FSharp.Compiler.AbstractIL.IL can break FSharp.Compiler.Import, while a change to FSharp.Compiler.Import can't break FSharp.Compiler.AbstractIL.IL.
- Position
- Below the diagonal: FSharp.Compiler.Import uses a module listed above it, which is the healthy direction.
21→19 FSharp.Compiler.Import uses FSharp.Compiler.TypedTree✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.Import uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.Import.AssemblyLoader→FSharp.Compiler.TypedTree.CcuResolutionResultFSharp.Compiler.Import.Import→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Import.Import→FSharp.Compiler.TypedTree.CcuTypeForwarderTableFSharp.Compiler.Import.Import→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Import.Import→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Import.Import→FSharp.Compiler.TypedTree.Typar
- Direction
- FSharp.Compiler.Import uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.Import, while a change to FSharp.Compiler.Import can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.Import uses a module listed above it, which is the healthy direction.
21→20 FSharp.Compiler.Import uses FSharp.Compiler.TcGlobals✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Import uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.Import.ImportMap→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.Import uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.Import, while a change to FSharp.Compiler.Import can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.Import uses a module listed above it, which is the healthy direction.
22→2 FSharp.Compiler.InfoReader uses System.Collections✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in System.Collections.
- The types involved
FSharp.Compiler.InfoReader.FindMemberFlag→System.Collections.IStructuralComparableFSharp.Compiler.InfoReader.FindMemberFlag→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.InfoReader uses System.Collections, so a change to System.Collections can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.InfoReader uses a module listed above it, which is the healthy direction.
22→7 FSharp.Compiler.InfoReader uses System✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in System.
- The types involved
FSharp.Compiler.InfoReader.FindMemberFlag→System.IComparableFSharp.Compiler.InfoReader.FindMemberFlag→System.IComparable`1
- Direction
- FSharp.Compiler.InfoReader uses System, so a change to System can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break System.
- Position
- Below the diagonal: FSharp.Compiler.InfoReader uses a module listed above it, which is the healthy direction.
22→8 FSharp.Compiler.InfoReader uses FSharp.Compiler.Text✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.Text.RangeFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.InfoReader uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.InfoReader uses a module listed above it, which is the healthy direction.
22→19 FSharp.Compiler.InfoReader uses FSharp.Compiler.TypedTree✕
- Connections
- 10 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.InfoReader.HierarchyItem→FSharp.Compiler.TypedTree.TraitConstraintInfoFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.TypedTree.RecdFieldRefFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.TypedTree.UnionCaseRefFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.TypedTree.ValMemberInfoFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.InfoReader.SigOfFunctionForDelegate→FSharp.Compiler.TypedTree.TType
- Direction
- FSharp.Compiler.InfoReader uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.InfoReader uses a module listed above it, which is the healthy direction.
22→20 FSharp.Compiler.InfoReader uses FSharp.Compiler.TcGlobals✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.InfoReader uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.InfoReader uses a module listed above it, which is the healthy direction.
22→21 FSharp.Compiler.InfoReader uses FSharp.Compiler.Import✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in FSharp.Compiler.Import.
- The types involved
FSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.Import.ImportMapFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.Import.ImportMap
- Direction
- FSharp.Compiler.InfoReader uses FSharp.Compiler.Import, so a change to FSharp.Compiler.Import can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break FSharp.Compiler.Import.
- Position
- Below the diagonal: FSharp.Compiler.InfoReader uses a module listed above it, which is the healthy direction.
22→29 FSharp.Compiler.InfoReader uses FSharp.Compiler.Infos part of a loop✕
- Connections
- 11 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in FSharp.Compiler.Infos.
- The types involved
FSharp.Compiler.InfoReader.HierarchyItem→FSharp.Compiler.Infos.EventInfoFSharp.Compiler.InfoReader.HierarchyItem→FSharp.Compiler.Infos.ILFieldInfoFSharp.Compiler.InfoReader.HierarchyItem→FSharp.Compiler.Infos.MethInfoFSharp.Compiler.InfoReader.HierarchyItem→FSharp.Compiler.Infos.PropInfoFSharp.Compiler.InfoReader.HierarchyItem→FSharp.Compiler.Infos.RecdFieldInfoFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.Infos.EventInfoFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.Infos.ILFieldInfoFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.Infos.MethInfoFSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.Infos.PropInfoFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.Infos.PropInfoFSharp.Compiler.InfoReader.SigOfFunctionForDelegate→FSharp.Compiler.Infos.MethInfo
- Direction
- FSharp.Compiler.InfoReader uses FSharp.Compiler.Infos, so a change to FSharp.Compiler.Infos can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break FSharp.Compiler.Infos.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
22→30 FSharp.Compiler.InfoReader uses FSharp.Compiler.AccessibilityLogic part of a loop✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.InfoReader uses a type in FSharp.Compiler.AccessibilityLogic.
- The types involved
FSharp.Compiler.InfoReader.InfoReader→FSharp.Compiler.AccessibilityLogic.AccessorDomainFSharp.Compiler.InfoReader.PropertyCollector→FSharp.Compiler.AccessibilityLogic.AccessorDomain
- Direction
- FSharp.Compiler.InfoReader uses FSharp.Compiler.AccessibilityLogic, so a change to FSharp.Compiler.AccessibilityLogic can break FSharp.Compiler.InfoReader, while a change to FSharp.Compiler.InfoReader can't break FSharp.Compiler.AccessibilityLogic.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
23→2 FSharp.Compiler.NameResolution uses System.Collections✕
- Connections
- 28 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.NameResolution.BulkAdd→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.BulkAdd→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.CheckForDuplicateTyparFlag→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.CheckForDuplicateTyparFlag→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.ExtraDotAfterIdentifier→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.ExtraDotAfterIdentifier→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.FormatStringCheckContext→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.FullyQualifiedFlag→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.FullyQualifiedFlag→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.IndeterminateType→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.ItemOccurrence→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.ItemOccurrence→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.LookupIsInstance→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.LookupIsInstance→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.LookupKind→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.LookupKind→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.PermitDirectReferenceToGeneratedType→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.PermitDirectReferenceToGeneratedType→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.ResultCollectionSettings→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.ResultCollectionSettings→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.ShouldNotifySink→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.ShouldNotifySink→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.TcResultsSink→System.Collections.IStructuralEquatableFSharp.Compiler.NameResolution.TypeNameResolutionFlag→System.Collections.IStructuralComparableFSharp.Compiler.NameResolution.TypeNameResolutionFlag→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.NameResolution uses System.Collections, so a change to System.Collections can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→7 FSharp.Compiler.NameResolution uses System✕
- Connections
- 25 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in System.
- The types involved
FSharp.Compiler.NameResolution.BulkAdd→System.IComparableFSharp.Compiler.NameResolution.BulkAdd→System.IComparable`1FSharp.Compiler.NameResolution.CheckForDuplicateTyparFlag→System.IComparableFSharp.Compiler.NameResolution.CheckForDuplicateTyparFlag→System.IComparable`1FSharp.Compiler.NameResolution.ExtraDotAfterIdentifier→System.IComparableFSharp.Compiler.NameResolution.ExtraDotAfterIdentifier→System.IComparable`1FSharp.Compiler.NameResolution.FullyQualifiedFlag→System.IComparableFSharp.Compiler.NameResolution.FullyQualifiedFlag→System.IComparable`1FSharp.Compiler.NameResolution.ItemOccurrence→System.IComparableFSharp.Compiler.NameResolution.ItemOccurrence→System.IComparable`1FSharp.Compiler.NameResolution.LookupIsInstance→System.IComparableFSharp.Compiler.NameResolution.LookupIsInstance→System.IComparable`1FSharp.Compiler.NameResolution.LookupKind→System.IComparableFSharp.Compiler.NameResolution.LookupKind→System.IComparable`1FSharp.Compiler.NameResolution.NameResolution→System.IDisposableFSharp.Compiler.NameResolution.PermitDirectReferenceToGeneratedType→System.IComparableFSharp.Compiler.NameResolution.PermitDirectReferenceToGeneratedType→System.IComparable`1FSharp.Compiler.NameResolution.ResultCollectionSettings→System.IComparableFSharp.Compiler.NameResolution.ResultCollectionSettings→System.IComparable`1FSharp.Compiler.NameResolution.ShouldNotifySink→System.IComparableFSharp.Compiler.NameResolution.ShouldNotifySink→System.IComparable`1FSharp.Compiler.NameResolution.TypeNameResolutionFlag→System.IComparableFSharp.Compiler.NameResolution.TypeNameResolutionFlag→System.IComparable`1FSharp.Compiler.NameResolution.WarnOnUpperFlag→System.IComparableFSharp.Compiler.NameResolution.WarnOnUpperFlag→System.IComparable`1
- Direction
- FSharp.Compiler.NameResolution uses System, so a change to System can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break System.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→8 FSharp.Compiler.NameResolution uses FSharp.Compiler.Text✕
- Connections
- 13 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.NameResolution.CapturedNameResolution→FSharp.Compiler.Text.PositionFSharp.Compiler.NameResolution.CapturedNameResolution→FSharp.Compiler.Text.RangeFSharp.Compiler.NameResolution.FormatStringCheckContext→FSharp.Compiler.Text.ISourceTextFSharp.Compiler.NameResolution.ITypecheckResultsSink→FSharp.Compiler.Text.ISourceTextFSharp.Compiler.NameResolution.ITypecheckResultsSink→FSharp.Compiler.Text.PositionFSharp.Compiler.NameResolution.ITypecheckResultsSink→FSharp.Compiler.Text.RangeFSharp.Compiler.NameResolution.IndeterminateType→FSharp.Compiler.Text.RangeFSharp.Compiler.NameResolution.Item→FSharp.Compiler.Text.RangeFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Text.RangeFSharp.Compiler.NameResolution.NoConstructorsAvailableForType→FSharp.Compiler.Text.RangeFSharp.Compiler.NameResolution.TcResultsSinkImpl→FSharp.Compiler.Text.ISourceTextFSharp.Compiler.NameResolution.TcSymbolUseData→FSharp.Compiler.Text.RangeFSharp.Compiler.NameResolution.UpperCaseIdentifierInPattern→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→12 FSharp.Compiler.NameResolution uses Internal.Utilities.Library✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in Internal.Utilities.Library.
- The types involved
FSharp.Compiler.NameResolution.NameResolution→Internal.Utilities.Library.ResultOrException`1FSharp.Compiler.NameResolution.NameResolutionEnv→Internal.Utilities.Library.LayeredMultiMap`2
- Direction
- FSharp.Compiler.NameResolution uses Internal.Utilities.Library, so a change to Internal.Utilities.Library can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break Internal.Utilities.Library.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→14 FSharp.Compiler.NameResolution uses FSharp.Compiler.Syntax✕
- Connections
- 4 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.NameResolution.Item→FSharp.Compiler.Syntax.IdentFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Syntax.IdentFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Syntax.SynExprFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Syntax.TyparStaticReq
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→19 FSharp.Compiler.NameResolution uses FSharp.Compiler.TypedTree✕
- Connections
- 31 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.TypedTree. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.NameResolution.ArgumentContainer→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.NameResolution.ExtensionMember→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.NameResolution.ExtensionMember→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.NameResolution.ITypecheckResultsSink→FSharp.Compiler.TypedTree.OpenDeclarationFSharp.Compiler.NameResolution.ITypecheckResultsSink→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.ActivePatternElemRefFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.AnonRecdTypeInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.ArgReprInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.TraitConstraintInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.TraitConstraintSlnFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.NameResolution.Item→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.ActivePatternElemRefFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.MeasureFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.OpenDeclarationFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.RecdFieldRefFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.TyparDynamicReqFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.TyparKindFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.TyparRigidityFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTree.ValRef
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→20 FSharp.Compiler.NameResolution uses FSharp.Compiler.TcGlobals✕
- Connections
- 4 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.NameResolution.NameResolutionEnv→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.NameResolution.NameResolver→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.NameResolution.TcResultsSinkImpl→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→21 FSharp.Compiler.NameResolution uses FSharp.Compiler.Import✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.Import.
- The types involved
FSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Import.ImportMapFSharp.Compiler.NameResolution.NameResolver→FSharp.Compiler.Import.ImportMap
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.Import, so a change to FSharp.Compiler.Import can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.Import.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→22 FSharp.Compiler.NameResolution uses FSharp.Compiler.InfoReader✕
- Connections
- 3 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.InfoReader.
- The types involved
FSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.InfoReader.FindMemberFlagFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.InfoReader.InfoReaderFSharp.Compiler.NameResolution.NameResolver→FSharp.Compiler.InfoReader.InfoReader
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.InfoReader, so a change to FSharp.Compiler.InfoReader can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.InfoReader.
- Position
- Below the diagonal: FSharp.Compiler.NameResolution uses a module listed above it, which is the healthy direction.
23→28 FSharp.Compiler.NameResolution uses FSharp.Compiler.TypedTreeOps part of a loop✕
- Connections
- 7 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.TypedTreeOps.
- The types involved
FSharp.Compiler.NameResolution.CapturedNameResolution→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.NameResolution.NameResolutionEnv→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.NameResolution.NameResolutionEnv→FSharp.Compiler.TypedTreeOps.TyconRefMap`1FSharp.Compiler.NameResolution.NameResolutionEnv→FSharp.Compiler.TypedTreeOps.TyconRefMultiMap`1FSharp.Compiler.NameResolution.NoConstructorsAvailableForType→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.NameResolution.TcSymbolUseData→FSharp.Compiler.TypedTreeOps.DisplayEnv
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.TypedTreeOps, so a change to FSharp.Compiler.TypedTreeOps can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.TypedTreeOps.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
23→29 FSharp.Compiler.NameResolution uses FSharp.Compiler.Infos part of a loop✕
- Connections
- 12 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.Infos.
- The types involved
FSharp.Compiler.NameResolution.ArgumentContainer→FSharp.Compiler.Infos.MethInfoFSharp.Compiler.NameResolution.ExtensionMember→FSharp.Compiler.Infos.MethInfoFSharp.Compiler.NameResolution.FieldResolution→FSharp.Compiler.Infos.RecdFieldInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.Infos.EventInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.Infos.ILFieldInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.Infos.MethInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.Infos.PropInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.Infos.RecdFieldInfoFSharp.Compiler.NameResolution.Item→FSharp.Compiler.Infos.UnionCaseInfoFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Infos.MethInfoFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Infos.PropInfoFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.Infos.RecdFieldInfo
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.Infos, so a change to FSharp.Compiler.Infos can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.Infos.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
23→30 FSharp.Compiler.NameResolution uses FSharp.Compiler.AccessibilityLogic part of a loop✕
- Connections
- 3 pairs of types, where a type in FSharp.Compiler.NameResolution uses a type in FSharp.Compiler.AccessibilityLogic.
- The types involved
FSharp.Compiler.NameResolution.CapturedNameResolution→FSharp.Compiler.AccessibilityLogic.AccessorDomainFSharp.Compiler.NameResolution.ITypecheckResultsSink→FSharp.Compiler.AccessibilityLogic.AccessorDomainFSharp.Compiler.NameResolution.NameResolution→FSharp.Compiler.AccessibilityLogic.AccessorDomain
- Direction
- FSharp.Compiler.NameResolution uses FSharp.Compiler.AccessibilityLogic, so a change to FSharp.Compiler.AccessibilityLogic can break FSharp.Compiler.NameResolution, while a change to FSharp.Compiler.NameResolution can't break FSharp.Compiler.AccessibilityLogic.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
24→2 FSharp.Compiler.Symbols uses System.Collections✕
- Connections
- 4 pairs of types, where a type in FSharp.Compiler.Symbols uses a type in System.Collections.
- The types involved
FSharp.Compiler.Symbols.FSharpImplementationFileDeclaration→System.Collections.IStructuralEquatableFSharp.Compiler.Symbols.FSharpInlineAnnotation→System.Collections.IStructuralComparableFSharp.Compiler.Symbols.FSharpInlineAnnotation→System.Collections.IStructuralEquatableFSharp.Compiler.Symbols.FSharpXmlDoc→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.Symbols uses System.Collections, so a change to System.Collections can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→4 FSharp.Compiler.Symbols uses System.Collections.Generic✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.Symbols uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.Symbols.FSharpAssemblySignature→System.Collections.Generic.IEnumerable`1FSharp.Compiler.Symbols.FSharpEntity→System.Collections.Generic.IEnumerable`1
- Direction
- FSharp.Compiler.Symbols uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→7 FSharp.Compiler.Symbols uses System✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.Symbols uses a type in System.
- The types involved
FSharp.Compiler.Symbols.FSharpInlineAnnotation→System.IComparableFSharp.Compiler.Symbols.FSharpInlineAnnotation→System.IComparable`1
- Direction
- FSharp.Compiler.Symbols uses System, so a change to System can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break System.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→8 FSharp.Compiler.Symbols uses FSharp.Compiler.Text✕
- Connections
- 14 pairs of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.Symbols.FSharpActivePatternCase→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpAttribute→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpEntity→FSharp.Compiler.Text.ISourceTextFSharp.Compiler.Symbols.FSharpEntity→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpExpr→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpField→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpGenericParameter→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpMemberOrFunctionOrValue→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpMemberOrFunctionOrValue→FSharp.Compiler.Text.TaggedTextFSharp.Compiler.Symbols.FSharpOpenDeclaration→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpParameter→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpSymbol→FSharp.Compiler.Text.RangeFSharp.Compiler.Symbols.FSharpType→FSharp.Compiler.Text.TaggedTextFSharp.Compiler.Symbols.FSharpUnionCase→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→14 FSharp.Compiler.Symbols uses FSharp.Compiler.Syntax✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.Symbols.FSharpOpenDeclaration→FSharp.Compiler.Syntax.IdentFSharp.Compiler.Symbols.FSharpOpenDeclaration→FSharp.Compiler.Syntax.SynOpenDeclTarget
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→19 FSharp.Compiler.Symbols uses FSharp.Compiler.TypedTree✕
- Connections
- 23 pairs of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.Symbols.FSharpAbstractSignature→FSharp.Compiler.TypedTree.SlotSigFSharp.Compiler.Symbols.FSharpAccessibility→FSharp.Compiler.TypedTree.AccessibilityFSharp.Compiler.Symbols.FSharpAccessibilityRights→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Symbols.FSharpAssembly→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Symbols.FSharpAssemblyContents→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Symbols.FSharpAssemblyContents→FSharp.Compiler.TypedTree.CheckedImplFileFSharp.Compiler.Symbols.FSharpAssemblyContents→FSharp.Compiler.TypedTree.ModuleOrNamespaceTypeFSharp.Compiler.Symbols.FSharpAssemblySignature→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Symbols.FSharpAssemblySignature→FSharp.Compiler.TypedTree.ModuleOrNamespaceTypeFSharp.Compiler.Symbols.FSharpEntity→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Symbols.FSharpField→FSharp.Compiler.TypedTree.RecdFieldRefFSharp.Compiler.Symbols.FSharpField→FSharp.Compiler.TypedTree.UnionCaseRefFSharp.Compiler.Symbols.FSharpGenericParameter→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.Symbols.FSharpImplementationFileContents→FSharp.Compiler.TypedTree.CheckedImplFileFSharp.Compiler.Symbols.FSharpMemberOrFunctionOrValue→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.Symbols.FSharpSymbol→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Symbols.FSharpSymbol→FSharp.Compiler.TypedTree.ModuleOrNamespaceTypeFSharp.Compiler.Symbols.FSharpType→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Symbols.FSharpType→FSharp.Compiler.TypedTree.ModuleOrNamespaceTypeFSharp.Compiler.Symbols.FSharpType→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Symbols.FSharpUnionCase→FSharp.Compiler.TypedTree.UnionCaseRefFSharp.Compiler.Symbols.SymbolEnv→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.Symbols.SymbolEnv→FSharp.Compiler.TypedTree.ModuleOrNamespaceType
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→20 FSharp.Compiler.Symbols uses FSharp.Compiler.TcGlobals✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.Symbols.FSharpAssembly→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Symbols.FSharpAssemblyContents→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Symbols.FSharpAssemblySignature→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Symbols.FSharpSymbol→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Symbols.FSharpType→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Symbols.SymbolEnv→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→21 FSharp.Compiler.Symbols uses FSharp.Compiler.Import✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.Import.
- The types involved
FSharp.Compiler.Symbols.SymbolEnv→FSharp.Compiler.Import.ImportMap
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.Import, so a change to FSharp.Compiler.Import can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.Import.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→22 FSharp.Compiler.Symbols uses FSharp.Compiler.InfoReader✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.InfoReader.
- The types involved
FSharp.Compiler.Symbols.SymbolEnv→FSharp.Compiler.InfoReader.InfoReader
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.InfoReader, so a change to FSharp.Compiler.InfoReader can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.InfoReader.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→23 FSharp.Compiler.Symbols uses FSharp.Compiler.NameResolution✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.NameResolution.
- The types involved
FSharp.Compiler.Symbols.FSharpSymbol→FSharp.Compiler.NameResolution.Item
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.NameResolution, so a change to FSharp.Compiler.NameResolution can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.NameResolution.
- Position
- Below the diagonal: FSharp.Compiler.Symbols uses a module listed above it, which is the healthy direction.
24→29 FSharp.Compiler.Symbols uses FSharp.Compiler.Infos part of a loop✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.Infos.
- The types involved
FSharp.Compiler.Symbols.FSharpMemberOrFunctionOrValue→FSharp.Compiler.Infos.MethInfo
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.Infos, so a change to FSharp.Compiler.Infos can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.Infos.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
24→30 FSharp.Compiler.Symbols uses FSharp.Compiler.AccessibilityLogic part of a loop✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Symbols uses a type in FSharp.Compiler.AccessibilityLogic.
- The types involved
FSharp.Compiler.Symbols.FSharpAccessibilityRights→FSharp.Compiler.AccessibilityLogic.AccessorDomain
- Direction
- FSharp.Compiler.Symbols uses FSharp.Compiler.AccessibilityLogic, so a change to FSharp.Compiler.AccessibilityLogic can break FSharp.Compiler.Symbols, while a change to FSharp.Compiler.Symbols can't break FSharp.Compiler.AccessibilityLogic.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
25→2 FSharp.Compiler.Diagnostics uses System.Collections✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.Diagnostics uses a type in System.Collections.
- The types involved
FSharp.Compiler.Diagnostics.FSharpDiagnosticKind→System.Collections.IStructuralComparableFSharp.Compiler.Diagnostics.FSharpDiagnosticKind→System.Collections.IStructuralEquatableFSharp.Compiler.Diagnostics.FSharpDiagnosticOptions→System.Collections.IStructuralEquatableFSharp.Compiler.Diagnostics.FSharpDiagnosticSeverity→System.Collections.IStructuralComparableFSharp.Compiler.Diagnostics.FSharpDiagnosticSeverity→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.Diagnostics uses System.Collections, so a change to System.Collections can break FSharp.Compiler.Diagnostics, while a change to FSharp.Compiler.Diagnostics can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.Diagnostics uses a module listed above it, which is the healthy direction.
25→7 FSharp.Compiler.Diagnostics uses System✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.Diagnostics uses a type in System.
- The types involved
FSharp.Compiler.Diagnostics.DiagnosticsScope→System.IDisposableFSharp.Compiler.Diagnostics.FSharpDiagnosticKind→System.IComparableFSharp.Compiler.Diagnostics.FSharpDiagnosticKind→System.IComparable`1FSharp.Compiler.Diagnostics.FSharpDiagnosticSeverity→System.IComparableFSharp.Compiler.Diagnostics.FSharpDiagnosticSeverity→System.IComparable`1
- Direction
- FSharp.Compiler.Diagnostics uses System, so a change to System can break FSharp.Compiler.Diagnostics, while a change to FSharp.Compiler.Diagnostics can't break System.
- Position
- Below the diagonal: FSharp.Compiler.Diagnostics uses a module listed above it, which is the healthy direction.
25→8 FSharp.Compiler.Diagnostics uses FSharp.Compiler.Text✕
- Connections
- 3 pairs of types, where a type in FSharp.Compiler.Diagnostics uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.Diagnostics.DiagnosticsScope→FSharp.Compiler.Text.RangeFSharp.Compiler.Diagnostics.FSharpDiagnostic→FSharp.Compiler.Text.PositionFSharp.Compiler.Diagnostics.FSharpDiagnostic→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.Diagnostics uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.Diagnostics, while a change to FSharp.Compiler.Diagnostics can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.Diagnostics uses a module listed above it, which is the healthy direction.
25→24 FSharp.Compiler.Diagnostics uses FSharp.Compiler.Symbols✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Diagnostics uses a type in FSharp.Compiler.Symbols.
- The types involved
FSharp.Compiler.Diagnostics.FSharpDiagnostic→FSharp.Compiler.Symbols.SymbolEnv
- Direction
- FSharp.Compiler.Diagnostics uses FSharp.Compiler.Symbols, so a change to FSharp.Compiler.Symbols can break FSharp.Compiler.Diagnostics, while a change to FSharp.Compiler.Diagnostics can't break FSharp.Compiler.Symbols.
- Position
- Below the diagonal: FSharp.Compiler.Diagnostics uses a module listed above it, which is the healthy direction.
25→26 FSharp.Compiler.Diagnostics uses FSharp.Compiler.DiagnosticsLogger part of a loop✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.Diagnostics uses a type in FSharp.Compiler.DiagnosticsLogger.
- The types involved
FSharp.Compiler.Diagnostics.CompilationDiagnosticLogger→FSharp.Compiler.DiagnosticsLogger.DiagnosticsLoggerFSharp.Compiler.Diagnostics.FSharpDiagnostic→FSharp.Compiler.DiagnosticsLogger.PhasedDiagnostic
- Direction
- FSharp.Compiler.Diagnostics uses FSharp.Compiler.DiagnosticsLogger, so a change to FSharp.Compiler.DiagnosticsLogger can break FSharp.Compiler.Diagnostics, while a change to FSharp.Compiler.Diagnostics can't break FSharp.Compiler.DiagnosticsLogger.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
26→2 FSharp.Compiler.DiagnosticsLogger uses System.Collections✕
- Connections
- 22 pairs of types, where a type in FSharp.Compiler.DiagnosticsLogger uses a type in System.Collections.
- The types involved
FSharp.Compiler.DiagnosticsLogger.BuildPhase→System.Collections.IStructuralComparableFSharp.Compiler.DiagnosticsLogger.BuildPhase→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.Deprecated→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.DiagnosticEnabledWithLanguageFeature→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.DiagnosticWithText→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.Experimental→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.InternalError→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.InternalException→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.LibraryUseOnly→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.ObsoleteDiagnostic→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.PhasedDiagnostic→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.PossibleUnverifiableCode→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.ReportedError→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.StopProcessingExn→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.SuppressLanguageFeatureCheck→System.Collections.IStructuralComparableFSharp.Compiler.DiagnosticsLogger.SuppressLanguageFeatureCheck→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.UnresolvedPathReference→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.UnresolvedPathReferenceNoRange→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.UnresolvedReferenceError→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.UnresolvedReferenceNoRange→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.UserCompilerMessage→System.Collections.IStructuralEquatableFSharp.Compiler.DiagnosticsLogger.WrappedError→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.DiagnosticsLogger uses System.Collections, so a change to System.Collections can break FSharp.Compiler.DiagnosticsLogger, while a change to FSharp.Compiler.DiagnosticsLogger can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.DiagnosticsLogger uses a module listed above it, which is the healthy direction.
26→7 FSharp.Compiler.DiagnosticsLogger uses System✕
- Connections
- 13 pairs of types, where a type in FSharp.Compiler.DiagnosticsLogger uses a type in System.
- The types involved
FSharp.Compiler.DiagnosticsLogger.BuildPhase→System.IComparableFSharp.Compiler.DiagnosticsLogger.BuildPhase→System.IComparable`1FSharp.Compiler.DiagnosticsLogger.CompilationGlobalsScope→System.IDisposableFSharp.Compiler.DiagnosticsLogger.DiagnosticsLogger→System.ExceptionFSharp.Compiler.DiagnosticsLogger.DiagnosticsLogger→System.IDisposableFSharp.Compiler.DiagnosticsLogger.InternalException→System.ExceptionFSharp.Compiler.DiagnosticsLogger.OperationResult`1→System.ExceptionFSharp.Compiler.DiagnosticsLogger.PhasedDiagnostic→System.ExceptionFSharp.Compiler.DiagnosticsLogger.ReportedError→System.ExceptionFSharp.Compiler.DiagnosticsLogger.StopProcessingExn→System.ExceptionFSharp.Compiler.DiagnosticsLogger.SuppressLanguageFeatureCheck→System.IComparableFSharp.Compiler.DiagnosticsLogger.SuppressLanguageFeatureCheck→System.IComparable`1FSharp.Compiler.DiagnosticsLogger.WrappedError→System.Exception
- Direction
- FSharp.Compiler.DiagnosticsLogger uses System, so a change to System can break FSharp.Compiler.DiagnosticsLogger, while a change to FSharp.Compiler.DiagnosticsLogger can't break System.
- Position
- Below the diagonal: FSharp.Compiler.DiagnosticsLogger uses a module listed above it, which is the healthy direction.
26→8 FSharp.Compiler.DiagnosticsLogger uses FSharp.Compiler.Text✕
- Connections
- 15 pairs of types, where a type in FSharp.Compiler.DiagnosticsLogger uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.DiagnosticsLogger.Deprecated→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.DiagnosticEnabledWithLanguageFeature→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.DiagnosticWithSuggestions→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.DiagnosticWithText→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.DiagnosticsLogger→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.Experimental→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.InternalError→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.InternalException→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.LibraryUseOnly→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.ObsoleteDiagnostic→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.PossibleUnverifiableCode→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.UnresolvedPathReference→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.UnresolvedReferenceError→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.UserCompilerMessage→FSharp.Compiler.Text.RangeFSharp.Compiler.DiagnosticsLogger.WrappedError→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.DiagnosticsLogger uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.DiagnosticsLogger, while a change to FSharp.Compiler.DiagnosticsLogger can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.DiagnosticsLogger uses a module listed above it, which is the healthy direction.
26→12 FSharp.Compiler.DiagnosticsLogger uses Internal.Utilities.Library✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.DiagnosticsLogger uses a type in Internal.Utilities.Library.
- The types involved
FSharp.Compiler.DiagnosticsLogger.StackGuard→Internal.Utilities.Library.Cancellable`1
- Direction
- FSharp.Compiler.DiagnosticsLogger uses Internal.Utilities.Library, so a change to Internal.Utilities.Library can break FSharp.Compiler.DiagnosticsLogger, while a change to FSharp.Compiler.DiagnosticsLogger can't break Internal.Utilities.Library.
- Position
- Below the diagonal: FSharp.Compiler.DiagnosticsLogger uses a module listed above it, which is the healthy direction.
26→25 FSharp.Compiler.DiagnosticsLogger uses FSharp.Compiler.Diagnostics✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.DiagnosticsLogger uses a type in FSharp.Compiler.Diagnostics.
- The types involved
FSharp.Compiler.DiagnosticsLogger.CapturingDiagnosticsLogger→FSharp.Compiler.Diagnostics.FSharpDiagnosticSeverityFSharp.Compiler.DiagnosticsLogger.DiagnosticsLogger→FSharp.Compiler.Diagnostics.FSharpDiagnosticSeverity
- Direction
- FSharp.Compiler.DiagnosticsLogger uses FSharp.Compiler.Diagnostics, so a change to FSharp.Compiler.Diagnostics can break FSharp.Compiler.DiagnosticsLogger, while a change to FSharp.Compiler.DiagnosticsLogger can't break FSharp.Compiler.Diagnostics.
- Position
- Below the diagonal: FSharp.Compiler.DiagnosticsLogger uses a module listed above it, which is the healthy direction.
27→2 FSharp.Compiler.CompilerConfig uses System.Collections✕
- Connections
- 30 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.CompilerConfig.AssemblyReference→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.CompilerTarget→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.CompilerTarget→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.CopyFSharpCoreFlag→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.CopyFSharpCoreFlag→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.Directive→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.Directive→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.FileNameNotResolved→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.HashAlgorithm→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.HashAlgorithm→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.LStatus→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.LStatus→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.LoadedSourceNotFoundIgnoring→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.MetadataAssemblyGeneration→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.MetadataAssemblyGeneration→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.PackageManagerLine→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.ParallelReferenceResolution→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.ParallelReferenceResolution→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.ProjectAssemblyDataResult→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.TokenizeOption→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.TokenizeOption→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.TypeCheckingConfig→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.TypeCheckingConfig→System.Collections.IStructuralEquatableFSharp.Compiler.CompilerConfig.TypeCheckingMode→System.Collections.IStructuralComparableFSharp.Compiler.CompilerConfig.TypeCheckingMode→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.CompilerConfig uses System.Collections, so a change to System.Collections can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→4 FSharp.Compiler.CompilerConfig uses System.Collections.Generic✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CompilerConfig uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.CompilerConfig.TcConfigBuilder→System.Collections.Generic.IEnumerable`1
- Direction
- FSharp.Compiler.CompilerConfig uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→7 FSharp.Compiler.CompilerConfig uses System✕
- Connections
- 24 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in System.
- The types involved
FSharp.Compiler.CompilerConfig.CompilerTarget→System.IComparableFSharp.Compiler.CompilerConfig.CompilerTarget→System.IComparable`1FSharp.Compiler.CompilerConfig.CopyFSharpCoreFlag→System.IComparableFSharp.Compiler.CompilerConfig.CopyFSharpCoreFlag→System.IComparable`1FSharp.Compiler.CompilerConfig.Directive→System.IComparableFSharp.Compiler.CompilerConfig.Directive→System.IComparable`1FSharp.Compiler.CompilerConfig.HashAlgorithm→System.IComparableFSharp.Compiler.CompilerConfig.HashAlgorithm→System.IComparable`1FSharp.Compiler.CompilerConfig.LStatus→System.IComparableFSharp.Compiler.CompilerConfig.LStatus→System.IComparable`1FSharp.Compiler.CompilerConfig.MetadataAssemblyGeneration→System.IComparableFSharp.Compiler.CompilerConfig.MetadataAssemblyGeneration→System.IComparable`1FSharp.Compiler.CompilerConfig.ParallelReferenceResolution→System.IComparableFSharp.Compiler.CompilerConfig.ParallelReferenceResolution→System.IComparable`1FSharp.Compiler.CompilerConfig.TokenizeOption→System.IComparableFSharp.Compiler.CompilerConfig.TokenizeOption→System.IComparable`1FSharp.Compiler.CompilerConfig.TypeCheckingConfig→System.IComparableFSharp.Compiler.CompilerConfig.TypeCheckingConfig→System.IComparable`1FSharp.Compiler.CompilerConfig.TypeCheckingMode→System.IComparableFSharp.Compiler.CompilerConfig.TypeCheckingMode→System.IComparable`1FSharp.Compiler.CompilerConfig.VersionFlag→System.IComparableFSharp.Compiler.CompilerConfig.VersionFlag→System.IComparable`1FSharp.Compiler.CompilerConfig.WarningNumberSource→System.IComparableFSharp.Compiler.CompilerConfig.WarningNumberSource→System.IComparable`1
- Direction
- FSharp.Compiler.CompilerConfig uses System, so a change to System can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break System.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→8 FSharp.Compiler.CompilerConfig uses FSharp.Compiler.Text✕
- Connections
- 7 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.CompilerConfig.AssemblyReference→FSharp.Compiler.Text.RangeFSharp.Compiler.CompilerConfig.CompilerConfig→FSharp.Compiler.Text.RangeFSharp.Compiler.CompilerConfig.FileNameNotResolved→FSharp.Compiler.Text.RangeFSharp.Compiler.CompilerConfig.IRawFSharpAssemblyData→FSharp.Compiler.Text.RangeFSharp.Compiler.CompilerConfig.LoadedSourceNotFoundIgnoring→FSharp.Compiler.Text.RangeFSharp.Compiler.CompilerConfig.PackageManagerLine→FSharp.Compiler.Text.RangeFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.CompilerConfig uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→13 FSharp.Compiler.CompilerConfig uses FSharp.Compiler.AbstractIL.IL✕
- Connections
- 9 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in FSharp.Compiler.AbstractIL.IL.
- The types involved
FSharp.Compiler.CompilerConfig.IRawFSharpAssemblyData→FSharp.Compiler.AbstractIL.IL.ILAssemblyRefFSharp.Compiler.CompilerConfig.IRawFSharpAssemblyData→FSharp.Compiler.AbstractIL.IL.ILExportedTypesAndForwardersFSharp.Compiler.CompilerConfig.IRawFSharpAssemblyData→FSharp.Compiler.AbstractIL.IL.ILModuleDefFSharp.Compiler.CompilerConfig.IRawFSharpAssemblyData→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.AbstractIL.IL.ILPlatformFSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.AbstractIL.IL.PrimaryAssemblyFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.AbstractIL.IL.ILPlatformFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.AbstractIL.IL.PrimaryAssemblyFSharp.Compiler.CompilerConfig.VersionFlag→FSharp.Compiler.AbstractIL.IL.ILVersionInfo
- Direction
- FSharp.Compiler.CompilerConfig uses FSharp.Compiler.AbstractIL.IL, so a change to FSharp.Compiler.AbstractIL.IL can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break FSharp.Compiler.AbstractIL.IL.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→14 FSharp.Compiler.CompilerConfig uses FSharp.Compiler.Syntax✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CompilerConfig uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.CompilerConfig.WarningDescription→FSharp.Compiler.Syntax.Ident
- Direction
- FSharp.Compiler.CompilerConfig uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→20 FSharp.Compiler.CompilerConfig uses FSharp.Compiler.TcGlobals✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.TcGlobals.CompilationModeFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.TcGlobals.CompilationMode
- Direction
- FSharp.Compiler.CompilerConfig uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→25 FSharp.Compiler.CompilerConfig uses FSharp.Compiler.Diagnostics✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in FSharp.Compiler.Diagnostics.
- The types involved
FSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.Diagnostics.FSharpDiagnosticOptionsFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.Diagnostics.FSharpDiagnosticOptions
- Direction
- FSharp.Compiler.CompilerConfig uses FSharp.Compiler.Diagnostics, so a change to FSharp.Compiler.Diagnostics can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break FSharp.Compiler.Diagnostics.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→26 FSharp.Compiler.CompilerConfig uses FSharp.Compiler.DiagnosticsLogger✕
- Connections
- 4 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in FSharp.Compiler.DiagnosticsLogger.
- The types involved
FSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.DiagnosticsLogger.DiagnosticStyleFSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.DiagnosticsLogger.ExiterFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.DiagnosticsLogger.DiagnosticStyleFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.DiagnosticsLogger.Exiter
- Direction
- FSharp.Compiler.CompilerConfig uses FSharp.Compiler.DiagnosticsLogger, so a change to FSharp.Compiler.DiagnosticsLogger can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break FSharp.Compiler.DiagnosticsLogger.
- Position
- Below the diagonal: FSharp.Compiler.CompilerConfig uses a module listed above it, which is the healthy direction.
27→34 FSharp.Compiler.CompilerConfig uses FSharp.Compiler.CodeAnalysis part of a loop✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.CompilerConfig uses a type in FSharp.Compiler.CodeAnalysis.
- The types involved
FSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.CodeAnalysis.FxResolverFSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.CodeAnalysis.LegacyReferenceResolverFSharp.Compiler.CompilerConfig.TcConfig→FSharp.Compiler.CodeAnalysis.LegacyResolutionEnvironmentFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.CodeAnalysis.FxResolverFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.CodeAnalysis.LegacyReferenceResolverFSharp.Compiler.CompilerConfig.TcConfigBuilder→FSharp.Compiler.CodeAnalysis.LegacyResolutionEnvironment
- Direction
- FSharp.Compiler.CompilerConfig uses FSharp.Compiler.CodeAnalysis, so a change to FSharp.Compiler.CodeAnalysis can break FSharp.Compiler.CompilerConfig, while a change to FSharp.Compiler.CompilerConfig can't break FSharp.Compiler.CodeAnalysis.
- Position
- Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
28→2 FSharp.Compiler.TypedTreeOps uses System.Collections✕
- Connections
- 15 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in System.Collections.
- The types involved
FSharp.Compiler.TypedTreeOps.AllowTypeDirectedDetupling→System.Collections.IStructuralComparableFSharp.Compiler.TypedTreeOps.AllowTypeDirectedDetupling→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTreeOps.DefensiveCopyWarning→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTreeOps.Erasure→System.Collections.IStructuralComparableFSharp.Compiler.TypedTreeOps.Erasure→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTreeOps.GenericParameterStyle→System.Collections.IStructuralComparableFSharp.Compiler.TypedTreeOps.GenericParameterStyle→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTreeOps.Mutates→System.Collections.IStructuralComparableFSharp.Compiler.TypedTreeOps.Mutates→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTreeOps.OptimizeForExpressionOptions→System.Collections.IStructuralComparableFSharp.Compiler.TypedTreeOps.OptimizeForExpressionOptions→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTreeOps.SignatureHidingInfo→System.Collections.IStructuralComparableFSharp.Compiler.TypedTreeOps.SignatureHidingInfo→System.Collections.IStructuralEquatableFSharp.Compiler.TypedTreeOps.ValCopyFlag→System.Collections.IStructuralComparableFSharp.Compiler.TypedTreeOps.ValCopyFlag→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.TypedTreeOps uses System.Collections, so a change to System.Collections can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→4 FSharp.Compiler.TypedTreeOps uses System.Collections.Generic✕
- Connections
- 4 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.TypedTreeOps.SignatureHidingInfo→System.Collections.Generic.IComparer`1FSharp.Compiler.TypedTreeOps.TypedTreeOps→System.Collections.Generic.IComparer`1FSharp.Compiler.TypedTreeOps.TypedTreeOps→System.Collections.Generic.IEnumerable`1FSharp.Compiler.TypedTreeOps.ValHash`1→System.Collections.Generic.IEnumerable`1
- Direction
- FSharp.Compiler.TypedTreeOps uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→7 FSharp.Compiler.TypedTreeOps uses System✕
- Connections
- 15 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in System.
- The types involved
FSharp.Compiler.TypedTreeOps.AllowTypeDirectedDetupling→System.IComparableFSharp.Compiler.TypedTreeOps.AllowTypeDirectedDetupling→System.IComparable`1FSharp.Compiler.TypedTreeOps.Erasure→System.IComparableFSharp.Compiler.TypedTreeOps.Erasure→System.IComparable`1FSharp.Compiler.TypedTreeOps.GenericParameterStyle→System.IComparableFSharp.Compiler.TypedTreeOps.GenericParameterStyle→System.IComparable`1FSharp.Compiler.TypedTreeOps.Mutates→System.IComparableFSharp.Compiler.TypedTreeOps.Mutates→System.IComparable`1FSharp.Compiler.TypedTreeOps.OptimizeForExpressionOptions→System.IComparableFSharp.Compiler.TypedTreeOps.OptimizeForExpressionOptions→System.IComparable`1FSharp.Compiler.TypedTreeOps.SignatureHidingInfo→System.IComparableFSharp.Compiler.TypedTreeOps.SignatureHidingInfo→System.IComparable`1FSharp.Compiler.TypedTreeOps.StaticOptimizationAnswer→System.EnumFSharp.Compiler.TypedTreeOps.ValCopyFlag→System.IComparableFSharp.Compiler.TypedTreeOps.ValCopyFlag→System.IComparable`1
- Direction
- FSharp.Compiler.TypedTreeOps uses System, so a change to System can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break System.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→8 FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.Text✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.TypedTreeOps.DefensiveCopyWarning→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTreeOps.MatchBuilder→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Text.LayoutFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Text.RangeFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Text.TaggedText
- Direction
- FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→11 FSharp.Compiler.TypedTreeOps uses Internal.Utilities.Collections.Tagged✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in Internal.Utilities.Collections.Tagged.
- The types involved
FSharp.Compiler.TypedTreeOps.SignatureHidingInfo→Internal.Utilities.Collections.Tagged.Set`2FSharp.Compiler.TypedTreeOps.TypedTreeOps→Internal.Utilities.Collections.Tagged.Set`2
- Direction
- FSharp.Compiler.TypedTreeOps uses Internal.Utilities.Collections.Tagged, so a change to Internal.Utilities.Collections.Tagged can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break Internal.Utilities.Collections.Tagged.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→12 FSharp.Compiler.TypedTreeOps uses Internal.Utilities.Library✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in Internal.Utilities.Library.
- The types involved
FSharp.Compiler.TypedTreeOps.DisplayEnv→Internal.Utilities.Library.InterruptibleLazy`1
- Direction
- FSharp.Compiler.TypedTreeOps uses Internal.Utilities.Library, so a change to Internal.Utilities.Library can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break Internal.Utilities.Library.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→13 FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.AbstractIL.IL✕
- Connections
- 12 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in FSharp.Compiler.AbstractIL.IL.
- The types involved
FSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILArrayShapeFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILAttribElemFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILAttributeFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILAttributesFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILFieldInitFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILFieldSpecFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILInstrFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILMethodSpecFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILReadonlyFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILTypeFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.AbstractIL.IL.ILVersionInfo
- Direction
- FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.AbstractIL.IL, so a change to FSharp.Compiler.AbstractIL.IL can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break FSharp.Compiler.AbstractIL.IL.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→14 FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.Syntax✕
- Connections
- 11 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.TypedTreeOps.MatchBuilder→FSharp.Compiler.Syntax.DebugPointAtBindingFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.DebugPointAtBindingFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.DebugPointAtFinallyFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.DebugPointAtForFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.DebugPointAtInOrToFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.DebugPointAtTryFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.DebugPointAtWhileFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.DebugPointAtWithFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.IdentFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.SynMemberFlagsFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.Syntax.TyparStaticReq
- Direction
- FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→19 FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.TypedTree✕
- Connections
- 72 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in FSharp.Compiler.TypedTree. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.TypedTreeOps.DisplayEnv→FSharp.Compiler.TypedTree.AccessibilityFSharp.Compiler.TypedTreeOps.DisplayEnv→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.TypedTreeOps.FreeVarOptions→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.TypedTreeOps.GeneralizedType→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.TypedTreeOps.GeneralizedType→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.TypedTreeOps.MatchBuilder→FSharp.Compiler.TypedTree.DecisionTreeFSharp.Compiler.TypedTreeOps.MatchBuilder→FSharp.Compiler.TypedTree.DecisionTreeTargetFSharp.Compiler.TypedTreeOps.MatchBuilder→FSharp.Compiler.TypedTree.ExprFSharp.Compiler.TypedTreeOps.MatchBuilder→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.TypedTreeOps.Remap→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.TypedTreeOps.Remap→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.TypedTreeOps.SignatureHidingInfo→FSharp.Compiler.TypedTree.EntityFSharp.Compiler.TypedTreeOps.SignatureHidingInfo→FSharp.Compiler.TypedTree.RecdFieldRefFSharp.Compiler.TypedTreeOps.SignatureHidingInfo→FSharp.Compiler.TypedTree.UnionCaseRefFSharp.Compiler.TypedTreeOps.SignatureHidingInfo→FSharp.Compiler.TypedTree.ValFSharp.Compiler.TypedTreeOps.TyconRefMap`1→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.TypedTreeOps.TyconRefMultiMap`1→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.TypedTreeOps.TyparMap`1→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.TypedTreeOps.TypeDefMetadata→FSharp.Compiler.TypedTree.TILObjectReprDataFSharp.Compiler.TypedTreeOps.TypeEquivEnv→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.TypedTreeOps.TypeEquivEnv→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.TypedTreeOps.TypeEquivEnv→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.TypedTree.ActivePatternReturnKindFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.TypedTree.AnonRecdTypeInfoFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.TypedTree.ArgReprInfo
- Direction
- FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→20 FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.TcGlobals✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.TypedTreeOps.DisplayEnv→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.TypedTreeOps.TypeEquivEnv→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.TcGlobals.BuiltinAttribInfoFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.TcGlobals.IntrinsicValRefFSharp.Compiler.TypedTreeOps.TypedTreeOps→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
28→26 FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.DiagnosticsLogger✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.TypedTreeOps uses a type in FSharp.Compiler.DiagnosticsLogger.
- The types involved
FSharp.Compiler.TypedTreeOps.ExprRewritingEnv→FSharp.Compiler.DiagnosticsLogger.StackGuard
- Direction
- FSharp.Compiler.TypedTreeOps uses FSharp.Compiler.DiagnosticsLogger, so a change to FSharp.Compiler.DiagnosticsLogger can break FSharp.Compiler.TypedTreeOps, while a change to FSharp.Compiler.TypedTreeOps can't break FSharp.Compiler.DiagnosticsLogger.
- Position
- Below the diagonal: FSharp.Compiler.TypedTreeOps uses a module listed above it, which is the healthy direction.
29→2 FSharp.Compiler.Infos uses System.Collections✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.Infos uses a type in System.Collections.
- The types involved
FSharp.Compiler.Infos.BadEventTransformation→System.Collections.IStructuralEquatableFSharp.Compiler.Infos.CallerInfo→System.Collections.IStructuralComparableFSharp.Compiler.Infos.CallerInfo→System.Collections.IStructuralEquatableFSharp.Compiler.Infos.ReflectedArgInfo→System.Collections.IStructuralComparableFSharp.Compiler.Infos.ReflectedArgInfo→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.Infos uses System.Collections, so a change to System.Collections can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→7 FSharp.Compiler.Infos uses System✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.Infos uses a type in System.
- The types involved
FSharp.Compiler.Infos.CallerInfo→System.IComparableFSharp.Compiler.Infos.CallerInfo→System.IComparable`1FSharp.Compiler.Infos.Infos→System.ExceptionFSharp.Compiler.Infos.ReflectedArgInfo→System.IComparableFSharp.Compiler.Infos.ReflectedArgInfo→System.IComparable`1
- Direction
- FSharp.Compiler.Infos uses System, so a change to System can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break System.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→8 FSharp.Compiler.Infos uses FSharp.Compiler.Text✕
- Connections
- 10 pairs of types, where a type in FSharp.Compiler.Infos uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.Infos.BadEventTransformation→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.EventInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.ILPropInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.Infos→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.MethInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.OptionalArgInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.PropInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.Infos.UnionCaseInfo→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.Infos uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→13 FSharp.Compiler.Infos uses FSharp.Compiler.AbstractIL.IL✕
- Connections
- 23 pairs of types, where a type in FSharp.Compiler.Infos uses a type in FSharp.Compiler.AbstractIL.IL.
- The types involved
FSharp.Compiler.Infos.EventInfo→FSharp.Compiler.AbstractIL.IL.ILAttributesFSharp.Compiler.Infos.ILEventInfo→FSharp.Compiler.AbstractIL.IL.ILEventDefFSharp.Compiler.Infos.ILEventInfo→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.AbstractIL.IL.ILFieldDefFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.AbstractIL.IL.ILFieldInitFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.AbstractIL.IL.ILFieldRefFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.AbstractIL.IL.ILTypeFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.AbstractIL.IL.ILMethodDefFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.AbstractIL.IL.ILMethodRefFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.AbstractIL.IL.ILParameterFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.Infos.ILPropInfo→FSharp.Compiler.AbstractIL.IL.ILPropertyDefFSharp.Compiler.Infos.ILTypeInfo→FSharp.Compiler.AbstractIL.IL.ILScopeRefFSharp.Compiler.Infos.ILTypeInfo→FSharp.Compiler.AbstractIL.IL.ILTypeDefFSharp.Compiler.Infos.ILTypeInfo→FSharp.Compiler.AbstractIL.IL.ILTypeRefFSharp.Compiler.Infos.MethInfo→FSharp.Compiler.AbstractIL.IL.ILAttributesFSharp.Compiler.Infos.MethInfo→FSharp.Compiler.AbstractIL.IL.ILMethodDefFSharp.Compiler.Infos.OptionalArgCallerSideValue→FSharp.Compiler.AbstractIL.IL.ILFieldInitFSharp.Compiler.Infos.OptionalArgInfo→FSharp.Compiler.AbstractIL.IL.ILFieldInitFSharp.Compiler.Infos.OptionalArgInfo→FSharp.Compiler.AbstractIL.IL.ILParameterFSharp.Compiler.Infos.OptionalArgInfo→FSharp.Compiler.AbstractIL.IL.ILScopeRef
- Direction
- FSharp.Compiler.Infos uses FSharp.Compiler.AbstractIL.IL, so a change to FSharp.Compiler.AbstractIL.IL can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break FSharp.Compiler.AbstractIL.IL.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→14 FSharp.Compiler.Infos uses FSharp.Compiler.Syntax✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.Infos uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.Infos.ParamData→FSharp.Compiler.Syntax.IdentFSharp.Compiler.Infos.ParamNameAndType→FSharp.Compiler.Syntax.Ident
- Direction
- FSharp.Compiler.Infos uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→19 FSharp.Compiler.Infos uses FSharp.Compiler.TypedTree✕
- Connections
- 52 pairs of types, where a type in FSharp.Compiler.Infos uses a type in FSharp.Compiler.TypedTree. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.Infos.CompiledSig→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.CompiledSig→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.Infos.EventInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Infos.EventInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.EventInfo→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.Infos.ILEventInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Infos.ILEventInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.Infos.ILMethParentTypeInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Infos.ILMethParentTypeInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.ILPropInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.ILTypeInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Infos.ILTypeInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.Infos→FSharp.Compiler.TypedTree.ArgReprInfoFSharp.Compiler.Infos.Infos→FSharp.Compiler.TypedTree.SlotParamFSharp.Compiler.Infos.Infos→FSharp.Compiler.TypedTree.SlotSigFSharp.Compiler.Infos.Infos→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.Infos.Infos→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.Infos.Infos→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.Infos.MethInfo→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.Infos.MethInfo→FSharp.Compiler.TypedTree.SlotSig
- Direction
- FSharp.Compiler.Infos uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→20 FSharp.Compiler.Infos uses FSharp.Compiler.TcGlobals✕
- Connections
- 11 pairs of types, where a type in FSharp.Compiler.Infos uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.Infos.EventInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.ILEventInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.ILPropInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.ILTypeInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.Infos→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.MethInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.OptionalArgInfo→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.ParamNameAndType→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.Infos.PropInfo→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.Infos uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→21 FSharp.Compiler.Infos uses FSharp.Compiler.Import✕
- Connections
- 8 pairs of types, where a type in FSharp.Compiler.Infos uses a type in FSharp.Compiler.Import.
- The types involved
FSharp.Compiler.Infos.EventInfo→FSharp.Compiler.Import.ImportMapFSharp.Compiler.Infos.ILFieldInfo→FSharp.Compiler.Import.ImportMapFSharp.Compiler.Infos.ILMethInfo→FSharp.Compiler.Import.ImportMapFSharp.Compiler.Infos.ILPropInfo→FSharp.Compiler.Import.ImportMapFSharp.Compiler.Infos.Infos→FSharp.Compiler.Import.ImportMapFSharp.Compiler.Infos.MethInfo→FSharp.Compiler.Import.ImportMapFSharp.Compiler.Infos.OptionalArgInfo→FSharp.Compiler.Import.ImportMapFSharp.Compiler.Infos.PropInfo→FSharp.Compiler.Import.ImportMap
- Direction
- FSharp.Compiler.Infos uses FSharp.Compiler.Import, so a change to FSharp.Compiler.Import can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break FSharp.Compiler.Import.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
29→28 FSharp.Compiler.Infos uses FSharp.Compiler.TypedTreeOps✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.Infos uses a type in FSharp.Compiler.TypedTreeOps.
- The types involved
FSharp.Compiler.Infos.Infos→FSharp.Compiler.TypedTreeOps.Erasure
- Direction
- FSharp.Compiler.Infos uses FSharp.Compiler.TypedTreeOps, so a change to FSharp.Compiler.TypedTreeOps can break FSharp.Compiler.Infos, while a change to FSharp.Compiler.Infos can't break FSharp.Compiler.TypedTreeOps.
- Position
- Below the diagonal: FSharp.Compiler.Infos uses a module listed above it, which is the healthy direction.
30→8 FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.Text✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.AccessibilityLogic uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.AccessibilityLogic, while a change to FSharp.Compiler.AccessibilityLogic can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.AccessibilityLogic uses a module listed above it, which is the healthy direction.
30→13 FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.AbstractIL.IL✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.AccessibilityLogic uses a type in FSharp.Compiler.AbstractIL.IL.
- The types involved
FSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.AbstractIL.IL.ILMemberAccess
- Direction
- FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.AbstractIL.IL, so a change to FSharp.Compiler.AbstractIL.IL can break FSharp.Compiler.AccessibilityLogic, while a change to FSharp.Compiler.AccessibilityLogic can't break FSharp.Compiler.AbstractIL.IL.
- Position
- Below the diagonal: FSharp.Compiler.AccessibilityLogic uses a module listed above it, which is the healthy direction.
30→19 FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.TypedTree✕
- Connections
- 8 pairs of types, where a type in FSharp.Compiler.AccessibilityLogic uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.TypedTree.AccessibilityFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.TypedTree.RecdFieldRefFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.TypedTree.UnionCaseRefFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.TypedTree.ValRefFSharp.Compiler.AccessibilityLogic.AccessorDomain→FSharp.Compiler.TypedTree.CompilationPathFSharp.Compiler.AccessibilityLogic.AccessorDomain→FSharp.Compiler.TypedTree.EntityRef
- Direction
- FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.AccessibilityLogic, while a change to FSharp.Compiler.AccessibilityLogic can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.AccessibilityLogic uses a module listed above it, which is the healthy direction.
30→20 FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.TcGlobals✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.AccessibilityLogic uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.AccessibilityLogic.AccessorDomain→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.AccessibilityLogic, while a change to FSharp.Compiler.AccessibilityLogic can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.AccessibilityLogic uses a module listed above it, which is the healthy direction.
30→21 FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.Import✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.AccessibilityLogic uses a type in FSharp.Compiler.Import.
- The types involved
FSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Import.ImportMap
- Direction
- FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.Import, so a change to FSharp.Compiler.Import can break FSharp.Compiler.AccessibilityLogic, while a change to FSharp.Compiler.AccessibilityLogic can't break FSharp.Compiler.Import.
- Position
- Below the diagonal: FSharp.Compiler.AccessibilityLogic uses a module listed above it, which is the healthy direction.
30→29 FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.Infos✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.AccessibilityLogic uses a type in FSharp.Compiler.Infos.
- The types involved
FSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Infos.ILEventInfoFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Infos.ILFieldInfoFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Infos.ILPropInfoFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Infos.MethInfoFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Infos.PropInfoFSharp.Compiler.AccessibilityLogic.AccessibilityLogic→FSharp.Compiler.Infos.RecdFieldInfo
- Direction
- FSharp.Compiler.AccessibilityLogic uses FSharp.Compiler.Infos, so a change to FSharp.Compiler.Infos can break FSharp.Compiler.AccessibilityLogic, while a change to FSharp.Compiler.AccessibilityLogic can't break FSharp.Compiler.Infos.
- Position
- Below the diagonal: FSharp.Compiler.AccessibilityLogic uses a module listed above it, which is the healthy direction.
31→2 FSharp.Compiler.ConstraintSolver uses System.Collections✕
- Connections
- 3 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in System.Collections.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolverError→System.Collections.IStructuralEquatableFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarning→System.Collections.IStructuralEquatableFSharp.Compiler.ConstraintSolver.OverloadInformation→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.ConstraintSolver uses System.Collections, so a change to System.Collections can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→4 FSharp.Compiler.ConstraintSolver uses System.Collections.Generic✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→System.Collections.Generic.IComparer`1FSharp.Compiler.ConstraintSolver.ConstraintSolverState→System.Collections.Generic.IEnumerable`1
- Direction
- FSharp.Compiler.ConstraintSolver uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→7 FSharp.Compiler.ConstraintSolver uses System✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in System.
- The types involved
FSharp.Compiler.ConstraintSolver.ErrorFromAddingConstraint→System.ExceptionFSharp.Compiler.ConstraintSolver.ErrorFromAddingTypeEquation→System.ExceptionFSharp.Compiler.ConstraintSolver.ErrorFromApplyingDefault→System.ExceptionFSharp.Compiler.ConstraintSolver.ErrorsFromAddingSubsumptionConstraint→System.ExceptionFSharp.Compiler.ConstraintSolver.OverloadInformation→System.Exception
- Direction
- FSharp.Compiler.ConstraintSolver uses System, so a change to System can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break System.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→8 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Text✕
- Connections
- 19 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverError→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverInfiniteTypes→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverMissingConstraint→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarning→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningEquivWithTypes→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithType→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithTypes→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverTupleDiffLengths→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverTypesNotInEqualityRelation→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ConstraintSolverTypesNotInSubsumptionRelation→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ContextInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ErrorFromAddingConstraint→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ErrorFromAddingTypeEquation→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ErrorFromApplyingDefault→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.ErrorsFromAddingSubsumptionConstraint→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.NonRigidTypar→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.UnresolvedConversionOperator→FSharp.Compiler.Text.RangeFSharp.Compiler.ConstraintSolver.UnresolvedOverloading→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→11 FSharp.Compiler.ConstraintSolver uses Internal.Utilities.Collections.Tagged✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in Internal.Utilities.Collections.Tagged.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→Internal.Utilities.Collections.Tagged.Set`2
- Direction
- FSharp.Compiler.ConstraintSolver uses Internal.Utilities.Collections.Tagged, so a change to Internal.Utilities.Collections.Tagged can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break Internal.Utilities.Collections.Tagged.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→14 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Syntax✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.Syntax.SynExpr
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→19 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.TypedTree✕
- Connections
- 30 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.TypedTree. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.ConstraintSolver.ArgDoesNotMatchError→FSharp.Compiler.TypedTree.ExprFSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TypedTree.ExprFSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TypedTree.NullnessFSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TypedTree.TraitConstraintInfoFSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TypedTree.TyparConstraintFSharp.Compiler.ConstraintSolver.ConstraintSolverInfiniteTypes→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ConstraintSolverMissingConstraint→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.ConstraintSolver.ConstraintSolverMissingConstraint→FSharp.Compiler.TypedTree.TyparConstraintFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningEquivWithTypes→FSharp.Compiler.TypedTree.NullnessInfoFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningEquivWithTypes→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithType→FSharp.Compiler.TypedTree.NullnessInfoFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithType→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithTypes→FSharp.Compiler.TypedTree.NullnessInfoFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithTypes→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ConstraintSolverTupleDiffLengths→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ConstraintSolverTypesNotInEqualityRelation→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ConstraintSolverTypesNotInSubsumptionRelation→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ContextInfo→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ErrorFromAddingTypeEquation→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ErrorFromApplyingDefault→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.ErrorFromApplyingDefault→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.ConstraintSolver.ErrorsFromAddingSubsumptionConstraint→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.ConstraintSolver.NonRigidTypar→FSharp.Compiler.TypedTree.TType
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→20 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.TcGlobals✕
- Connections
- 5 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.ConstraintSolver.ConstraintSolverState→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.ConstraintSolver.ErrorFromAddingTypeEquation→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.ConstraintSolver.ErrorFromApplyingDefault→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.ConstraintSolver.ErrorsFromAddingSubsumptionConstraint→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→21 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Import✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.Import.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.Import.ImportMapFSharp.Compiler.ConstraintSolver.ConstraintSolverState→FSharp.Compiler.Import.ImportMap
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Import, so a change to FSharp.Compiler.Import can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.Import.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→22 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.InfoReader✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.InfoReader.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolverState→FSharp.Compiler.InfoReader.InfoReaderFSharp.Compiler.ConstraintSolver.OverloadInformation→FSharp.Compiler.InfoReader.InfoReader
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.InfoReader, so a change to FSharp.Compiler.InfoReader can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.InfoReader.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→26 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.DiagnosticsLogger✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.DiagnosticsLogger.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.DiagnosticsLogger.OperationResult`1
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.DiagnosticsLogger, so a change to FSharp.Compiler.DiagnosticsLogger can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.DiagnosticsLogger.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→28 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.TypedTreeOps✕
- Connections
- 16 pairs of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.TypedTreeOps.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverInfiniteTypes→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverMissingConstraint→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningEquivWithTypes→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithType→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverNullnessWarningWithTypes→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverTupleDiffLengths→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverTypesNotInEqualityRelation→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ConstraintSolverTypesNotInSubsumptionRelation→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ErrorFromAddingConstraint→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ErrorFromAddingTypeEquation→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ErrorFromApplyingDefault→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.ErrorsFromAddingSubsumptionConstraint→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.NonRigidTypar→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.UnresolvedConversionOperator→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.ConstraintSolver.UnresolvedOverloading→FSharp.Compiler.TypedTreeOps.DisplayEnv
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.TypedTreeOps, so a change to FSharp.Compiler.TypedTreeOps can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.TypedTreeOps.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→29 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Infos✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.Infos.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.Infos.MethInfo
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.Infos, so a change to FSharp.Compiler.Infos can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.Infos.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
31→30 FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.AccessibilityLogic✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.ConstraintSolver uses a type in FSharp.Compiler.AccessibilityLogic.
- The types involved
FSharp.Compiler.ConstraintSolver.ConstraintSolver→FSharp.Compiler.AccessibilityLogic.AccessorDomain
- Direction
- FSharp.Compiler.ConstraintSolver uses FSharp.Compiler.AccessibilityLogic, so a change to FSharp.Compiler.AccessibilityLogic can break FSharp.Compiler.ConstraintSolver, while a change to FSharp.Compiler.ConstraintSolver can't break FSharp.Compiler.AccessibilityLogic.
- Position
- Below the diagonal: FSharp.Compiler.ConstraintSolver uses a module listed above it, which is the healthy direction.
32→1 FSharp.Compiler.EditorServices uses (global)✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.EditorServices uses a type in (global).
- The types involved
FSharp.Compiler.EditorServices.SemanticClassificationKeyStore→IDisposable
- Direction
- FSharp.Compiler.EditorServices uses (global), so a change to (global) can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break (global).
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→2 FSharp.Compiler.EditorServices uses System.Collections✕
- Connections
- 51 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in System.Collections. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.EditorServices.AssemblyContentType→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.AssemblyContentType→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.CompletionContext→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.CompletionItemKind→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.CompletionItemKind→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.EntityKind→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.EntityKind→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.FSharpGlyph→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.FSharpGlyph→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.FindDeclExternalSymbol→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.FindDeclExternalType→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.FindDeclExternalType→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.FindDeclFailureReason→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.FindDeclFailureReason→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.FindDeclResult→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.InheritanceContext→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.InheritanceContext→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.InsertionContext→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.InsertionContextEntity→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.InsertionContextEntity→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.LookupType→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.LookupType→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.MaybeUnresolvedIdent→System.Collections.IStructuralComparableFSharp.Compiler.EditorServices.MaybeUnresolvedIdent→System.Collections.IStructuralEquatableFSharp.Compiler.EditorServices.MethodOverrideCompletionContext→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.EditorServices uses System.Collections, so a change to System.Collections can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→7 FSharp.Compiler.EditorServices uses System✕
- Connections
- 40 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in System. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
FSharp.Compiler.EditorServices.AssemblyContentType→System.IComparableFSharp.Compiler.EditorServices.AssemblyContentType→System.IComparable`1FSharp.Compiler.EditorServices.CompletionItemKind→System.IComparableFSharp.Compiler.EditorServices.CompletionItemKind→System.IComparable`1FSharp.Compiler.EditorServices.EntityKind→System.IComparableFSharp.Compiler.EditorServices.EntityKind→System.IComparable`1FSharp.Compiler.EditorServices.FSharpGlyph→System.IComparableFSharp.Compiler.EditorServices.FSharpGlyph→System.IComparable`1FSharp.Compiler.EditorServices.FSharpGlyph→System.IEquatable`1FSharp.Compiler.EditorServices.FindDeclExternalType→System.IComparableFSharp.Compiler.EditorServices.FindDeclExternalType→System.IComparable`1FSharp.Compiler.EditorServices.FindDeclFailureReason→System.IComparableFSharp.Compiler.EditorServices.FindDeclFailureReason→System.IComparable`1FSharp.Compiler.EditorServices.InheritanceContext→System.IComparableFSharp.Compiler.EditorServices.InheritanceContext→System.IComparable`1FSharp.Compiler.EditorServices.InsertionContextEntity→System.IComparableFSharp.Compiler.EditorServices.InsertionContextEntity→System.IComparable`1FSharp.Compiler.EditorServices.LookupType→System.IComparableFSharp.Compiler.EditorServices.LookupType→System.IComparable`1FSharp.Compiler.EditorServices.MaybeUnresolvedIdent→System.IComparableFSharp.Compiler.EditorServices.MaybeUnresolvedIdent→System.IComparable`1FSharp.Compiler.EditorServices.ModuleKind→System.IComparableFSharp.Compiler.EditorServices.ModuleKind→System.IComparable`1FSharp.Compiler.EditorServices.NavigableContainerType→System.IComparableFSharp.Compiler.EditorServices.NavigableContainerType→System.IComparable`1
- Direction
- FSharp.Compiler.EditorServices uses System, so a change to System can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break System.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→8 FSharp.Compiler.EditorServices uses FSharp.Compiler.Text✕
- Connections
- 18 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.EditorServices.CompletionContext→FSharp.Compiler.Text.PositionFSharp.Compiler.EditorServices.CompletionContext→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.DeclarationListInfo→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.FindDeclResult→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.InsertionContext→FSharp.Compiler.Text.PositionFSharp.Compiler.EditorServices.MethodGroup→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.MethodGroupItem→FSharp.Compiler.Text.TaggedTextFSharp.Compiler.EditorServices.MethodGroupItemParameter→FSharp.Compiler.Text.TaggedTextFSharp.Compiler.EditorServices.MethodOverrideCompletionContext→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.NavigableItem→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.NavigationItem→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.ParameterLocations→FSharp.Compiler.Text.PositionFSharp.Compiler.EditorServices.PatternContext→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.RecordContext→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.SemanticClassificationItem→FSharp.Compiler.Text.RangeFSharp.Compiler.EditorServices.ToolTipElement→FSharp.Compiler.Text.TaggedTextFSharp.Compiler.EditorServices.ToolTipElementData→FSharp.Compiler.Text.TaggedTextFSharp.Compiler.EditorServices.TupledArgumentLocation→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→14 FSharp.Compiler.EditorServices uses FSharp.Compiler.Syntax✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.EditorServices.NavigationItem→FSharp.Compiler.Syntax.SynAccessFSharp.Compiler.EditorServices.ParameterLocations→FSharp.Compiler.Syntax.ParsedInput
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→19 FSharp.Compiler.EditorServices uses FSharp.Compiler.TypedTree✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.EditorServices.CompletionItem→FSharp.Compiler.TypedTree.EntityRef
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→22 FSharp.Compiler.EditorServices uses FSharp.Compiler.InfoReader✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.InfoReader.
- The types involved
FSharp.Compiler.EditorServices.DeclarationListInfo→FSharp.Compiler.InfoReader.InfoReaderFSharp.Compiler.EditorServices.MethodGroup→FSharp.Compiler.InfoReader.InfoReader
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.InfoReader, so a change to FSharp.Compiler.InfoReader can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.InfoReader.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→23 FSharp.Compiler.EditorServices uses FSharp.Compiler.NameResolution✕
- Connections
- 3 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.NameResolution.
- The types involved
FSharp.Compiler.EditorServices.CompletionItem→FSharp.Compiler.NameResolution.ItemFSharp.Compiler.EditorServices.CompletionItem→FSharp.Compiler.NameResolution.ItemWithInstFSharp.Compiler.EditorServices.MethodGroup→FSharp.Compiler.NameResolution.ItemWithInst
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.NameResolution, so a change to FSharp.Compiler.NameResolution can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.NameResolution.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→24 FSharp.Compiler.EditorServices uses FSharp.Compiler.Symbols✕
- Connections
- 7 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.Symbols.
- The types involved
FSharp.Compiler.EditorServices.AssemblySymbol→FSharp.Compiler.Symbols.FSharpSymbolFSharp.Compiler.EditorServices.DeclarationListItem→FSharp.Compiler.Symbols.FSharpAccessibilityFSharp.Compiler.EditorServices.MethodGroupItem→FSharp.Compiler.Symbols.FSharpXmlDocFSharp.Compiler.EditorServices.ToolTipElement→FSharp.Compiler.Symbols.FSharpSymbolFSharp.Compiler.EditorServices.ToolTipElement→FSharp.Compiler.Symbols.FSharpXmlDocFSharp.Compiler.EditorServices.ToolTipElementData→FSharp.Compiler.Symbols.FSharpSymbolFSharp.Compiler.EditorServices.ToolTipElementData→FSharp.Compiler.Symbols.FSharpXmlDoc
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.Symbols, so a change to FSharp.Compiler.Symbols can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.Symbols.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→28 FSharp.Compiler.EditorServices uses FSharp.Compiler.TypedTreeOps✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.TypedTreeOps.
- The types involved
FSharp.Compiler.EditorServices.DeclarationListInfo→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.EditorServices.MethodGroup→FSharp.Compiler.TypedTreeOps.DisplayEnv
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.TypedTreeOps, so a change to FSharp.Compiler.TypedTreeOps can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.TypedTreeOps.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
32→30 FSharp.Compiler.EditorServices uses FSharp.Compiler.AccessibilityLogic✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.EditorServices uses a type in FSharp.Compiler.AccessibilityLogic.
- The types involved
FSharp.Compiler.EditorServices.DeclarationListInfo→FSharp.Compiler.AccessibilityLogic.AccessorDomainFSharp.Compiler.EditorServices.MethodGroup→FSharp.Compiler.AccessibilityLogic.AccessorDomain
- Direction
- FSharp.Compiler.EditorServices uses FSharp.Compiler.AccessibilityLogic, so a change to FSharp.Compiler.AccessibilityLogic can break FSharp.Compiler.EditorServices, while a change to FSharp.Compiler.EditorServices can't break FSharp.Compiler.AccessibilityLogic.
- Position
- Below the diagonal: FSharp.Compiler.EditorServices uses a module listed above it, which is the healthy direction.
33→2 FSharp.Compiler.CheckBasics uses System.Collections✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in System.Collections.
- The types involved
FSharp.Compiler.CheckBasics.CheckConstraints→System.Collections.IStructuralComparableFSharp.Compiler.CheckBasics.CheckConstraints→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.CheckBasics uses System.Collections, so a change to System.Collections can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→4 FSharp.Compiler.CheckBasics uses System.Collections.Generic✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.CheckBasics.UngeneralizableItem→System.Collections.Generic.IComparer`1
- Direction
- FSharp.Compiler.CheckBasics uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→7 FSharp.Compiler.CheckBasics uses System✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in System.
- The types involved
FSharp.Compiler.CheckBasics.CheckConstraints→System.IComparableFSharp.Compiler.CheckBasics.CheckConstraints→System.IComparable`1
- Direction
- FSharp.Compiler.CheckBasics uses System, so a change to System can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break System.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→8 FSharp.Compiler.CheckBasics uses FSharp.Compiler.Text✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.Text.RangeFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.Text.Range
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→11 FSharp.Compiler.CheckBasics uses Internal.Utilities.Collections.Tagged✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in Internal.Utilities.Collections.Tagged.
- The types involved
FSharp.Compiler.CheckBasics.UngeneralizableItem→Internal.Utilities.Collections.Tagged.Set`2
- Direction
- FSharp.Compiler.CheckBasics uses Internal.Utilities.Collections.Tagged, so a change to Internal.Utilities.Collections.Tagged can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break Internal.Utilities.Collections.Tagged.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→14 FSharp.Compiler.CheckBasics uses FSharp.Compiler.Syntax✕
- Connections
- 4 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.CheckBasics.PrelimVal1→FSharp.Compiler.Syntax.IdentFSharp.Compiler.CheckBasics.PrelimVal1→FSharp.Compiler.Syntax.SynAccessFSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.Syntax.IdentFSharp.Compiler.CheckBasics.TcPatValFlags→FSharp.Compiler.Syntax.SynAccess
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→19 FSharp.Compiler.CheckBasics uses FSharp.Compiler.TypedTree✕
- Connections
- 22 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.CheckBasics.ArgAndRetAttribs→FSharp.Compiler.TypedTree.AttribFSharp.Compiler.CheckBasics.CtorInfo→FSharp.Compiler.TypedTree.ValFSharp.Compiler.CheckBasics.ExplicitTyparInfo→FSharp.Compiler.TypedTree.TyparFSharp.Compiler.CheckBasics.PrelimMemberInfo→FSharp.Compiler.TypedTree.ValMemberInfoFSharp.Compiler.CheckBasics.PrelimVal1→FSharp.Compiler.TypedTree.TTypeFSharp.Compiler.CheckBasics.PrelimVal1→FSharp.Compiler.TypedTree.ValBaseOrThisInfoFSharp.Compiler.CheckBasics.PrelimVal1→FSharp.Compiler.TypedTree.ValInlineFSharp.Compiler.CheckBasics.PrelimValReprInfo→FSharp.Compiler.TypedTree.ArgReprInfoFSharp.Compiler.CheckBasics.SafeInitData→FSharp.Compiler.TypedTree.RecdFieldFSharp.Compiler.CheckBasics.SafeInitData→FSharp.Compiler.TypedTree.RecdFieldRefFSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.TypedTree.ArgReprInfoFSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.TypedTree.CompilationPathFSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.TypedTree.ModuleOrNamespaceTypeFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.TypedTree.ArgReprInfoFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.TypedTree.NamedDebugPointKeyFSharp.Compiler.CheckBasics.TcPatValFlags→FSharp.Compiler.TypedTree.ValInlineFSharp.Compiler.CheckBasics.UngeneralizableItem→FSharp.Compiler.TypedTree.EntityFSharp.Compiler.CheckBasics.UngeneralizableItem→FSharp.Compiler.TypedTree.FreeTyvarsFSharp.Compiler.CheckBasics.UngeneralizableItem→FSharp.Compiler.TypedTree.ValFSharp.Compiler.CheckBasics.UnscopedTyparEnv→FSharp.Compiler.TypedTree.Typar
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→20 FSharp.Compiler.CheckBasics uses FSharp.Compiler.TcGlobals✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→21 FSharp.Compiler.CheckBasics uses FSharp.Compiler.Import✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.Import.
- The types involved
FSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.Import.ImportMap
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.Import, so a change to FSharp.Compiler.Import can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.Import.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→22 FSharp.Compiler.CheckBasics uses FSharp.Compiler.InfoReader✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.InfoReader.
- The types involved
FSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.InfoReader.InfoReader
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.InfoReader, so a change to FSharp.Compiler.InfoReader can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.InfoReader.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→23 FSharp.Compiler.CheckBasics uses FSharp.Compiler.NameResolution✕
- Connections
- 3 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.NameResolution.
- The types involved
FSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.NameResolution.NameResolutionEnvFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.NameResolution.NameResolverFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.NameResolution.TcResultsSink
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.NameResolution, so a change to FSharp.Compiler.NameResolution can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.NameResolution.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→25 FSharp.Compiler.CheckBasics uses FSharp.Compiler.Diagnostics✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.Diagnostics.
- The types involved
FSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.Diagnostics.FSharpDiagnosticOptions
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.Diagnostics, so a change to FSharp.Compiler.Diagnostics can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.Diagnostics.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→26 FSharp.Compiler.CheckBasics uses FSharp.Compiler.DiagnosticsLogger✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.DiagnosticsLogger.
- The types involved
FSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.DiagnosticsLogger.StackGuard
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.DiagnosticsLogger, so a change to FSharp.Compiler.DiagnosticsLogger can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.DiagnosticsLogger.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→28 FSharp.Compiler.CheckBasics uses FSharp.Compiler.TypedTreeOps✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.TypedTreeOps.
- The types involved
FSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.TypedTreeOps.DisplayEnvFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.TypedTreeOps.ValMultiMap`1
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.TypedTreeOps, so a change to FSharp.Compiler.TypedTreeOps can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.TypedTreeOps.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→30 FSharp.Compiler.CheckBasics uses FSharp.Compiler.AccessibilityLogic✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.AccessibilityLogic.
- The types involved
FSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.AccessibilityLogic.AccessorDomain
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.AccessibilityLogic, so a change to FSharp.Compiler.AccessibilityLogic can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.AccessibilityLogic.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
33→31 FSharp.Compiler.CheckBasics uses FSharp.Compiler.ConstraintSolver✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CheckBasics uses a type in FSharp.Compiler.ConstraintSolver.
- The types involved
FSharp.Compiler.CheckBasics.TcEnv→FSharp.Compiler.ConstraintSolver.ContextInfoFSharp.Compiler.CheckBasics.TcFileState→FSharp.Compiler.ConstraintSolver.ConstraintSolverState
- Direction
- FSharp.Compiler.CheckBasics uses FSharp.Compiler.ConstraintSolver, so a change to FSharp.Compiler.ConstraintSolver can break FSharp.Compiler.CheckBasics, while a change to FSharp.Compiler.CheckBasics can't break FSharp.Compiler.ConstraintSolver.
- Position
- Below the diagonal: FSharp.Compiler.CheckBasics uses a module listed above it, which is the healthy direction.
34→1 FSharp.Compiler.CodeAnalysis uses (global)✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in (global).
- The types involved
FSharp.Compiler.CodeAnalysis.ItemKeyStore→IDisposable
- Direction
- FSharp.Compiler.CodeAnalysis uses (global), so a change to (global) can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break (global).
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→2 FSharp.Compiler.CodeAnalysis uses System.Collections✕
- Connections
- 10 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in System.Collections.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileAnswer→System.Collections.IStructuralEquatableFSharp.Compiler.CodeAnalysis.FSharpCodeCompletionOptions→System.Collections.IStructuralComparableFSharp.Compiler.CodeAnalysis.FSharpCodeCompletionOptions→System.Collections.IStructuralEquatableFSharp.Compiler.CodeAnalysis.FSharpParsingOptions→System.Collections.IStructuralEquatableFSharp.Compiler.CodeAnalysis.FSharpProjectOptions→System.Collections.IStructuralEquatableFSharp.Compiler.CodeAnalysis.FSharpUnresolvedReferencesSet→System.Collections.IStructuralEquatableFSharp.Compiler.CodeAnalysis.LegacyResolutionEnvironment→System.Collections.IStructuralComparableFSharp.Compiler.CodeAnalysis.LegacyResolutionEnvironment→System.Collections.IStructuralEquatableFSharp.Compiler.CodeAnalysis.LegacyResolutionFailure→System.Collections.IStructuralEquatableFSharp.Compiler.CodeAnalysis.TextContainer→System.Collections.IStructuralEquatable
- Direction
- FSharp.Compiler.CodeAnalysis uses System.Collections, so a change to System.Collections can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break System.Collections.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→4 FSharp.Compiler.CodeAnalysis uses System.Collections.Generic✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in System.Collections.Generic.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→System.Collections.Generic.IEnumerable`1
- Direction
- FSharp.Compiler.CodeAnalysis uses System.Collections.Generic, so a change to System.Collections.Generic can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break System.Collections.Generic.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→7 FSharp.Compiler.CodeAnalysis uses System✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in System.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCodeCompletionOptions→System.IComparableFSharp.Compiler.CodeAnalysis.FSharpCodeCompletionOptions→System.IComparable`1FSharp.Compiler.CodeAnalysis.IncrementalBuilder→System.IDisposableFSharp.Compiler.CodeAnalysis.LegacyResolutionEnvironment→System.IComparableFSharp.Compiler.CodeAnalysis.LegacyResolutionEnvironment→System.IComparable`1FSharp.Compiler.CodeAnalysis.TextContainer→System.IDisposable
- Direction
- FSharp.Compiler.CodeAnalysis uses System, so a change to System can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break System.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→8 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Text✕
- Connections
- 7 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.Text.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Text.ISourceTextFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Text.PositionFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Text.RangeFSharp.Compiler.CodeAnalysis.FSharpParseFileResults→FSharp.Compiler.Text.PositionFSharp.Compiler.CodeAnalysis.FSharpParseFileResults→FSharp.Compiler.Text.RangeFSharp.Compiler.CodeAnalysis.FSharpSymbolUse→FSharp.Compiler.Text.RangeFSharp.Compiler.CodeAnalysis.TextContainer→FSharp.Compiler.Text.ISourceText
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→12 FSharp.Compiler.CodeAnalysis uses Internal.Utilities.Library✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in Internal.Utilities.Library.
- The types involved
FSharp.Compiler.CodeAnalysis.DelayedILModuleReader→Internal.Utilities.Library.Cancellable`1
- Direction
- FSharp.Compiler.CodeAnalysis uses Internal.Utilities.Library, so a change to Internal.Utilities.Library can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break Internal.Utilities.Library.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→14 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Syntax✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.Syntax.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpParseFileResults→FSharp.Compiler.Syntax.ParsedInput
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Syntax, so a change to FSharp.Compiler.Syntax can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.Syntax.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→19 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.TypedTree✕
- Connections
- 9 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.TypedTree.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.TypedTree.CheckedImplFileFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.TypedTree.EntityRefFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.TypedTree.ModuleOrNamespaceTypeFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.TypedTree.OpenDeclarationFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.TypedTree.CcuThunkFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.TypedTree.CheckedImplFileFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.TypedTree.ModuleOrNamespaceTypeFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.TypedTree.OpenDeclaration
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.TypedTree, so a change to FSharp.Compiler.TypedTree can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.TypedTree.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→20 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.TcGlobals✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.TcGlobals.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.TcGlobals.TcGlobalsFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.TcGlobals.TcGlobals
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.TcGlobals, so a change to FSharp.Compiler.TcGlobals can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.TcGlobals.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→23 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.NameResolution✕
- Connections
- 8 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.NameResolution.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.NameResolution.ItemFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.NameResolution.NameResolutionEnvFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.NameResolution.TcResolutionsFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.NameResolution.TcSymbolUsesFSharp.Compiler.CodeAnalysis.FSharpSymbolUse→FSharp.Compiler.NameResolution.ItemOccurrenceFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.NameResolution.NameResolutionEnvFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.NameResolution.TcResolutionsFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.NameResolution.TcSymbolUses
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.NameResolution, so a change to FSharp.Compiler.NameResolution can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.NameResolution.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→24 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Symbols✕
- Connections
- 13 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.Symbols.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Symbols.FSharpAssemblySignatureFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Symbols.FSharpDisplayContextFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Symbols.FSharpImplementationFileContentsFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Symbols.FSharpOpenDeclarationFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Symbols.FSharpSymbolFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Symbols.FSharpTypeFSharp.Compiler.CodeAnalysis.FSharpCheckProjectResults→FSharp.Compiler.Symbols.FSharpAssemblyContentsFSharp.Compiler.CodeAnalysis.FSharpCheckProjectResults→FSharp.Compiler.Symbols.FSharpAssemblySignatureFSharp.Compiler.CodeAnalysis.FSharpCheckProjectResults→FSharp.Compiler.Symbols.FSharpSymbolFSharp.Compiler.CodeAnalysis.FSharpProjectContext→FSharp.Compiler.Symbols.FSharpAccessibilityRightsFSharp.Compiler.CodeAnalysis.FSharpProjectContext→FSharp.Compiler.Symbols.FSharpAssemblyFSharp.Compiler.CodeAnalysis.FSharpSymbolUse→FSharp.Compiler.Symbols.FSharpDisplayContextFSharp.Compiler.CodeAnalysis.FSharpSymbolUse→FSharp.Compiler.Symbols.FSharpSymbol
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Symbols, so a change to FSharp.Compiler.Symbols can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.Symbols.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→25 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Diagnostics✕
- Connections
- 4 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.Diagnostics.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.Diagnostics.FSharpDiagnosticFSharp.Compiler.CodeAnalysis.FSharpCheckProjectResults→FSharp.Compiler.Diagnostics.FSharpDiagnosticFSharp.Compiler.CodeAnalysis.FSharpParseFileResults→FSharp.Compiler.Diagnostics.FSharpDiagnosticFSharp.Compiler.CodeAnalysis.FSharpParsingOptions→FSharp.Compiler.Diagnostics.FSharpDiagnosticOptions
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.Diagnostics, so a change to FSharp.Compiler.Diagnostics can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.Diagnostics.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→27 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.CompilerConfig✕
- Connections
- 6 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.CompilerConfig.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.CompilerConfig.TcConfigFSharp.Compiler.CodeAnalysis.FSharpCheckProjectResults→FSharp.Compiler.CompilerConfig.TcConfigFSharp.Compiler.CodeAnalysis.FSharpParsingOptions→FSharp.Compiler.CompilerConfig.TcConfigFSharp.Compiler.CodeAnalysis.FSharpParsingOptions→FSharp.Compiler.CompilerConfig.TcConfigBuilderFSharp.Compiler.CodeAnalysis.FSharpUnresolvedReferencesSet→FSharp.Compiler.CompilerConfig.UnresolvedAssemblyReferenceFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.CompilerConfig.TcConfig
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.CompilerConfig, so a change to FSharp.Compiler.CompilerConfig can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.CompilerConfig.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→28 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.TypedTreeOps✕
- Connections
- 1 pair of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.TypedTreeOps.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpSymbolUse→FSharp.Compiler.TypedTreeOps.DisplayEnv
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.TypedTreeOps, so a change to FSharp.Compiler.TypedTreeOps can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.TypedTreeOps.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→30 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.AccessibilityLogic✕
- Connections
- 2 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.AccessibilityLogic.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.AccessibilityLogic.AccessorDomainFSharp.Compiler.CodeAnalysis.TypeCheckInfo→FSharp.Compiler.AccessibilityLogic.AccessorDomain
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.AccessibilityLogic, so a change to FSharp.Compiler.AccessibilityLogic can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.AccessibilityLogic.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
34→32 FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.EditorServices✕
- Connections
- 8 pairs of types, where a type in FSharp.Compiler.CodeAnalysis uses a type in FSharp.Compiler.EditorServices.
- The types involved
FSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.EditorServices.DeclarationListInfoFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.EditorServices.FindDeclResultFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.EditorServices.MethodGroupFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.EditorServices.PartialLongNameFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.EditorServices.SemanticClassificationItemFSharp.Compiler.CodeAnalysis.FSharpCheckFileResults→FSharp.Compiler.EditorServices.ToolTipTextFSharp.Compiler.CodeAnalysis.FSharpParseFileResults→FSharp.Compiler.EditorServices.NavigationItemsFSharp.Compiler.CodeAnalysis.FSharpParseFileResults→FSharp.Compiler.EditorServices.ParameterLocations
- Direction
- FSharp.Compiler.CodeAnalysis uses FSharp.Compiler.EditorServices, so a change to FSharp.Compiler.EditorServices can break FSharp.Compiler.CodeAnalysis, while a change to FSharp.Compiler.CodeAnalysis can't break FSharp.Compiler.EditorServices.
- Position
- Below the diagonal: FSharp.Compiler.CodeAnalysis uses a module listed above it, which is the healthy direction.
35→2 Fable uses System.Collections✕
- Connections
- 13 pairs of types, where a type in Fable uses a type in System.Collections.
- The types involved
Fable.CompilerOptions→System.Collections.IStructuralComparableFable.CompilerOptions→System.Collections.IStructuralEquatableFable.CompilerPlugins→System.Collections.IStructuralEquatableFable.InlineExpr→System.Collections.IStructuralComparableFable.InlineExpr→System.Collections.IStructuralEquatableFable.Language→System.Collections.IStructuralComparableFable.Language→System.Collections.IStructuralEquatableFable.OutputType→System.Collections.IStructuralComparableFable.OutputType→System.Collections.IStructuralEquatableFable.Severity→System.Collections.IStructuralComparableFable.Severity→System.Collections.IStructuralEquatableFable.Verbosity→System.Collections.IStructuralComparableFable.Verbosity→System.Collections.IStructuralEquatable
- Direction
- Fable uses System.Collections, so a change to System.Collections can break Fable, while a change to Fable can't break System.Collections.
- Position
- Below the diagonal: Fable uses a module listed above it, which is the healthy direction.
35→4 Fable uses System.Collections.Generic✕
- Connections
- 1 pair of types, where a type in Fable uses a type in System.Collections.Generic.
- The types involved
Fable.PluginHelper→System.Collections.Generic.IEnumerable`1
- Direction
- Fable uses System.Collections.Generic, so a change to System.Collections.Generic can break Fable, while a change to Fable can't break System.Collections.Generic.
- Position
- Below the diagonal: Fable uses a module listed above it, which is the healthy direction.
35→7 Fable uses System✕
- Connections
- 21 pairs of types, where a type in Fable uses a type in System.
- The types involved
Fable.CompilerOptions→System.IComparableFable.CompilerOptions→System.IComparable`1Fable.CompilerOptions→System.IEquatable`1Fable.CompilerPlugins→System.IEquatable`1Fable.InlineExpr→System.IComparableFable.InlineExpr→System.IComparable`1Fable.InlineExpr→System.IEquatable`1Fable.Language→System.IComparableFable.Language→System.IComparable`1Fable.Language→System.IEquatable`1Fable.OutputType→System.IComparableFable.OutputType→System.IComparable`1Fable.OutputType→System.IEquatable`1Fable.PluginAttribute→System.AttributeFable.ScanForPluginsAttribute→System.AttributeFable.Severity→System.IComparableFable.Severity→System.IComparable`1Fable.Severity→System.IEquatable`1Fable.Verbosity→System.IComparableFable.Verbosity→System.IComparable`1Fable.Verbosity→System.IEquatable`1
- Direction
- Fable uses System, so a change to System can break Fable, while a change to Fable can't break System.
- Position
- Below the diagonal: Fable uses a module listed above it, which is the healthy direction.
35→9 Fable uses Fable.AST✕
- Connections
- 2 pairs of types, where a type in Fable uses a type in Fable.AST.
- The types involved
Fable.Compiler→Fable.AST.SourceLocationFable.PluginHelper→Fable.AST.SourceLocation
- Direction
- Fable uses Fable.AST, so a change to Fable.AST can break Fable, while a change to Fable can't break Fable.AST.
- Position
- Below the diagonal: Fable uses a module listed above it, which is the healthy direction.
35→16 Fable uses Fable.AST.Fable✕
- Connections
- 13 pairs of types, where a type in Fable uses a type in Fable.AST.Fable.
- The types involved
Fable.Compiler→Fable.AST.Fable.EntityFable.Compiler→Fable.AST.Fable.EntityRefFable.CompilerPlugins→Fable.AST.Fable.EntityRefFable.InlineExpr→Fable.AST.Fable.ExprFable.InlineExpr→Fable.AST.Fable.IdentFable.MemberDeclarationPluginAttribute→Fable.AST.Fable.ExprFable.MemberDeclarationPluginAttribute→Fable.AST.Fable.FileFable.MemberDeclarationPluginAttribute→Fable.AST.Fable.MemberDeclFable.MemberDeclarationPluginAttribute→Fable.AST.Fable.MemberFunctionOrValueFable.PluginHelper→Fable.AST.Fable.EntityFable.PluginHelper→Fable.AST.Fable.EntityRefFable.PluginHelper→Fable.AST.Fable.MemberFunctionOrValueFable.PluginHelper→Fable.AST.Fable.MemberRef
- Direction
- Fable uses Fable.AST.Fable, so a change to Fable.AST.Fable can break Fable, while a change to Fable can't break Fable.AST.Fable.
- Position
- Below the diagonal: Fable uses a module listed above it, which is the healthy direction.
35→24 Fable uses FSharp.Compiler.Symbols✕
- Connections
- 1 pair of types, where a type in Fable uses a type in FSharp.Compiler.Symbols.
- The types involved
Fable.Compiler→FSharp.Compiler.Symbols.FSharpImplementationFileDeclaration
- Direction
- Fable uses FSharp.Compiler.Symbols, so a change to FSharp.Compiler.Symbols can break Fable, while a change to Fable can't break FSharp.Compiler.Symbols.
- Position
- Below the diagonal: Fable uses a module listed above it, which is the healthy direction.
35→34 Fable uses FSharp.Compiler.CodeAnalysis✕
- Connections
- 1 pair of types, where a type in Fable uses a type in FSharp.Compiler.CodeAnalysis.
- The types involved
Fable.Compiler→FSharp.Compiler.CodeAnalysis.FSharpProjectOptions
- Direction
- Fable uses FSharp.Compiler.CodeAnalysis, so a change to FSharp.Compiler.CodeAnalysis can break Fable, while a change to Fable can't break FSharp.Compiler.CodeAnalysis.
- Position
- Below the diagonal: Fable uses a module listed above it, which is the healthy direction.
36→2 Fable.Compiler.Util uses System.Collections✕
- Connections
- 5 pairs of types, where a type in Fable.Compiler.Util uses a type in System.Collections.
- The types involved
Fable.Compiler.Util.CliArgs→System.Collections.IStructuralEquatableFable.Compiler.Util.PrecompiledFileJson→System.Collections.IStructuralComparableFable.Compiler.Util.PrecompiledFileJson→System.Collections.IStructuralEquatableFable.Compiler.Util.PrecompiledInfoJson→System.Collections.IStructuralComparableFable.Compiler.Util.PrecompiledInfoJson→System.Collections.IStructuralEquatable
- Direction
- Fable.Compiler.Util uses System.Collections, so a change to System.Collections can break Fable.Compiler.Util, while a change to Fable.Compiler.Util can't break System.Collections.
- Position
- Below the diagonal: Fable.Compiler.Util uses a module listed above it, which is the healthy direction.
36→7 Fable.Compiler.Util uses System✕
- Connections
- 4 pairs of types, where a type in Fable.Compiler.Util uses a type in System.
- The types involved
Fable.Compiler.Util.PrecompiledFileJson→System.IComparableFable.Compiler.Util.PrecompiledFileJson→System.IComparable`1Fable.Compiler.Util.PrecompiledInfoJson→System.IComparableFable.Compiler.Util.PrecompiledInfoJson→System.IComparable`1
- Direction
- Fable.Compiler.Util uses System, so a change to System can break Fable.Compiler.Util, while a change to Fable.Compiler.Util can't break System.
- Position
- Below the diagonal: Fable.Compiler.Util uses a module listed above it, which is the healthy direction.
36→35 Fable.Compiler.Util uses Fable✕
- Connections
- 4 pairs of types, where a type in Fable.Compiler.Util uses a type in Fable.
- The types involved
Fable.Compiler.Util.CliArgs→Fable.CompilerOptionsFable.Compiler.Util.CliArgs→Fable.VerbosityFable.Compiler.Util.PrecompiledInfoImpl→Fable.CompilerOptionsFable.Compiler.Util.PrecompiledInfoJson→Fable.CompilerOptions
- Direction
- Fable.Compiler.Util uses Fable, so a change to Fable can break Fable.Compiler.Util, while a change to Fable.Compiler.Util can't break Fable.
- Position
- Below the diagonal: Fable.Compiler.Util uses a module listed above it, which is the healthy direction.
37→2 Fable.Transforms.FSharp2Fable uses System.Collections✕
- Connections
- 2 pairs of types, where a type in Fable.Transforms.FSharp2Fable uses a type in System.Collections.
- The types involved
Fable.Transforms.FSharp2Fable.CompiledValue→System.Collections.IStructuralComparableFable.Transforms.FSharp2Fable.CompiledValue→System.Collections.IStructuralEquatable
- Direction
- Fable.Transforms.FSharp2Fable uses System.Collections, so a change to System.Collections can break Fable.Transforms.FSharp2Fable, while a change to Fable.Transforms.FSharp2Fable can't break System.Collections.
- Position
- Below the diagonal: Fable.Transforms.FSharp2Fable uses a module listed above it, which is the healthy direction.
37→4 Fable.Transforms.FSharp2Fable uses System.Collections.Generic✕
- Connections
- 4 pairs of types, where a type in Fable.Transforms.FSharp2Fable uses a type in System.Collections.Generic.
- The types involved
Fable.Transforms.FSharp2Fable.FsEnt→System.Collections.Generic.IEnumerable`1Fable.Transforms.FSharp2Fable.FsMemberFunctionOrValue→System.Collections.Generic.IEnumerable`1Fable.Transforms.FSharp2Fable.FsParam→System.Collections.Generic.IEnumerable`1Fable.Transforms.FSharp2Fable.FsUnionCase→System.Collections.Generic.IEnumerable`1
- Direction
- Fable.Transforms.FSharp2Fable uses System.Collections.Generic, so a change to System.Collections.Generic can break Fable.Transforms.FSharp2Fable, while a change to Fable.Transforms.FSharp2Fable can't break System.Collections.Generic.
- Position
- Below the diagonal: Fable.Transforms.FSharp2Fable uses a module listed above it, which is the healthy direction.
37→7 Fable.Transforms.FSharp2Fable uses System✕
- Connections
- 3 pairs of types, where a type in Fable.Transforms.FSharp2Fable uses a type in System.
- The types involved
Fable.Transforms.FSharp2Fable.CompiledValue→System.IComparableFable.Transforms.FSharp2Fable.CompiledValue→System.IComparable`1Fable.Transforms.FSharp2Fable.CompiledValue→System.IEquatable`1
- Direction
- Fable.Transforms.FSharp2Fable uses System, so a change to System can break Fable.Transforms.FSharp2Fable, while a change to Fable.Transforms.FSharp2Fable can't break System.
- Position
- Below the diagonal: Fable.Transforms.FSharp2Fable uses a module listed above it, which is the healthy direction.
37→9 Fable.Transforms.FSharp2Fable uses Fable.AST✕
- Connections
- 1 pair of types, where a type in Fable.Transforms.FSharp2Fable uses a type in Fable.AST.
- The types involved
Fable.Transforms.FSharp2Fable.IFableCompiler→Fable.AST.SourceLocation
- Direction
- Fable.Transforms.FSharp2Fable uses Fable.AST, so a change to Fable.AST can break Fable.Transforms.FSharp2Fable, while a change to Fable.Transforms.FSharp2Fable can't break Fable.AST.
- Position
- Below the diagonal: Fable.Transforms.FSharp2Fable uses a module listed above it, which is the healthy direction.
37→16 Fable.Transforms.FSharp2Fable uses Fable.AST.Fable✕
- Connections
- 40 pairs of types, where a type in Fable.Transforms.FSharp2Fable uses a type in Fable.AST.Fable. Showing 25 of them; the rest are in namespace-graph.json in this report's bundle.
- The types involved
Fable.Transforms.FSharp2Fable.Context→Fable.AST.Fable.IdentFable.Transforms.FSharp2Fable.Context→Fable.AST.Fable.TypeFable.Transforms.FSharp2Fable.Context→Fable.AST.Fable.WitnessFable.Transforms.FSharp2Fable.FsAbstractSignature→Fable.AST.Fable.AbstractSignatureFable.Transforms.FSharp2Fable.FsAbstractSignature→Fable.AST.Fable.TypeFable.Transforms.FSharp2Fable.FsAtt→Fable.AST.Fable.AttributeFable.Transforms.FSharp2Fable.FsAtt→Fable.AST.Fable.EntityRefFable.Transforms.FSharp2Fable.FsDeclaredType→Fable.AST.Fable.DeclaredTypeFable.Transforms.FSharp2Fable.FsDeclaredType→Fable.AST.Fable.EntityRefFable.Transforms.FSharp2Fable.FsDeclaredType→Fable.AST.Fable.TypeFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.AttributeFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.DeclaredTypeFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.EntityFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.EntityRefFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.FieldFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.GenericParamFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.MemberFunctionOrValueFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.MemberRefInfoFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.TypeFable.Transforms.FSharp2Fable.FsEnt→Fable.AST.Fable.UnionCaseFable.Transforms.FSharp2Fable.FsField→Fable.AST.Fable.FieldFable.Transforms.FSharp2Fable.FsField→Fable.AST.Fable.TypeFable.Transforms.FSharp2Fable.FsGenParam→Fable.AST.Fable.ConstraintFable.Transforms.FSharp2Fable.FsGenParam→Fable.AST.Fable.GenericParamFable.Transforms.FSharp2Fable.FsMemberFunctionOrValue→Fable.AST.Fable.AbstractSignature
- Direction
- Fable.Transforms.FSharp2Fable uses Fable.AST.Fable, so a change to Fable.AST.Fable can break Fable.Transforms.FSharp2Fable, while a change to Fable.Transforms.FSharp2Fable can't break Fable.AST.Fable.
- Position
- Below the diagonal: Fable.Transforms.FSharp2Fable uses a module listed above it, which is the healthy direction.
37→24 Fable.Transforms.FSharp2Fable uses FSharp.Compiler.Symbols✕
- Connections
- 15 pairs of types, where a type in Fable.Transforms.FSharp2Fable uses a type in FSharp.Compiler.Symbols.
- The types involved
Fable.Transforms.FSharp2Fable.Context→FSharp.Compiler.Symbols.FSharpMemberOrFunctionOrValueFable.Transforms.FSharp2Fable.FsAbstractSignature→FSharp.Compiler.Symbols.FSharpAbstractSignatureFable.Transforms.FSharp2Fable.FsAtt→FSharp.Compiler.Symbols.FSharpAttributeFable.Transforms.FSharp2Fable.FsDeclaredType→FSharp.Compiler.Symbols.FSharpEntityFable.Transforms.FSharp2Fable.FsDeclaredType→FSharp.Compiler.Symbols.FSharpTypeFable.Transforms.FSharp2Fable.FsEnt→FSharp.Compiler.Symbols.FSharpEntityFable.Transforms.FSharp2Fable.FsEnt→FSharp.Compiler.Symbols.FSharpMemberOrFunctionOrValueFable.Transforms.FSharp2Fable.FsField→FSharp.Compiler.Symbols.FSharpFieldFable.Transforms.FSharp2Fable.FsGenParam→FSharp.Compiler.Symbols.FSharpGenericParameterFable.Transforms.FSharp2Fable.FsGenParam→FSharp.Compiler.Symbols.FSharpGenericParameterConstraintFable.Transforms.FSharp2Fable.FsMemberFunctionOrValue→FSharp.Compiler.Symbols.FSharpAttributeFable.Transforms.FSharp2Fable.FsMemberFunctionOrValue→FSharp.Compiler.Symbols.FSharpMemberOrFunctionOrValueFable.Transforms.FSharp2Fable.FsParam→FSharp.Compiler.Symbols.FSharpParameterFable.Transforms.FSharp2Fable.FsUnionCase→FSharp.Compiler.Symbols.FSharpUnionCaseFable.Transforms.FSharp2Fable.IFableCompiler→FSharp.Compiler.Symbols.FSharpExpr
- Direction
- Fable.Transforms.FSharp2Fable uses FSharp.Compiler.Symbols, so a change to FSharp.Compiler.Symbols can break Fable.Transforms.FSharp2Fable, while a change to Fable.Transforms.FSharp2Fable can't break FSharp.Compiler.Symbols.
- Position
- Below the diagonal: Fable.Transforms.FSharp2Fable uses a module listed above it, which is the healthy direction.
37→35 Fable.Transforms.FSharp2Fable uses Fable✕
- Connections
- 2 pairs of types, where a type in Fable.Transforms.FSharp2Fable uses a type in Fable.
- The types involved
Fable.Transforms.FSharp2Fable.IFableCompiler→Fable.CompilerFable.Transforms.FSharp2Fable.IFableCompiler→Fable.InlineExpr
- Direction
- Fable.Transforms.FSharp2Fable uses Fable, so a change to Fable can break Fable.Transforms.FSharp2Fable, while a change to Fable.Transforms.FSharp2Fable can't break Fable.
- Position
- Below the diagonal: Fable.Transforms.FSharp2Fable uses a module listed above it, which is the healthy direction.
38→2 Fable.Transforms.Fable2Babel uses System.Collections✕
- Connections
- 6 pairs of types, where a type in Fable.Transforms.Fable2Babel uses a type in System.Collections.
- The types involved
Fable.Transforms.Fable2Babel.ConstructorRef→System.Collections.IStructuralComparableFable.Transforms.Fable2Babel.ConstructorRef→System.Collections.IStructuralEquatableFable.Transforms.Fable2Babel.Import→System.Collections.IStructuralComparableFable.Transforms.Fable2Babel.Import→System.Collections.IStructuralEquatableFable.Transforms.Fable2Babel.ReturnStrategy→System.Collections.IStructuralEquatableFable.Transforms.Fable2Babel.UsedNames→System.Collections.IStructuralEquatable
- Direction
- Fable.Transforms.Fable2Babel uses System.Collections, so a change to System.Collections can break Fable.Transforms.Fable2Babel, while a change to Fable.Transforms.Fable2Babel can't break System.Collections.
- Position
- Below the diagonal: Fable.Transforms.Fable2Babel uses a module listed above it, which is the healthy direction.
38→4 Fable.Transforms.Fable2Babel uses System.Collections.Generic✕
- Connections
- 1 pair of types, where a type in Fable.Transforms.Fable2Babel uses a type in System.Collections.Generic.
- The types involved
Fable.Transforms.Fable2Babel.IBabelCompiler→System.Collections.Generic.IEnumerable`1
- Direction
- Fable.Transforms.Fable2Babel uses System.Collections.Generic, so a change to System.Collections.Generic can break Fable.Transforms.Fable2Babel, while a change to Fable.Transforms.Fable2Babel can't break System.Collections.Generic.
- Position
- Below the diagonal: Fable.Transforms.Fable2Babel uses a module listed above it, which is the healthy direction.
38→7 Fable.Transforms.Fable2Babel uses System✕
- Connections
- 8 pairs of types, where a type in Fable.Transforms.Fable2Babel uses a type in System.
- The types involved
Fable.Transforms.Fable2Babel.ConstructorRef→System.IComparableFable.Transforms.Fable2Babel.ConstructorRef→System.IComparable`1Fable.Transforms.Fable2Babel.ConstructorRef→System.IEquatable`1Fable.Transforms.Fable2Babel.Import→System.IComparableFable.Transforms.Fable2Babel.Import→System.IComparable`1Fable.Transforms.Fable2Babel.Import→System.IEquatable`1Fable.Transforms.Fable2Babel.ReturnStrategy→System.IEquatable`1Fable.Transforms.Fable2Babel.UsedNames→System.IEquatable`1
- Direction
- Fable.Transforms.Fable2Babel uses System, so a change to System can break Fable.Transforms.Fable2Babel, while a change to Fable.Transforms.Fable2Babel can't break System.
- Position
- Below the diagonal: Fable.Transforms.Fable2Babel uses a module listed above it, which is the healthy direction.
38→9 Fable.Transforms.Fable2Babel uses Fable.AST✕
- Connections
- 1 pair of types, where a type in Fable.Transforms.Fable2Babel uses a type in Fable.AST.
- The types involved
Fable.Transforms.Fable2Babel.IBabelCompiler→Fable.AST.SourceLocation
- Direction
- Fable.Transforms.Fable2Babel uses Fable.AST, so a change to Fable.AST can break Fable.Transforms.Fable2Babel, while a change to Fable.Transforms.Fable2Babel can't break Fable.AST.
- Position
- Below the diagonal: Fable.Transforms.Fable2Babel uses a module listed above it, which is the healthy direction.
38→15 Fable.Transforms.Fable2Babel uses Fable.AST.Babel✕
- Connections
- 7 pairs of types, where a type in Fable.Transforms.Fable2Babel uses a type in Fable.AST.Babel.
- The types involved
Fable.Transforms.Fable2Babel.Context→Fable.AST.Babel.ClassMemberFable.Transforms.Fable2Babel.Context→Fable.AST.Babel.ExpressionFable.Transforms.Fable2Babel.IBabelCompiler→Fable.AST.Babel.ExpressionFable.Transforms.Fable2Babel.IBabelCompiler→Fable.AST.Babel.ModuleDeclarationFable.Transforms.Fable2Babel.IBabelCompiler→Fable.AST.Babel.StatementFable.Transforms.Fable2Babel.ReturnStrategy→Fable.AST.Babel.ExpressionFable.Transforms.Fable2Babel.ReturnStrategy→Fable.AST.Babel.Identifier
- Direction
- Fable.Transforms.Fable2Babel uses Fable.AST.Babel, so a change to Fable.AST.Babel can break Fable.Transforms.Fable2Babel, while a change to Fable.Transforms.Fable2Babel can't break Fable.AST.Babel.
- Position
- Below the diagonal: Fable.Transforms.Fable2Babel uses a module listed above it, which is the healthy direction.
38→16 Fable.Transforms.Fable2Babel uses Fable.AST.Fable✕
- Connections
- 8 pairs of types, where a type in Fable.Transforms.Fable2Babel uses a type in Fable.AST.Fable.
- The types involved
Fable.Transforms.Fable2Babel.Context→Fable.AST.Fable.FileFable.Transforms.Fable2Babel.Context→Fable.AST.Fable.IdentFable.Transforms.Fable2Babel.Context→Fable.AST.Fable.TypeFable.Transforms.Fable2Babel.IBabelCompiler→Fable.AST.Fable.EntityFable.Transforms.Fable2Babel.IBabelCompiler→Fable.AST.Fable.ExprFable.Transforms.Fable2Babel.IBabelCompiler→Fable.AST.Fable.IdentFable.Transforms.Fable2Babel.ITailCallOpportunity→Fable.AST.Fable.ExprFable.Transforms.Fable2Babel.ModuleDecl→Fable.AST.Fable.Type
- Direction
- Fable.Transforms.Fable2Babel uses Fable.AST.Fable, so a change to Fable.AST.Fable can break Fable.Transforms.Fable2Babel, while a change to Fable.Transforms.Fable2Babel can't break Fable.AST.Fable.
- Position
- Below the diagonal: Fable.Transforms.Fable2Babel uses a module listed above it, which is the healthy direction.
38→35 Fable.Transforms.Fable2Babel uses Fable✕
- Connections
- 1 pair of types, where a type in Fable.Transforms.Fable2Babel uses a type in Fable.
- The types involved
Fable.Transforms.Fable2Babel.IBabelCompiler→Fable.Compiler
- Direction
- Fable.Transforms.Fable2Babel uses Fable, so a change to Fable can break Fable.Transforms.Fable2Babel, while a change to Fable.Transforms.Fable2Babel can't break Fable.
- Position
- Below the diagonal: Fable.Transforms.Fable2Babel uses a module listed above it, which is the healthy direction.
39→2 Fable.Transforms.Printer uses System.Collections✕
- Connections
- 2 pairs of types, where a type in Fable.Transforms.Printer uses a type in System.Collections.
- The types involved
Fable.Transforms.Printer.ParsedXmlDoc→System.Collections.IStructuralComparableFable.Transforms.Printer.ParsedXmlDoc→System.Collections.IStructuralEquatable
- Direction
- Fable.Transforms.Printer uses System.Collections, so a change to System.Collections can break Fable.Transforms.Printer, while a change to Fable.Transforms.Printer can't break System.Collections.
- Position
- Below the diagonal: Fable.Transforms.Printer uses a module listed above it, which is the healthy direction.
39→7 Fable.Transforms.Printer uses System✕
- Connections
- 5 pairs of types, where a type in Fable.Transforms.Printer uses a type in System.
- The types involved
Fable.Transforms.Printer.ParsedXmlDoc→System.IComparableFable.Transforms.Printer.ParsedXmlDoc→System.IComparable`1Fable.Transforms.Printer.ParsedXmlDoc→System.IEquatable`1Fable.Transforms.Printer.PrinterImpl→System.IDisposableFable.Transforms.Printer.Writer→System.IDisposable
- Direction
- Fable.Transforms.Printer uses System, so a change to System can break Fable.Transforms.Printer, while a change to Fable.Transforms.Printer can't break System.
- Position
- Below the diagonal: Fable.Transforms.Printer uses a module listed above it, which is the healthy direction.
39→9 Fable.Transforms.Printer uses Fable.AST✕
- Connections
- 2 pairs of types, where a type in Fable.Transforms.Printer uses a type in Fable.AST.
- The types involved
Fable.Transforms.Printer.PrinterImpl→Fable.AST.SourceLocationFable.Transforms.Printer.Writer→Fable.AST.SourceLocation
- Direction
- Fable.Transforms.Printer uses Fable.AST, so a change to Fable.AST can break Fable.Transforms.Printer, while a change to Fable.Transforms.Printer can't break Fable.AST.
- Position
- Below the diagonal: Fable.Transforms.Printer uses a module listed above it, which is the healthy direction.
39→35 Fable.Transforms.Printer uses Fable✕
- Connections
- 2 pairs of types, where a type in Fable.Transforms.Printer uses a type in Fable.
- The types involved
Fable.Transforms.Printer.PrinterImpl→Fable.SeverityFable.Transforms.Printer.Writer→Fable.Severity
- Direction
- Fable.Transforms.Printer uses Fable, so a change to Fable can break Fable.Transforms.Printer, while a change to Fable.Transforms.Printer can't break Fable.
- Position
- Below the diagonal: Fable.Transforms.Printer uses a module listed above it, which is the healthy direction.
40→7 Fable.Standalone.Main uses System✕
- Connections
- 1 pair of types, where a type in Fable.Standalone.Main uses a type in System.
- The types involved
Fable.Standalone.Main.ParseAndCheckResults→System.Lazy`1
- Direction
- Fable.Standalone.Main uses System, so a change to System can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break System.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→8 Fable.Standalone.Main uses FSharp.Compiler.Text✕
- Connections
- 3 pairs of types, where a type in Fable.Standalone.Main uses a type in FSharp.Compiler.Text.
- The types involved
Fable.Standalone.Main.Main→FSharp.Compiler.Text.RangeFable.Standalone.Main.Main→FSharp.Compiler.Text.TaggedTextFable.Standalone.Main.Main→FSharp.Compiler.Text.TextTag
- Direction
- Fable.Standalone.Main uses FSharp.Compiler.Text, so a change to FSharp.Compiler.Text can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break FSharp.Compiler.Text.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→10 Fable.Standalone.Main uses Fable.Transforms.Rust.AST.Types✕
- Connections
- 1 pair of types, where a type in Fable.Standalone.Main uses a type in Fable.Transforms.Rust.AST.Types.
- The types involved
Fable.Standalone.Main.RustResult→Fable.Transforms.Rust.AST.Types.Crate
- Direction
- Fable.Standalone.Main uses Fable.Transforms.Rust.AST.Types, so a change to Fable.Transforms.Rust.AST.Types can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break Fable.Transforms.Rust.AST.Types.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→15 Fable.Standalone.Main uses Fable.AST.Babel✕
- Connections
- 1 pair of types, where a type in Fable.Standalone.Main uses a type in Fable.AST.Babel.
- The types involved
Fable.Standalone.Main.BabelResult→Fable.AST.Babel.Program
- Direction
- Fable.Standalone.Main uses Fable.AST.Babel, so a change to Fable.AST.Babel can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break Fable.AST.Babel.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→16 Fable.Standalone.Main uses Fable.AST.Fable✕
- Connections
- 1 pair of types, where a type in Fable.Standalone.Main uses a type in Fable.AST.Fable.
- The types involved
Fable.Standalone.Main.Main→Fable.AST.Fable.File
- Direction
- Fable.Standalone.Main uses Fable.AST.Fable, so a change to Fable.AST.Fable can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break Fable.AST.Fable.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→17 Fable.Standalone.Main uses Fable.Transforms.Python.AST✕
- Connections
- 1 pair of types, where a type in Fable.Standalone.Main uses a type in Fable.Transforms.Python.AST.
- The types involved
Fable.Standalone.Main.PythonResult→Fable.Transforms.Python.AST.Module
- Direction
- Fable.Standalone.Main uses Fable.Transforms.Python.AST, so a change to Fable.Transforms.Python.AST can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break Fable.Transforms.Python.AST.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→24 Fable.Standalone.Main uses FSharp.Compiler.Symbols✕
- Connections
- 2 pairs of types, where a type in Fable.Standalone.Main uses a type in FSharp.Compiler.Symbols.
- The types involved
Fable.Standalone.Main.Main→FSharp.Compiler.Symbols.FSharpXmlDocFable.Standalone.Main.SymbolImpl→FSharp.Compiler.Symbols.FSharpSymbol
- Direction
- Fable.Standalone.Main uses FSharp.Compiler.Symbols, so a change to FSharp.Compiler.Symbols can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break FSharp.Compiler.Symbols.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→25 Fable.Standalone.Main uses FSharp.Compiler.Diagnostics✕
- Connections
- 1 pair of types, where a type in Fable.Standalone.Main uses a type in FSharp.Compiler.Diagnostics.
- The types involved
Fable.Standalone.Main.Main→FSharp.Compiler.Diagnostics.FSharpDiagnostic
- Direction
- Fable.Standalone.Main uses FSharp.Compiler.Diagnostics, so a change to FSharp.Compiler.Diagnostics can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break FSharp.Compiler.Diagnostics.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→32 Fable.Standalone.Main uses FSharp.Compiler.EditorServices✕
- Connections
- 6 pairs of types, where a type in Fable.Standalone.Main uses a type in FSharp.Compiler.EditorServices.
- The types involved
Fable.Standalone.Main.Main→FSharp.Compiler.EditorServices.CompletionItemKindFable.Standalone.Main.Main→FSharp.Compiler.EditorServices.DeclarationListItemFable.Standalone.Main.Main→FSharp.Compiler.EditorServices.FSharpGlyphFable.Standalone.Main.Main→FSharp.Compiler.EditorServices.FindDeclFailureReasonFable.Standalone.Main.Main→FSharp.Compiler.EditorServices.SemanticClassificationTypeFable.Standalone.Main.Main→FSharp.Compiler.EditorServices.ToolTipElement
- Direction
- Fable.Standalone.Main uses FSharp.Compiler.EditorServices, so a change to FSharp.Compiler.EditorServices can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break FSharp.Compiler.EditorServices.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→34 Fable.Standalone.Main uses FSharp.Compiler.CodeAnalysis✕
- Connections
- 5 pairs of types, where a type in Fable.Standalone.Main uses a type in FSharp.Compiler.CodeAnalysis.
- The types involved
Fable.Standalone.Main.Main→FSharp.Compiler.CodeAnalysis.FSharpCheckProjectResultsFable.Standalone.Main.Main→FSharp.Compiler.CodeAnalysis.FSharpProjectOptionsFable.Standalone.Main.ParseAndCheckResults→FSharp.Compiler.CodeAnalysis.FSharpCheckFileResultsFable.Standalone.Main.ParseAndCheckResults→FSharp.Compiler.CodeAnalysis.FSharpCheckProjectResultsFable.Standalone.Main.ParseAndCheckResults→FSharp.Compiler.CodeAnalysis.FSharpParseFileResults
- Direction
- Fable.Standalone.Main uses FSharp.Compiler.CodeAnalysis, so a change to FSharp.Compiler.CodeAnalysis can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break FSharp.Compiler.CodeAnalysis.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→35 Fable.Standalone.Main uses Fable✕
- Connections
- 2 pairs of types, where a type in Fable.Standalone.Main uses a type in Fable.
- The types involved
Fable.Standalone.Main.Main→Fable.CompilerFable.Standalone.Main.Main→Fable.Language
- Direction
- Fable.Standalone.Main uses Fable, so a change to Fable can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break Fable.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
40→39 Fable.Standalone.Main uses Fable.Transforms.Printer✕
- Connections
- 1 pair of types, where a type in Fable.Standalone.Main uses a type in Fable.Transforms.Printer.
- The types involved
Fable.Standalone.Main.Main→Fable.Transforms.Printer.Writer
- Direction
- Fable.Standalone.Main uses Fable.Transforms.Printer, so a change to Fable.Transforms.Printer can break Fable.Standalone.Main, while a change to Fable.Standalone.Main can't break Fable.Transforms.Printer.
- Position
- Below the diagonal: Fable.Standalone.Main uses a module listed above it, which is the healthy direction.
At a glance — Code Health
At a glance — Architecture
At a glance — Maturity
At a glance — Readiness
At a glance — Security
At a glance — Event Sourcing
At a glance — Performance
Security & Compliance — OWASP Top-10 mapping
| OWASP category | Findings | Severity |
|---|---|---|
| A05:2025 — Injection | 102 | High / Critical |
| A02:2025 — Security Misconfiguration | 13 | Medium |
| A03:2025 — Software Supply Chain Failures | 8 | High / Critical |
Roadmap
Top priorities: Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract; Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package; Resolve the 31 Outdated (npm) finding(s) in Dependency Hygiene — start with package.json.
| Do this | Helps | Effort | Dimension |
|---|---|---|---|
| Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability. | +1.6 pts | Low | Test Reliability |
| Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract. | +3.0 pts | Medium | Code Duplication |
| Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package. | +2.8 pts | Medium | Large Files |
| Resolve the 1 CommentedOutCode finding(s) in Explicit Debt — start with REDACTED. | +1.1 pts | Low | Explicit Debt |
| Resolve the 1 No ADRs found finding(s) in ADR Quality — start with docs.fsproj. | +1.0 pts | Low | ADR Quality |
| Resolve the 31 Outdated (npm) finding(s) in Dependency Hygiene — start with package.json. | +1.8 pts | Medium | Dependency Hygiene |
| F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow. | +1.3 pts | Medium | Async & latency hygiene |
| Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it. | +1.1 pts | Medium | Deployment & Rollback |
File quality
| File | Score | Band | Worst signal |
|---|---|---|---|
| REDACTED | 3.3 | Slop | Static Analysis (SAST): High: REDACTED |
| REDACTED | 4.4 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 4.4 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 4.4 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 4.4 | Mixed | Dependency Vulnerabilities: High CVE: REDACTED |
| REDACTED | 4.4 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 4.6 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 5.1 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 5.8 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 5.8 | Mixed | Static Analysis (SAST): High: REDACTED |
| src/Fable.Transforms/Rust/Replacements.fs | 7.0 | Mixed | Change Coupling: Boundary-crossing change coupling: Replacements.fs ↔ Mutable.rs |
| REDACTED | 7.2 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 7.2 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 7.2 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 7.2 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 7.2 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 7.2 | Mixed | Static Analysis (SAST): High: REDACTED |
| REDACTED | 7.9 | Mixed | Static Analysis (SAST): Medium: REDACTED |
| REDACTED | 7.9 | Mixed | Static Analysis (SAST): Medium: REDACTED |
| REDACTED | 7.9 | Mixed | Static Analysis (SAST): Medium: REDACTED |
How the grades work
A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.
Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.
Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.
Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.
Methodology & how to trust this report
This survey is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. All 54 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.
What we checked — 54 dimensions across the health lenses
- Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 446 of 714 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line.
- Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
- Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
Tools & methods
| Method | Backs | Version | Evaluator |
|---|---|---|---|
| Roslyn static analysis | Complexity, cohesion, coupling, dead code, API surface, layering | 5.3.0 | ✓ deterministic |
| Native secret scanner | Hardcoded secrets / credentials | 1.0.0 | ✓ deterministic |
| Canine Code Analyzer duplication detector (in-process) | Code duplication | 1.0.0 | ✓ deterministic |
| Coverage (coverlet / dotnet-coverage) | Line & branch coverage | 10.0.400 | ✓ deterministic |
| NuGet / dotnet | Outdated, vulnerable & deprecated dependencies | 10.0.400 | ✓ deterministic |
| git / LibGit2Sharp | Churn hotspots, knowledge concentration, history | 2.43.0 · 0.31.0 | ✓ deterministic |
| gitleaks · semgrep · trivy · checkov | Secrets in history, SAST, CVEs, IaC & container, PII / GDPR | 1.86.0 · 0.69.3 · 3.2.533 | ✓ deterministic |
Run transparency — what happened this run
- D1 Cyclomatic Complexity — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Cyclomatic Complexity couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
- D2 Cognitive Complexity — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Cognitive Complexity couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
- D3 God Classes — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. God Classes couldn't be assessed within its 5-minute budget on a solution this large — not included in this run.
- D4 Code Duplication — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Code Duplication couldn't be assessed within its 20-minute budget on a solution this large — not included in this run.
- D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Python REDACTED/requirements.txt (pip/uv/Poetry), but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
- D14 License Compliance — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its NuGet package dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
- D15 Churn × Complexity Hotspots — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. A hotspot's complexity is meant to be the worst body its churn actually touched. For src/Fable.Compiler/ProjectCracker.fs, src/Fable.Transforms/Replacements.Util.fs, src/Fable.Transforms/Replacements.fs, src/Fable.Transforms/FableTransforms.fs, src/Fable.Transforms/Babel/Fable2Babel.fs, … that could not be established — the complexity reader for the file reports no body extents, or the history carries no per-line attribution — so the row quotes the file's worst body, which the counted changes may never have touched. The churn count is unaffected.
- D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The C# workspace loaded this repository's projects but reported a load failure, and the dead-code reference search is unreliable over a graph that did not load cleanly, so it was skipped. The other debt markers on this row were read; dead symbols were not, and their absence from the score is not a finding that the code has none. First load diagnostic: Failure: Cannot open project 'src/Fable.Core/Fable.Core.fsproj' because the file extension '.fsproj' is not associated with a language.
- D17 Explicit Debt — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 1 deducted marker(s) and the 0.1/KLoC density on this row were taken over this repository's .NET projects ALONE: .fs (354,641 lines, 85% of production source) went unread, because every marker collector on this path is reached through a C# workspace. D17's marker collectors need a compiler we do not have for that language, so none of its nine marker kinds were read there. The debt in that source is UNMEASURED — its absence from the score above is a gap in this analyzer's language coverage, not a finding that the code carries none.
- D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. D21's naming rules read C# through Roslyn and every other language through its sidecar model; these languages are left out (PHP's reading is its own change, a Roslyn-loaded VB or F# project has no population builder yet). Their declarations carry no naming verdict this run — this says nothing about whether their names are consistent.
- D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
- D21 Naming Consistency — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
- D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated per language (docs/plans/deterministic-engine.md, P5; C# and each NeutralApiArms arm pass): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
- D24 Comment Value — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
- D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `src/fable-library-py/fable_library/async_.py`, `src/fable-library-py/fable_library/async_builder.py`, `src/fable-library-py/fable_library/bases.py`, `src/fable-library-py/fable_library/choice.pyi`, `src/fable-library-py/fable_library/core/array.pyi`, … (+25 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
- IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is implemented over the C# syntax tree, and no C# was loaded on this run, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
- M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
- P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
- R10 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 8 further occurrence(s) are not listed individually; the score already reflects all 48.
- SC1 Supply-chain hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 22 further occurrence(s) are not listed individually; the score already reflects all 62.
- X10 Duplicated predicate — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 2 further occurrence(s) are not listed individually; the score already reflects all 42.
- X12 Unreachable branch — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
- X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
- X23 Unguarded diagnostic materialisation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
- X27 Collection changed while being enumerated — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
- X28 Index access outside its own emptiness guard — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
- X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
- X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 110 further occurrence(s) are not listed individually; the score already reflects all 150.
- X7 Silent fallback defaults — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. X7 measured the part of this repository it reads (C#, Python, TypeScript/JavaScript, Rust, Go, Java, Kotlin, Scala, PHP, Ruby, Swift, Dart and Elixir), and its Erlang source is outside the check's reach, so the card covers only part of the product. That is a gap in this analyzer's language reach — not a finding that the unread source is free of silent defaults.
Limitations & what we did not check
We assess the repository exactly as committed, and only the repository. By design we do not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
- D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
- D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
- D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
- D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
- D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
- D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
- D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
- D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
- D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
- D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
- D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
- D21 Naming Consistency: Naming consistency compares each name with the convention its structural peers follow in this repository: it cannot tell whether a consistently used name is a good one, and languages other than C# and TypeScript are not measured.
- D24 Comment Value: Comment value is measured as redundancy only: a comment that repeats its code's words is found, but a paraphrase in other words, a vague comment, or one the code contradicts is not, and whether a comment is valuable is not claimed. Comments in other scripts or languages, and outside C#, are not judged.
- D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
- D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
- D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
- D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
- D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
- D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
- D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
- D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
- D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
- D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
- AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
- AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
- M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
- P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
- P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
Dimensions
D5 · Coupling
2 projects, 0 dependency cycle(s), 0 unstable depended-on project(s).
D6 · Cohesion (LCOM4)
0 of 103 classes have LCOM4 above 3.
D11 · Test Reliability
0 flaky across 2 measured tier(s). .NET suite (the runs D8 measures coverage on): measured (0 flaky); JavaScript/TypeScript (jest via `npm ci --ignore-scripts` in tests/React/ (0 tests)): measured (0 flaky).
What to do
- Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability. — One of this dimension's main actionable groups (1 issue-level).
D12 · Dependency Hygiene
12 outdated, 0 vulnerable, 0 deprecated packages. Those are the NuGet packages; this repository's npm dependencies were read too — 243 outdated of 479 package(s) across 6 lockfile(s).
What to do
- Resolve the 31 Outdated (npm) finding(s) in Dependency Hygiene — start with package.json. — One of this dimension's main actionable groups (31 recommendation-level).
- Resolve the 1 Outdated finding(s) in Dependency Hygiene — start with docs.fsproj. — One of this dimension's main actionable groups (1 recommendation-level).
D13 · Secret Scanning
Secret scan ran and found no leaked secrets.
D14 · License Compliance
0 of 280 packages use a banned license. ★ DEPTH: this repository's MSBuild projects declare 63 direct `PackageReference`(s), and 163 further package(s) were reached beyond them by closing the graph over nuget.org's own nuspec dependency graph — so a banned licence pulled in only by a dependency's OWN dependencies is inside this verdict. A package whose licence nuget.org could not be asked for is not graded, and version ranges are taken at their lower bound, so this is the closure as that graph states it rather than a restored consumer's exact resolution. ★ COVERAGE OF THIS VERDICT: it grades this repository's NuGet package dependencies and nothing else. The repository also declares a Python REDACTED/requirements.txt (pip/uv/Poetry) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
D15 · Churn × Complexity Hotspots
Top hotspots: src/Fable.Transforms/Replacements.fs (109×100=10900); src/Fable.Transforms/Beam/Replacements.fs (30×279=8370); src/Fable.Transforms/Babel/Fable2Babel.fs (112×67=7504) Repeated repair below the complexity floor: src/Fable.Transforms/FSharp2Fable.fs (31 of 57 changes were fixes); src/Fable.Transforms/State.fs (8 of 11 changes were fixes); src/fable-library-ts/Decimal.ts (8 of 10 changes were fixes)
What to do
- Resolve the 41 Hotspot finding(s) in Churn × Complexity Hotspots — start with Replacements.fs (5), Seq.fs (4), Fable2Babel.fs. — One of this dimension's main actionable groups (41 warning-level).
- Resolve the 29 Repeated repair finding(s) in Churn × Complexity Hotspots — start with List.fs (2), FSharp2Fable.fs, State.fs. — One of this dimension's main actionable groups (29 warning-level).
D16 · Bus Factor
47 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is src/Fable.Transforms/Beam/Fable2Beam.fs. Counted over 539 of the 705 production source files in this repository: 161 are under the ~2,400-byte size floor this dimension measures over, and the remaining 5 have no attributable history left to measure.
D17 · Explicit Debt
1 deducted debt markers + unmeasured dead symbols across 62 LoC in the .NET projects (0.1/KLoC) → score 9.8. Dead code not measured: the solution did not load cleanly, so the reference search was skipped. Measured on the .NET source only: .fs (85% of production source) was not read, and carries at least 0 uncounted task marker(s) in 0 file(s).
What to do
- Resolve the 1 CommentedOutCode finding(s) in Explicit Debt — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
D19 · Documentation Quality
1 of 2 documentation facets pass in full; short on: F2 example. 43 document(s) read across 13 unit(s).
What to do
- Resolve the 4 Documentation finding(s) in Documentation Quality — start with README.md (4). — One of this dimension's main actionable groups (4 recommendation-level).
D20 · ADR Quality
No architecture decision records were found.
What to do
- Resolve the 1 No ADRs found finding(s) in ADR Quality — start with docs.fsproj. — One of this dimension's main actionable groups (1 recommendation-level).
D21 · Naming Consistency
10 naming inconsistencies among 377 declarations measured against a convention their peers follow.
What to do
- Resolve the 2 `test Bitwise NOT on large unsigned integer works` spells `NO` where 173… finding(s) in Naming Consistency — start with ArithmeticTests.fs, TestArithmetic.fs. — One of this dimension's main actionable groups (2 recommendation-level).
- Resolve the 1 `messageID` spells `ID` where 61 names in the project spell it `Id` finding(s) in Naming Consistency — start with SR.fs. — One of this dimension's main actionable groups (1 recommendation-level).
- Resolve the 1 `et_STRING` spells `STRING` where 41 names in the project spell it… finding(s) in Naming Consistency — start with ilbinary.fs. — One of this dimension's main actionable groups (1 recommendation-level).
D24 · Comment Value
0 of 415 judged comments only repeat the code they sit on (0.0 %). 15 comment(s) in another language or script were not judged.
D26 · Project Cohesion
0 of 2 projects flagged as possibly oversized/incoherent.
D27 · Navigability
92 % of calls cross a namespace and 2 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.
D28 · Secrets (history)
gitleaks scanned the full history AND the current working tree and found no secrets.
D29 · Static Analysis (SAST)
102 finding(s): 0 critical, 99 high, 3 medium, 0 low. 89 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 32 file(s) — `.devcontainer/scripts/zsh_dotnet_completion.sh` (line 15), `src/fable-library-py/fable_library/async_.py` (line 54, lines 58–62, lines 68–71, …), `src/fable-library-py/fable_library/async_builder.py` (line 29, line 117, line 137, …), `src/fable-library-py/fable_library/bases.py` (line 164, lines 201–204, lines 222–225), `src/fable-library-py/fable_library/choice.pyi` (line 9, lines 11–13, lines 15–17, …), … (+27 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 3 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
What to do
- Resolve the 3 REDACTED finding(s) charged to Static Analysis (SAST) — the other 89 are reported here at file:line but scored by D36 (supply-chain provenance), which charges them once. — One of this dimension's main actionable groups (92 issue-level, 3 of them charged here).
- Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
- Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
D30 · Dependency Vulnerabilities
4 finding(s): 0 critical, 1 high, 2 medium, 1 low.
What to do
- Resolve the 1 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
- Resolve the 1 Medium advisory (unmaintained) finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
- Resolve the 1 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
D31 · IaC & Container Security
13 finding(s): 0 critical, 0 high, 0 medium, 13 low.
D34 · Knowledge Freshness
34 of 544 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs. Counted over 544 of the 705 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What to do
- Resolve the 8 Orphaned knowledge finding(s) in Knowledge Freshness — start with ilwrite.fs, infos.fs, Exprs.fs. — One of this dimension's main actionable groups (8 issue-level).
- Resolve the 26 Orphaned file finding(s) in Knowledge Freshness — start with service_slim.fs, PhpPrinter.fs, AccessibilityLogic.fs. — One of this dimension's main actionable groups (26 recommendation-level).
- Resolve the 1 Further orphaned files (smaller) finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
D35 · Change Coupling
Strongest change-coupling: HashMap.rs↔HashSet.rs 100%; MutableMap.fs↔MutableSet.fs 92%; Replacements.fs↔Mutable.rs 83%
What to do
- Resolve the 4 Boundary-crossing change coupling finding(s) in Change Coupling — start with Replacements.fs (3), DartPrinter.fs. — One of this dimension's main actionable groups (4 issue-level).
- Resolve the 7 Change coupling finding(s) in Change Coupling — start with HashMap.rs, MutableMap.fs, Array.fs. — One of this dimension's main actionable groups (7 warning-level).
- Resolve the 1 Change-coupling hub finding(s) in Change Coupling — start with Option.fs. — One of this dimension's main actionable groups (1 warning-level).
D36 · Supply-chain Provenance & Signing
2/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).
What to do
- Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
- Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
- Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
D43 · Malicious Dependencies
No dependency in any ecosystem this repository declares is published as malicious.
D44 · Platform End-of-Life
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 174 platform declaration(s) and 7 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
Frontend & cross-cutting dimensions
AX10 · Code composition
AX3 · Project dependency cycles
AX4 · Dependency direction
AX5 · Architecture & structure
AX6 · Interface segregation
- `NumericArray` declares 19 required operations under just 15 distinct name(s): `every`, `fill`, `filter`, `find`, `findIndex`, `forEach`, `indexOf`, `join`, `lastIndexOf`, `reduce`, `reduce`, `reduce`, `reduceRight`, `reduceRight`, `reduceRight`, `reverse`, `slice`, `some`, `sort`. Counted over its REQUIRED operations — a method signature or a function-typed property with no `?`, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. That is an OVERLOAD SET, not 19 separate responsibilities: a caller binds to 15 operation(s) and uses the overload it selected, so the Interface-Segregation harm does NOT apply on the caller's side and splitting this into role-interfaces would scatter one operation without relieving anything. The burden that does remain is the IMPLEMENTER's — all 19 signatures must be written and kept in step. Reduce it by collapsing overloads (optional or default parameters, or an options object) rather than by segregating the interface. — src/fable-library-ts/Util.ts:9
- `ObjectConstructor` declares 18 abstract members: `assign`, `create`, `defineProperties`, `defineProperty`, `entries`, `freeze`, `getOwnPropertyDescriptor`, `getOwnPropertyNames`, `getPrototypeOf`, `is`, `isExtensible`, `isFrozen`, `isSealed`, `keys`, `preventExtensions`, `seal`, `setPrototypeOf`, `values`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:196
- `Math` declares 43 abstract members: `abs`, `acos`, `acosh`, `asin`, `asinh`, `atan`, `atan2`, `atanh`, `cbrt`, `ceil`, `clz32`, `cos`, `cosh`, `exp`, `expm1`, `floor`, `fround`, `hypot`, `imul`, `log`, `log10`, `log1p`, `log2`, `max`, `min`, `pow`, `random`, `round`, `sign`, `sin`, `sinh`, `sqrt`, `tan`, `tanh`, `trunc`, `PI`, `LN2`, `E`, `LN10`, `SQRT2`, and 3 more. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:229
- `Date` declares 43 abstract members: `getDate`, `getDay`, `getFullYear`, `getHours`, `getMilliseconds`, `getMinutes`, `getMonth`, `getSeconds`, `getTime`, `getTimezoneOffset`, `getUTCDate`, `getUTCDay`, `getUTCFullYear`, `getUTCHours`, `getUTCMilliseconds`, `getUTCMinutes`, `getUTCMonth`, `getUTCSeconds`, `setDate`, `setFullYear`, `setHours`, `setMilliseconds`, `setMinutes`, `setMonth`, `setSeconds`, `setTime`, `setUTCDate`, `setUTCFullYear`, `setUTCHours`, `setUTCMilliseconds`, `setUTCMinutes`, `setUTCMonth`, `setUTCSeconds`, `toDateString`, `toISOString`, `toJSON`, `toLocaleDateString`, `toLocaleString`, `toLocaleTimeString`, `toString`, and 3 more. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:274
- `DataView` declares 23 abstract members: `getBigInt64`, `getBigUint64`, `getFloat32`, `getFloat64`, `getInt16`, `getInt32`, `getInt8`, `getUint16`, `getUint32`, `getUint8`, `setBigInt64`, `setBigUint64`, `setFloat32`, `setFloat64`, `setInt16`, `setInt32`, `setInt8`, `setUint16`, `setUint32`, `setUint8`, `byteLength`, `byteOffset`, `buffer`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:472
- `TypedArray`1<T>` declares 19 abstract members: `fill`, `filter`, `find`, `findIndex`, `forEach`, `includes`, `indexOf`, `lastIndexOf`, `map`, `reduce`, `reduceRight`, `reverse`, `set`, `slice`, `some`, `sort`, `subarray`, `values`, `Item`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:523
- `Console` declares 19 abstract members: `assert`, `clear`, `count`, `debug`, `dir`, `dirxml`, `error`, `group`, `groupCollapsed`, `groupEnd`, `info`, `log`, `profile`, `profileEnd`, `table`, `time`, `timeEnd`, `trace`, `warn`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Core/Fable.Core.JS.fs:750
- `MemberFunctionOrValue` declares 26 abstract members: `IsPublic`, `FullName`, `IsConstructor`, `IsSetter`, `ImplementedAbstractSignatures`, `IsOverrideOrExplicitInterfaceImplementation`, `IsGetter`, `ApparentEnclosingEntity`, `ReturnParameter`, `Attributes`, `CompiledName`, `IsInstance`, `IsValue`, `GenericParameters`, `IsInline`, `IsInternal`, `IsProperty`, `DeclaringEntity`, `HasSpread`, `IsExtension`, `IsMutable`, `CurriedParameterGroups`, `IsDispatchSlot`, `DisplayName`, `IsPrivate`, `XmlDoc`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.AST/Fable.fs:119
- `Entity` declares 29 abstract members: `TryFindMember`, `DeclaringEntity`, `IsEnum`, `GenericParameters`, `CompiledName`, `DisplayName`, `MembersFunctionsAndValues`, `IsFSharpRecord`, `BaseType`, `AllInterfaces`, `IsFSharpUnion`, `Attributes`, `IsFSharpExceptionDeclaration`, `IsInternal`, `IsNamespace`, `IsFSharpModule`, `DeclaredInterfaces`, `IsByRef`, `IsInterface`, `FSharpFields`, `IsFSharpAbbreviation`, `IsAbstractClass`, `UnionCases`, `IsMeasure`, `IsPublic`, `IsPrivate`, `Ref`, `IsValueType`, `FullName`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.AST/Fable.fs:149
- `Compiler` declares 19 abstract members: `AddLog`, `AddSignatureDependency`, `AddWatchDependency`, `GetImplementationFile`, `GetInlineExpr`, `GetRootModule`, `IncrementCounter`, `TryGetEntity`, `WillPrecompileInlineFunction`, `IsPrecompilingInlineFunction`, `OutputType`, `SourceFiles`, `Plugins`, `OutputDir`, `ProjectFile`, `CurrentFile`, `Options`, `ProjectOptions`, `LibraryDir`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Transforms/Global/Compiler.fs:70
- `IBabelCompiler` declares 18 abstract members: `GetAllAllTopDirectivesPrologue`, `GetAllImports`, `GetImportAs`, `GetImportExpr`, `GetRecordCopier`, `GetRecordCopierDeclarations`, `GetSymbolDeclarations`, `GetSymbolKey`, `InTypePosition`, `MarkValueImport`, `SaveTopDirectivePrologue`, `TransformAsExpr`, `TransformAsStatements`, `TransformFunction`, `TransformImport`, `UsesRecordCopier`, `WarnOnlyOnce`, `IsTypeScript`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Transforms/Babel/Fable2Babel.fs:77
- `IPhpCompiler` declares 27 abstract members: `AddEntityName`, `AddImport`, `AddLocalVar`, `AddRequire`, `AddType`, `AddUse`, `ClearRequire`, `ClearThisArgument`, `EnterBreakable`, `FindLableLevel`, `GetEntityName`, `IsImport`, `IsThisArgument`, `LeaveBreakable`, `MakeUniqueVar`, `NewScope`, `RestoreScope`, `SetDecisionTargets`, `SetPhpNamespace`, `SetThisArgument`, `TryFindType`, `UseVar`, `UseVarByRef`, `NsUse`, `PhpNamespace`, `DecisionTargets`, `Require`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/Fable.Transforms/Php/Fable2Php.fs:11
- `IBackgroundCompiler` declares 25 abstract members: `BeforeBackgroundFileCheck`, `FileChecked`, `FileParsed`, `FrameworkImportsCache`, `ProjectChecked`, `CheckFileInProject`, `CheckFileInProjectAllowingStaleCachedResults`, `ClearCache`, `ClearCaches`, `DownsizeCaches`, `FindReferencesInFile`, `GetAssemblyData`, `GetBackgroundCheckResultsForFileInProject`, `GetBackgroundParseResultsForFileInProject`, `GetCachedCheckFileResult`, `GetProjectOptionsFromScript`, `GetProjectSnapshotFromScript`, `GetSemanticClassificationForFile`, `InvalidateConfiguration`, `NotifyFileChanged`, `NotifyProjectCleaned`, `ParseAndCheckFileInProject`, `ParseAndCheckProject`, `ParseFile`, `TryGetRecentCheckResultsForFile`. Counted over its abstract members, once per name. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — src/fcs-fable/src/Compiler/Service/BackgroundCompiler.fs:36
What to do
- Split fat interfaces into focused role-interfaces so clients depend only on what they use.
- Where the width is an overload set rather than separate responsibilities, collapse the overloads instead — segregating those relieves no caller.
AX8 · Test isolation
AX9 · CQS / query purity
ES1 · Fold determinism
GD1 · Unfinished & placeholder code
M1 · Documentation (README)
What to do
- Add a build/run (quick start) section to the root README — the first thing a newcomer needs.
- Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation
- No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
What to do
- Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure
M4 · Documentation accuracy
P1 · CI/CD gates
P10 · Library API & versioning
P2 · Observability
- Only 4/14 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `docs`, `src/Fable.Build`, `src/Fickl.Build`, `src/fable-compiler-js`, `src/fable-compiler-js/src` and 5 more.
What to do
- Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
- Add a health-check endpoint (ASP.NET Core's MapHealthChecks, or a /health route in your Giraffe/Suave app) so orchestrators and load balancers can probe liveness/readiness.
P3 · Security & performance tooling
What to do
- Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback
What to do
- Make sure a person approves each release. The release job names an environment, but its approval rules live in the code host's settings, where we can't see them. Check that a reviewer must approve each release, or publish releases as drafts first, so a bad build can be stopped before anyone downloads it.
P6 · Release Hygiene
PF3 · Async & latency hygiene
- `GetOrComputeValue` holds an async function that calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — src/fcs-fable/src/Compiler/Facilities/BuildGraph.fs:64
- `Parallel` holds an async function that calls .Wait() — a blocking call inside async code stalls the thread-pool thread the workflow runs on, and every continuation queued behind it for as long as it runs. — src/fcs-fable/src/Compiler/Facilities/DiagnosticsLogger.fs:1069
What to do
- F#: inside async { } or task { }, bind with let! / do! (Async.AwaitTask for a Task) instead of Async.RunSynchronously, .Wait() or .GetAwaiter().GetResult(), and use do! Async.Sleep or Task.Delay instead of Thread.Sleep; Async.RunSynchronously belongs at the program's entry point, outside every workflow.
R1 · Type Safety
R10 · Code Duplication
- src/fable-library-ts/Date.ts:719 · src/fable-library-ts/DateOffset.ts:110 — the two spans are one implementation copied and then locally edited — 972 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Date.ts:719
- src/fable-library-ts/Date.ts:629 · src/fable-library-ts/DateTimeFormat.ts:559 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — src/fable-library-ts/Date.ts:629
- src/fable-library-ts/Date.ts:304 · src/fable-library-ts/DateTimeFormat.ts:292 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:304
- src/fable-library-ts/Transfer.ts:36 · src/fable-library-ts/Transfer.ts:83 — the two spans are one implementation copied and then locally edited — 271 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Transfer.ts:36
- src/fable-library-ts/TimeSpan.ts:192 · src/fable-library-ts/TimeSpanTemporal.ts:243 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeSpan.ts:192
- src/fable-library-ts/DateOnly.ts:76 · src/fable-library-ts/DateOnlyTemporal.ts:109 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateOnly.ts:76
- src/fable-library-ts/Date.ts:59 · src/fable-library-ts/DateTimeFormat.ts:73 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — src/fable-library-ts/Date.ts:59
- src/fable-library-ts/Date.ts:178 · src/fable-library-ts/Date.ts:211 · src/fable-library-ts/Date.ts:243 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:178
- src/fable-library-ts/DateTimeFormat.ts:178 · src/fable-library-ts/DateTimeFormat.ts:211 · src/fable-library-ts/DateTimeFormat.ts:243 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeFormat.ts:178
- src/fable-library-ts/Rune.ts:210 · src/fable-library-ts/Util.ts:540 — the two spans are one implementation copied and then locally edited — 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Rune.ts:210
- src/fable-library-ts/Util.ts:773 · src/fable-library-ts/Util.ts:811 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Util.ts:773
- src/fable-library-ts/Date.ts:157 · src/fable-library-ts/DateTimeFormat.ts:157 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:157
- src/fable-library-ts/Observable.ts:76 · src/fable-library-ts/Observable.ts:93 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Observable.ts:76
- src/fable-library-ts/Uri.ts:101 · src/fable-library-ts/Uri.ts:127 — the two spans are one implementation copied and then locally edited — 57 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Uri.ts:101
- src/fable-library-ts/DateOnlyTemporal.ts:75 · src/fable-library-ts/TimeOnlyTemporal.ts:120 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateOnlyTemporal.ts:75
- src/fable-library-ts/TimeSpan.ts:233 · src/fable-library-ts/TimeSpanTemporal.ts:285 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeSpan.ts:233
- src/fable-library-ts/BitConverter.ts:21 · src/fable-library-ts/BitConverter.ts:35 · src/fable-library-ts/BitConverter.ts:49 · src/fable-library-ts/BitConverter.ts:63 — all 4 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/BitConverter.ts:21
- src/fable-library-ts/Date.ts:104 · src/fable-library-ts/Date.ts:227 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:104
- src/fable-library-ts/DateTimeFormat.ts:121 · src/fable-library-ts/DateTimeFormat.ts:227 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeFormat.ts:121
- src/fable-library-ts/Encoding.ts:108 · src/fable-library-ts/Encoding.ts:143 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Encoding.ts:108
- src/fable-library-ts/TimeOnly.ts:99 · src/fable-library-ts/TimeSpan.ts:216 · src/fable-library-ts/TimeSpanTemporal.ts:267 — the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeOnly.ts:99
- src/fable-library-ts/TimeOnly.ts:7 · src/fable-library-ts/TimeOnlyTemporal.ts:38 — the two spans are one implementation copied and then locally edited — 65 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/TimeOnly.ts:7
- src/fable-library-ts/Date.ts:613 · src/fable-library-ts/DateTimeFormat.ts:494 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:613
- src/fable-library-ts/BitConverter.ts:90 · src/fable-library-ts/BitConverter.ts:102 · src/fable-library-ts/BitConverter.ts:114 — all 3 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/BitConverter.ts:90
- src/fable-library-ts/Char.ts:81 · src/fable-library-ts/Char.ts:93 — all 2 copies are in the same file, and the CITED SPAN is a run of MODULE-LEVEL DECLARATIONS — bindings the module declares and exports — rather than statements with a call site. Do not read this as an extract-a-helper row: a call expression cannot stand where a declaration was, and putting one there would delete the names themselves, which are what the rest of the codebase imports. What actually repeats here is the INITIALISER — the same expression shape written once per binding. So give that expression one name (a small helper the initialisers call, or a shared base value they are each derived from) and keep every binding under the name it already has. Where the run is an enumeration — one binding per distinct thing, differing precisely in the thing each one names — the repetition IS the enumeration and collapsing it would delete entries; consider instead whether the set belongs in one exported table the individual names are read out of. Reported because the copies drift apart the first time only one of them is edited. — src/fable-library-ts/Char.ts:81
- src/fable-library-ts/Date.ts:410 · src/fable-library-ts/Date.ts:514 · src/fable-library-ts/DateTimeFormat.ts:436 — the 3 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:410
- src/fable-library-ts/DateTimeOffsetTemporal.ts:302 · src/fable-library-ts/DateTimeTemporal.ts:76 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeOffsetTemporal.ts:302
- src/fable-library-ts/TimeSpan.ts:38 · src/fable-library-ts/TimeSpanTemporal.ts:60 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/TimeSpan.ts:38
- src/fable-library-ts/AsyncBuilder.ts:221 · src/fable-library-ts/AsyncBuilder.ts:230 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — src/fable-library-ts/AsyncBuilder.ts:221
- src/fable-library-ts/Date.ts:473 · src/fable-library-ts/Date.ts:492 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Date.ts:473
- src/fable-library-ts/Numeric.ts:57 · src/fable-library-ts/Numeric.ts:67 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — src/fable-library-ts/Numeric.ts:57
- REDACTED:85 · REDACTED:95 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — REDACTED:85
- src/fable-library-ts/Types.ts:163 · src/fable-library-ts/Types.ts:179 — the two spans are one implementation copied and then locally edited — 92 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — src/fable-library-ts/Types.ts:163
- src/fable-library-ts/Util.ts:269 · src/fable-library-ts/Util.ts:330 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Util.ts:269
- src/fable-library-ts/Char.ts:139 · src/fable-library-ts/Char.ts:149 · src/fable-library-ts/Char.ts:159 · src/fable-library-ts/Char.ts:169 · +1 more site(s) not listed — all 5 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/Char.ts:139
- src/fable-library-ts/DateTimeFormat.ts:381 · src/fable-library-ts/DateTimeFormat.ts:391 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/DateTimeFormat.ts:381
- src/fable-library-ts/Decimal.ts:179 · src/fable-library-ts/Decimal.ts:381 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — src/fable-library-ts/Decimal.ts:179
- src/fable-library-ts/Reflection.ts:493 · src/fable-library-ts/Reflection.ts:501 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — src/fable-library-ts/Reflection.ts:493
- src/fable-library-ts/CollectionUtil.ts:98 · src/fable-library-ts/CollectionUtil.ts:128 — all 2 copies are in the same file, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/CollectionUtil.ts:98
- src/fable-library-ts/CollectionUtil.ts:167 · src/fable-library-ts/Util.ts:1163 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — src/fable-library-ts/CollectionUtil.ts:167
What to do
- Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
R2 · Cyclomatic Complexity
- (anonymous) has cyclomatic complexity 65 and cognitive complexity 111; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:475
- dateToStringWithCustomFormat has cyclomatic complexity 65 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Date.ts:94
- dateToStringWithCustomFormat has cyclomatic complexity 58 and cognitive complexity 76; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateTimeFormat.ts:111
- formatReplacement has cyclomatic complexity 47 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:238
- hasValidDateParts has cyclomatic complexity 31 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateTimeFormat.ts:515
- parseRaw has cyclomatic complexity 27 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. (×2) — src/fable-library-ts/Date.ts:629, src/fable-library-ts/DateTimeFormat.ts:559
- walk has cyclomatic complexity 24 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:550
- evaluate has cyclomatic complexity 22 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:411
- parse has cyclomatic complexity 21 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpanTemporal.ts:243
- split has cyclomatic complexity 20 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:827
- parse has cyclomatic complexity 20 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpan.ts:192
- formatGeneral has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:429
- exprToString has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:518
- sub has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/quotation.ts:604
- toPlain has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Transfer.ts:36
- isValid has cyclomatic complexity 17 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Int32.ts:104
- ofPlain has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Transfer.ts:83
- parse has cyclomatic complexity 16 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateOnly.ts:76
- splitNumber has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/NumberStyles.ts:35
- parse has cyclomatic complexity 13 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/DateOnlyTemporal.ts:109
- (anonymous) has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:280
- op_Division has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Decimal.ts:333
- toString has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpan.ts:169
- (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:613
- compare has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:981
- parseStyled has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/BigInt.ts:199
- fit has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Decimal.ts:135
- structuralHash has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:816
- (anonymous) has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:165
- parse has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeOnly.ts:88
- roundToModeWithLimits has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:1064
- equals has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Util.ts:899
- fromFloat has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/Decimal.ts:520
- toString has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — src/fable-library-ts/TimeSpanTemporal.ts:221
R3 · Large Files
- src/fable-library-ts/Util.ts has 1372 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Util.ts:1
- REDACTED has 850 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
- src/fable-library-ts/Date.ts has 839 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Date.ts:1
- src/fable-library-ts/Reflection.ts has 740 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Reflection.ts:1
- src/fable-library-ts/quotation.ts has 617 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/quotation.ts:1
- src/fable-library-ts/DateTimeFormat.ts has 589 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/DateTimeFormat.ts:1
- src/fable-library-ts/Decimal.ts has 562 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — src/fable-library-ts/Decimal.ts:1
What to do
- Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
R5 · Dependency Freshness
R6 · Tooling
R7 · Dead Code
- 47 file(s) (~787 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package.
- 54 file(s) (~13579 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — src/fable-library-ts
- 1 file(s) (~6 LoC) were excluded from dead-code analysis — declare main/module/exports or a conventional entry (src/index.*, an index.html script) so reachability can see this package. — tests/React
- Unreachable from the 3 application, 11 tooling and 52 test entry point(s) detected in this repo. Gate removals on `npm run tsc` — an undetected custom entry would make these reachable.
- no import path from any entry point (3 application, 11 tooling, 52 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×2) — REDACTED, src/fable-standalone/src/Worker/util.js
What to do
- Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
R8 · Dependency Hygiene
- Declared in the root package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — package.json:28
- Declared in src/fable-compiler-js/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×3) — src/fable-compiler-js/package.json:27, src/fable-compiler-js/package.json:28, src/fable-compiler-js/package.json:31
- Declared in src/fcs-fable/test/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. — src/fcs-fable/test/package.json:13
- Declared in src/tools/source-maps/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2) — src/tools/source-maps/package.json:7, src/tools/source-maps/package.json:8
- Declared in tests/React/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×3) — tests/React/package.json:12, tests/React/package.json:14, tests/React/package.json:15
What to do
- Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
R9 · Circular Imports
- src/fable-library-ts/BigInt.ts → src/fable-library-ts/Decimal.ts → src/fable-library-ts/BigInt.ts — src/fable-library-ts/BigInt.ts:3
What to do
- Break each cycle by extracting the shared piece into a module both sides can import.
X14 · Bypassable address classification
Reference — by lens
| Lens | Score | Rating | Impact |
|---|---|---|---|
| Code Health | 63.1 | Adequate — gated by R10 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Architecture | 94.9 | Exemplary | Solid. |
| Maturity | 71.7 | Strong | Solid. |
| Readiness | 67.1 | Adequate | Acceptable, with room to improve. |
| Security | 72.3 | Adequate — gated by D29 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Event Sourcing | 100.0 | Exemplary | Strongest area. |
| Performance | 70.0 | Strong | Solid. |
Unscored — 3 check(s) recorded observations but carry no score
- SC1 Supply-chain hygiene — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
- X10 Duplicated predicate — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
- X6 Hand-rolled structured-format parsing — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for
- P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 74 check(s) not relevant to this codebase
- AC1 Text alternatives — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
- AC2 Forms & labels — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
- AC3 Page structure — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
- AC4 Keyboard semantics — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
- AC5 ARIA correctness — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
- AC6 Visual & motion safety — No user-facing web UI (the repo is a library/CLI/worker/headless service) — accessibility is not applicable.
- AX1 Captive dependencies — no DI registrations detected
- AX2 Stateful singletons — no singleton implementations detected
- AX7 Slice cohesion — not applicable — not a vertical-slice architecture
- AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
- AXR1 Runtime accessibility — docker build failed (exit 1) — 56 | # Trigger the dotnet first run experience by running a command 57 | >>> RUN source .zshrc && dotnet --help 58 | # Add dotnet zsh completion 59 | COPY scripts/zsh_dotnet_completion.sh /home/vscode/zsh_dotnet_completion.sh -------------------- ERROR: failed to solve: process "/bin/zsh -c source .zshrc && dotnet --help" did not complete successfully: exit code: 127; likely cause (the repository): a RUN step of the repository's REDACTED exited with code 127 (`/bin/zsh -c source .zshrc && dotnet --help`): the build's own command failed, for example a compile or test error; runtime evidence skipped The cause is in the repository, not in our sandbox: a RUN step of the repository's REDACTED exited with code 127 (`/bin/zsh -c source .zshrc && dotnet --help`): the build's own command failed, for example a compile or test error. Nothing here says the surface is inaccessible, only that it was never rendered.
- C1 Data Protection — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
- C2 Access Controls — No access-control surface detected in the analyzed source — no web/app surface to authorize (no HTTP API or web-UI project) and no authorization code at all (no [Authorize]/policies, no imperative guard methods). Access control is therefore N/A here — this is a library/CLI, which is authorized by its CALLER, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
- C3 Audit Trail — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
- C4 Data Retention — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
- C5 Data-Subject Rights — No personal data detected in the analyzed source — no PII-typed entity/column names (Email, FirstName, DateOfBirth, …), no ASP.NET Identity / user-account model, and no stored user credentials. GDPR data-protection controls are therefore N/A here. If this is intentional, record the no-PII posture in an ADR; if the app does process personal data, name those fields conventionally so this dimension activates.
- D1 Cyclomatic Complexity — Cyclomatic Complexity not included (time budget)
- D10 Test Quality — ~151702 lines of test source are present (.fs, .py, .ts, .js, .mjs) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
- D18 Solution Shape — D18 scores the shape of a C#/VB .NET solution, but this repository's production source is mostly .dart, .erl, .fs, .php, .py, .rs, .ts, which the C#/VB workspace does not load — the projects that loaded are an immaterial minority, so solution shape was not assessed for this repository. Not scored — this is a gap in the analyzer's reach, not a verdict about this repository.
- D2 Cognitive Complexity — Cognitive Complexity not included (time budget)
- D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed F#, JavaScript, Rust surface was not measured.
- D23 Boundary Type-Coupling — single shared-core project — no cross-context coupling to assess
- D25 ADR Conformance — no ADRs to check
- D3 God Classes — God Classes not included (time budget)
- D32 Data Compliance (PII/GDPR) — 30 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
- D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
- D4 Code Duplication — Code Duplication not included (time budget)
- D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
- D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
- D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
- D7 Architectural Integrity — no checkable ADRs and no dependency cycles — architectural integrity not assessed
- D8 Code Coverage — Coverage NOT MEASURED: the .NET half could not be measured — no coverage produced (collector absent, or test run exceeded the inline budget); the JavaScript/TypeScript half could not be measured — the jest suite in tests/React/ ran and not one test passed (No tests found, exiting with code 1), so the coverage would describe the failed run, not the code. This repository's production source spans both ecosystems, and no partial figure is published as if it were the whole: coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan.
- DM1 Domain Modelling — applicable but not scored (3 signals for this style, 3 needed — the count is met but a required primary signal is absent): 19 strongly-typed id(s); 1704 value object(s); 56 domain event(s); its domain events are published by services or handlers — no domain entity raises one; no aggregate is declared and no domain structure surrounds the state-guarding types: not claimed as DDD
- ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, which this analysis does not build from source alone for this language. Reported as guidance rather than measured
- ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
- ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
- ES2 Immutable events — not applicable — the code was read and holds no persisted event, so there is nothing for this check to judge
- IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
- P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
- P7 Outbound HTTP resilience — not applicable — this isn't a service/API/worker
- P8 Schema migrations — no EF Core usage detected
- P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
- PF1 Benchmark discipline — Performance is assessed only for perf-relevant repos — a packaged library, one that ships benchmarks, or one already using allocation-aware APIs. This repo isn't one, so the Performance lens is not applicable and is excluded from the score.
- PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
- R11 Import Boundaries — No recognizable feature-sliced/layered src layout — boundary rules not applicable.
- R4 Test Coverage — 52 test file(s) reach none of 58 production file(s) via imports — exercised outside the JS import graph (integration/bundled), not import-reachable
- S1 Web-Security Posture — No web surface detected in the analyzed source — no HTTP API or web-UI project (no controllers/minimal-API endpoints, no Razor/Blazor views) and no web middleware (HTTPS redirection, HSTS, security headers, cookies). Transport security, security headers, secure cookies, CSRF/input-validation and middleware-order controls are therefore N/A here — this is a library/CLI/worker, not a web app. Crypto hygiene was still checked and found nothing to flag. If this codebase becomes web-facing, the dimension reactivates automatically.
- X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X12 Unreachable branch — X12 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
- X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X16 Unfloored truncation loop — X16 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
- X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X2 Cancellation propagation — no async method does work a token could cancel
- X20 Mistyped argument guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X23 Unguarded diagnostic materialisation — X23 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
- X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X27 Collection changed while being enumerated — X27 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
- X28 Index access outside its own emptiness guard — X28 reached only 0% of this repository's production lines — fsharp (355,600 lines), rust (21,851 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
- X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X3 Exception handling — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X31 Test-only surface in a production module — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
- X32 Type resolved by simple name across every loaded assembly — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X4 Structured logging — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- X5 Nullable reference types — X5 reached only 5% of this repository's production lines — fsharp (355,600 lines), typescript (11,934 lines), python (11,726 lines), erlang (10,495 lines), dart (3,696 lines), php (1,973 lines), javascript (982 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
- X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score.
- X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
Critical — 114 finding(s)
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- Orphaned knowledge src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:1
- Orphaned knowledge src/fcs-fable/src/Compiler/Checking/infos.fs:1
- Orphaned knowledge src/fcs-fable/src/Compiler/Symbols/Exprs.fs:1
- Orphaned knowledge src/fcs-fable/src/Compiler/Optimize/InnerLambdasToTopLevelFuncs.fs:1
- Orphaned knowledge src/fcs-fable/src/Compiler/Checking/SignatureConformance.fs:1
- Orphaned knowledge src/Fable.Transforms/Dart/DartPrinter.fs:1
- Orphaned knowledge src/Fable.PublishUtils/PublishUtils.fs:1
- Orphaned knowledge src/fable-library-php/Set.php:1
- Boundary-crossing change coupling: Replacements.fs ↔ Mutable.rs src/Fable.Transforms/Rust/Replacements.fs:1
- Boundary-crossing change coupling: Replacements.fs ↔ Option.fs src/Fable.Transforms/Rust/Replacements.fs:1
- Boundary-crossing change coupling: Replacements.fs ↔ double.py src/Fable.Transforms/Python/Replacements.fs:1
- Boundary-crossing change coupling: DartPrinter.fs ↔ Util.dart src/Fable.Transforms/Dart/DartPrinter.fs:1
- REDACTED
- REDACTED
- Test suite declares a test script but contains no test files: tests/React/
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- Import cycle (2 files) src/fable-library-ts/BigInt.ts:3
Serious — 224 finding(s)
- Hotspot: src/Fable.Transforms/Replacements.fs src/Fable.Transforms/Replacements.fs:2345
- Hotspot: src/Fable.Transforms/Beam/Replacements.fs src/Fable.Transforms/Beam/Replacements.fs:5865
- Hotspot: src/Fable.Transforms/Babel/Fable2Babel.fs src/Fable.Transforms/Babel/Fable2Babel.fs:3192
- Hotspot: src/Fable.Transforms/FSharp2Fable.Util.fs src/Fable.Transforms/FSharp2Fable.Util.fs:3773
- Hotspot: src/Fable.Transforms/Transforms.Util.fs src/Fable.Transforms/Transforms.Util.fs:1962
- Hotspot: src/Fable.Transforms/Rust/Replacements.fs src/Fable.Transforms/Rust/Replacements.fs:1389
- Hotspot: src/Fable.Transforms/Python/Replacements.fs src/Fable.Transforms/Python/Replacements.fs:1148
- Hotspot: REDACTED REDACTED:465
- Hotspot: src/Fable.Cli/Main.fs src/Fable.Cli/Main.fs:1787
- Hotspot: src/Fable.Transforms/Rust/Fable2Rust.fs src/Fable.Transforms/Rust/Fable2Rust.fs:1150
- Hotspot: src/Fable.Transforms/Dart/Replacements.fs src/Fable.Transforms/Dart/Replacements.fs:976
- Hotspot: src/Fable.Transforms/Beam/Fable2Beam.fs src/Fable.Transforms/Beam/Fable2Beam.fs:316
- Hotspot: src/Fable.Transforms/Babel/BabelPrinter.fs src/Fable.Transforms/Babel/BabelPrinter.fs:509
- Hotspot: src/fable-library-ts/Util.ts src/fable-library-ts/Util.ts:256
- Hotspot: src/Fable.Transforms/Python/Fable2Python.Transforms.fs src/Fable.Transforms/Python/Fable2Python.Transforms.fs:930
- Hotspot: src/Fable.Cli/Entry.fs src/Fable.Cli/Entry.fs:370
- Hotspot: src/fable-standalone/src/Worker/Worker.fs src/fable-standalone/src/Worker/Worker.fs:339
- Hotspot: src/Fable.Compiler/ProjectCracker.fs src/Fable.Compiler/ProjectCracker.fs:1104
- Hotspot: src/Fickl.Declarations/Declarations.fs src/Fickl.Declarations/Declarations.fs:592
- Hotspot: src/Fable.Transforms/Replacements.Util.fs src/Fable.Transforms/Replacements.Util.fs:1490
- Hotspot: src/Fable.Transforms/FableTransforms.fs src/Fable.Transforms/FableTransforms.fs:86
- Hotspot: src/Fable.Transforms/Dart/Fable2Dart.fs src/Fable.Transforms/Dart/Fable2Dart.fs:826
- Hotspot: src/Fable.Transforms/Beam/Fable2Beam.Util.fs src/Fable.Transforms/Beam/Fable2Beam.Util.fs:199
- Hotspot: src/Fable.Compiler/MSBuildCrackerResolver.fs src/Fable.Compiler/MSBuildCrackerResolver.fs:352
- Hotspot: src/Fable.Cli/Pipeline.fs src/Fable.Cli/Pipeline.fs:281
- NuGet dependencies are not locked docs/docs.fsproj:21
- NuGet dependencies are not locked notes/benchmarks/core-runtime/allocations/Allocations.csproj:3
- NuGet dependencies are not locked notes/benchmarks/watch-latency/throttle-race/ThrottleRace.fsproj:14
- NuGet dependencies are not locked notes/benchmarks/workloads/beam/App.fsproj:10
- NuGet dependencies are not locked notes/benchmarks/workloads/py/App.fsproj:10
- NuGet dependencies are not locked src/Directory.Build.props:26
- NuGet dependencies are not locked src/Fable.AST/Fable.AST.fsproj:15
- NuGet dependencies are not locked src/Fable.Analyzers/Fable.Analyzers.fsproj:13
- NuGet dependencies are not locked src/Fable.Build/Fable.Build.fsproj:49
- NuGet dependencies are not locked src/Fable.Cli/Fable.Cli.fsproj:62
- NuGet dependencies are not locked src/Fable.Compiler/Fable.Compiler.fsproj:39
- NuGet dependencies are not locked src/Fable.Core/Fable.Core.fsproj:31
- NuGet dependencies are not locked src/Fable.PublishUtils/Fable.PublishUtils.fsproj:12
- NuGet dependencies are not locked src/Fable.Transforms/Rust/AST/Tests/Rust.AST.Tests.fsproj:25
- NuGet dependencies are not locked src/Fickl.Build/Fickl.Build.fsproj:21
- NuGet dependencies are not locked src/fable-compiler-js/src/fable-compiler-js.fsproj:10
- NuGet dependencies are not locked src/fable-standalone/src/Fable.Standalone.fsproj:13
- NuGet dependencies are not locked src/fable-standalone/src/Worker/Worker.fsproj:14
- NuGet dependencies are not locked src/fable-standalone/test/bench-compiler/bench-compiler.fsproj:45
- NuGet dependencies are not locked src/fcs-fable/codegen/codegen.fsproj:49
- NuGet dependencies are not locked src/fcs-fable/fcs-fable.fsproj:427
- NuGet dependencies are not locked src/fcs-fable/src/Compiler/FSharp.Compiler.Service.fsproj:599
- NuGet dependencies are not locked src/fcs-fable/test/bench/fcs-fable-bench.fsproj:23
- NuGet dependencies are not locked src/fcs-fable/test/fcs-fable-test.fsproj:21
- NuGet dependencies are not locked src/tools/ASTViewer/ASTViewer.fsproj:12
- Repeated repair: src/Fable.Transforms/FSharp2Fable.fs src/Fable.Transforms/FSharp2Fable.fs:4598
- Repeated repair: src/Fable.Transforms/State.fs src/Fable.Transforms/State.fs:216
- Repeated repair: src/fable-library-ts/Decimal.ts src/fable-library-ts/Decimal.ts:333
- Repeated repair: src/fable-library-rust/src/Native.rs src/fable-library-rust/src/Native.rs:405
- Repeated repair: src/fable-library-ts/Async.ts src/fable-library-ts/Async.ts:194
- Repeated repair: src/fable-library-py/fable_library/async_.py src/fable-library-py/fable_library/async_.py:85
- Repeated repair: src/fable-library-ts/Numeric.ts src/fable-library-ts/Numeric.ts:79
- Repeated repair: src/Fable.Compiler/Library.fs src/Fable.Compiler/Library.fs:169
- Repeated repair: src/fable-library-rust/src/Reflection.rs src/fable-library-rust/src/Reflection.rs:78
- Repeated repair: src/fable-library-ts/AsyncBuilder.ts src/fable-library-ts/AsyncBuilder.ts:214
- Repeated repair: src/fable-library-ts/BigInt.ts src/fable-library-ts/BigInt.ts:199
- Repeated repair: src/fable-library-beam/fable_list.erl src/fable-library-beam/fable_list.erl:835
- Repeated repair: src/fable-library-ts/Double.ts src/fable-library-ts/Double.ts:10
- Repeated repair: src/fable-library-py/fable_library/async_builder.py src/fable-library-py/fable_library/async_builder.py:64
- Repeated repair: src/fable-library-beam/fable_utils.erl src/fable-library-beam/fable_utils.erl:288
- Repeated repair: src/fable-library-rust/src/Async.rs src/fable-library-rust/src/Async.rs:485
- Repeated repair: src/fable-library-dart/Array.fs src/fable-library-dart/Array.fs:1295
- Repeated repair: src/Fable.Transforms/Rust/AST/Rust.AST.Helpers.fs src/Fable.Transforms/Rust/AST/Rust.AST.Helpers.fs:340
- Repeated repair: src/fable-library-ts/DateOnlyTemporal.ts src/fable-library-ts/DateOnlyTemporal.ts:109
- Repeated repair: src/fable-library-rust/src/String.rs src/fable-library-rust/src/String.rs:657
- Repeated repair: src/fable-library-ts/Encoding.ts src/fable-library-ts/Encoding.ts:26
- Repeated repair: src/fable-library-dart/List.fs src/fable-library-dart/List.fs:453
- Repeated repair: src/fable-library-py/fable_library/List.fs src/fable-library-py/fable_library/List.fs:470
- Repeated repair: src/fable-library-ts/MailboxProcessor.ts src/fable-library-ts/MailboxProcessor.ts:82
- Repeated repair: src/fable-library-py/fable_library/mailbox_processor.py src/fable-library-py/fable_library/mailbox_processor.py:155
- Change coupling: HashMap.rs ↔ HashSet.rs src/fable-library-rust/src/HashMap.rs:1
- Change coupling: MutableMap.fs ↔ MutableSet.fs src/fable-library-ts/MutableMap.fs:1
- Change coupling: Array.fs ↔ List.fs src/fable-library-rust/src/Array.fs:1
- Change coupling: Interfaces.fs ↔ Native.rs src/fable-library-rust/src/Interfaces.fs:1
- Change coupling: numeric.py ↔ string_.py src/fable-library-py/fable_library/numeric.py:1
- Change coupling: BigInt.rs ↔ Decimal.rs src/fable-library-rust/src/BigInt.rs:1
- Change coupling: HashSet.rs ↔ String.rs src/fable-library-rust/src/HashSet.rs:1
- Duplicated block (9 lines × 2 locations) src/fable-library-ts/AsyncBuilder.ts:221
- Duplicated block (9 lines × 2 locations) src/fable-library-ts/Date.ts:473
- Duplicated block (9 lines × 2 locations) src/fable-library-ts/Numeric.ts:57
- Duplicated block (9 lines × 2 locations) REDACTED:85
- Duplicated block (9 lines × 2 locations) src/fable-library-ts/Util.ts:269
- Duplicated block (12 lines × 2 locations) src/fable-library-ts/Date.ts:104
- Duplicated block (12 lines × 2 locations) src/fable-library-ts/DateTimeFormat.ts:121
- Duplicated block (12 lines × 2 locations) src/fable-library-ts/Encoding.ts:108
- Duplicated block (10 lines × 2 locations) src/fable-library-ts/Char.ts:81
- Duplicated block (10 lines × 2 locations) src/fable-library-ts/DateTimeOffsetTemporal.ts:302
- Duplicated block (10 lines × 2 locations) src/fable-library-ts/TimeSpan.ts:38
- Duplicated block (7 lines × 2 locations) src/fable-library-ts/DateTimeFormat.ts:381
- Duplicated block (7 lines × 2 locations) src/fable-library-ts/Decimal.ts:179
- Duplicated block (7 lines × 2 locations) src/fable-library-ts/Reflection.ts:493
- REDACTED
- REDACTED
- Sync-over-async blocking src/fcs-fable/src/Compiler/Facilities/BuildGraph.fs:64
- Sync-over-async blocking src/fcs-fable/src/Compiler/Facilities/DiagnosticsLogger.fs:1069
- Duplicated block (21 lines × 3 locations) src/fable-library-ts/Date.ts:178
- Duplicated block (21 lines × 3 locations) src/fable-library-ts/DateTimeFormat.ts:178
- Duplicated block (15 lines × 2 locations) src/fable-library-ts/Date.ts:157
- Duplicated block (15 lines × 2 locations) src/fable-library-ts/Observable.ts:76
- Duplicated block (13 lines × 2 locations) src/fable-library-ts/DateOnlyTemporal.ts:75
- Duplicated block (13 lines × 2 locations) src/fable-library-ts/TimeSpan.ts:233
- Duplicated block (10 lines × 3 locations) src/fable-library-ts/BitConverter.ts:90
- Duplicated block (10 lines × 3 locations) src/fable-library-ts/Date.ts:410
- Duplicated block (6 lines × 2 locations) src/fable-library-ts/CollectionUtil.ts:98
- Duplicated block (6 lines × 2 locations) src/fable-library-ts/CollectionUtil.ts:167
- Complex function parseRaw (cyclomatic 27, cognitive 50) src/fable-library-ts/Date.ts:629
- Complex function parseRaw (cyclomatic 27, cognitive 50) src/fable-library-ts/DateTimeFormat.ts:559
- CommentedOutCode REDACTED:44
- REDACTED
- REDACTED
- REDACTED
- Change-coupling hub: Option.fs → Array.fs, List.fs, Native.rs src/fable-library-rust/src/Option.fs
- Change coupling clique: Async.ts, Observable.ts, Timer.ts src/fable-library-ts/Async.ts
- REDACTED
- REDACTED
- Coverage not measured — .NET and JavaScript/TypeScript suite
- Duplicated block with local edits (139 matched lines × 2 locations) src/fable-library-ts/Date.ts:719
- Duplicated block (83 lines × 2 locations) src/fable-library-ts/Date.ts:629
- Duplicated block (57 lines × 2 locations) src/fable-library-ts/Date.ts:304
- Duplicated block with local edits (45 matched lines × 2 locations) src/fable-library-ts/Transfer.ts:36
- Duplicated block (36 lines × 2 locations) src/fable-library-ts/TimeSpan.ts:192
- Duplicated block (35 lines × 2 locations) src/fable-library-ts/DateOnly.ts:76
- Duplicated block (34 lines × 2 locations) src/fable-library-ts/Date.ts:59
- Duplicated block with local edits (21 matched lines × 2 locations) src/fable-library-ts/Rune.ts:210
- Duplicated block (18 lines × 2 locations) src/fable-library-ts/Util.ts:773
- Duplicated block with local edits (14 matched lines × 2 locations) src/fable-library-ts/Uri.ts:101
- Duplicated block (12 lines × 4 locations) src/fable-library-ts/BitConverter.ts:21
- Duplicated block (12 lines × 3 locations) src/fable-library-ts/TimeOnly.ts:99
- Duplicated block with local edits (12 matched lines × 2 locations) src/fable-library-ts/TimeOnly.ts:7
- Duplicated block (11 lines × 2 locations) src/fable-library-ts/Date.ts:613
- Duplicated block with local edits (9 matched lines × 2 locations) src/fable-library-ts/Types.ts:163
- Duplicated block (8 lines × 5 locations) src/fable-library-ts/Char.ts:139
- Complex function (anonymous) (cyclomatic 65, cognitive 111) REDACTED:475
- Complex function dateToStringWithCustomFormat (cyclomatic 65, cognitive 87) src/fable-library-ts/Date.ts:94
- Complex function dateToStringWithCustomFormat (cyclomatic 58, cognitive 76) src/fable-library-ts/DateTimeFormat.ts:111
- Complex function formatReplacement (cyclomatic 47, cognitive 58) REDACTED:238
- Complex function hasValidDateParts (cyclomatic 31, cognitive 32) src/fable-library-ts/DateTimeFormat.ts:515
- Complex function walk (cyclomatic 24, cognitive 28) src/fable-library-ts/quotation.ts:550
- Complex function evaluate (cyclomatic 22, cognitive 26) src/fable-library-ts/quotation.ts:411
- Complex function parse (cyclomatic 21, cognitive 30) src/fable-library-ts/TimeSpanTemporal.ts:243
- Complex function split (cyclomatic 20, cognitive 37) REDACTED:827
- Complex function parse (cyclomatic 20, cognitive 27) src/fable-library-ts/TimeSpan.ts:192
- Complex function formatGeneral (cyclomatic 20, cognitive 26) REDACTED:429
- Complex function exprToString (cyclomatic 20, cognitive 26) src/fable-library-ts/quotation.ts:518
- Complex function sub (cyclomatic 20, cognitive 21) src/fable-library-ts/quotation.ts:604
- Complex function toPlain (cyclomatic 18, cognitive 17) src/fable-library-ts/Transfer.ts:36
- Complex function isValid (cyclomatic 17, cognitive 19) src/fable-library-ts/Int32.ts:104
- Complex function ofPlain (cyclomatic 17, cognitive 15) src/fable-library-ts/Transfer.ts:83
- Complex function parse (cyclomatic 16, cognitive 36) src/fable-library-ts/DateOnly.ts:76
- Complex function splitNumber (cyclomatic 14, cognitive 14) src/fable-library-ts/NumberStyles.ts:35
- Complex function parse (cyclomatic 13, cognitive 38) src/fable-library-ts/DateOnlyTemporal.ts:109
- Complex function (anonymous) (cyclomatic 13, cognitive 18) src/fable-library-ts/Util.ts:280
- Complex function op_Division (cyclomatic 13, cognitive 14) src/fable-library-ts/Decimal.ts:333
- Complex function toString (cyclomatic 13, cognitive 13) src/fable-library-ts/TimeSpan.ts:169
- Complex function (anonymous) (cyclomatic 12, cognitive 16) REDACTED:613
- Complex function compare (cyclomatic 12, cognitive 16) src/fable-library-ts/Util.ts:981
- Complex function parseStyled (cyclomatic 12, cognitive 13) src/fable-library-ts/BigInt.ts:199
- Complex function fit (cyclomatic 12, cognitive 13) src/fable-library-ts/Decimal.ts:135
- Complex function structuralHash (cyclomatic 12, cognitive 13) src/fable-library-ts/Util.ts:816
- Complex function (anonymous) (cyclomatic 12, cognitive 12) REDACTED:165
- Complex function parse (cyclomatic 12, cognitive 10) src/fable-library-ts/TimeOnly.ts:88
- Complex function roundToModeWithLimits (cyclomatic 12, cognitive 9) src/fable-library-ts/Util.ts:1064
- Complex function equals (cyclomatic 11, cognitive 11) src/fable-library-ts/Util.ts:899
- Complex function fromFloat (cyclomatic 11, cognitive 10) src/fable-library-ts/Decimal.ts:520
- Complex function toString (cyclomatic 11, cognitive 10) src/fable-library-ts/TimeSpanTemporal.ts:221
- src/fable-library-ts/Util.ts: 1372 lines of code src/fable-library-ts/Util.ts:1
- REDACTED: 850 lines of code REDACTED:1
- src/fable-library-ts/Date.ts: 839 lines of code src/fable-library-ts/Date.ts:1
- src/fable-library-ts/Reflection.ts: 740 lines of code src/fable-library-ts/Reflection.ts:1
- src/fable-library-ts/quotation.ts: 617 lines of code src/fable-library-ts/quotation.ts:1
- src/fable-library-ts/DateTimeFormat.ts: 589 lines of code src/fable-library-ts/DateTimeFormat.ts:1
- src/fable-library-ts/Decimal.ts: 562 lines of code src/fable-library-ts/Decimal.ts:1
- Dead file (~72 LoC) REDACTED
- Dead file (~31 LoC) src/fable-standalone/src/Worker/util.js
- Unused dependency 'ghreleases' package.json:28
- Unused dependency '@fable-org/fable-metadata' src/fable-compiler-js/package.json:27
- Unused dependency '@fable-org/fable-standalone' src/fable-compiler-js/package.json:28
- Unused dependency 'esbuild' src/fable-compiler-js/package.json:31
- Unused dependency 'fable-compiler-js' src/fcs-fable/test/package.json:13
- Unused dependency '@matthid/source-map-visualization' src/tools/source-maps/package.json:7
- Unused dependency 'source-map-support' src/tools/source-maps/package.json:8
- Unused dependency '@fluentui/react' tests/React/package.json:12
- Unused dependency '@testing-library/react' tests/React/package.json:14
- Unused dependency '@testing-library/user-event' tests/React/package.json:15
Minor — 153 finding(s)
- Duplicated predicate src/fcs-fable/src/Compiler/Checking/PostInferenceChecks.fs:1521
- Duplicated predicate src/fable-library-beam/Range.fs:15
- Duplicated predicate src/fable-library-ts/Seq.fs:122
- Duplicated predicate src/fable-library-dart/Array.fs:777
- Duplicated predicate src/Fable.Transforms/Dart/Fable2Dart.fs:349
- Duplicated predicate src/Fable.Transforms/Babel/Fable2Babel.fs:2049
- Duplicated predicate src/Fable.Transforms/Babel/Fable2Babel.fs:8863
- Duplicated predicate src/Fable.Cli/Entry.fs:539
- Duplicated predicate src/Fable.Transforms/Dart/Replacements.fs:4273
- Duplicated predicate src/fcs-fable/src/Compiler/Checking/CheckFormatStrings.fs:451
- Duplicated predicate src/fcs-fable/src/Compiler/Checking/PostInferenceChecks.fs:2602
- Duplicated predicate src/fable-library-dart/System.Text.fs:106
- Duplicated predicate src/fable-library-beam/Seq.fs:1286
- Duplicated predicate src/Fable.Transforms/FSharp2Fable.Util.fs:4302
- Duplicated predicate src/fable-library-beam/Seq.fs:543
- Duplicated predicate src/fcs-fable/src/Compiler/Checking/ConstraintSolver.fs:2217
- Duplicated predicate src/Fable.Compiler/ProjectCracker.fs:465
- Duplicated predicate src/fcs-fable/src/Compiler/Driver/ScriptClosure.fs:440
- Duplicated predicate src/fable-library-dart/Array.fs:207
- Duplicated predicate src/Fable.Cli/Printers.fs:36
- Duplicated predicate src/fcs-fable/src/Compiler/CodeGen/IlxGen.fs:5703
- Duplicated predicate src/fcs-fable/src/Compiler/Driver/fsc.fs:533
- Duplicated predicate src/fcs-fable/src/Compiler/Service/IncrementalBuild.fs:851
- Duplicated predicate src/fcs-fable/src/Compiler/Utilities/sformat.fs:464
- Duplicated predicate src/fcs-fable/src/Compiler/Checking/AugmentWithHashCompare.fs:1430
- Outdated (npm): @asamuzakjp/css-color
- Outdated (npm): @types/jsdom
- Outdated (npm): ansi-escapes
- Outdated (npm): bl
- Outdated (npm): camelcase
- Outdated (npm): chokidar
- Outdated (npm): commander
- Outdated (npm): data-urls
- Outdated (npm): entities
- Outdated (npm): escape-string-regexp
- Outdated (npm): execa
- Outdated (npm): find-up
- Outdated (npm): get-stream
- Outdated (npm): html-encoding-sniffer
- Outdated (npm): human-signals
- Outdated (npm): js-tokens
- Outdated (npm): jsdom tests/React/package.json:7
- Outdated (npm): json-parse-even-better-errors
- Outdated (npm): locate-path
- Outdated (npm): mimic-fn
- Outdated (npm): onetime
- Outdated (npm): p-limit
- Outdated (npm): p-locate
- Outdated (npm): parse-json
- Outdated (npm): pkg-dir
- Orphaned file src/fcs-fable/service_slim.fs:1
- Orphaned file src/Fable.Transforms/Php/PhpPrinter.fs:1
- Orphaned file src/fcs-fable/src/Compiler/Checking/AccessibilityLogic.fs:1
- Orphaned file src/fcs-fable/src/Compiler/TypedTree/QuotationPickler.fs:1
- Orphaned file src/fcs-fable/src/Compiler/Service/ServiceAssemblyContent.fs:1
- Orphaned file src/fcs-fable/src/Compiler/Utilities/lib.fs:1
- Orphaned file src/fable-library-dart/Date.dart:1
- Orphaned file src/fable-library-php/Map.php:1
- Orphaned file src/fable-library-php/List.php:1
- Orphaned file src/fcs-fable/src/Compiler/Optimize/LowerLocalMutables.fs:1
- Orphaned file src/fcs-fable/src/Compiler/Symbols/SymbolPatterns.fs:1
- Orphaned file src/fcs-fable/src/Compiler/TypedTree/tainted.fs:1
- Orphaned file src/Fable.Transforms/Replacements.Api.fs:1
- Orphaned file src/fable-library-ts/Uri.ts:1
- Orphaned file src/fcs-fable/src/Compiler/Service/ExternalSymbol.fs:1
- Orphaned file src/fable-library-dart/RegExp.dart:1
- Orphaned file src/fcs-fable/src/Compiler/Utilities/EditDistance.fs:1
- Orphaned file src/fcs-fable/ast_print.fs:1
- Orphaned file src/fable-library-php/Serialization.php:1
- Orphaned file src/fable-library-php/Util.php:1
- Orphaned file src/Fable.Transforms/Printer.fs:1
- Orphaned file src/tools/ASTViewer/ASTViewer.fs:1
- Orphaned file src/fcs-fable/src/Compiler/Facilities/ReferenceResolver.fs:1
- Orphaned file src/Fable.AST/Common.fs:1
- Orphaned file src/fable-library-php/Seq.php:1
- Fat interface: NumericArray (19 required operations) src/fable-library-ts/Util.ts:9
- Fat interface: ObjectConstructor (18 abstract members) src/Fable.Core/Fable.Core.JS.fs:196
- Fat interface: Math (43 abstract members) src/Fable.Core/Fable.Core.JS.fs:229
- Fat interface: Date (43 abstract members) src/Fable.Core/Fable.Core.JS.fs:274
- Fat interface: DataView (23 abstract members) src/Fable.Core/Fable.Core.JS.fs:472
- Fat interface: TypedArray`1<T> (19 abstract members) src/Fable.Core/Fable.Core.JS.fs:523
- Fat interface: Console (19 abstract members) src/Fable.Core/Fable.Core.JS.fs:750
- Fat interface: MemberFunctionOrValue (26 abstract members) src/Fable.AST/Fable.fs:119
- Fat interface: Entity (29 abstract members) src/Fable.AST/Fable.fs:149
- Fat interface: Compiler (19 abstract members) src/Fable.Transforms/Global/Compiler.fs:70
- Fat interface: IBabelCompiler (18 abstract members) src/Fable.Transforms/Babel/Fable2Babel.fs:77
- Fat interface: IPhpCompiler (27 abstract members) src/Fable.Transforms/Php/Fable2Php.fs:11
- Fat interface: IBackgroundCompiler (25 abstract members) src/fcs-fable/src/Compiler/Service/BackgroundCompiler.fs:36
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- REDACTED
- Off-boarding risk: anonymized user #1
- Off-boarding risk: anonymized user #2
- Off-boarding risk: anonymized user #3
- Off-boarding risk: anonymized user #4
- Off-boarding risk: anonymized user #5
- Documentation: no build, run or usage example src/fable-library-py/README.md:1
- Documentation: no build, run or usage example src/fable-library-rust/README.md:1
- Documentation: no build, run or usage example src/fable-library-ts/README.md:1
- Documentation: no build, run or usage example src/fable-metadata/README.md:1
- `test Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` tests/Beam/ArithmeticTests.fs:790
- `test Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` tests/Python/TestArithmetic.fs:285
- Hand-rolled JSON/XML parsing via regex src/Fable.Transforms/Printer.fs:12
- Hand-rolled JSON/XML parsing via regex src/Fable.PublishUtils/PublishUtils.fs:367
- Outdated: FSharp.Core docs/docs.fsproj:30
- Further sole-owners (lower concentration)
- No ADRs found docs/docs.fsproj:3
- `messageID` spells `ID` where 61 names in the project spell it `Id` src/fcs-fable/SR.fs:33
- `et_STRING` spells `STRING` where 41 names in the project spell it `string` src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:328
- `nt_STRUCT` spells `STRUCT` where 12 names in the project spell it `struct` src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:853
- `e_IMAGE_CEE_CS_CALLCONV_GENERIC` spells `GENERIC` where 42 names in the project spell it `generic` src/fcs-fable/src/Compiler/AbstractIL/ilbinary.fs:1060
- `portablePDB` spells `PDB` where 25 names in the project spell it `Pdb` src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:3819
- `embeddedPDB` spells `PDB` where 25 names in the project spell it `Pdb` src/fcs-fable/src/Compiler/AbstractIL/ilwrite.fs:3820
- `test Passing a function reference in a TCO context does not capture unneeded outer args` spells `TC` where 13 names in the project spell it `Tc` tests/Python/TestTailCall.fs:298
- `Bitwise NOT on large unsigned integer works` spells `NO` where 173 names in the project spell it `No` tests/Rust/tests/src/ArithmeticTests.fs:135
- REDACTED
- Further orphaned files (smaller)
- REDACTED
- REDACTED
- No ADRs
- Logging is not universal
Minor — 223 finding(s)
- Outdated (npm): @adobe/css-tools
- Outdated (npm): @babel/code-frame
- Outdated (npm): @babel/compat-data
- Outdated (npm): @babel/core
- Outdated (npm): @babel/generator
- Outdated (npm): @babel/helper-annotate-as-pure
- Outdated (npm): @babel/helper-compilation-targets
- Outdated (npm): @babel/helper-globals
- Outdated (npm): @babel/helper-module-imports
- Outdated (npm): @babel/helper-module-transforms
- Outdated (npm): @babel/helper-plugin-utils
- Outdated (npm): @babel/helper-string-parser
- Outdated (npm): @babel/helper-validator-identifier
- Outdated (npm): @babel/helper-validator-option
- Outdated (npm): @babel/helpers
- Outdated (npm): @babel/parser
- Outdated (npm): @babel/plugin-syntax-jsx
- Outdated (npm): @babel/plugin-syntax-typescript
- Outdated (npm): @babel/plugin-transform-modules-commonjs
- Outdated (npm): @babel/plugin-transform-react-jsx
- Outdated (npm): @babel/runtime
- Outdated (npm): @babel/template
- Outdated (npm): @babel/traverse
- Outdated (npm): @babel/types
- Outdated (npm): @bcoe/v8-coverage
- Outdated: G-Research.FSharp.Analyzers
- Outdated: Ionide.Analyzers
- Outdated: Microsoft.SourceLink.GitHub
- Outdated: Microsoft.Extensions.Logging.Console
- Outdated: AltCover
- Outdated: FSharp.Data.Adaptive
- Outdated: Microsoft.NET.Test.Sdk
- Outdated: xunit.v3.mtp-off
- Outdated: Microsoft.Extensions.FileSystemGlobbing
- Outdated: Microsoft.Extensions.Logging.Abstractions
- Outdated: FSharp.Analyzers.SDK
Appendix B — Reproduction & audit trail
| Dimension | Tool | Version | Command | Findings | Raw output |
|---|---|---|---|---|---|
| D28 · Secrets (history) | gitleaks | — | gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history.json --exit-code 0 --source . | 0 | artifacts/raw/gitleaks-history.json |
| D28 · Secrets (history) | gitleaks | — | gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history-1.json --exit-code 0 --source . | 0 | artifacts/raw/gitleaks-history-1.json |
| D28 · Secrets (history) | gitleaks | — | gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=3200" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history-2.json --exit-code 0 --source . | 0 | artifacts/raw/gitleaks-history-2.json |
| D28 · Secrets (history) | gitleaks | — | gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=4200 --max-count=3996" --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/history-3.json --exit-code 0 --source . | 0 | artifacts/raw/gitleaks-history-3.json |
| D28 · Secrets (history) | gitleaks | — | gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-dbc7f2fea2d245bb99d995e2d6c0412c/tree.json --exit-code 0 --source . | 0 | artifacts/raw/gitleaks-tree.json |
| D29 · Static Analysis (SAST) | semgrep | — | semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt . | 102 | artifacts/raw/semgrep.json |
| D30 · Dependency Vulnerabilities | dotnet | — | dotnet list Fable.sln package --vulnerable --include-transitive --format json | 4 | artifacts/raw/dotnet-vulnerable.json |
| D31 · IaC & Container Security | trivy | — | trivy config --format json --quiet . | 13 | artifacts/raw/trivy-config.json |
| D32 · Data Compliance (PII/GDPR) | semgrep | — | semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 30 file(s) — `src/fable-library-py/fable_library/async_.py`, `src/fable-library-py/fable_library/async_builder.py`, `src/fable-library-py/fable_library/bases.py`, `src/fable-library-py/fable_library/choice.pyi`, `src/fable-library-py/fable_library/core/array.pyi`, … (+25 more) — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real. | 0 | — |
| D37 · Vulnerability-disclosure Policy | disclosure | — | disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed. | 0 | — |
| D40 · Network Egress Confinement | runtime-hardening | — | runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here. | 0 | — |
| D41 · Kernel & Syscall Confinement | runtime-hardening | — | runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here. | 0 | — |
| D42 · Runtime Threat Enforcement | runtime-hardening | — | runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here. | 0 | — |
| D43 · Malicious Dependencies | trivy | — | trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . | 0 | artifacts/raw/trivy-fs.json |