Executive summary
flashbots/mosaik falls short of our standard for production because we found no working pipeline that builds or tests changes to the code and no automated security scanning of the code, its secrets or its dependencies. It scores 55.8 out of 100 and is rated Adequate, and its one critical finding doesn't concern security.
Production Readiness, at 36.9, is the weakest lens and counts most in the score. The best first step for the work it takes is recording design decisions, worth about 5.9 points. Adding an automated build and test pipeline would lift Production Readiness itself, worth about 8.9 points. Raising Production Readiness to 70 would lift the score to about 68.5.
The critical findings are small groups of different kinds, each listed in the report.
The product code is 31,801 lines, about €46,000 to rebuild.
If Production Readiness rose from 36.9 to 70, the lowest score rated Strong, the score would rise from 55.8 to about 68.5.
Rebuild cost: about €46,000 · Estimate
| Cost to rebuild | €15,000 to €77,000, for 254 to 806 hours of work, about 0.3 person-years for one engineer |
|---|---|
| Difficulty of the problem | Standard, 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.8 at a score of 56. 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 | Medium: 31,801 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 — module dependency graph
Architecture: which parts of the code depend on which
| uses → | 1 collections.config | 2 groups.cursor | 3 network.local | 4 primitives.channel | 5 collections.primitives | 6 groups.builder | 7 groups.raft.protocol | 8 network.link | 9 tickets.ticket | 10 collections.when | 11 discovery.entry | 12 groups | 13 groups.bond.protocol | 14 streams.consumer.receiver | 15 streams.producer.sender | 16 groups.group.state | 17 groups.bond | 18 groups.machine.sync | 19 groups.machine | 20 groups.group | 21 collections.vec | 22 collections.sync.session | 23 groups.raft.shared | 24 collections.sync | 25 discovery.announce | 26 discovery.catalog | 27 discovery.worker | 28 discovery | 29 groups.bond.worker | 30 groups.group.worker | 31 streams.producer.worker | 32 streams | 33 network | 34 streams.consumer.worker | 35 collections | 36 collections.cell | 37 collections.depq | 38 collections.map | 39 collections.once | 40 collections.set |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 collections.config | ||||||||||||||||||||||||||||||||||||||||
| 2 groups.cursor | ||||||||||||||||||||||||||||||||||||||||
| 3 network.local | ||||||||||||||||||||||||||||||||||||||||
| 4 primitives.channel | ||||||||||||||||||||||||||||||||||||||||
| 5 collections.primitives | 1 | |||||||||||||||||||||||||||||||||||||||
| 6 groups.builder | 1 | 1 | ||||||||||||||||||||||||||||||||||||||
| 7 groups.raft.protocol | 10 | |||||||||||||||||||||||||||||||||||||||
| 8 network.link | 1 | |||||||||||||||||||||||||||||||||||||||
| 9 tickets.ticket | 1 | |||||||||||||||||||||||||||||||||||||||
| 10 collections.when | 1 | |||||||||||||||||||||||||||||||||||||||
| 11 discovery.entry | 1 | 1 | ||||||||||||||||||||||||||||||||||||||
| 12 groups | 1 | 1 | 1 | 1 | 1 | 1 | ||||||||||||||||||||||||||||||||||
| 13 groups.bond.protocol | 1 | 3 | 2 | 1 | 1 | 1 | ||||||||||||||||||||||||||||||||||
| 14 streams.consumer.receiver | 1 | 2 | 1 | 1 | 1 | |||||||||||||||||||||||||||||||||||
| 15 streams.producer.sender | 1 | 2 | 1 | |||||||||||||||||||||||||||||||||||||
| 16 groups.group.state | 1 | 3 | 1 | 3 | 2 | 1 | 1 | 2 | 1 | 1 | ||||||||||||||||||||||||||||||
| 17 groups.bond | 1 | 1 | 2 | 3 | 1 | 1 | 1 | |||||||||||||||||||||||||||||||||
| 18 groups.machine.sync | 7 | 3 | 1 | 1 | 2 | |||||||||||||||||||||||||||||||||||
| 19 groups.machine | 2 | 1 | ||||||||||||||||||||||||||||||||||||||
| 20 groups.group | 3 | 1 | 1 | 1 | 3 | |||||||||||||||||||||||||||||||||||
| 21 collections.vec | 1 | 1 | 1 | 2 | 1 | 1 | 4 | 1 | 4 | 1 | 1 | |||||||||||||||||||||||||||||
| 22 collections.sync.session | 2 | 1 | 1 | 1 | 2 | |||||||||||||||||||||||||||||||||||
| 23 groups.raft.shared | 5 | 1 | 1 | 1 | 1 | 4 | 2 | 1 | ||||||||||||||||||||||||||||||||
| 24 collections.sync | 5 | 1 | 1 | 2 | 1 | |||||||||||||||||||||||||||||||||||
| 25 discovery.announce | 3 | 1 | 1 | 3 | 2 | 1 | 2 | |||||||||||||||||||||||||||||||||
| 26 discovery.catalog | 1 | 2 | 1 | |||||||||||||||||||||||||||||||||||||
| 27 discovery.worker | 2 | 2 | 1 | 2 | 1 | 2 | ||||||||||||||||||||||||||||||||||
| 28 discovery | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | ||||||||||||||||||||||||||||||||
| 29 groups.bond.worker | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | |||||||||||||||||||||||||||||||
| 30 groups.group.worker | 2 | 1 | 4 | 1 | 1 | 1 | ||||||||||||||||||||||||||||||||||
| 31 streams.producer.worker | 2 | 1 | 2 | 1 | 1 | 1 | ||||||||||||||||||||||||||||||||||
| 32 streams | 1 | 1 | 1 | 1 | 5 | |||||||||||||||||||||||||||||||||||
| 33 network | 1 | 1 | 1 | 1 | ||||||||||||||||||||||||||||||||||||
| 34 streams.consumer.worker | 1 | 1 | 1 | 1 | 1 | |||||||||||||||||||||||||||||||||||
| 35 collections | 1 | 6 | ||||||||||||||||||||||||||||||||||||||
| 36 collections.cell | 1 | 1 | 1 | 2 | 1 | 1 | 4 | 1 | 4 | 1 | 1 | |||||||||||||||||||||||||||||
| 37 collections.depq | 1 | 1 | 1 | 2 | 1 | 1 | 4 | 1 | 4 | 1 | 1 | |||||||||||||||||||||||||||||
| 38 collections.map | 1 | 1 | 1 | 2 | 1 | 1 | 4 | 1 | 4 | 1 | 1 | |||||||||||||||||||||||||||||
| 39 collections.once | 1 | 1 | 1 | 2 | 1 | 1 | 4 | 1 | 4 | 1 | 1 | |||||||||||||||||||||||||||||
| 40 collections.set | 1 | 1 | 1 | 2 | 1 | 1 | 4 | 1 | 4 | 1 | 1 |
5→2 collections.primitives uses groups.cursor✕
- Connections
- 1 pair of types, where a type in collections.primitives uses a type in groups.cursor.
- The types involved
mosaik.collections.primitives.Version→mosaik.groups.cursor.Index
- Direction
- collections.primitives uses groups.cursor, so a change to groups.cursor can break collections.primitives, while a change to collections.primitives can't break groups.cursor.
- Position
- Below the diagonal: collections.primitives uses a module listed above it, which is the healthy direction.
6→12 groups.builder uses groups part of a loop✕
- Connections
- 1 pair of types, where a type in groups.builder uses a type in groups.
- The types involved
mosaik.groups.builder.GroupBuilder→mosaik.groups.Groups
- Direction
- groups.builder uses groups, so a change to groups can break groups.builder, while a change to groups.builder can't break groups.
- 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.
6→20 groups.builder uses groups.group part of a loop✕
- Connections
- 1 pair of types, where a type in groups.builder uses a type in groups.group.
- The types involved
mosaik.groups.builder.GroupBuilder→mosaik.groups.group.Group
- Direction
- groups.builder uses groups.group, so a change to groups.group can break groups.builder, while a change to groups.builder can't break groups.group.
- 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.
7→2 groups.raft.protocol uses groups.cursor✕
- Connections
- 10 pairs of types, where a type in groups.raft.protocol uses a type in groups.cursor.
- The types involved
mosaik.groups.raft.protocol.AppendEntries→mosaik.groups.cursor.Cursormosaik.groups.raft.protocol.AppendEntries→mosaik.groups.cursor.Indexmosaik.groups.raft.protocol.AppendEntries→mosaik.groups.cursor.Termmosaik.groups.raft.protocol.AppendEntriesResponse→mosaik.groups.cursor.Indexmosaik.groups.raft.protocol.AppendEntriesResponse→mosaik.groups.cursor.Termmosaik.groups.raft.protocol.LogEntry→mosaik.groups.cursor.Termmosaik.groups.raft.protocol.Message→mosaik.groups.cursor.Termmosaik.groups.raft.protocol.RequestVote→mosaik.groups.cursor.Cursormosaik.groups.raft.protocol.RequestVote→mosaik.groups.cursor.Termmosaik.groups.raft.protocol.RequestVoteResponse→mosaik.groups.cursor.Term
- Direction
- groups.raft.protocol uses groups.cursor, so a change to groups.cursor can break groups.raft.protocol, while a change to groups.raft.protocol can't break groups.cursor.
- Position
- Below the diagonal: groups.raft.protocol uses a module listed above it, which is the healthy direction.
8→3 network.link uses network.local✕
- Connections
- 1 pair of types, where a type in network.link uses a type in network.local.
- The types involved
mosaik.network.link.Link→mosaik.network.local.LocalNode
- Direction
- network.link uses network.local, so a change to network.local can break network.link, while a change to network.link can't break network.local.
- Position
- Below the diagonal: network.link uses a module listed above it, which is the healthy direction.
9→11 tickets.ticket uses discovery.entry part of a loop✕
- Connections
- 1 pair of types, where a type in tickets.ticket uses a type in discovery.entry.
- The types involved
mosaik.tickets.ticket.TicketValidator→mosaik.discovery.entry.PeerEntry
- Direction
- tickets.ticket uses discovery.entry, so a change to discovery.entry can break tickets.ticket, while a change to tickets.ticket can't break discovery.entry.
- 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.
10→5 collections.when uses collections.primitives✕
- Connections
- 1 pair of types, where a type in collections.when uses a type in collections.primitives.
- The types involved
mosaik.collections.when.When→mosaik.collections.primitives.Version
- Direction
- collections.when uses collections.primitives, so a change to collections.primitives can break collections.when, while a change to collections.when can't break collections.primitives.
- Position
- Below the diagonal: collections.when uses a module listed above it, which is the healthy direction.
11→5 discovery.entry uses collections.primitives✕
- Connections
- 1 pair of types, where a type in discovery.entry uses a type in collections.primitives.
- The types involved
mosaik.discovery.entry.PeerEntry→mosaik.collections.primitives.Version
- Direction
- discovery.entry uses collections.primitives, so a change to collections.primitives can break discovery.entry, while a change to discovery.entry can't break collections.primitives.
- Position
- Below the diagonal: discovery.entry uses a module listed above it, which is the healthy direction.
11→9 discovery.entry uses tickets.ticket✕
- Connections
- 1 pair of types, where a type in discovery.entry uses a type in tickets.ticket.
- The types involved
mosaik.discovery.entry.PeerEntry→mosaik.tickets.ticket.Ticket
- Direction
- discovery.entry uses tickets.ticket, so a change to tickets.ticket can break discovery.entry, while a change to discovery.entry can't break tickets.ticket.
- Position
- Below the diagonal: discovery.entry uses a module listed above it, which is the healthy direction.
12→3 groups uses network.local✕
- Connections
- 1 pair of types, where a type in groups uses a type in network.local.
- The types involved
mosaik.groups.Groups→mosaik.network.local.LocalNode
- Direction
- groups uses network.local, so a change to network.local can break groups, while a change to groups can't break network.local.
- Position
- Below the diagonal: groups uses a module listed above it, which is the healthy direction.
12→6 groups uses groups.builder✕
- Connections
- 1 pair of types, where a type in groups uses a type in groups.builder.
- The types involved
mosaik.groups.Groups→mosaik.groups.builder.GroupBuilder
- Direction
- groups uses groups.builder, so a change to groups.builder can break groups, while a change to groups can't break groups.builder.
- Position
- Below the diagonal: groups uses a module listed above it, which is the healthy direction.
12→8 groups uses network.link✕
- Connections
- 1 pair of types, where a type in groups uses a type in network.link.
- The types involved
mosaik.groups.Groups→mosaik.network.link.Protocol
- Direction
- groups uses network.link, so a change to network.link can break groups, while a change to groups can't break network.link.
- Position
- Below the diagonal: groups uses a module listed above it, which is the healthy direction.
12→24 groups uses collections.sync part of a loop✕
- Connections
- 1 pair of types, where a type in groups uses a type in collections.sync.
- The types involved
mosaik.groups.Groups→mosaik.collections.sync.Config
- Direction
- groups uses collections.sync, so a change to collections.sync can break groups, while a change to groups can't break collections.sync.
- 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.
12→28 groups uses discovery part of a loop✕
- Connections
- 1 pair of types, where a type in groups uses a type in discovery.
- The types involved
mosaik.groups.Groups→mosaik.discovery.Discovery
- Direction
- groups uses discovery, so a change to discovery can break groups, while a change to groups can't break discovery.
- 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.
12→33 groups uses network part of a loop✕
- Connections
- 1 pair of types, where a type in groups uses a type in network.
- The types involved
mosaik.groups.Groups→mosaik.network.ProtocolProvider
- Direction
- groups uses network, so a change to network can break groups, while a change to groups can't break network.
- 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.
13→3 groups.bond.protocol uses network.local✕
- Connections
- 1 pair of types, where a type in groups.bond.protocol uses a type in network.local.
- The types involved
mosaik.groups.bond.protocol.Acceptor→mosaik.network.local.LocalNode
- Direction
- groups.bond.protocol uses network.local, so a change to network.local can break groups.bond.protocol, while a change to groups.bond.protocol can't break network.local.
- Position
- Below the diagonal: groups.bond.protocol uses a module listed above it, which is the healthy direction.
13→8 groups.bond.protocol uses network.link✕
- Connections
- 3 pairs of types, where a type in groups.bond.protocol uses a type in network.link.
- The types involved
mosaik.groups.bond.protocol.Acceptor→mosaik.network.link.AcceptErrormosaik.groups.bond.protocol.Acceptor→mosaik.network.link.Linkmosaik.groups.bond.protocol.protocol$module→mosaik.network.link.AcceptError
- Direction
- groups.bond.protocol uses network.link, so a change to network.link can break groups.bond.protocol, while a change to groups.bond.protocol can't break network.link.
- Position
- Below the diagonal: groups.bond.protocol uses a module listed above it, which is the healthy direction.
13→11 groups.bond.protocol uses discovery.entry✕
- Connections
- 2 pairs of types, where a type in groups.bond.protocol uses a type in discovery.entry.
- The types involved
mosaik.groups.bond.protocol.HandshakeEnd→mosaik.discovery.entry.SignedPeerEntrymosaik.groups.bond.protocol.HandshakeStart→mosaik.discovery.entry.SignedPeerEntry
- Direction
- groups.bond.protocol uses discovery.entry, so a change to discovery.entry can break groups.bond.protocol, while a change to groups.bond.protocol can't break discovery.entry.
- Position
- Below the diagonal: groups.bond.protocol uses a module listed above it, which is the healthy direction.
13→12 groups.bond.protocol uses groups✕
- Connections
- 1 pair of types, where a type in groups.bond.protocol uses a type in groups.
- The types involved
mosaik.groups.bond.protocol.Acceptor→mosaik.groups.Groups
- Direction
- groups.bond.protocol uses groups, so a change to groups can break groups.bond.protocol, while a change to groups.bond.protocol can't break groups.
- Position
- Below the diagonal: groups.bond.protocol uses a module listed above it, which is the healthy direction.
13→24 groups.bond.protocol uses collections.sync part of a loop✕
- Connections
- 1 pair of types, where a type in groups.bond.protocol uses a type in collections.sync.
- The types involved
mosaik.groups.bond.protocol.Acceptor→mosaik.collections.sync.Config
- Direction
- groups.bond.protocol uses collections.sync, so a change to collections.sync can break groups.bond.protocol, while a change to groups.bond.protocol can't break collections.sync.
- 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.
13→28 groups.bond.protocol uses discovery part of a loop✕
- Connections
- 1 pair of types, where a type in groups.bond.protocol uses a type in discovery.
- The types involved
mosaik.groups.bond.protocol.Acceptor→mosaik.discovery.Discovery
- Direction
- groups.bond.protocol uses discovery, so a change to discovery can break groups.bond.protocol, while a change to groups.bond.protocol can't break discovery.
- 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.
14→3 streams.consumer.receiver uses network.local✕
- Connections
- 1 pair of types, where a type in streams.consumer.receiver uses a type in network.local.
- The types involved
mosaik.streams.consumer.receiver.Receiver→mosaik.network.local.LocalNode
- Direction
- streams.consumer.receiver uses network.local, so a change to network.local can break streams.consumer.receiver, while a change to streams.consumer.receiver can't break network.local.
- Position
- Below the diagonal: streams.consumer.receiver uses a module listed above it, which is the healthy direction.
14→8 streams.consumer.receiver uses network.link✕
- Connections
- 2 pairs of types, where a type in streams.consumer.receiver uses a type in network.link.
- The types involved
mosaik.streams.consumer.receiver.Receiver→mosaik.network.link.Linkmosaik.streams.consumer.receiver.Receiver→mosaik.network.link.LinkError
- Direction
- streams.consumer.receiver uses network.link, so a change to network.link can break streams.consumer.receiver, while a change to streams.consumer.receiver can't break network.link.
- Position
- Below the diagonal: streams.consumer.receiver uses a module listed above it, which is the healthy direction.
14→11 streams.consumer.receiver uses discovery.entry✕
- Connections
- 1 pair of types, where a type in streams.consumer.receiver uses a type in discovery.entry.
- The types involved
mosaik.streams.consumer.receiver.Receiver→mosaik.discovery.entry.PeerEntry
- Direction
- streams.consumer.receiver uses discovery.entry, so a change to discovery.entry can break streams.consumer.receiver, while a change to streams.consumer.receiver can't break discovery.entry.
- Position
- Below the diagonal: streams.consumer.receiver uses a module listed above it, which is the healthy direction.
14→15 streams.consumer.receiver uses streams.producer.sender part of a loop✕
- Connections
- 1 pair of types, where a type in streams.consumer.receiver uses a type in streams.producer.sender.
- The types involved
mosaik.streams.consumer.receiver.Receiver→mosaik.streams.producer.sender.Sender
- Direction
- streams.consumer.receiver uses streams.producer.sender, so a change to streams.producer.sender can break streams.consumer.receiver, while a change to streams.consumer.receiver can't break streams.producer.sender.
- 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.
14→28 streams.consumer.receiver uses discovery part of a loop✕
- Connections
- 1 pair of types, where a type in streams.consumer.receiver uses a type in discovery.
- The types involved
mosaik.streams.consumer.receiver.Receiver→mosaik.discovery.Discovery
- Direction
- streams.consumer.receiver uses discovery, so a change to discovery can break streams.consumer.receiver, while a change to streams.consumer.receiver can't break discovery.
- 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.
15→8 streams.producer.sender uses network.link✕
- Connections
- 1 pair of types, where a type in streams.producer.sender uses a type in network.link.
- The types involved
mosaik.streams.producer.sender.Sender→mosaik.network.link.Link
- Direction
- streams.producer.sender uses network.link, so a change to network.link can break streams.producer.sender, while a change to streams.producer.sender can't break network.link.
- Position
- Below the diagonal: streams.producer.sender uses a module listed above it, which is the healthy direction.
15→11 streams.producer.sender uses discovery.entry✕
- Connections
- 2 pairs of types, where a type in streams.producer.sender uses a type in discovery.entry.
- The types involved
mosaik.streams.producer.sender.Sender→mosaik.discovery.entry.PeerEntrymosaik.streams.producer.sender.Subscription→mosaik.discovery.entry.PeerEntry
- Direction
- streams.producer.sender uses discovery.entry, so a change to discovery.entry can break streams.producer.sender, while a change to streams.producer.sender can't break discovery.entry.
- Position
- Below the diagonal: streams.producer.sender uses a module listed above it, which is the healthy direction.
15→14 streams.producer.sender uses streams.consumer.receiver✕
- Connections
- 1 pair of types, where a type in streams.producer.sender uses a type in streams.consumer.receiver.
- The types involved
mosaik.streams.producer.sender.Sender→mosaik.streams.consumer.receiver.Receiver
- Direction
- streams.producer.sender uses streams.consumer.receiver, so a change to streams.consumer.receiver can break streams.producer.sender, while a change to streams.producer.sender can't break streams.consumer.receiver.
- Position
- Below the diagonal: streams.producer.sender uses a module listed above it, which is the healthy direction.
16→3 groups.group.state uses network.local✕
- Connections
- 1 pair of types, where a type in groups.group.state uses a type in network.local.
- The types involved
mosaik.groups.group.state.WorkerState→mosaik.network.local.LocalNode
- Direction
- groups.group.state uses network.local, so a change to network.local can break groups.group.state, while a change to groups.group.state can't break network.local.
- Position
- Below the diagonal: groups.group.state uses a module listed above it, which is the healthy direction.
16→8 groups.group.state uses network.link✕
- Connections
- 3 pairs of types, where a type in groups.group.state uses a type in network.link.
- The types involved
mosaik.groups.group.state.AcceptRequest→mosaik.network.link.Linkmosaik.groups.group.state.GroupHandle→mosaik.network.link.Linkmosaik.groups.group.state.WorkerState→mosaik.network.link.Link
- Direction
- groups.group.state uses network.link, so a change to network.link can break groups.group.state, while a change to groups.group.state can't break network.link.
- Position
- Below the diagonal: groups.group.state uses a module listed above it, which is the healthy direction.
16→10 groups.group.state uses collections.when✕
- Connections
- 1 pair of types, where a type in groups.group.state uses a type in collections.when.
- The types involved
mosaik.groups.group.state.WorkerState→mosaik.collections.when.When
- Direction
- groups.group.state uses collections.when, so a change to collections.when can break groups.group.state, while a change to groups.group.state can't break collections.when.
- Position
- Below the diagonal: groups.group.state uses a module listed above it, which is the healthy direction.
16→11 groups.group.state uses discovery.entry✕
- Connections
- 3 pairs of types, where a type in groups.group.state uses a type in discovery.entry.
- The types involved
mosaik.groups.group.state.AcceptRequest→mosaik.discovery.entry.SignedPeerEntrymosaik.groups.group.state.GroupHandle→mosaik.discovery.entry.SignedPeerEntrymosaik.groups.group.state.WorkerState→mosaik.discovery.entry.SignedPeerEntry
- Direction
- groups.group.state uses discovery.entry, so a change to discovery.entry can break groups.group.state, while a change to groups.group.state can't break discovery.entry.
- Position
- Below the diagonal: groups.group.state uses a module listed above it, which is the healthy direction.
16→13 groups.group.state uses groups.bond.protocol✕
- Connections
- 2 pairs of types, where a type in groups.group.state uses a type in groups.bond.protocol.
- The types involved
mosaik.groups.group.state.AcceptRequest→mosaik.groups.bond.protocol.HandshakeStartmosaik.groups.group.state.GroupHandle→mosaik.groups.bond.protocol.HandshakeStart
- Direction
- groups.group.state uses groups.bond.protocol, so a change to groups.bond.protocol can break groups.group.state, while a change to groups.group.state can't break groups.bond.protocol.
- Position
- Below the diagonal: groups.group.state uses a module listed above it, which is the healthy direction.
16→15 groups.group.state uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in groups.group.state uses a type in streams.producer.sender.
- The types involved
mosaik.groups.group.state.AcceptRequest→mosaik.streams.producer.sender.Sender
- Direction
- groups.group.state uses streams.producer.sender, so a change to streams.producer.sender can break groups.group.state, while a change to groups.group.state can't break streams.producer.sender.
- Position
- Below the diagonal: groups.group.state uses a module listed above it, which is the healthy direction.
16→17 groups.group.state uses groups.bond part of a loop✕
- Connections
- 1 pair of types, where a type in groups.group.state uses a type in groups.bond.
- The types involved
mosaik.groups.group.state.WorkerState→mosaik.groups.bond.Bonds
- Direction
- groups.group.state uses groups.bond, so a change to groups.bond can break groups.group.state, while a change to groups.group.state can't break groups.bond.
- 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.
16→20 groups.group.state uses groups.group part of a loop✕
- Connections
- 2 pairs of types, where a type in groups.group.state uses a type in groups.group.
- The types involved
mosaik.groups.group.state.GroupHandle→mosaik.groups.group.Groupmosaik.groups.group.state.WorkerState→mosaik.groups.group.Group
- Direction
- groups.group.state uses groups.group, so a change to groups.group can break groups.group.state, while a change to groups.group.state can't break groups.group.
- 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.
16→24 groups.group.state uses collections.sync part of a loop✕
- Connections
- 1 pair of types, where a type in groups.group.state uses a type in collections.sync.
- The types involved
mosaik.groups.group.state.WorkerState→mosaik.collections.sync.Config
- Direction
- groups.group.state uses collections.sync, so a change to collections.sync can break groups.group.state, while a change to groups.group.state can't break collections.sync.
- 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.
16→28 groups.group.state uses discovery part of a loop✕
- Connections
- 1 pair of types, where a type in groups.group.state uses a type in discovery.
- The types involved
mosaik.groups.group.state.WorkerState→mosaik.discovery.Discovery
- Direction
- groups.group.state uses discovery, so a change to discovery can break groups.group.state, while a change to groups.group.state can't break discovery.
- 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.
17→7 groups.bond uses groups.raft.protocol✕
- Connections
- 1 pair of types, where a type in groups.bond uses a type in groups.raft.protocol.
- The types involved
mosaik.groups.bond.Bonds→mosaik.groups.raft.protocol.Message
- Direction
- groups.bond uses groups.raft.protocol, so a change to groups.raft.protocol can break groups.bond, while a change to groups.bond can't break groups.raft.protocol.
- Position
- Below the diagonal: groups.bond uses a module listed above it, which is the healthy direction.
17→8 groups.bond uses network.link✕
- Connections
- 1 pair of types, where a type in groups.bond uses a type in network.link.
- The types involved
mosaik.groups.bond.Bond→mosaik.network.link.Link
- Direction
- groups.bond uses network.link, so a change to network.link can break groups.bond, while a change to groups.bond can't break network.link.
- Position
- Below the diagonal: groups.bond uses a module listed above it, which is the healthy direction.
17→11 groups.bond uses discovery.entry✕
- Connections
- 2 pairs of types, where a type in groups.bond uses a type in discovery.entry.
- The types involved
mosaik.groups.bond.Bond→mosaik.discovery.entry.SignedPeerEntrymosaik.groups.bond.Bonds→mosaik.discovery.entry.SignedPeerEntry
- Direction
- groups.bond uses discovery.entry, so a change to discovery.entry can break groups.bond, while a change to groups.bond can't break discovery.entry.
- Position
- Below the diagonal: groups.bond uses a module listed above it, which is the healthy direction.
17→13 groups.bond uses groups.bond.protocol✕
- Connections
- 3 pairs of types, where a type in groups.bond uses a type in groups.bond.protocol.
- The types involved
mosaik.groups.bond.Bond→mosaik.groups.bond.protocol.BondMessagemosaik.groups.bond.Bond→mosaik.groups.bond.protocol.HandshakeStartmosaik.groups.bond.Bonds→mosaik.groups.bond.protocol.BondMessage
- Direction
- groups.bond uses groups.bond.protocol, so a change to groups.bond.protocol can break groups.bond, while a change to groups.bond can't break groups.bond.protocol.
- Position
- Below the diagonal: groups.bond uses a module listed above it, which is the healthy direction.
17→14 groups.bond uses streams.consumer.receiver✕
- Connections
- 1 pair of types, where a type in groups.bond uses a type in streams.consumer.receiver.
- The types involved
mosaik.groups.bond.Bond→mosaik.streams.consumer.receiver.Receiver
- Direction
- groups.bond uses streams.consumer.receiver, so a change to streams.consumer.receiver can break groups.bond, while a change to groups.bond can't break streams.consumer.receiver.
- Position
- Below the diagonal: groups.bond uses a module listed above it, which is the healthy direction.
17→15 groups.bond uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in groups.bond uses a type in streams.producer.sender.
- The types involved
mosaik.groups.bond.Bonds→mosaik.streams.producer.sender.Sender
- Direction
- groups.bond uses streams.producer.sender, so a change to streams.producer.sender can break groups.bond, while a change to groups.bond can't break streams.producer.sender.
- Position
- Below the diagonal: groups.bond uses a module listed above it, which is the healthy direction.
17→16 groups.bond uses groups.group.state✕
- Connections
- 1 pair of types, where a type in groups.bond uses a type in groups.group.state.
- The types involved
mosaik.groups.bond.Bond→mosaik.groups.group.state.WorkerState
- Direction
- groups.bond uses groups.group.state, so a change to groups.group.state can break groups.bond, while a change to groups.bond can't break groups.group.state.
- Position
- Below the diagonal: groups.bond uses a module listed above it, which is the healthy direction.
18→2 groups.machine.sync uses groups.cursor✕
- Connections
- 7 pairs of types, where a type in groups.machine.sync uses a type in groups.cursor.
- The types involved
mosaik.groups.machine.sync.StateSync→mosaik.groups.cursor.Cursormosaik.groups.machine.sync.StateSync→mosaik.groups.cursor.Indexmosaik.groups.machine.sync.StateSyncProvider→mosaik.groups.cursor.Cursormosaik.groups.machine.sync.StateSyncProvider→mosaik.groups.cursor.Indexmosaik.groups.machine.sync.StateSyncSession→mosaik.groups.cursor.Cursormosaik.groups.machine.sync.SyncContext→mosaik.groups.cursor.Cursormosaik.groups.machine.sync.SyncSessionContext→mosaik.groups.cursor.Cursor
- Direction
- groups.machine.sync uses groups.cursor, so a change to groups.cursor can break groups.machine.sync, while a change to groups.machine.sync can't break groups.cursor.
- Position
- Below the diagonal: groups.machine.sync uses a module listed above it, which is the healthy direction.
18→7 groups.machine.sync uses groups.raft.protocol✕
- Connections
- 3 pairs of types, where a type in groups.machine.sync uses a type in groups.raft.protocol.
- The types involved
mosaik.groups.machine.sync.StateSyncProvider→mosaik.groups.raft.protocol.Messagemosaik.groups.machine.sync.StateSyncSession→mosaik.groups.raft.protocol.Messagemosaik.groups.machine.sync.SyncContext→mosaik.groups.raft.protocol.Message
- Direction
- groups.machine.sync uses groups.raft.protocol, so a change to groups.raft.protocol can break groups.machine.sync, while a change to groups.machine.sync can't break groups.raft.protocol.
- Position
- Below the diagonal: groups.machine.sync uses a module listed above it, which is the healthy direction.
18→17 groups.machine.sync uses groups.bond✕
- Connections
- 1 pair of types, where a type in groups.machine.sync uses a type in groups.bond.
- The types involved
mosaik.groups.machine.sync.SyncContext→mosaik.groups.bond.Bonds
- Direction
- groups.machine.sync uses groups.bond, so a change to groups.bond can break groups.machine.sync, while a change to groups.machine.sync can't break groups.bond.
- Position
- Below the diagonal: groups.machine.sync uses a module listed above it, which is the healthy direction.
18→19 groups.machine.sync uses groups.machine part of a loop✕
- Connections
- 1 pair of types, where a type in groups.machine.sync uses a type in groups.machine.
- The types involved
mosaik.groups.machine.sync.SyncProviderContext→mosaik.groups.machine.Command
- Direction
- groups.machine.sync uses groups.machine, so a change to groups.machine can break groups.machine.sync, while a change to groups.machine.sync can't break groups.machine.
- 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.
18→21 groups.machine.sync uses collections.vec part of a loop✕
- Connections
- 2 pairs of types, where a type in groups.machine.sync uses a type in collections.vec.
- The types involved
mosaik.groups.machine.sync.StateSync→mosaik.collections.vec.Vecmosaik.groups.machine.sync.StateSyncSession→mosaik.collections.vec.Vec
- Direction
- groups.machine.sync uses collections.vec, so a change to collections.vec can break groups.machine.sync, while a change to groups.machine.sync can't break collections.vec.
- 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.
19→2 groups.machine uses groups.cursor✕
- Connections
- 2 pairs of types, where a type in groups.machine uses a type in groups.cursor.
- The types involved
mosaik.groups.machine.ApplyContext→mosaik.groups.cursor.Cursormosaik.groups.machine.ApplyContext→mosaik.groups.cursor.Term
- Direction
- groups.machine uses groups.cursor, so a change to groups.cursor can break groups.machine, while a change to groups.machine can't break groups.cursor.
- Position
- Below the diagonal: groups.machine uses a module listed above it, which is the healthy direction.
19→18 groups.machine uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in groups.machine uses a type in groups.machine.sync.
- The types involved
mosaik.groups.machine.StateMachine→mosaik.groups.machine.sync.StateSync
- Direction
- groups.machine uses groups.machine.sync, so a change to groups.machine.sync can break groups.machine, while a change to groups.machine can't break groups.machine.sync.
- Position
- Below the diagonal: groups.machine uses a module listed above it, which is the healthy direction.
20→2 groups.group uses groups.cursor✕
- Connections
- 3 pairs of types, where a type in groups.group uses a type in groups.cursor.
- The types involved
mosaik.groups.group.Group→mosaik.groups.cursor.Cursormosaik.groups.group.Group→mosaik.groups.cursor.Indexmosaik.groups.group.QueryResultAt→mosaik.groups.cursor.Index
- Direction
- groups.group uses groups.cursor, so a change to groups.cursor can break groups.group, while a change to groups.group can't break groups.cursor.
- Position
- Below the diagonal: groups.group uses a module listed above it, which is the healthy direction.
20→10 groups.group uses collections.when✕
- Connections
- 1 pair of types, where a type in groups.group uses a type in collections.when.
- The types involved
mosaik.groups.group.Group→mosaik.collections.when.When
- Direction
- groups.group uses collections.when, so a change to collections.when can break groups.group, while a change to groups.group can't break collections.when.
- Position
- Below the diagonal: groups.group uses a module listed above it, which is the healthy direction.
20→16 groups.group uses groups.group.state✕
- Connections
- 1 pair of types, where a type in groups.group uses a type in groups.group.state.
- The types involved
mosaik.groups.group.Group→mosaik.groups.group.state.WorkerState
- Direction
- groups.group uses groups.group.state, so a change to groups.group.state can break groups.group, while a change to groups.group can't break groups.group.state.
- Position
- Below the diagonal: groups.group uses a module listed above it, which is the healthy direction.
20→17 groups.group uses groups.bond✕
- Connections
- 1 pair of types, where a type in groups.group uses a type in groups.bond.
- The types involved
mosaik.groups.group.Group→mosaik.groups.bond.Bonds
- Direction
- groups.group uses groups.bond, so a change to groups.bond can break groups.group, while a change to groups.group can't break groups.bond.
- Position
- Below the diagonal: groups.group uses a module listed above it, which is the healthy direction.
20→19 groups.group uses groups.machine✕
- Connections
- 3 pairs of types, where a type in groups.group uses a type in groups.machine.
- The types involved
mosaik.groups.group.Group→mosaik.groups.machine.Commandmosaik.groups.group.Group→mosaik.groups.machine.Querymosaik.groups.group.QueryResultAt→mosaik.groups.machine.QueryResult
- Direction
- groups.group uses groups.machine, so a change to groups.machine can break groups.group, while a change to groups.group can't break groups.machine.
- Position
- Below the diagonal: groups.group uses a module listed above it, which is the healthy direction.
21→1 collections.vec uses collections.config✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in collections.config.
- The types involved
mosaik.collections.vec.Vec→mosaik.collections.config.CollectionConfig
- Direction
- collections.vec uses collections.config, so a change to collections.config can break collections.vec, while a change to collections.vec can't break collections.config.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→5 collections.vec uses collections.primitives✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in collections.primitives.
- The types involved
mosaik.collections.vec.Vec→mosaik.collections.primitives.Version
- Direction
- collections.vec uses collections.primitives, so a change to collections.primitives can break collections.vec, while a change to collections.vec can't break collections.primitives.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→10 collections.vec uses collections.when✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in collections.when.
- The types involved
mosaik.collections.vec.Vec→mosaik.collections.when.When
- Direction
- collections.vec uses collections.when, so a change to collections.when can break collections.vec, while a change to collections.vec can't break collections.when.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→14 collections.vec uses streams.consumer.receiver✕
- Connections
- 2 pairs of types, where a type in collections.vec uses a type in streams.consumer.receiver.
- The types involved
mosaik.collections.vec.Vec→mosaik.streams.consumer.receiver.Receivermosaik.collections.vec.VecStateMachine→mosaik.streams.consumer.receiver.Receiver
- Direction
- collections.vec uses streams.consumer.receiver, so a change to streams.consumer.receiver can break collections.vec, while a change to collections.vec can't break streams.consumer.receiver.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→15 collections.vec uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in streams.producer.sender.
- The types involved
mosaik.collections.vec.VecStateMachine→mosaik.streams.producer.sender.Sender
- Direction
- collections.vec uses streams.producer.sender, so a change to streams.producer.sender can break collections.vec, while a change to collections.vec can't break streams.producer.sender.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→18 collections.vec uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in groups.machine.sync.
- The types involved
mosaik.collections.vec.VecStateMachine→mosaik.groups.machine.sync.StateSync
- Direction
- collections.vec uses groups.machine.sync, so a change to groups.machine.sync can break collections.vec, while a change to collections.vec can't break groups.machine.sync.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→19 collections.vec uses groups.machine✕
- Connections
- 4 pairs of types, where a type in collections.vec uses a type in groups.machine.
- The types involved
mosaik.collections.vec.VecStateMachine→mosaik.groups.machine.Commandmosaik.collections.vec.VecStateMachine→mosaik.groups.machine.LeadershipPreferencemosaik.collections.vec.VecStateMachine→mosaik.groups.machine.Querymosaik.collections.vec.VecStateMachine→mosaik.groups.machine.StateMachine
- Direction
- collections.vec uses groups.machine, so a change to groups.machine can break collections.vec, while a change to collections.vec can't break groups.machine.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→20 collections.vec uses groups.group✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in groups.group.
- The types involved
mosaik.collections.vec.Vec→mosaik.groups.group.Group
- Direction
- collections.vec uses groups.group, so a change to groups.group can break collections.vec, while a change to collections.vec can't break groups.group.
- Position
- Below the diagonal: collections.vec uses a module listed above it, which is the healthy direction.
21→24 collections.vec uses collections.sync part of a loop✕
- Connections
- 4 pairs of types, where a type in collections.vec uses a type in collections.sync.
- The types involved
mosaik.collections.vec.VecSnapshot→mosaik.collections.sync.Snapshotmosaik.collections.vec.VecStateMachine→mosaik.collections.sync.Snapshotmosaik.collections.vec.VecStateMachine→mosaik.collections.sync.SnapshotStateMachinemosaik.collections.vec.VecStateMachine→mosaik.collections.sync.SnapshotSync
- Direction
- collections.vec uses collections.sync, so a change to collections.sync can break collections.vec, while a change to collections.vec can't break collections.sync.
- 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.
21→33 collections.vec uses network part of a loop✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in network.
- The types involved
mosaik.collections.vec.Vec→mosaik.network.Network
- Direction
- collections.vec uses network, so a change to network can break collections.vec, while a change to collections.vec can't break network.
- 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.
21→35 collections.vec uses collections part of a loop✕
- Connections
- 1 pair of types, where a type in collections.vec uses a type in collections.
- The types involved
mosaik.collections.vec.Vec→mosaik.collections.CollectionFromDef
- Direction
- collections.vec uses collections, so a change to collections can break collections.vec, while a change to collections.vec can't break collections.
- 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→2 collections.sync.session uses groups.cursor✕
- Connections
- 2 pairs of types, where a type in collections.sync.session uses a type in groups.cursor.
- The types involved
mosaik.collections.sync.session.SnapshotSyncSession→mosaik.groups.cursor.Cursormosaik.collections.sync.session.SnapshotSyncSession→mosaik.groups.cursor.Index
- Direction
- collections.sync.session uses groups.cursor, so a change to groups.cursor can break collections.sync.session, while a change to collections.sync.session can't break groups.cursor.
- Position
- Below the diagonal: collections.sync.session uses a module listed above it, which is the healthy direction.
22→4 collections.sync.session uses primitives.channel✕
- Connections
- 1 pair of types, where a type in collections.sync.session uses a type in primitives.channel.
- The types involved
mosaik.collections.sync.session.SnapshotSyncSession→mosaik.primitives.channel.UnboundedChannel
- Direction
- collections.sync.session uses primitives.channel, so a change to primitives.channel can break collections.sync.session, while a change to collections.sync.session can't break primitives.channel.
- Position
- Below the diagonal: collections.sync.session uses a module listed above it, which is the healthy direction.
22→18 collections.sync.session uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.sync.session uses a type in groups.machine.sync.
- The types involved
mosaik.collections.sync.session.SnapshotSyncSession→mosaik.groups.machine.sync.StateSyncSession
- Direction
- collections.sync.session uses groups.machine.sync, so a change to groups.machine.sync can break collections.sync.session, while a change to collections.sync.session can't break groups.machine.sync.
- Position
- Below the diagonal: collections.sync.session uses a module listed above it, which is the healthy direction.
22→21 collections.sync.session uses collections.vec✕
- Connections
- 1 pair of types, where a type in collections.sync.session uses a type in collections.vec.
- The types involved
mosaik.collections.sync.session.SnapshotSyncSession→mosaik.collections.vec.Vec
- Direction
- collections.sync.session uses collections.vec, so a change to collections.vec can break collections.sync.session, while a change to collections.sync.session can't break collections.vec.
- Position
- Below the diagonal: collections.sync.session uses a module listed above it, which is the healthy direction.
22→24 collections.sync.session uses collections.sync part of a loop✕
- Connections
- 2 pairs of types, where a type in collections.sync.session uses a type in collections.sync.
- The types involved
mosaik.collections.sync.session.SnapshotSyncSession→mosaik.collections.sync.Configmosaik.collections.sync.session.SnapshotSyncSession→mosaik.collections.sync.Snapshot
- Direction
- collections.sync.session uses collections.sync, so a change to collections.sync can break collections.sync.session, while a change to collections.sync.session can't break collections.sync.
- 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 groups.raft.shared uses groups.cursor✕
- Connections
- 5 pairs of types, where a type in groups.raft.shared uses a type in groups.cursor.
- The types involved
mosaik.groups.raft.shared.LocalApplyContext→mosaik.groups.cursor.Cursormosaik.groups.raft.shared.LocalApplyContext→mosaik.groups.cursor.Termmosaik.groups.raft.shared.Shared→mosaik.groups.cursor.Cursormosaik.groups.raft.shared.Shared→mosaik.groups.cursor.Indexmosaik.groups.raft.shared.Shared→mosaik.groups.cursor.Term
- Direction
- groups.raft.shared uses groups.cursor, so a change to groups.cursor can break groups.raft.shared, while a change to groups.raft.shared can't break groups.cursor.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
23→6 groups.raft.shared uses groups.builder✕
- Connections
- 1 pair of types, where a type in groups.raft.shared uses a type in groups.builder.
- The types involved
mosaik.groups.raft.shared.Shared→mosaik.groups.builder.ConsensusConfig
- Direction
- groups.raft.shared uses groups.builder, so a change to groups.builder can break groups.raft.shared, while a change to groups.raft.shared can't break groups.builder.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
23→7 groups.raft.shared uses groups.raft.protocol✕
- Connections
- 1 pair of types, where a type in groups.raft.shared uses a type in groups.raft.protocol.
- The types involved
mosaik.groups.raft.shared.Shared→mosaik.groups.raft.protocol.Message
- Direction
- groups.raft.shared uses groups.raft.protocol, so a change to groups.raft.protocol can break groups.raft.shared, while a change to groups.raft.shared can't break groups.raft.protocol.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
23→16 groups.raft.shared uses groups.group.state✕
- Connections
- 1 pair of types, where a type in groups.raft.shared uses a type in groups.group.state.
- The types involved
mosaik.groups.raft.shared.Shared→mosaik.groups.group.state.WorkerState
- Direction
- groups.raft.shared uses groups.group.state, so a change to groups.group.state can break groups.raft.shared, while a change to groups.raft.shared can't break groups.group.state.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
23→17 groups.raft.shared uses groups.bond✕
- Connections
- 1 pair of types, where a type in groups.raft.shared uses a type in groups.bond.
- The types involved
mosaik.groups.raft.shared.Shared→mosaik.groups.bond.Bonds
- Direction
- groups.raft.shared uses groups.bond, so a change to groups.bond can break groups.raft.shared, while a change to groups.raft.shared can't break groups.bond.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
23→18 groups.raft.shared uses groups.machine.sync✕
- Connections
- 4 pairs of types, where a type in groups.raft.shared uses a type in groups.machine.sync.
- The types involved
mosaik.groups.raft.shared.Shared→mosaik.groups.machine.sync.StateSyncmosaik.groups.raft.shared.Shared→mosaik.groups.machine.sync.SyncContextmosaik.groups.raft.shared.Shared→mosaik.groups.machine.sync.SyncProviderContextmosaik.groups.raft.shared.Shared→mosaik.groups.machine.sync.SyncSessionContext
- Direction
- groups.raft.shared uses groups.machine.sync, so a change to groups.machine.sync can break groups.raft.shared, while a change to groups.raft.shared can't break groups.machine.sync.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
23→19 groups.raft.shared uses groups.machine✕
- Connections
- 2 pairs of types, where a type in groups.raft.shared uses a type in groups.machine.
- The types involved
mosaik.groups.raft.shared.LocalApplyContext→mosaik.groups.machine.ApplyContextmosaik.groups.raft.shared.Shared→mosaik.groups.machine.Command
- Direction
- groups.raft.shared uses groups.machine, so a change to groups.machine can break groups.raft.shared, while a change to groups.raft.shared can't break groups.machine.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
23→21 groups.raft.shared uses collections.vec✕
- Connections
- 1 pair of types, where a type in groups.raft.shared uses a type in collections.vec.
- The types involved
mosaik.groups.raft.shared.Shared→mosaik.collections.vec.Vec
- Direction
- groups.raft.shared uses collections.vec, so a change to collections.vec can break groups.raft.shared, while a change to groups.raft.shared can't break collections.vec.
- Position
- Below the diagonal: groups.raft.shared uses a module listed above it, which is the healthy direction.
24→2 collections.sync uses groups.cursor✕
- Connections
- 5 pairs of types, where a type in collections.sync uses a type in groups.cursor.
- The types involved
mosaik.collections.sync.PendingRequest→mosaik.groups.cursor.Cursormosaik.collections.sync.SnapshotSync→mosaik.groups.cursor.Cursormosaik.collections.sync.SnapshotSync→mosaik.groups.cursor.Indexmosaik.collections.sync.SnapshotSyncInner→mosaik.groups.cursor.Cursormosaik.collections.sync.SnapshotSyncInner→mosaik.groups.cursor.Index
- Direction
- collections.sync uses groups.cursor, so a change to groups.cursor can break collections.sync, while a change to collections.sync can't break groups.cursor.
- Position
- Below the diagonal: collections.sync uses a module listed above it, which is the healthy direction.
24→18 collections.sync uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.sync uses a type in groups.machine.sync.
- The types involved
mosaik.collections.sync.SnapshotSync→mosaik.groups.machine.sync.StateSync
- Direction
- collections.sync uses groups.machine.sync, so a change to groups.machine.sync can break collections.sync, while a change to collections.sync can't break groups.machine.sync.
- Position
- Below the diagonal: collections.sync uses a module listed above it, which is the healthy direction.
24→19 collections.sync uses groups.machine✕
- Connections
- 1 pair of types, where a type in collections.sync uses a type in groups.machine.
- The types involved
mosaik.collections.sync.SnapshotStateMachine→mosaik.groups.machine.StateMachine
- Direction
- collections.sync uses groups.machine, so a change to groups.machine can break collections.sync, while a change to collections.sync can't break groups.machine.
- Position
- Below the diagonal: collections.sync uses a module listed above it, which is the healthy direction.
24→21 collections.sync uses collections.vec✕
- Connections
- 2 pairs of types, where a type in collections.sync uses a type in collections.vec.
- The types involved
mosaik.collections.sync.SnapshotSync→mosaik.collections.vec.Vecmosaik.collections.sync.SnapshotSyncInner→mosaik.collections.vec.Vec
- Direction
- collections.sync uses collections.vec, so a change to collections.vec can break collections.sync, while a change to collections.sync can't break collections.vec.
- Position
- Below the diagonal: collections.sync uses a module listed above it, which is the healthy direction.
24→22 collections.sync uses collections.sync.session✕
- Connections
- 1 pair of types, where a type in collections.sync uses a type in collections.sync.session.
- The types involved
mosaik.collections.sync.SnapshotSyncInner→mosaik.collections.sync.session.SnapshotSyncSession
- Direction
- collections.sync uses collections.sync.session, so a change to collections.sync.session can break collections.sync, while a change to collections.sync can't break collections.sync.session.
- Position
- Below the diagonal: collections.sync uses a module listed above it, which is the healthy direction.
25→3 discovery.announce uses network.local✕
- Connections
- 3 pairs of types, where a type in discovery.announce uses a type in network.local.
- The types involved
mosaik.discovery.announce.Announce→mosaik.network.local.LocalNodemosaik.discovery.announce.GracefulDeparture→mosaik.network.local.LocalNodemosaik.discovery.announce.WorkerLoop→mosaik.network.local.LocalNode
- Direction
- discovery.announce uses network.local, so a change to network.local can break discovery.announce, while a change to discovery.announce can't break network.local.
- Position
- Below the diagonal: discovery.announce uses a module listed above it, which is the healthy direction.
25→4 discovery.announce uses primitives.channel✕
- Connections
- 1 pair of types, where a type in discovery.announce uses a type in primitives.channel.
- The types involved
mosaik.discovery.announce.WorkerLoop→mosaik.primitives.channel.UnboundedChannel
- Direction
- discovery.announce uses primitives.channel, so a change to primitives.channel can break discovery.announce, while a change to discovery.announce can't break primitives.channel.
- Position
- Below the diagonal: discovery.announce uses a module listed above it, which is the healthy direction.
25→8 discovery.announce uses network.link✕
- Connections
- 1 pair of types, where a type in discovery.announce uses a type in network.link.
- The types involved
mosaik.discovery.announce.Announce→mosaik.network.link.Protocol
- Direction
- discovery.announce uses network.link, so a change to network.link can break discovery.announce, while a change to discovery.announce can't break network.link.
- Position
- Below the diagonal: discovery.announce uses a module listed above it, which is the healthy direction.
25→11 discovery.announce uses discovery.entry✕
- Connections
- 3 pairs of types, where a type in discovery.announce uses a type in discovery.entry.
- The types involved
mosaik.discovery.announce.Announce→mosaik.discovery.entry.PeerEntrymosaik.discovery.announce.GracefulDeparture→mosaik.discovery.entry.PeerEntryVersionmosaik.discovery.announce.WorkerLoop→mosaik.discovery.entry.PeerEntryVersion
- Direction
- discovery.announce uses discovery.entry, so a change to discovery.entry can break discovery.announce, while a change to discovery.announce can't break discovery.entry.
- Position
- Below the diagonal: discovery.announce uses a module listed above it, which is the healthy direction.
25→14 discovery.announce uses streams.consumer.receiver✕
- Connections
- 2 pairs of types, where a type in discovery.announce uses a type in streams.consumer.receiver.
- The types involved
mosaik.discovery.announce.Announce→mosaik.streams.consumer.receiver.Receivermosaik.discovery.announce.WorkerLoop→mosaik.streams.consumer.receiver.Receiver
- Direction
- discovery.announce uses streams.consumer.receiver, so a change to streams.consumer.receiver can break discovery.announce, while a change to discovery.announce can't break streams.consumer.receiver.
- Position
- Below the diagonal: discovery.announce uses a module listed above it, which is the healthy direction.
25→15 discovery.announce uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in discovery.announce uses a type in streams.producer.sender.
- The types involved
mosaik.discovery.announce.WorkerLoop→mosaik.streams.producer.sender.Sender
- Direction
- discovery.announce uses streams.producer.sender, so a change to streams.producer.sender can break discovery.announce, while a change to discovery.announce can't break streams.producer.sender.
- Position
- Below the diagonal: discovery.announce uses a module listed above it, which is the healthy direction.
25→24 discovery.announce uses collections.sync✕
- Connections
- 2 pairs of types, where a type in discovery.announce uses a type in collections.sync.
- The types involved
mosaik.discovery.announce.Announce→mosaik.collections.sync.Configmosaik.discovery.announce.WorkerLoop→mosaik.collections.sync.Config
- Direction
- discovery.announce uses collections.sync, so a change to collections.sync can break discovery.announce, while a change to discovery.announce can't break collections.sync.
- Position
- Below the diagonal: discovery.announce uses a module listed above it, which is the healthy direction.
26→3 discovery.catalog uses network.local✕
- Connections
- 1 pair of types, where a type in discovery.catalog uses a type in network.local.
- The types involved
mosaik.discovery.catalog.Catalog→mosaik.network.local.LocalNode
- Direction
- discovery.catalog uses network.local, so a change to network.local can break discovery.catalog, while a change to discovery.catalog can't break network.local.
- Position
- Below the diagonal: discovery.catalog uses a module listed above it, which is the healthy direction.
26→11 discovery.catalog uses discovery.entry✕
- Connections
- 2 pairs of types, where a type in discovery.catalog uses a type in discovery.entry.
- The types involved
mosaik.discovery.catalog.Catalog→mosaik.discovery.entry.PeerEntrymosaik.discovery.catalog.Catalog→mosaik.discovery.entry.SignedPeerEntry
- Direction
- discovery.catalog uses discovery.entry, so a change to discovery.entry can break discovery.catalog, while a change to discovery.catalog can't break discovery.entry.
- Position
- Below the diagonal: discovery.catalog uses a module listed above it, which is the healthy direction.
26→24 discovery.catalog uses collections.sync✕
- Connections
- 1 pair of types, where a type in discovery.catalog uses a type in collections.sync.
- The types involved
mosaik.discovery.catalog.Catalog→mosaik.collections.sync.Config
- Direction
- discovery.catalog uses collections.sync, so a change to collections.sync can break discovery.catalog, while a change to discovery.catalog can't break collections.sync.
- Position
- Below the diagonal: discovery.catalog uses a module listed above it, which is the healthy direction.
27→3 discovery.worker uses network.local✕
- Connections
- 2 pairs of types, where a type in discovery.worker uses a type in network.local.
- The types involved
mosaik.discovery.worker.Handle→mosaik.network.local.LocalNodemosaik.discovery.worker.WorkerLoop→mosaik.network.local.LocalNode
- Direction
- discovery.worker uses network.local, so a change to network.local can break discovery.worker, while a change to discovery.worker can't break network.local.
- Position
- Below the diagonal: discovery.worker uses a module listed above it, which is the healthy direction.
27→11 discovery.worker uses discovery.entry✕
- Connections
- 2 pairs of types, where a type in discovery.worker uses a type in discovery.entry.
- The types involved
mosaik.discovery.worker.WorkerLoop→mosaik.discovery.entry.PeerEntryVersionmosaik.discovery.worker.WorkerLoop→mosaik.discovery.entry.SignedPeerEntry
- Direction
- discovery.worker uses discovery.entry, so a change to discovery.entry can break discovery.worker, while a change to discovery.worker can't break discovery.entry.
- Position
- Below the diagonal: discovery.worker uses a module listed above it, which is the healthy direction.
27→14 discovery.worker uses streams.consumer.receiver✕
- Connections
- 1 pair of types, where a type in discovery.worker uses a type in streams.consumer.receiver.
- The types involved
mosaik.discovery.worker.Handle→mosaik.streams.consumer.receiver.Receiver
- Direction
- discovery.worker uses streams.consumer.receiver, so a change to streams.consumer.receiver can break discovery.worker, while a change to discovery.worker can't break streams.consumer.receiver.
- Position
- Below the diagonal: discovery.worker uses a module listed above it, which is the healthy direction.
27→15 discovery.worker uses streams.producer.sender✕
- Connections
- 2 pairs of types, where a type in discovery.worker uses a type in streams.producer.sender.
- The types involved
mosaik.discovery.worker.Handle→mosaik.streams.producer.sender.Sendermosaik.discovery.worker.WorkerLoop→mosaik.streams.producer.sender.Sender
- Direction
- discovery.worker uses streams.producer.sender, so a change to streams.producer.sender can break discovery.worker, while a change to discovery.worker can't break streams.producer.sender.
- Position
- Below the diagonal: discovery.worker uses a module listed above it, which is the healthy direction.
27→24 discovery.worker uses collections.sync✕
- Connections
- 1 pair of types, where a type in discovery.worker uses a type in collections.sync.
- The types involved
mosaik.discovery.worker.WorkerLoop→mosaik.collections.sync.Config
- Direction
- discovery.worker uses collections.sync, so a change to collections.sync can break discovery.worker, while a change to discovery.worker can't break collections.sync.
- Position
- Below the diagonal: discovery.worker uses a module listed above it, which is the healthy direction.
27→25 discovery.worker uses discovery.announce✕
- Connections
- 2 pairs of types, where a type in discovery.worker uses a type in discovery.announce.
- The types involved
mosaik.discovery.worker.WorkerLoop→mosaik.discovery.announce.Announcemosaik.discovery.worker.WorkerLoop→mosaik.discovery.announce.Event
- Direction
- discovery.worker uses discovery.announce, so a change to discovery.announce can break discovery.worker, while a change to discovery.worker can't break discovery.announce.
- Position
- Below the diagonal: discovery.worker uses a module listed above it, which is the healthy direction.
28→3 discovery uses network.local✕
- Connections
- 1 pair of types, where a type in discovery uses a type in network.local.
- The types involved
mosaik.discovery.Discovery→mosaik.network.local.LocalNode
- Direction
- discovery uses network.local, so a change to network.local can break discovery, while a change to discovery can't break network.local.
- Position
- Below the diagonal: discovery uses a module listed above it, which is the healthy direction.
28→9 discovery uses tickets.ticket✕
- Connections
- 1 pair of types, where a type in discovery uses a type in tickets.ticket.
- The types involved
mosaik.discovery.Discovery→mosaik.tickets.ticket.Ticket
- Direction
- discovery uses tickets.ticket, so a change to tickets.ticket can break discovery, while a change to discovery can't break tickets.ticket.
- Position
- Below the diagonal: discovery uses a module listed above it, which is the healthy direction.
28→11 discovery uses discovery.entry✕
- Connections
- 1 pair of types, where a type in discovery uses a type in discovery.entry.
- The types involved
mosaik.discovery.Discovery→mosaik.discovery.entry.SignedPeerEntry
- Direction
- discovery uses discovery.entry, so a change to discovery.entry can break discovery, while a change to discovery can't break discovery.entry.
- Position
- Below the diagonal: discovery uses a module listed above it, which is the healthy direction.
28→14 discovery uses streams.consumer.receiver✕
- Connections
- 1 pair of types, where a type in discovery uses a type in streams.consumer.receiver.
- The types involved
mosaik.discovery.Discovery→mosaik.streams.consumer.receiver.Receiver
- Direction
- discovery uses streams.consumer.receiver, so a change to streams.consumer.receiver can break discovery, while a change to discovery can't break streams.consumer.receiver.
- Position
- Below the diagonal: discovery uses a module listed above it, which is the healthy direction.
28→24 discovery uses collections.sync✕
- Connections
- 1 pair of types, where a type in discovery uses a type in collections.sync.
- The types involved
mosaik.discovery.Discovery→mosaik.collections.sync.Config
- Direction
- discovery uses collections.sync, so a change to collections.sync can break discovery, while a change to discovery can't break collections.sync.
- Position
- Below the diagonal: discovery uses a module listed above it, which is the healthy direction.
28→26 discovery uses discovery.catalog✕
- Connections
- 1 pair of types, where a type in discovery uses a type in discovery.catalog.
- The types involved
mosaik.discovery.Discovery→mosaik.discovery.catalog.Catalog
- Direction
- discovery uses discovery.catalog, so a change to discovery.catalog can break discovery, while a change to discovery can't break discovery.catalog.
- Position
- Below the diagonal: discovery uses a module listed above it, which is the healthy direction.
28→27 discovery uses discovery.worker✕
- Connections
- 1 pair of types, where a type in discovery uses a type in discovery.worker.
- The types involved
mosaik.discovery.Discovery→mosaik.discovery.worker.Handle
- Direction
- discovery uses discovery.worker, so a change to discovery.worker can break discovery, while a change to discovery can't break discovery.worker.
- Position
- Below the diagonal: discovery uses a module listed above it, which is the healthy direction.
28→33 discovery uses network part of a loop✕
- Connections
- 1 pair of types, where a type in discovery uses a type in network.
- The types involved
mosaik.discovery.Discovery→mosaik.network.ProtocolProvider
- Direction
- discovery uses network, so a change to network can break discovery, while a change to discovery can't break network.
- 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.
29→4 groups.bond.worker uses primitives.channel✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in primitives.channel.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.primitives.channel.UnboundedChannel
- Direction
- groups.bond.worker uses primitives.channel, so a change to primitives.channel can break groups.bond.worker, while a change to groups.bond.worker can't break primitives.channel.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→7 groups.bond.worker uses groups.raft.protocol✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in groups.raft.protocol.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.groups.raft.protocol.Message
- Direction
- groups.bond.worker uses groups.raft.protocol, so a change to groups.raft.protocol can break groups.bond.worker, while a change to groups.bond.worker can't break groups.raft.protocol.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→8 groups.bond.worker uses network.link✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in network.link.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.network.link.Link
- Direction
- groups.bond.worker uses network.link, so a change to network.link can break groups.bond.worker, while a change to groups.bond.worker can't break network.link.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→9 groups.bond.worker uses tickets.ticket✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in tickets.ticket.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.tickets.ticket.Expiration
- Direction
- groups.bond.worker uses tickets.ticket, so a change to tickets.ticket can break groups.bond.worker, while a change to groups.bond.worker can't break tickets.ticket.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→11 groups.bond.worker uses discovery.entry✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in discovery.entry.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.discovery.entry.SignedPeerEntry
- Direction
- groups.bond.worker uses discovery.entry, so a change to discovery.entry can break groups.bond.worker, while a change to groups.bond.worker can't break discovery.entry.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→13 groups.bond.worker uses groups.bond.protocol✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in groups.bond.protocol.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.groups.bond.protocol.BondMessage
- Direction
- groups.bond.worker uses groups.bond.protocol, so a change to groups.bond.protocol can break groups.bond.worker, while a change to groups.bond.worker can't break groups.bond.protocol.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→15 groups.bond.worker uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in streams.producer.sender.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.streams.producer.sender.Sender
- Direction
- groups.bond.worker uses streams.producer.sender, so a change to streams.producer.sender can break groups.bond.worker, while a change to groups.bond.worker can't break streams.producer.sender.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→16 groups.bond.worker uses groups.group.state✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in groups.group.state.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.groups.group.state.WorkerState
- Direction
- groups.bond.worker uses groups.group.state, so a change to groups.group.state can break groups.bond.worker, while a change to groups.bond.worker can't break groups.group.state.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
29→27 groups.bond.worker uses discovery.worker✕
- Connections
- 1 pair of types, where a type in groups.bond.worker uses a type in discovery.worker.
- The types involved
mosaik.groups.bond.worker.BondWorker→mosaik.discovery.worker.WorkerCommand
- Direction
- groups.bond.worker uses discovery.worker, so a change to discovery.worker can break groups.bond.worker, while a change to groups.bond.worker can't break discovery.worker.
- Position
- Below the diagonal: groups.bond.worker uses a module listed above it, which is the healthy direction.
30→11 groups.group.worker uses discovery.entry✕
- Connections
- 2 pairs of types, where a type in groups.group.worker uses a type in discovery.entry.
- The types involved
mosaik.groups.group.worker.Worker→mosaik.discovery.entry.PeerEntryVersionmosaik.groups.group.worker.Worker→mosaik.discovery.entry.SignedPeerEntry
- Direction
- groups.group.worker uses discovery.entry, so a change to discovery.entry can break groups.group.worker, while a change to groups.group.worker can't break discovery.entry.
- Position
- Below the diagonal: groups.group.worker uses a module listed above it, which is the healthy direction.
30→12 groups.group.worker uses groups✕
- Connections
- 1 pair of types, where a type in groups.group.worker uses a type in groups.
- The types involved
mosaik.groups.group.worker.Worker→mosaik.groups.Groups
- Direction
- groups.group.worker uses groups, so a change to groups can break groups.group.worker, while a change to groups.group.worker can't break groups.
- Position
- Below the diagonal: groups.group.worker uses a module listed above it, which is the healthy direction.
30→16 groups.group.worker uses groups.group.state✕
- Connections
- 4 pairs of types, where a type in groups.group.worker uses a type in groups.group.state.
- The types involved
mosaik.groups.group.worker.Worker→mosaik.groups.group.state.AcceptRequestmosaik.groups.group.worker.Worker→mosaik.groups.group.state.GroupHandlemosaik.groups.group.worker.Worker→mosaik.groups.group.state.WorkerRaftCommandmosaik.groups.group.worker.Worker→mosaik.groups.group.state.WorkerState
- Direction
- groups.group.worker uses groups.group.state, so a change to groups.group.state can break groups.group.worker, while a change to groups.group.worker can't break groups.group.state.
- Position
- Below the diagonal: groups.group.worker uses a module listed above it, which is the healthy direction.
30→17 groups.group.worker uses groups.bond✕
- Connections
- 1 pair of types, where a type in groups.group.worker uses a type in groups.bond.
- The types involved
mosaik.groups.group.worker.Worker→mosaik.groups.bond.BondEvent
- Direction
- groups.group.worker uses groups.bond, so a change to groups.bond can break groups.group.worker, while a change to groups.group.worker can't break groups.bond.
- Position
- Below the diagonal: groups.group.worker uses a module listed above it, which is the healthy direction.
30→26 groups.group.worker uses discovery.catalog✕
- Connections
- 1 pair of types, where a type in groups.group.worker uses a type in discovery.catalog.
- The types involved
mosaik.groups.group.worker.Worker→mosaik.discovery.catalog.Catalog
- Direction
- groups.group.worker uses discovery.catalog, so a change to discovery.catalog can break groups.group.worker, while a change to groups.group.worker can't break discovery.catalog.
- Position
- Below the diagonal: groups.group.worker uses a module listed above it, which is the healthy direction.
30→27 groups.group.worker uses discovery.worker✕
- Connections
- 1 pair of types, where a type in groups.group.worker uses a type in discovery.worker.
- The types involved
mosaik.groups.group.worker.Worker→mosaik.discovery.worker.WorkerCommand
- Direction
- groups.group.worker uses discovery.worker, so a change to discovery.worker can break groups.group.worker, while a change to groups.group.worker can't break discovery.worker.
- Position
- Below the diagonal: groups.group.worker uses a module listed above it, which is the healthy direction.
31→8 streams.producer.worker uses network.link✕
- Connections
- 2 pairs of types, where a type in streams.producer.worker uses a type in network.link.
- The types involved
mosaik.streams.producer.worker.Handle→mosaik.network.link.Linkmosaik.streams.producer.worker.WorkerLoop→mosaik.network.link.Link
- Direction
- streams.producer.worker uses network.link, so a change to network.link can break streams.producer.worker, while a change to streams.producer.worker can't break network.link.
- Position
- Below the diagonal: streams.producer.worker uses a module listed above it, which is the healthy direction.
31→10 streams.producer.worker uses collections.when✕
- Connections
- 1 pair of types, where a type in streams.producer.worker uses a type in collections.when.
- The types involved
mosaik.streams.producer.worker.Handle→mosaik.collections.when.When
- Direction
- streams.producer.worker uses collections.when, so a change to collections.when can break streams.producer.worker, while a change to streams.producer.worker can't break collections.when.
- Position
- Below the diagonal: streams.producer.worker uses a module listed above it, which is the healthy direction.
31→11 streams.producer.worker uses discovery.entry✕
- Connections
- 2 pairs of types, where a type in streams.producer.worker uses a type in discovery.entry.
- The types involved
mosaik.streams.producer.worker.Handle→mosaik.discovery.entry.PeerEntrymosaik.streams.producer.worker.WorkerLoop→mosaik.discovery.entry.PeerEntry
- Direction
- streams.producer.worker uses discovery.entry, so a change to discovery.entry can break streams.producer.worker, while a change to streams.producer.worker can't break discovery.entry.
- Position
- Below the diagonal: streams.producer.worker uses a module listed above it, which is the healthy direction.
31→14 streams.producer.worker uses streams.consumer.receiver✕
- Connections
- 1 pair of types, where a type in streams.producer.worker uses a type in streams.consumer.receiver.
- The types involved
mosaik.streams.producer.worker.WorkerLoop→mosaik.streams.consumer.receiver.Receiver
- Direction
- streams.producer.worker uses streams.consumer.receiver, so a change to streams.consumer.receiver can break streams.producer.worker, while a change to streams.producer.worker can't break streams.consumer.receiver.
- Position
- Below the diagonal: streams.producer.worker uses a module listed above it, which is the healthy direction.
31→15 streams.producer.worker uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in streams.producer.worker uses a type in streams.producer.sender.
- The types involved
mosaik.streams.producer.worker.WorkerLoop→mosaik.streams.producer.sender.Sender
- Direction
- streams.producer.worker uses streams.producer.sender, so a change to streams.producer.sender can break streams.producer.worker, while a change to streams.producer.worker can't break streams.producer.sender.
- Position
- Below the diagonal: streams.producer.worker uses a module listed above it, which is the healthy direction.
31→27 streams.producer.worker uses discovery.worker✕
- Connections
- 1 pair of types, where a type in streams.producer.worker uses a type in discovery.worker.
- The types involved
mosaik.streams.producer.worker.WorkerLoop→mosaik.discovery.worker.Handle
- Direction
- streams.producer.worker uses discovery.worker, so a change to discovery.worker can break streams.producer.worker, while a change to streams.producer.worker can't break discovery.worker.
- Position
- Below the diagonal: streams.producer.worker uses a module listed above it, which is the healthy direction.
32→3 streams uses network.local✕
- Connections
- 1 pair of types, where a type in streams uses a type in network.local.
- The types involved
mosaik.streams.Streams→mosaik.network.local.LocalNode
- Direction
- streams uses network.local, so a change to network.local can break streams, while a change to streams can't break network.local.
- Position
- Below the diagonal: streams uses a module listed above it, which is the healthy direction.
32→8 streams uses network.link✕
- Connections
- 1 pair of types, where a type in streams uses a type in network.link.
- The types involved
mosaik.streams.Streams→mosaik.network.link.Protocol
- Direction
- streams uses network.link, so a change to network.link can break streams, while a change to streams can't break network.link.
- Position
- Below the diagonal: streams uses a module listed above it, which is the healthy direction.
32→24 streams uses collections.sync✕
- Connections
- 1 pair of types, where a type in streams uses a type in collections.sync.
- The types involved
mosaik.streams.Streams→mosaik.collections.sync.Config
- Direction
- streams uses collections.sync, so a change to collections.sync can break streams, while a change to streams can't break collections.sync.
- Position
- Below the diagonal: streams uses a module listed above it, which is the healthy direction.
32→28 streams uses discovery✕
- Connections
- 1 pair of types, where a type in streams uses a type in discovery.
- The types involved
mosaik.streams.Streams→mosaik.discovery.Discovery
- Direction
- streams uses discovery, so a change to discovery can break streams, while a change to streams can't break discovery.
- Position
- Below the diagonal: streams uses a module listed above it, which is the healthy direction.
32→33 streams uses network part of a loop✕
- Connections
- 5 pairs of types, where a type in streams uses a type in network.
- The types involved
mosaik.streams.ConsumerDef→mosaik.network.Networkmosaik.streams.ProducerDef→mosaik.network.Networkmosaik.streams.StreamConsumer→mosaik.network.Networkmosaik.streams.StreamProducer→mosaik.network.Networkmosaik.streams.Streams→mosaik.network.ProtocolProvider
- Direction
- streams uses network, so a change to network can break streams, while a change to streams can't break network.
- 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.
33→3 network uses network.local✕
- Connections
- 1 pair of types, where a type in network uses a type in network.local.
- The types involved
mosaik.network.Network→mosaik.network.local.LocalNode
- Direction
- network uses network.local, so a change to network.local can break network, while a change to network can't break network.local.
- Position
- Below the diagonal: network uses a module listed above it, which is the healthy direction.
33→12 network uses groups✕
- Connections
- 1 pair of types, where a type in network uses a type in groups.
- The types involved
mosaik.network.Network→mosaik.groups.Groups
- Direction
- network uses groups, so a change to groups can break network, while a change to network can't break groups.
- Position
- Below the diagonal: network uses a module listed above it, which is the healthy direction.
33→28 network uses discovery✕
- Connections
- 1 pair of types, where a type in network uses a type in discovery.
- The types involved
mosaik.network.Network→mosaik.discovery.Discovery
- Direction
- network uses discovery, so a change to discovery can break network, while a change to network can't break discovery.
- Position
- Below the diagonal: network uses a module listed above it, which is the healthy direction.
33→32 network uses streams✕
- Connections
- 1 pair of types, where a type in network uses a type in streams.
- The types involved
mosaik.network.Network→mosaik.streams.Streams
- Direction
- network uses streams, so a change to streams can break network, while a change to network can't break streams.
- Position
- Below the diagonal: network uses a module listed above it, which is the healthy direction.
34→3 streams.consumer.worker uses network.local✕
- Connections
- 1 pair of types, where a type in streams.consumer.worker uses a type in network.local.
- The types involved
mosaik.streams.consumer.worker.ConsumerWorker→mosaik.network.local.LocalNode
- Direction
- streams.consumer.worker uses network.local, so a change to network.local can break streams.consumer.worker, while a change to streams.consumer.worker can't break network.local.
- Position
- Below the diagonal: streams.consumer.worker uses a module listed above it, which is the healthy direction.
34→15 streams.consumer.worker uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in streams.consumer.worker uses a type in streams.producer.sender.
- The types involved
mosaik.streams.consumer.worker.ConsumerWorker→mosaik.streams.producer.sender.Sender
- Direction
- streams.consumer.worker uses streams.producer.sender, so a change to streams.producer.sender can break streams.consumer.worker, while a change to streams.consumer.worker can't break streams.producer.sender.
- Position
- Below the diagonal: streams.consumer.worker uses a module listed above it, which is the healthy direction.
34→26 streams.consumer.worker uses discovery.catalog✕
- Connections
- 1 pair of types, where a type in streams.consumer.worker uses a type in discovery.catalog.
- The types involved
mosaik.streams.consumer.worker.ConsumerWorker→mosaik.discovery.catalog.Catalog
- Direction
- streams.consumer.worker uses discovery.catalog, so a change to discovery.catalog can break streams.consumer.worker, while a change to streams.consumer.worker can't break discovery.catalog.
- Position
- Below the diagonal: streams.consumer.worker uses a module listed above it, which is the healthy direction.
34→28 streams.consumer.worker uses discovery✕
- Connections
- 1 pair of types, where a type in streams.consumer.worker uses a type in discovery.
- The types involved
mosaik.streams.consumer.worker.ConsumerWorker→mosaik.discovery.Discovery
- Direction
- streams.consumer.worker uses discovery, so a change to discovery can break streams.consumer.worker, while a change to streams.consumer.worker can't break discovery.
- Position
- Below the diagonal: streams.consumer.worker uses a module listed above it, which is the healthy direction.
34→32 streams.consumer.worker uses streams✕
- Connections
- 1 pair of types, where a type in streams.consumer.worker uses a type in streams.
- The types involved
mosaik.streams.consumer.worker.ConsumerWorker→mosaik.streams.Streams
- Direction
- streams.consumer.worker uses streams, so a change to streams can break streams.consumer.worker, while a change to streams.consumer.worker can't break streams.
- Position
- Below the diagonal: streams.consumer.worker uses a module listed above it, which is the healthy direction.
35→1 collections uses collections.config✕
- Connections
- 1 pair of types, where a type in collections uses a type in collections.config.
- The types involved
mosaik.collections.CollectionFromDef→mosaik.collections.config.CollectionConfig
- Direction
- collections uses collections.config, so a change to collections.config can break collections, while a change to collections can't break collections.config.
- Position
- Below the diagonal: collections uses a module listed above it, which is the healthy direction.
35→33 collections uses network✕
- Connections
- 6 pairs of types, where a type in collections uses a type in network.
- The types involved
mosaik.collections.CollectionDef→mosaik.network.Networkmosaik.collections.CollectionFromDef→mosaik.network.Networkmosaik.collections.CollectionReader→mosaik.network.Networkmosaik.collections.CollectionWriter→mosaik.network.Networkmosaik.collections.ReaderDef→mosaik.network.Networkmosaik.collections.WriterDef→mosaik.network.Network
- Direction
- collections uses network, so a change to network can break collections, while a change to collections can't break network.
- Position
- Below the diagonal: collections uses a module listed above it, which is the healthy direction.
36→1 collections.cell uses collections.config✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in collections.config.
- The types involved
mosaik.collections.cell.Cell→mosaik.collections.config.CollectionConfig
- Direction
- collections.cell uses collections.config, so a change to collections.config can break collections.cell, while a change to collections.cell can't break collections.config.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→5 collections.cell uses collections.primitives✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in collections.primitives.
- The types involved
mosaik.collections.cell.Cell→mosaik.collections.primitives.Version
- Direction
- collections.cell uses collections.primitives, so a change to collections.primitives can break collections.cell, while a change to collections.cell can't break collections.primitives.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→10 collections.cell uses collections.when✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in collections.when.
- The types involved
mosaik.collections.cell.Cell→mosaik.collections.when.When
- Direction
- collections.cell uses collections.when, so a change to collections.when can break collections.cell, while a change to collections.cell can't break collections.when.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→14 collections.cell uses streams.consumer.receiver✕
- Connections
- 2 pairs of types, where a type in collections.cell uses a type in streams.consumer.receiver.
- The types involved
mosaik.collections.cell.Cell→mosaik.streams.consumer.receiver.Receivermosaik.collections.cell.CellStateMachine→mosaik.streams.consumer.receiver.Receiver
- Direction
- collections.cell uses streams.consumer.receiver, so a change to streams.consumer.receiver can break collections.cell, while a change to collections.cell can't break streams.consumer.receiver.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→15 collections.cell uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in streams.producer.sender.
- The types involved
mosaik.collections.cell.CellStateMachine→mosaik.streams.producer.sender.Sender
- Direction
- collections.cell uses streams.producer.sender, so a change to streams.producer.sender can break collections.cell, while a change to collections.cell can't break streams.producer.sender.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→18 collections.cell uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in groups.machine.sync.
- The types involved
mosaik.collections.cell.CellStateMachine→mosaik.groups.machine.sync.StateSync
- Direction
- collections.cell uses groups.machine.sync, so a change to groups.machine.sync can break collections.cell, while a change to collections.cell can't break groups.machine.sync.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→19 collections.cell uses groups.machine✕
- Connections
- 4 pairs of types, where a type in collections.cell uses a type in groups.machine.
- The types involved
mosaik.collections.cell.CellStateMachine→mosaik.groups.machine.Commandmosaik.collections.cell.CellStateMachine→mosaik.groups.machine.LeadershipPreferencemosaik.collections.cell.CellStateMachine→mosaik.groups.machine.Querymosaik.collections.cell.CellStateMachine→mosaik.groups.machine.StateMachine
- Direction
- collections.cell uses groups.machine, so a change to groups.machine can break collections.cell, while a change to collections.cell can't break groups.machine.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→20 collections.cell uses groups.group✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in groups.group.
- The types involved
mosaik.collections.cell.Cell→mosaik.groups.group.Group
- Direction
- collections.cell uses groups.group, so a change to groups.group can break collections.cell, while a change to collections.cell can't break groups.group.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→24 collections.cell uses collections.sync✕
- Connections
- 4 pairs of types, where a type in collections.cell uses a type in collections.sync.
- The types involved
mosaik.collections.cell.CellSnapshot→mosaik.collections.sync.Snapshotmosaik.collections.cell.CellStateMachine→mosaik.collections.sync.Snapshotmosaik.collections.cell.CellStateMachine→mosaik.collections.sync.SnapshotStateMachinemosaik.collections.cell.CellStateMachine→mosaik.collections.sync.SnapshotSync
- Direction
- collections.cell uses collections.sync, so a change to collections.sync can break collections.cell, while a change to collections.cell can't break collections.sync.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→33 collections.cell uses network✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in network.
- The types involved
mosaik.collections.cell.Cell→mosaik.network.Network
- Direction
- collections.cell uses network, so a change to network can break collections.cell, while a change to collections.cell can't break network.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
36→35 collections.cell uses collections✕
- Connections
- 1 pair of types, where a type in collections.cell uses a type in collections.
- The types involved
mosaik.collections.cell.Cell→mosaik.collections.CollectionFromDef
- Direction
- collections.cell uses collections, so a change to collections can break collections.cell, while a change to collections.cell can't break collections.
- Position
- Below the diagonal: collections.cell uses a module listed above it, which is the healthy direction.
37→1 collections.depq uses collections.config✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in collections.config.
- The types involved
mosaik.collections.depq.PriorityQueue→mosaik.collections.config.CollectionConfig
- Direction
- collections.depq uses collections.config, so a change to collections.config can break collections.depq, while a change to collections.depq can't break collections.config.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→5 collections.depq uses collections.primitives✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in collections.primitives.
- The types involved
mosaik.collections.depq.PriorityQueue→mosaik.collections.primitives.Version
- Direction
- collections.depq uses collections.primitives, so a change to collections.primitives can break collections.depq, while a change to collections.depq can't break collections.primitives.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→10 collections.depq uses collections.when✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in collections.when.
- The types involved
mosaik.collections.depq.PriorityQueue→mosaik.collections.when.When
- Direction
- collections.depq uses collections.when, so a change to collections.when can break collections.depq, while a change to collections.depq can't break collections.when.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→14 collections.depq uses streams.consumer.receiver✕
- Connections
- 2 pairs of types, where a type in collections.depq uses a type in streams.consumer.receiver.
- The types involved
mosaik.collections.depq.DepqStateMachine→mosaik.streams.consumer.receiver.Receivermosaik.collections.depq.PriorityQueue→mosaik.streams.consumer.receiver.Receiver
- Direction
- collections.depq uses streams.consumer.receiver, so a change to streams.consumer.receiver can break collections.depq, while a change to collections.depq can't break streams.consumer.receiver.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→15 collections.depq uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in streams.producer.sender.
- The types involved
mosaik.collections.depq.DepqStateMachine→mosaik.streams.producer.sender.Sender
- Direction
- collections.depq uses streams.producer.sender, so a change to streams.producer.sender can break collections.depq, while a change to collections.depq can't break streams.producer.sender.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→18 collections.depq uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in groups.machine.sync.
- The types involved
mosaik.collections.depq.DepqStateMachine→mosaik.groups.machine.sync.StateSync
- Direction
- collections.depq uses groups.machine.sync, so a change to groups.machine.sync can break collections.depq, while a change to collections.depq can't break groups.machine.sync.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→19 collections.depq uses groups.machine✕
- Connections
- 4 pairs of types, where a type in collections.depq uses a type in groups.machine.
- The types involved
mosaik.collections.depq.DepqStateMachine→mosaik.groups.machine.Commandmosaik.collections.depq.DepqStateMachine→mosaik.groups.machine.LeadershipPreferencemosaik.collections.depq.DepqStateMachine→mosaik.groups.machine.Querymosaik.collections.depq.DepqStateMachine→mosaik.groups.machine.StateMachine
- Direction
- collections.depq uses groups.machine, so a change to groups.machine can break collections.depq, while a change to collections.depq can't break groups.machine.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→20 collections.depq uses groups.group✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in groups.group.
- The types involved
mosaik.collections.depq.PriorityQueue→mosaik.groups.group.Group
- Direction
- collections.depq uses groups.group, so a change to groups.group can break collections.depq, while a change to collections.depq can't break groups.group.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→24 collections.depq uses collections.sync✕
- Connections
- 4 pairs of types, where a type in collections.depq uses a type in collections.sync.
- The types involved
mosaik.collections.depq.DepqStateMachine→mosaik.collections.sync.Snapshotmosaik.collections.depq.DepqStateMachine→mosaik.collections.sync.SnapshotStateMachinemosaik.collections.depq.DepqStateMachine→mosaik.collections.sync.SnapshotSyncmosaik.collections.depq.PriorityQueueSnapshot→mosaik.collections.sync.Snapshot
- Direction
- collections.depq uses collections.sync, so a change to collections.sync can break collections.depq, while a change to collections.depq can't break collections.sync.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→33 collections.depq uses network✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in network.
- The types involved
mosaik.collections.depq.PriorityQueue→mosaik.network.Network
- Direction
- collections.depq uses network, so a change to network can break collections.depq, while a change to collections.depq can't break network.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
37→35 collections.depq uses collections✕
- Connections
- 1 pair of types, where a type in collections.depq uses a type in collections.
- The types involved
mosaik.collections.depq.PriorityQueue→mosaik.collections.CollectionFromDef
- Direction
- collections.depq uses collections, so a change to collections can break collections.depq, while a change to collections.depq can't break collections.
- Position
- Below the diagonal: collections.depq uses a module listed above it, which is the healthy direction.
38→1 collections.map uses collections.config✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in collections.config.
- The types involved
mosaik.collections.map.Map→mosaik.collections.config.CollectionConfig
- Direction
- collections.map uses collections.config, so a change to collections.config can break collections.map, while a change to collections.map can't break collections.config.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→5 collections.map uses collections.primitives✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in collections.primitives.
- The types involved
mosaik.collections.map.Map→mosaik.collections.primitives.Version
- Direction
- collections.map uses collections.primitives, so a change to collections.primitives can break collections.map, while a change to collections.map can't break collections.primitives.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→10 collections.map uses collections.when✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in collections.when.
- The types involved
mosaik.collections.map.Map→mosaik.collections.when.When
- Direction
- collections.map uses collections.when, so a change to collections.when can break collections.map, while a change to collections.map can't break collections.when.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→14 collections.map uses streams.consumer.receiver✕
- Connections
- 2 pairs of types, where a type in collections.map uses a type in streams.consumer.receiver.
- The types involved
mosaik.collections.map.Map→mosaik.streams.consumer.receiver.Receivermosaik.collections.map.MapStateMachine→mosaik.streams.consumer.receiver.Receiver
- Direction
- collections.map uses streams.consumer.receiver, so a change to streams.consumer.receiver can break collections.map, while a change to collections.map can't break streams.consumer.receiver.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→15 collections.map uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in streams.producer.sender.
- The types involved
mosaik.collections.map.MapStateMachine→mosaik.streams.producer.sender.Sender
- Direction
- collections.map uses streams.producer.sender, so a change to streams.producer.sender can break collections.map, while a change to collections.map can't break streams.producer.sender.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→18 collections.map uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in groups.machine.sync.
- The types involved
mosaik.collections.map.MapStateMachine→mosaik.groups.machine.sync.StateSync
- Direction
- collections.map uses groups.machine.sync, so a change to groups.machine.sync can break collections.map, while a change to collections.map can't break groups.machine.sync.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→19 collections.map uses groups.machine✕
- Connections
- 4 pairs of types, where a type in collections.map uses a type in groups.machine.
- The types involved
mosaik.collections.map.MapStateMachine→mosaik.groups.machine.Commandmosaik.collections.map.MapStateMachine→mosaik.groups.machine.LeadershipPreferencemosaik.collections.map.MapStateMachine→mosaik.groups.machine.Querymosaik.collections.map.MapStateMachine→mosaik.groups.machine.StateMachine
- Direction
- collections.map uses groups.machine, so a change to groups.machine can break collections.map, while a change to collections.map can't break groups.machine.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→20 collections.map uses groups.group✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in groups.group.
- The types involved
mosaik.collections.map.Map→mosaik.groups.group.Group
- Direction
- collections.map uses groups.group, so a change to groups.group can break collections.map, while a change to collections.map can't break groups.group.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→24 collections.map uses collections.sync✕
- Connections
- 4 pairs of types, where a type in collections.map uses a type in collections.sync.
- The types involved
mosaik.collections.map.MapSnapshot→mosaik.collections.sync.Snapshotmosaik.collections.map.MapStateMachine→mosaik.collections.sync.Snapshotmosaik.collections.map.MapStateMachine→mosaik.collections.sync.SnapshotStateMachinemosaik.collections.map.MapStateMachine→mosaik.collections.sync.SnapshotSync
- Direction
- collections.map uses collections.sync, so a change to collections.sync can break collections.map, while a change to collections.map can't break collections.sync.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→33 collections.map uses network✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in network.
- The types involved
mosaik.collections.map.Map→mosaik.network.Network
- Direction
- collections.map uses network, so a change to network can break collections.map, while a change to collections.map can't break network.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
38→35 collections.map uses collections✕
- Connections
- 1 pair of types, where a type in collections.map uses a type in collections.
- The types involved
mosaik.collections.map.Map→mosaik.collections.CollectionFromDef
- Direction
- collections.map uses collections, so a change to collections can break collections.map, while a change to collections.map can't break collections.
- Position
- Below the diagonal: collections.map uses a module listed above it, which is the healthy direction.
39→1 collections.once uses collections.config✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in collections.config.
- The types involved
mosaik.collections.once.Once→mosaik.collections.config.CollectionConfig
- Direction
- collections.once uses collections.config, so a change to collections.config can break collections.once, while a change to collections.once can't break collections.config.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→5 collections.once uses collections.primitives✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in collections.primitives.
- The types involved
mosaik.collections.once.Once→mosaik.collections.primitives.Version
- Direction
- collections.once uses collections.primitives, so a change to collections.primitives can break collections.once, while a change to collections.once can't break collections.primitives.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→10 collections.once uses collections.when✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in collections.when.
- The types involved
mosaik.collections.once.Once→mosaik.collections.when.When
- Direction
- collections.once uses collections.when, so a change to collections.when can break collections.once, while a change to collections.once can't break collections.when.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→14 collections.once uses streams.consumer.receiver✕
- Connections
- 2 pairs of types, where a type in collections.once uses a type in streams.consumer.receiver.
- The types involved
mosaik.collections.once.Once→mosaik.streams.consumer.receiver.Receivermosaik.collections.once.OnceStateMachine→mosaik.streams.consumer.receiver.Receiver
- Direction
- collections.once uses streams.consumer.receiver, so a change to streams.consumer.receiver can break collections.once, while a change to collections.once can't break streams.consumer.receiver.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→15 collections.once uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in streams.producer.sender.
- The types involved
mosaik.collections.once.OnceStateMachine→mosaik.streams.producer.sender.Sender
- Direction
- collections.once uses streams.producer.sender, so a change to streams.producer.sender can break collections.once, while a change to collections.once can't break streams.producer.sender.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→18 collections.once uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in groups.machine.sync.
- The types involved
mosaik.collections.once.OnceStateMachine→mosaik.groups.machine.sync.StateSync
- Direction
- collections.once uses groups.machine.sync, so a change to groups.machine.sync can break collections.once, while a change to collections.once can't break groups.machine.sync.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→19 collections.once uses groups.machine✕
- Connections
- 4 pairs of types, where a type in collections.once uses a type in groups.machine.
- The types involved
mosaik.collections.once.OnceStateMachine→mosaik.groups.machine.Commandmosaik.collections.once.OnceStateMachine→mosaik.groups.machine.LeadershipPreferencemosaik.collections.once.OnceStateMachine→mosaik.groups.machine.Querymosaik.collections.once.OnceStateMachine→mosaik.groups.machine.StateMachine
- Direction
- collections.once uses groups.machine, so a change to groups.machine can break collections.once, while a change to collections.once can't break groups.machine.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→20 collections.once uses groups.group✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in groups.group.
- The types involved
mosaik.collections.once.Once→mosaik.groups.group.Group
- Direction
- collections.once uses groups.group, so a change to groups.group can break collections.once, while a change to collections.once can't break groups.group.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→24 collections.once uses collections.sync✕
- Connections
- 4 pairs of types, where a type in collections.once uses a type in collections.sync.
- The types involved
mosaik.collections.once.OnceSnapshot→mosaik.collections.sync.Snapshotmosaik.collections.once.OnceStateMachine→mosaik.collections.sync.Snapshotmosaik.collections.once.OnceStateMachine→mosaik.collections.sync.SnapshotStateMachinemosaik.collections.once.OnceStateMachine→mosaik.collections.sync.SnapshotSync
- Direction
- collections.once uses collections.sync, so a change to collections.sync can break collections.once, while a change to collections.once can't break collections.sync.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→33 collections.once uses network✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in network.
- The types involved
mosaik.collections.once.Once→mosaik.network.Network
- Direction
- collections.once uses network, so a change to network can break collections.once, while a change to collections.once can't break network.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
39→35 collections.once uses collections✕
- Connections
- 1 pair of types, where a type in collections.once uses a type in collections.
- The types involved
mosaik.collections.once.Once→mosaik.collections.CollectionFromDef
- Direction
- collections.once uses collections, so a change to collections can break collections.once, while a change to collections.once can't break collections.
- Position
- Below the diagonal: collections.once uses a module listed above it, which is the healthy direction.
40→1 collections.set uses collections.config✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in collections.config.
- The types involved
mosaik.collections.set.Set→mosaik.collections.config.CollectionConfig
- Direction
- collections.set uses collections.config, so a change to collections.config can break collections.set, while a change to collections.set can't break collections.config.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→5 collections.set uses collections.primitives✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in collections.primitives.
- The types involved
mosaik.collections.set.Set→mosaik.collections.primitives.Version
- Direction
- collections.set uses collections.primitives, so a change to collections.primitives can break collections.set, while a change to collections.set can't break collections.primitives.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→10 collections.set uses collections.when✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in collections.when.
- The types involved
mosaik.collections.set.Set→mosaik.collections.when.When
- Direction
- collections.set uses collections.when, so a change to collections.when can break collections.set, while a change to collections.set can't break collections.when.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→14 collections.set uses streams.consumer.receiver✕
- Connections
- 2 pairs of types, where a type in collections.set uses a type in streams.consumer.receiver.
- The types involved
mosaik.collections.set.Set→mosaik.streams.consumer.receiver.Receivermosaik.collections.set.SetStateMachine→mosaik.streams.consumer.receiver.Receiver
- Direction
- collections.set uses streams.consumer.receiver, so a change to streams.consumer.receiver can break collections.set, while a change to collections.set can't break streams.consumer.receiver.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→15 collections.set uses streams.producer.sender✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in streams.producer.sender.
- The types involved
mosaik.collections.set.SetStateMachine→mosaik.streams.producer.sender.Sender
- Direction
- collections.set uses streams.producer.sender, so a change to streams.producer.sender can break collections.set, while a change to collections.set can't break streams.producer.sender.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→18 collections.set uses groups.machine.sync✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in groups.machine.sync.
- The types involved
mosaik.collections.set.SetStateMachine→mosaik.groups.machine.sync.StateSync
- Direction
- collections.set uses groups.machine.sync, so a change to groups.machine.sync can break collections.set, while a change to collections.set can't break groups.machine.sync.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→19 collections.set uses groups.machine✕
- Connections
- 4 pairs of types, where a type in collections.set uses a type in groups.machine.
- The types involved
mosaik.collections.set.SetStateMachine→mosaik.groups.machine.Commandmosaik.collections.set.SetStateMachine→mosaik.groups.machine.LeadershipPreferencemosaik.collections.set.SetStateMachine→mosaik.groups.machine.Querymosaik.collections.set.SetStateMachine→mosaik.groups.machine.StateMachine
- Direction
- collections.set uses groups.machine, so a change to groups.machine can break collections.set, while a change to collections.set can't break groups.machine.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→20 collections.set uses groups.group✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in groups.group.
- The types involved
mosaik.collections.set.Set→mosaik.groups.group.Group
- Direction
- collections.set uses groups.group, so a change to groups.group can break collections.set, while a change to collections.set can't break groups.group.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→24 collections.set uses collections.sync✕
- Connections
- 4 pairs of types, where a type in collections.set uses a type in collections.sync.
- The types involved
mosaik.collections.set.SetSnapshot→mosaik.collections.sync.Snapshotmosaik.collections.set.SetStateMachine→mosaik.collections.sync.Snapshotmosaik.collections.set.SetStateMachine→mosaik.collections.sync.SnapshotStateMachinemosaik.collections.set.SetStateMachine→mosaik.collections.sync.SnapshotSync
- Direction
- collections.set uses collections.sync, so a change to collections.sync can break collections.set, while a change to collections.set can't break collections.sync.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→33 collections.set uses network✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in network.
- The types involved
mosaik.collections.set.Set→mosaik.network.Network
- Direction
- collections.set uses network, so a change to network can break collections.set, while a change to collections.set can't break network.
- Position
- Below the diagonal: collections.set uses a module listed above it, which is the healthy direction.
40→35 collections.set uses collections✕
- Connections
- 1 pair of types, where a type in collections.set uses a type in collections.
- The types involved
mosaik.collections.set.Set→mosaik.collections.CollectionFromDef
- Direction
- collections.set uses collections, so a change to collections can break collections.set, while a change to collections.set can't break collections.
- Position
- Below the diagonal: collections.set 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-Driven
At a glance — Event Sourcing
At a glance — Performance
Roadmap
Top priorities: Add a CI workflow that builds and runs the test suite on every push/PR; Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml; Resolve the 87 Orphaned file finding(s) in Knowledge Freshness — start with mod.rs (14), builder.rs (6), worker.rs (5).
| Do this | Helps | Effort | Dimension |
|---|---|---|---|
| Resolve the 1 No ADRs found finding(s) in ADR Quality — start with Cargo.toml. | +5.9 pts | Low | ADR Quality |
| Resolve the 87 Orphaned file finding(s) in Knowledge Freshness — start with mod.rs (14), builder.rs (6), worker.rs (5). | +5.9 pts | Medium | Knowledge Freshness |
| Add a CI workflow that builds and runs the test suite on every push/PR. | +8.9 pts | Medium | CI/CD gates |
| 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. | +4.7 pts | Medium | Architecture documentation |
| Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release. | +3.7 pts | Medium | Release Hygiene |
| Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with jwt.rs, depq.rs, link.rs. | +0.4 pts | Low | Knowledge Freshness |
| Use the awaited twin of each blocking call, or move the work off the loop with `tokio::task::spawn_blocking` — a synchronous handler cannot simply `.await` in place. | +1.3 pts | Medium | Handler temporal coupling |
| Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Cargo.toml. | +0.4 pts | Low | Project Cohesion |
File quality
| File | Score | Band | Worst signal |
|---|---|---|---|
| src/groups/when.rs | 5.7 | Mixed | Code Duplication: Edited copies of one member (3 members, 15+ corresponding lines) |
| src/discovery/announce.rs | 6.0 | Mixed | Explicit Debt: TodoComment |
| src/groups/raft/leader.rs | 6.0 | Mixed | Explicit Debt: TodoComment |
| src/groups/raft/follower.rs | 6.7 | Mixed | Explicit Debt: TodoComment |
| src/streams/consumer/receiver.rs | 6.7 | Mixed | Explicit Debt: TodoComment |
| src/collections/sync/session.rs | 7.0 | Mixed | Cognitive Complexity: SnapshotSyncSession::schedule_fetches (cognitive 18) |
| src/tee/tdx/builder/alpine/builder.rs | 7.0 | Mixed | Cyclomatic Complexity: AlpineBuilder::build (cyclomatic 17) |
| src/tee/tdx/builder/alpine/cross.rs | 7.0 | Mixed | Cognitive Complexity: mosaik::tee::tdx::builder::alpine::cross::cross_compile_musl (cognitive 17) |
| src/macros/src/collection.rs | 7.0 | Mixed | Cognitive Complexity: CollectionInput::parse (cognitive 16) |
| src/collections/cell.rs | 7.0 | Mixed | Code Duplication: Near-duplicate member family (6 members, 34 shared lines) |
| src/collections/map.rs | 7.0 | Mixed | Cyclomatic Complexity: MapStateMachine::apply_batch (cyclomatic 17) |
| src/macros/src/stream.rs | 7.1 | Mixed | Cyclomatic Complexity: StreamInput::parse (cyclomatic 26) |
| src/tickets/jwt.rs | 7.1 | Mixed | Cyclomatic Complexity: Jwt::validate (cyclomatic 21) |
| src/network/link.rs | 7.1 | Mixed | God Classes: FileTooLong: network/link.rs |
| src/collections/depq.rs | 7.2 | Mixed | Cyclomatic Complexity: DepqStateMachine::apply_batch (cyclomatic 22) |
| src/tee/tdx/builder/kernel.rs | 7.2 | Mixed | Code Duplication: Edited copy of a member (98 corresponding lines) |
| src/streams/consumer/mod.rs | 7.4 | Mixed | Code Duplication: Edited copy of a member (15 corresponding lines) |
| src/collections/vec.rs | 7.8 | Mixed | Cyclomatic Complexity: VecStateMachine::apply_batch (cyclomatic 19) |
| src/cli/dht.rs | 7.8 | Mixed | Cyclomatic Complexity: DhtCommand::run (cyclomatic 16) |
| src/tee/tdx/builder/ubuntu/builder.rs | 7.8 | Mixed | Cognitive Complexity: UbuntuBuilder::build (cognitive 25) |
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 49 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 — 49 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, 336 of 341 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 | Secrets in history, SAST, CVEs, IaC & container, PII / GDPR | 1.86.0 · 0.69.3 | ✓ deterministic |
Run transparency — what happened this run
- D8 Code Coverage — 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. Coverage NOT MEASURED: the Rust half could not be measured — the Cargo suite in repository root did not build, so it was never run. Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo.
- D11 Test Reliability — 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. Test source is present (.rs) and this repository declares a Cargo test suite (repository root, 42 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
- D12 Dependency 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. Not scored — 54 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, and no committed Cargo.lock resolves them to versions, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
- D14 License Compliance — 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. Not scored — this repository declares Cargo manifests but commits no Cargo.lock, so its dependency graph was closed from the manifests over the crates.io index, and part of it could not be read: no published release of digest satisfies `=0.11.0-rc.10`. A licence verdict over part of a dependency graph is not a licence verdict. NOT a finding that this repository's licences are compliant: this dimension asserts nothing about its licensing in either direction.
- D16 Bus Factor — 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. Single-maintainer repository — bus factor is not applicable (5 contributor(s) across 258 commit(s) sampled, automation and bot accounts excluded). One of them holds 93% of the history; the other 4 hold 1.8% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
- D19 Documentation Quality — 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 kind did not reach the 95 % precision gate in three adjudicated runs (docs/plans/deterministic-engine/adjudication/D19-sample3-v3.md), so by the pre-registered fallback it publishes no row until a re-measurement shows it does. The candidates are counted here, not reported as findings, and the score does not include them.
- 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 — 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 the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
- D27 Navigability — 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. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
- AX6 Interface segregation — 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 computed over the public interfaces this run's compilations declare, and none was loaded, 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.
- X17 Uncapped recursion over a caller-supplied document — 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. 2 further occurrence(s) are not listed individually; the score already reflects all 42.
- X19 Unrestored process-global state — 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 reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala, PHP, Go, Swift, Erlang, F# and Visual Basic source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Python, Dart, Ruby, Scala, PHP, Go, Swift, Erlang, F# or Visual Basic was found in this repository, so it had nothing of this repository's product 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.
- X24 Document value interpolated into markup unescaped — 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 reads C# syntax, and JavaScript/TypeScript, Java, Scala, Ruby and Python source only, and no C# was loaded and no JavaScript/TypeScript, Java, Scala, Ruby or Python was found in this repository, so it had nothing of this repository's product 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.
- X3 Exception handling — 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 reads C# syntax, and PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go and JavaScript/TypeScript source only, and no C# was loaded and no PHP, Java, Kotlin, Python, Ruby, Scala, Dart, Swift, Erlang, Go, JavaScript or TypeScript was found in this repository, so it had nothing of this repository's product 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.
- X5 Nullable reference types — 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. 189 further occurrence(s) are not listed individually; the score already reflects all 229.
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
- D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
- D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
- D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
- D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
- 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.
- 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").
- 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.
- 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.
- 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.
- 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").
- 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.
- 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 Dockerfile (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.
- 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
D1 · Cyclomatic Complexity
8 function(s) exceeded the cyclomatic complexity threshold of 15; the worst was StreamInput::parse at 26.
What to do
- Bring the 8 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with StreamInput::parse (cyclomatic 26), StreamInput::expand (cyclomatic 23), DepqStateMachine::apply_batch (cyclomatic 22). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 8 together lifts Cyclomatic Complexity from 8.8 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.
D2 · Cognitive Complexity
22 function(s) exceeded the cognitive complexity threshold of 15; the worst was StreamInput::parse at 50.
What to do
- Bring the 2 bodies over 30 down to 30 or less in Cognitive Complexity — start with StreamInput::parse (cognitive 50), DepqStateMachine::apply_batch (cognitive 37). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 2 together lifts Cognitive Complexity from 7.0 to about 7.5/10, projected with the scoring formula itself and assuming each lands exactly at 30; a cleaner split scores higher.
D3 · God Classes
12 over-large unit(s) detected — types, modules or files that carry too much.
What to do
- Resolve the 4 MethodTooLong finding(s) in God Classes — start with builder.rs (2), stream.rs, collection.rs. — One of this dimension's main actionable groups (4 warning-level).
- Resolve the 3 FileTooLong finding(s) in God Classes — start with jwt.rs, depq.rs, link.rs. — One of this dimension's main actionable groups (3 warning-level).
- Resolve the 3 FunctionTooLong finding(s) in God Classes — start with cross.rs (2), common.rs. — One of this dimension's main actionable groups (3 warning-level).
D4 · Code Duplication
53 duplicated block group(s) detected. 7.6 % of the production lines (2,419 of 31,801) are in a reported copy. A further 30 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.
What to do
- Resolve the 7 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with mod.rs (2), builder.rs (2), role.rs. — One of this dimension's main actionable groups (7 warning-level).
- Resolve the 4 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with session.rs, announce.rs, sync.rs. — One of this dimension's main actionable groups (4 warning-level).
- Resolve the 4 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with map.rs (2), when.rs, worker.rs. — One of this dimension's main actionable groups (4 warning-level).
D5 · Coupling
2 production modules (Cargo), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence, with abstractness counted on 1 of the 2 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).
D6 · Cohesion (LCOM4)
3 of 96 classes have LCOM4 above 3.
What to do
- Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) — start with mod.rs, shared.rs, when.rs. — One of this dimension's main actionable groups (3 warning-level).
D13 · Secret Scanning
Secret scan ran and found no leaked secrets.
D15 · Churn × Complexity Hotspots
Top hotspots: src/collections/depq.rs (19×22=418); src/collections/vec.rs (21×19=399); src/collections/map.rs (19×17=323)
What to do
- Resolve the 6 Hotspot finding(s) in Churn × Complexity Hotspots — start with depq.rs, vec.rs, map.rs. — One of this dimension's main actionable groups (6 warning-level).
D17 · Explicit Debt
5 deducted task-comment markers across 31801 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
What to do
- Resolve the 5 TodoComment finding(s) in Explicit Debt — start with leader.rs (2), receiver.rs, follower.rs. — One of this dimension's main actionable groups (5 warning-level).
D19 · Documentation Quality
1 of 1 documentation facets pass in full. 1 document(s) read across 2 unit(s).
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 Cargo.toml. — One of this dimension's main actionable groups (1 recommendation-level).
D26 · Project Cohesion
1 of 2 build units (Cargo) flagged as possibly oversized/incoherent.
What to do
- Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion — start with Cargo.toml. — One of this dimension's main actionable groups (1 recommendation-level).
D28 · Secrets (history)
gitleaks scanned the full history AND the current working tree and found no secrets.
D29 · Static Analysis (SAST)
semgrep found no security issues. semgrep hit a parse error in 9 file(s) — `src/collections/cell.rs` (line 58), `src/collections/depq.rs` (line 52, line 55, line 59, …), `src/collections/map.rs` (line 53), `src/collections/once.rs` (line 60), `src/collections/set.rs` (line 49), … (+4 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.
D34 · Knowledge Freshness
90 of 90 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is src/tickets/jwt.rs. Counted over 90 of the 117 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 87 Orphaned file finding(s) in Knowledge Freshness — start with mod.rs (14), builder.rs (6), worker.rs (5). — One of this dimension's main actionable groups (87 recommendation-level).
- Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with jwt.rs, depq.rs, link.rs. — One of this dimension's main actionable groups (3 recommendation-level).
- Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
D35 · Change Coupling
Strongest change-coupling: receiver.rs↔mod.rs 67%
What to do
- Resolve the 1 Change coupling finding(s) in Change Coupling — start with receiver.rs. — One of this dimension's main actionable groups (1 warning-level).
D44 · Platform End-of-Life
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 0 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
AX9 · CQS / query purity
ED1 · Handler temporal coupling
- `Acceptor.wait_for_handshake` runs on the async event loop (it is async, an actor or framework handler, a hand-written `poll`, or called from one) and makes the blocking call `recv`: while it blocks, the loop's worker thread serves nothing else, so every task, message and request scheduled on it waits — and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (`tokio::time::sleep(..).await`, `tokio::fs`, an async channel/client), or move the work off the loop with `tokio::task::spawn_blocking`. — src/groups/bond/protocol.rs:199
What to do
- Use the awaited twin of each blocking call, or move the work off the loop with `tokio::task::spawn_blocking` — a synchronous handler cannot simply `.await` in place.
ES2 · Immutable events
GD1 · Unfinished & placeholder code
IC1 · Incompleteness & stubs
- `query` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. (×6) — src/collections/cell.rs:490, src/collections/depq.rs:984, src/collections/map.rs:653, …
- `serve_snapshot` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — src/collections/sync/mod.rs:367
- `send_raw_message` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — src/groups/bond/mod.rs:436
- `bond_with` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — src/groups/group/state.rs:203
- `send` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. — src/primitives/channel.rs:33
- `matches` looks like it should compute a result but its body just returns a constant — a placeholder return that was never filled in. — src/streams/criteria.rs:10
What to do
- Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
M1 · Documentation (README)
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
- No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
What to do
- Add a CI workflow that builds and runs the test suite on every push/PR.
P10 · Library API & versioning
P2 · Observability
P3 · Security & performance tooling
- No static application security testing detected. For this repository's stack, add cargo-audit / cargo-deny (or clippy) (or `semgrep --config=auto`, which runs on any language) — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
- `Cargo.toml` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — Cargo.toml:18
What to do
- Run what this repository's stack ships: cargo-audit / cargo-deny (or clippy) — or `semgrep --config=auto`, which runs on any language — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
- Enable Dependabot/Renovate or a dependency-review gate.
- Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P6 · Release Hygiene
- No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
- Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
PF3 · Async & latency hygiene
X1 · Async correctness
X12 · Unreachable branch
X13 · Undrained process stream
X16 · Unfloored truncation loop
X17 · Uncapped recursion over a caller-supplied document
- `clone` is public and takes a `When` as its receiver from its caller, and it calls itself at line 36 with a piece of the document (and at line 202, line 205, line 207) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `clone` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/streams/status/when.rs:36
- `clone` is public and takes a `Error` as its receiver from its caller, and it calls itself at line 46 with a piece of the document (and at line 47, line 48, line 50) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `clone` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/streams/producer/error.rs:46
- `is_online` is public and takes a `Producer` as its receiver from its caller, and it calls itself at line 172 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `is_online` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/streams/producer/mod.rs:172
- `try_send` is public and takes a `Producer` as its receiver from its caller, and it calls itself at line 185 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `try_send` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/streams/producer/mod.rs:185
- `is_cancelled` is public and takes a `LinkError` as its receiver from its caller, and it calls itself at line 739 with a piece of the document (and at line 740, line 741, line 742, line 743) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `is_cancelled` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/network/link.rs:739
- `close_reason` is public and takes a `LinkError` as its receiver from its caller, and it calls itself at line 750 with a piece of the document (and at line 751, line 752, line 753, line 754) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `close_reason` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/network/link.rs:750
- `public_handle` is public and takes a `GroupHandle` as its receiver from its caller, and it calls itself at line 96 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `public_handle` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/group/state.rs:96
- `group_id` is public and takes a `WorkerState` as its receiver from its caller, and it calls itself at line 161 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `group_id` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/group/state.rs:161
- `network_id` is public and takes a `WorkerState` as its receiver from its caller, and it calls itself at line 167 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `network_id` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/group/state.rs:167
- `clone` is public and takes a `Bond` as its receiver from its caller, and it calls itself at line 139 with a piece of the document (and at line 140, line 141, line 457) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `clone` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/bond/mod.rs:139
- `len` is public and takes a `Bonds` as its receiver from its caller, and it calls itself at line 465 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `len` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/bond/mod.rs:465
- `is_empty` is public and takes a `Bonds` as its receiver from its caller, and it calls itself at line 470 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `is_empty` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/bond/mod.rs:470
- `changed` is public and takes a `Bonds` as its receiver from its caller, and it calls itself at line 488 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `changed` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/bond/mod.rs:488
- `get` is public and takes a `Bonds` as its receiver from its caller, and it calls itself at line 493 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `get` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/groups/bond/mod.rs:493
- `get` is public and takes a `Catalog` as its receiver from its caller, and it calls itself at line 183 with a piece of the document (and at line 191, line 194) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `get` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/catalog.rs:183
- `remove` is public and takes a `Catalog` as its receiver from its caller, and it calls itself at line 411 with a piece of the document (and at line 415) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `remove` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/catalog.rs:411
- `clear` is public and takes a `Catalog` as its receiver from its caller, and it calls itself at line 440 with a piece of the document (and at line 442) — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `clear` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/catalog.rs:440
- `dial` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 108 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `dial` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:108
- `sync_with` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 142 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `sync_with` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:142
- `clear_unsigned` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 197 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `clear_unsigned` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:197
- `add_tags` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 203 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `add_tags` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:203
- `remove_tags` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 209 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `remove_tags` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:209
- `add_ticket` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 214 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `add_ticket` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:214
- `remove_ticket` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 219 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `remove_ticket` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:219
- `remove_tickets_of` is public and takes a `Discovery` as its receiver from its caller, and it calls itself at line 224 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `remove_tickets_of` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/discovery/mod.rs:224
- `len` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 99 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `len` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:99
- `is_empty` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 106 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `is_empty` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:106
- `back` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 115 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `back` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:115
- `last` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 126 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `last` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:126
- `front` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 135 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `front` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:135
- `head` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 146 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `head` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:146
- `get` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 155 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `get` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:155
- `contains` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 193 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `contains` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:193
- `index_of` is public and takes a `Vec` as its receiver from its caller, and it calls itself at line 204 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `index_of` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/vec.rs:204
- `online` is public and takes a `When` as its receiver from its caller, and it calls itself at line 23 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `online` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/when.rs:23
- `offline` is public and takes a `When` as its receiver from its caller, and it calls itself at line 34 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `offline` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/when.rs:34
- `reaches` is public and takes a `When` as its receiver from its caller, and it calls itself at line 55 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `reaches` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/when.rs:55
- `signature` is public and takes a `SnapshotSync` as its receiver from its caller, and it calls itself at line 298 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `signature` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/sync/mod.rs:298
- `create_provider` is public and takes a `SnapshotSync` as its receiver from its caller, and it calls itself at line 302 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `create_provider` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/sync/mod.rs:302
- `create_session` is public and takes a `SnapshotSync` as its receiver from its caller, and it calls itself at line 315 with a piece of the document — and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so `catch_unwind` does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from `disable_recursion_limit`, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through `create_session` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — src/collections/sync/mod.rs:315
What to do
- Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
X18 · Disposal-pattern correctness
X21 · Side-effecting pattern guard
X22 · Contradicted release guard
X23 · Unguarded diagnostic materialisation
X25 · Inert configuration knob
X27 · Collection changed while being enumerated
X30 · Support guard that admits what it rejects
X4 · Structured logging
- `debug!` at line 13 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/main.rs:13
- `debug!` at line 499 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/streams/consumer/receiver.rs:499
- `debug!` at line 451 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/groups/replay/session.rs:451
- `debug!` at line 517 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/groups/replay/session.rs:517
- `trace!` at line 473 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/groups/raft/leader.rs:473
- `trace!` at line 170 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `trace!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/groups/raft/role.rs:170
- `debug!` at line 395 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/groups/raft/role.rs:395
- `debug!` at line 678 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/discovery/worker.rs:678
- `debug!` at line 603 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/collections/sync/session.rs:603
- `debug!` at line 690 is handed a format string with `{…}` values in it, so tracing records one finished `message` field — the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: `debug!(order_id = %order_id, status = ?status, "order status updated")` (`%` records a value by its `Display`, `?` by its `Debug`, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: `error = %err`. — src/collections/sync/session.rs:690
What to do
- Interpolated log message defeats structured logging
X5 · Nullable reference types
- `claims.to_base64()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:601
- `self.key.key.sign(&header_b64,&claims_b64)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:606
- `Hmac::<sha2::Sha256>::new_from_slice(&self.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `sign` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:714
- `Hmac::<sha2::Sha256>::new_from_slice(&key.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:725
- `Hmac::<sha2::Sha384>::new_from_slice(&self.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `sign` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:768
- `Hmac::<sha2::Sha384>::new_from_slice(&key.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:779
- `Hmac::<sha2::Sha512>::new_from_slice(&self.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `sign` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:822
- `Hmac::<sha2::Sha512>::new_from_slice(&key.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:833
- `p256::ecdsa::VerifyingKey::from_sec1_bytes(&key.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:888
- `p256::ecdsa::SigningKey::from_slice(&bytes)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from_bytes` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:921
- `point.as_bytes().try_into()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `verifying_key` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×3) — src/tickets/jwt.rs:944, src/tickets/jwt.rs:1058, src/tickets/jwt.rs:1167
- `p384::ecdsa::VerifyingKey::from_sec1_bytes(&key.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:1016
- `p384::ecdsa::SigningKey::from_slice(&bytes)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from_bytes` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:1038
- `p521::ecdsa::VerifyingKey::from_sec1_bytes(&key.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:1124
- `p521::ecdsa::SigningKey::from_slice(&bytes)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from_bytes` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:1146
- `ed25519_dalek::VerifyingKey::from_bytes(&key.0)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `from` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tickets/jwt.rs:1232
- `self.quote.get()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `quote` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/ticket.rs:75
- `env::var("OUT_DIR")` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `resolve` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:75
- `fs::create_dir_all(&cache_dir)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `resolve` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:77
- `env::var("CARGO_PKG_NAME")` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `resolve` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:81
- `fs::create_dir_all(&dir)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `resolve_artifacts_dir` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:138
- `fs::write(&path,custom_vmlinuz)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `acquire_kernel` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:174
- `File::create(&gz_path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:245
- `Command::new("gzip").args(["-9","-n","-c"]).arg(cpio_path).stdout(gz_file).status()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:251
- `fs::copy(&gz_path,&final_path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:255
- `fs::copy(vmlinuz,&kernel_output)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:280
- `fs::write(&ovmf_output,data)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:323
- `fs::write(&mrtd_path,&hex)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:340
- `fs::read(&kernel_output)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:352
- `fs::read(&final_path)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). (×2) — src/tee/tdx/builder/common.rs:353, src/tee/tdx/builder/common.rs:369
- `fs::write(&rtmr1_path,&hex)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:362
- `fs::write(&rtmr2_path,&hex)` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `finalize_build` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/common.rs:378
- `Command::new("curl").args(["-fSL","--retry","3","-o"]).arg(&cached).arg(url).status()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `download_cached` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/helpers.rs:54
- `Command::new("tar").args(["xzf"]).arg(archive).args(["--to-stdout",inner_path]).output()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `extract_file_from_tar_gz` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/helpers.rs:72
- `Command::new("tar").args(["tzf"]).arg(archive).output()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `list_tar_gz` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/helpers.rs:89
- `data_tar.file_name()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.unwrap()` in `extract_data_tar` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/helpers.rs:108
- `Command::new("zstd").args(["-d","-c"]).arg(data_tar).stdout(Stdio::piped()).spawn()` can be absent — it is an `Option` or `Result`, which is why it is forced — and `.expect()` in `extract_data_tar` forces it with nothing on this path excluding `None`/`Err`: no `if let` or `match` arm that matched it present, no `let … else`, no `is_some()`/`is_ok()` test (or `is_none()`/`is_err()` test that leaves), no `assert!` of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with `?`, branch on it with `if let` / `match` / `let … else`, or give it a default (`unwrap_or`, `unwrap_or_default`, `unwrap_or_else`). — src/tee/tdx/builder/helpers.rs:119
What to do
- Each row is a forced `Option`/`Result` no guard on its path proves present. Handle the absent case where it arises rather than forcing it: `?` to hand it to the caller, `if let` / `match` / `let … else` to branch on it, `unwrap_or` / `unwrap_or_default` / `unwrap_or_else` where a default is right. Where the value genuinely cannot be absent, say so in a way a reader can check from the line: test it first (`if x.is_none() { return … }`), look the key up with `contains_key` or the index against `len()`, or construct the value so it cannot be absent.
Reference — by lens
| Lens | Score | Rating | Impact |
|---|---|---|---|
| Code Health | 75.6 | Strong | Solid. |
| Architecture | 90.2 | Adequate — gated by D26 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Maturity | 58.9 | Adequate — gated by D34, M2 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Readiness | 36.9 | Weak — gated by P1, P3 | Capped at Fair by a Critical contributor — resolve it before relying on this lens. |
| Security | 100.0 | Exemplary | Strongest area. |
| Event-Driven | 78.9 | Strong | Solid. |
| Event Sourcing | 100.0 | Exemplary | Solid. |
| Performance | 100.0 | Exemplary | Solid. |
Unscored — 1 check(s) recorded observations but carry no score
- X10 Duplicated predicate — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for
- P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
- P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 66 check(s) not relevant to this codebase
- AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
- AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
- AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
- AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
- AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
- AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
- AX1 Captive dependencies — Not applicable: Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one.
- AX2 Stateful singletons — Not applicable: Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written.
- AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) 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
- AX6 Interface segregation — not assessed — interface segregation is computed over a type surface 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
- AX7 Slice cohesion — not applicable — not a vertical-slice architecture
- AX8 Test isolation — no test/production split to check
- AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
- C1 Data Protection — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no data at rest for these controls to protect.
- C2 Access Controls — No access-control surface detected in the analyzed source — this repository starts no server another machine can reach (no actix-web HttpServer, axum::serve, Rocket launch, warp::serve, poem or salvo Server, tonic Server::builder, hyper or tiny_http server outside examples and tests, none bound beyond loopback). Access control is therefore N/A here — a crate is authorized by the application that serves it, 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 a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
- C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data whose lifetime a retention limit would bound.
- C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Diesel schema, a SeaORM entity, a Diesel or sqlx row struct, or a SQL CREATE TABLE or ALTER TABLE — and no database or data-store crate (sqlx, Diesel, SeaORM, rusqlite, tokio-postgres, MongoDB, …) in the source either, so this repository keeps no personal data for a data subject to erase, export or consent over.
- D10 Test Quality — ~13711 lines of test source are present (.rs) 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.
- D11 Test Reliability — Test reliability not included — the .rs suite was found but not re-run
- D12 Dependency Hygiene — Not scored — 54 direct Cargo declaration(s) were read, but the outdated signal needs crates.io, and no committed Cargo.lock resolves them to versions, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
- D14 License Compliance — Crate licences not graded — the lock-less Cargo graph could not be read in full
- D16 Bus Factor — single-maintainer repository — bus factor is not applicable
- D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
- D21 Naming Consistency — N/A — too few peers to establish a naming convention (3667 declarations, no unit with a dominant convention).
- D22 Internal API Consistency — API consistency is measured on C#, TypeScript, Go only; the exposed Rust surface was not measured.
- D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
- D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .rs, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
- D25 ADR Conformance — no ADRs to check
- D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
- D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).
- D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
- D32 Data Compliance (PII/GDPR) — 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.
- D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
- 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.
- 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.
- D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet).
- D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
- D8 Code Coverage — Coverage not measured — Rust suite
- DM1 Domain Modelling — applicable but not scored (2 of 3 signals for this style — below the bar we score at): 32 value object(s); 3 domain event(s); its domain events are published by services or handlers — no domain entity raises one
- 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
- ES1 Fold determinism — not applicable — the code was read and holds no event-replay fold, so there is nothing for this check to judge
- P12 CI test-gate honesty — no CI workflow found
- P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Rust source, so there is no service whose uptime a failing dependency could take down
- P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
- 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 — Not applicable: no benchmark suite was found. This check searched for `#[bench]`, criterion's `bench_function`/`bench_with_input`, `#[divan::bench]` or `#[library_benchmark]` in any `.rs` file, or criterion, divan, iai or a `[[bench]]` target in a Cargo.toml, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
- 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.
- S1 Web-Security Posture — No web surface: 117 Rust file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server crate (actix-web, axum, Rocket, warp, poem, tide, salvo, tonic, a hyper server, …) among its Cargo manifests' run-time dependencies, and no server started in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
- X14 Bypassable address classification — 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
- X19 Unrestored process-global state — 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
- X2 Cancellation propagation — no C# was loaded; this repository's Rust was read, and no request in it can be cancelled by a caller — a Rust request takes no token: a future is cancelled by dropping it, from outside the call (select!, a timeout, an aborted task), and reqwest, hyper and tonic take none
- X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
- X24 Document value interpolated into markup unescaped — 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
- X26 Unsynchronised callback handoff — Not applicable: this check looks for a collection written by a callback on one thread while the body waiting on it touches it on another, and in this repository's languages no collection is reachable from two threads at once. Rust's compiler refuses the unsynchronised version: a collection shared between a callback's thread and the waiting body must be `Sync`, which a `Vec`, `VecDeque` or `HashMap` is only behind a `Mutex`/`RwLock`, so the race this check looks for cannot be written in safe Rust. Not a gap in the analyzer and not a finding about your code.
- X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
- 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 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
- X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
- X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
- X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
- 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 — 1 finding(s)
- Blocking call on the event loop: Acceptor.wait_for_handshake calls `recv` src/groups/bond/protocol.rs:199
Serious — 232 finding(s)
- Recursive walk over a caller-supplied document has no depth cap src/streams/status/when.rs:36
- Recursive walk over a caller-supplied document has no depth cap src/streams/producer/error.rs:46
- Recursive walk over a caller-supplied document has no depth cap src/streams/producer/mod.rs:172
- Recursive walk over a caller-supplied document has no depth cap src/streams/producer/mod.rs:185
- Recursive walk over a caller-supplied document has no depth cap src/network/link.rs:739
- Recursive walk over a caller-supplied document has no depth cap src/network/link.rs:750
- Recursive walk over a caller-supplied document has no depth cap src/groups/group/state.rs:96
- Recursive walk over a caller-supplied document has no depth cap src/groups/group/state.rs:161
- Recursive walk over a caller-supplied document has no depth cap src/groups/group/state.rs:167
- Recursive walk over a caller-supplied document has no depth cap src/groups/bond/mod.rs:139
- Recursive walk over a caller-supplied document has no depth cap src/groups/bond/mod.rs:465
- Recursive walk over a caller-supplied document has no depth cap src/groups/bond/mod.rs:470
- Recursive walk over a caller-supplied document has no depth cap src/groups/bond/mod.rs:488
- Recursive walk over a caller-supplied document has no depth cap src/groups/bond/mod.rs:493
- Recursive walk over a caller-supplied document has no depth cap src/discovery/catalog.rs:183
- Recursive walk over a caller-supplied document has no depth cap src/discovery/catalog.rs:411
- Recursive walk over a caller-supplied document has no depth cap src/discovery/catalog.rs:440
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:108
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:142
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:197
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:203
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:209
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:214
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:219
- Recursive walk over a caller-supplied document has no depth cap src/discovery/mod.rs:224
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:601
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:606
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:714
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:725
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:768
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:779
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:822
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:833
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:888
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:921
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:944
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:1016
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:1038
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:1058
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:1124
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:1146
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:1167
- Symbol treated as nullable, then dereferenced unguarded src/tickets/jwt.rs:1232
- Symbol treated as nullable, then dereferenced unguarded src/tee/tdx/ticket.rs:75
- Symbol treated as nullable, then dereferenced unguarded src/tee/tdx/builder/common.rs:75
- Symbol treated as nullable, then dereferenced unguarded src/tee/tdx/builder/common.rs:77
- Symbol treated as nullable, then dereferenced unguarded src/tee/tdx/builder/common.rs:81
- Symbol treated as nullable, then dereferenced unguarded src/tee/tdx/builder/common.rs:138
- Symbol treated as nullable, then dereferenced unguarded src/tee/tdx/builder/common.rs:174
- Symbol treated as nullable, then dereferenced unguarded src/tee/tdx/builder/common.rs:245
- Empty method body — does nothing with its inputs src/collections/cell.rs:490
- Empty method body — does nothing with its inputs src/collections/depq.rs:984
- Empty method body — does nothing with its inputs src/collections/map.rs:653
- Empty method body — does nothing with its inputs src/collections/once.rs:435
- Empty method body — does nothing with its inputs src/collections/set.rs:544
- Empty method body — does nothing with its inputs src/collections/sync/mod.rs:367
- Empty method body — does nothing with its inputs src/collections/vec.rs:700
- Empty method body — does nothing with its inputs src/groups/bond/mod.rs:436
- Empty method body — does nothing with its inputs src/groups/group/state.rs:203
- Empty method body — does nothing with its inputs src/primitives/channel.rs:33
- Duplicated block (7 lines × 2) src/groups/raft/role.rs:306
- Duplicated block (7 lines × 2) src/streams/consumer/mod.rs:176
- Duplicated block (7 lines × 2) src/tee/tdx/builder/scripts.rs:31
- Duplicated block (7 lines × 2) src/collections/cell.rs:557
- Duplicated block (7 lines × 2) src/streams/consumer/mod.rs:155
- Duplicated block (7 lines × 2) src/tee/tdx/builder/alpine/builder.rs:142
- Duplicated block (7 lines × 2) src/tee/tdx/builder/alpine/builder.rs:214
- Hotspot: src/collections/depq.rs src/collections/depq.rs:856
- Hotspot: src/collections/vec.rs src/collections/vec.rs:600
- Hotspot: src/collections/map.rs src/collections/map.rs:554
- Hotspot: src/tee/tdx/builder/alpine/builder.rs src/tee/tdx/builder/alpine/builder.rs:240
- Hotspot: src/macros/src/stream.rs src/macros/src/stream.rs:176
- Hotspot: src/cli/dht.rs src/cli/dht.rs:42
- TodoComment src/streams/consumer/receiver.rs:397
- TodoComment src/groups/raft/follower.rs:390
- TodoComment src/groups/raft/leader.rs:218
- TodoComment src/groups/raft/leader.rs:578
- TodoComment src/discovery/announce.rs:378
- mosaik::tee::tdx::builder::mrtd::compute_mrtd (cognitive 22) src/tee/tdx/builder/mrtd.rs:186
- mosaik::tee::tdx::builder::mrtd::find_tdvf_descriptor_offset (cognitive 19) src/tee/tdx/builder/mrtd.rs:49
- mosaik::tee::tdx::builder::alpine::cross::cross_compile_musl (cognitive 17) src/tee/tdx/builder/alpine/cross.rs:12
- mosaik::tee::tdx::builder::ubuntu::cross::cross_compile_gnu (cognitive 17) src/tee/tdx/builder/ubuntu/cross.rs:12
- MethodTooLong: AlpineBuilder.build src/tee/tdx/builder/alpine/builder.rs:240
- MethodTooLong: StreamInput.expand src/macros/src/stream.rs:176
- MethodTooLong: CollectionInput.expand src/macros/src/collection.rs:113
- MethodTooLong: UbuntuBuilder.build src/tee/tdx/builder/ubuntu/builder.rs:239
- Duplicated block (13 lines × 2) src/collections/sync/session.rs:694
- Duplicated block (13 lines × 2) src/discovery/announce.rs:642
- Duplicated block (13 lines × 2) src/discovery/sync.rs:151
- Duplicated block (13 lines × 2) src/tee/tdx/builder/alpine/builder.rs:487
- Duplicated block (11 lines × 2) src/collections/map.rs:489
- Duplicated block (11 lines × 2) src/collections/map.rs:716
- Duplicated block (11 lines × 2) src/groups/when.rs:154
- Duplicated block (11 lines × 2) src/groups/bond/worker.rs:307
- Duplicated block (5 lines × 2) src/macros/src/collection.rs:65
- Duplicated block (5 lines × 2) src/streams/consumer/builder.rs:106
- Duplicated block (5 lines × 2) src/macros/src/collection.rs:129
- Duplicated block (5 lines × 2) src/tee/tdx/builder/alpine/builder.rs:403
- WorkerLoop::fetch (cognitive 21) src/discovery/dht.rs:335
- WorkerLoop::fanout (cognitive 21) src/streams/producer/worker.rs:275
- WorkerLoop::scan_chain (cognitive 18) src/discovery/dht.rs:227
- FileTooLong: tickets/jwt.rs src/tickets/jwt.rs
- FileTooLong: collections/depq.rs src/collections/depq.rs
- FileTooLong: network/link.rs src/network/link.rs
- FunctionTooLong: mosaik::tee::tdx::builder::alpine::cross::cross_compile_musl src/tee/tdx/builder/alpine/cross.rs:12
- FunctionTooLong: mosaik::tee::tdx::builder::common::finalize_build src/tee/tdx/builder/common.rs:231
- FunctionTooLong: mosaik::tee::tdx::builder::ubuntu::cross::cross_compile_gnu src/tee/tdx/builder/ubuntu/cross.rs:12
- Edited copy of a member (23 corresponding lines) src/collections/sync/session.rs:402
- Edited copy of a member (23 corresponding lines) src/groups/bond/worker.rs:385
- Edited copy of a member (23 corresponding lines) src/collections/sync/session.rs:546
- Edited copy of a member (15 corresponding lines) src/streams/consumer/mod.rs:173
- Edited copy of a member (15 corresponding lines) src/discovery/mod.rs:265
- Edited copy of a member (15 corresponding lines) src/collections/map.rs:715
- Duplicated block (14 lines × 2) src/groups/group/worker.rs:396
- Duplicated block (14 lines × 2) src/tee/tdx/builder/alpine/cross.rs:186
- Duplicated block (14 lines × 2) src/tee/tdx/builder/alpine/cross.rs:203
- Duplicated block (10 lines × 2) src/tee/tdx/measure.rs:95
- Duplicated block (10 lines × 2) src/streams/producer/worker.rs:392
- Duplicated block (10 lines × 2) src/collections/sync/session.rs:658
- Duplicated block (9 lines × 2) src/tee/tdx/builder/kernel.rs:208
- Duplicated block (9 lines × 2) src/collections/sync/session.rs:754
- Duplicated block (9 lines × 2) src/groups/raft/candidate.rs:246
- Duplicated block (6 lines × 2) src/collections/sync/session.rs:334
- Duplicated block (6 lines × 2) src/tee/tdx/builder/helpers.rs:121
- Duplicated block (6 lines × 2) src/groups/bond/mod.rs:223
- Low cohesion: Config (LCOM4 4) src/collections/sync/mod.rs:163
- Low cohesion: Shared (LCOM4 4) src/groups/raft/shared.rs:32
- Low cohesion: When (LCOM4 4) src/groups/when.rs:11
- StreamInput::parse (cyclomatic 26) src/macros/src/stream.rs:43
- StreamInput::expand (cyclomatic 23) src/macros/src/stream.rs:176
- StreamInput::parse (cognitive 50) src/macros/src/stream.rs:43
- StreamInput::expand (cognitive 18) src/macros/src/stream.rs:176
- Edited copy of a member (40 corresponding lines) src/collections/sync/session.rs:683
- Edited copy of a member (40 corresponding lines) src/groups/raft/leader.rs:300
- Edited copy of a member (18 corresponding lines) src/discovery/announce.rs:637
- Edited copy of a member (18 corresponding lines) src/collections/map.rs:484
- Edited copy of a member (14 corresponding lines) src/groups/when.rs:107
- Edited copy of a member (14 corresponding lines) src/streams/status/when.rs:96
- Edited copy of a member (4 corresponding lines) src/collections/cell.rs:516
- Edited copy of a member (4 corresponding lines) src/collections/map.rs:110
- Duplicated block (15 lines × 2) src/groups/bond/mod.rs:315
- Duplicated block (15 lines × 2) src/tee/tdx/builder/alpine/cross.rs:128
- Duplicated block (12 lines × 2) src/collections/sync/session.rs:373
- Duplicated block (12 lines × 2) src/groups/when.rs:90
- DepqStateMachine::apply_batch (cyclomatic 22) src/collections/depq.rs:856
- Jwt::validate (cyclomatic 21) src/tickets/jwt.rs:245
- VecStateMachine::apply_batch (cyclomatic 19) src/collections/vec.rs:600
- MapStateMachine::apply_batch (cyclomatic 17) src/collections/map.rs:554
- AlpineBuilder::build (cyclomatic 17) src/tee/tdx/builder/alpine/builder.rs:240
- DhtCommand::run (cyclomatic 16) src/cli/dht.rs:42
- DepqStateMachine::apply_batch (cognitive 37) src/collections/depq.rs:856
- DhtCommand::run (cognitive 30) src/cli/dht.rs:42
- MapStateMachine::apply_batch (cognitive 28) src/collections/map.rs:554
- Jwt::validate (cognitive 26) src/tickets/jwt.rs:245
- UbuntuBuilder::build (cognitive 25) src/tee/tdx/builder/ubuntu/builder.rs:239
- AlpineBuilder::build (cognitive 24) src/tee/tdx/builder/alpine/builder.rs:240
- LogReplaySession::schedule_fetches (cognitive 20) src/groups/replay/session.rs:271
- ConsumerWorker::on_catalog_update (cognitive 20) src/streams/consumer/worker.rs:195
- SnapshotSyncSession::schedule_fetches (cognitive 18) src/collections/sync/session.rs:483
- Tdx::validate (cognitive 18) src/tee/tdx/validator.rs:275
- VecStateMachine::apply_batch (cognitive 17) src/collections/vec.rs:600
- SetStateMachine::apply_batch (cognitive 16) src/collections/set.rs:465
- CollectionInput::parse (cognitive 16) src/macros/src/collection.rs:34
- TooManyMethods: PeerEntry src/discovery/entry.rs:106
- ClassTooLong: SnapshotSyncSession src/collections/sync/session.rs:24
- Change coupling: receiver.rs ↔ mod.rs src/streams/consumer/receiver.rs:1
- Near-duplicate member family (6 members, 34 shared lines) src/collections/cell.rs:417
- Near-duplicate member pair (156 shared lines) src/tee/tdx/builder/alpine/cross.rs:16
- Near-duplicate member pair (38 shared lines) src/macros/src/collection.rs:34
- Members sharing a duplicated core (6 members, 50+ identical tokens) src/collections/cell.rs:289
- Edited copy of a member (98 corresponding lines) src/tee/tdx/builder/kernel.rs:132
- Edited copy of a member (42 corresponding lines) src/groups/raft/follower.rs:320
- Edited copy of a member (44 corresponding lines) src/groups/group/worker.rs:143
- Edited copy of a member (20 corresponding lines) src/collections/sync/session.rs:372
- Edited copies of one member (3 members, 15+ corresponding lines) src/groups/when.rs:232
- Edited copies of one member (6 members, 17+ corresponding lines) src/collections/cell.rs:379
- Edited copy of a member (12 corresponding lines) src/collections/sync/session.rs:469
- Edited copies of one member (3 members, 6+ corresponding lines) src/collections/depq.rs:175
- Edited copy of a member (19 corresponding lines) src/network/link.rs:593
- Edited copies of one member (4 members, 8+ corresponding lines) src/tickets/jwt.rs:1304
- Edited copy of a member (16 corresponding lines) src/streams/consumer/worker.rs:414
- Edited copies of one member (3 members, 9+ corresponding lines) src/tickets/jwt.rs:958
- Duplicated block (96 lines × 2) src/tee/tdx/builder/alpine/cross.rs:24
- Duplicated block (39 lines × 2) src/network/link.rs:285
- Duplicated block (27 lines × 2) src/tee/tdx/builder/kernel.rs:148
- Duplicated block (18–21 lines × 6) src/collections/cell.rs:437
- Duplicated block (19–21 lines × 2) src/collections/sync/session.rs:114
- Duplicated block (21 lines × 2) src/tee/tdx/builder/alpine/builder.rs:437
- Duplicated block (19 lines × 2) src/network/link.rs:359
- Duplicated block (18 lines × 2) src/macros/src/collection.rs:91
- Duplicated block (17–18 lines × 2) src/macros/src/collection.rs:165
- Duplicated block (17 lines × 6) src/collections/cell.rs:292
- Duplicated block (16 lines × 6) src/collections/cell.rs:461
- Duplicated block (16 lines × 2) src/network/link.rs:153
- Duplicated block (15–16 lines × 2) src/macros/src/collection.rs:36
- Duplicated block (9–10 lines × 2) src/tee/tdx/builder/kernel.rs:100
- Duplicated block (8 lines × 2) src/tee/tdx/builder/alpine/builder.rs:387
- Duplicated block (17 lines × 2) src/tee/tdx/builder/alpine/cross.rs:159
- Duplicated block (9 lines × 3) src/groups/raft/candidate.rs:246
- Duplicated block (8 lines × 3) src/groups/raft/role.rs:306
- Hollow method — returns a constant without doing the work src/streams/criteria.rs:10
- No CI pipeline
Minor — 108 finding(s)
- Orphaned file src/discovery/entry.rs:1
- Orphaned file src/groups/raft/leader.rs:1
- Orphaned file src/discovery/worker.rs:1
- Orphaned file src/collections/sync/session.rs:1
- Orphaned file src/discovery/announce.rs:1
- Orphaned file src/groups/raft/follower.rs:1
- Orphaned file src/collections/vec.rs:1
- Orphaned file src/tee/tdx/builder/ubuntu/builder.rs:1
- Orphaned file src/collections/map.rs:1
- Orphaned file src/groups/bond/mod.rs:1
- Orphaned file src/tee/tdx/builder/mrtd.rs:1
- Orphaned file src/streams/producer/worker.rs:1
- Orphaned file src/discovery/dht.rs:1
- Orphaned file src/streams/consumer/receiver.rs:1
- Orphaned file src/groups/replay/session.rs:1
- Orphaned file src/collections/set.rs:1
- Orphaned file src/discovery/catalog.rs:1
- Orphaned file src/groups/machine/sync.rs:1
- Orphaned file src/groups/group/worker.rs:1
- Orphaned file src/groups/machine/mod.rs:1
- Orphaned file src/groups/raft/shared.rs:1
- Orphaned file src/groups/bond/worker.rs:1
- Orphaned file src/groups/raft/role.rs:1
- Orphaned file src/collections/cell.rs:1
- Orphaned file src/streams/consumer/worker.rs:1
- Interpolated log message defeats structured logging src/main.rs:13
- Interpolated log message defeats structured logging src/streams/consumer/receiver.rs:499
- Interpolated log message defeats structured logging src/groups/replay/session.rs:451
- Interpolated log message defeats structured logging src/groups/replay/session.rs:517
- Interpolated log message defeats structured logging src/groups/raft/leader.rs:473
- Interpolated log message defeats structured logging src/groups/raft/role.rs:170
- Interpolated log message defeats structured logging src/groups/raft/role.rs:395
- Interpolated log message defeats structured logging src/discovery/worker.rs:678
- Interpolated log message defeats structured logging src/collections/sync/session.rs:603
- Interpolated log message defeats structured logging src/collections/sync/session.rs:690
- Most significant orphaned file src/tickets/jwt.rs:1
- Most significant orphaned file src/collections/depq.rs:1
- Most significant orphaned file src/network/link.rs:1
- No ADRs found Cargo.toml:67
- Projects may be oversized for their cohesion Cargo.toml:1
- Dormant codebase
- No ADRs
- No SAST
- No dependency-update automation Cargo.toml:18
- No changelog
- Duplicated predicate src/macros/src/collection.rs:51
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-ba3dacd9c5db4fe890aa3e7b137f2828/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=58" --report-format json --report-path /tmp/watchdog-gitleaks-ba3dacd9c5db4fe890aa3e7b137f2828/history-1.json --exit-code 0 --source . | 0 | artifacts/raw/gitleaks-history-1.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-ba3dacd9c5db4fe890aa3e7b137f2828/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 . | 0 | artifacts/raw/semgrep.json |
| D30 · Dependency Vulnerabilities | none (dependency manifest found, not scanned for vulnerabilities here) | — | none (dependency manifest found, not scanned for vulnerabilities here): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet). | 0 | — |
| D31 · IaC & Container Security | trivy | — | trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan. | 0 | — |
| 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. | 0 | — |
| D36 · Supply-chain Provenance & Signing | provenance | — | provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for. | 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 | none (dependency manifest found, not scanned for vulnerabilities here) | — | none (dependency manifest found, not scanned for vulnerabilities here): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Cargo manifest — not scanned yet). | 0 | — |