mirror of
https://github.com/github/semantic.git
synced 2024-12-25 16:02:43 +03:00
StrictData is on so we don't need explicit bangs
This commit is contained in:
parent
666524a07b
commit
220aaff435
@ -88,7 +88,7 @@ graphToAdjList = taggedGraphToAdjList . tagGraph
|
|||||||
-- Using a PBGraph as the accumulator for the fold would incur
|
-- Using a PBGraph as the accumulator for the fold would incur
|
||||||
-- significant overhead associated with Vector concatenation.
|
-- significant overhead associated with Vector concatenation.
|
||||||
-- We use this and then pay the O(v + e) to-Vector cost once.
|
-- We use this and then pay the O(v + e) to-Vector cost once.
|
||||||
data Acc = Acc ![Vertex] !(HashSet Edge)
|
data Acc = Acc [Vertex] (HashSet Edge)
|
||||||
|
|
||||||
-- Convert a graph with tagged members to a protobuf-compatible adjacency list.
|
-- Convert a graph with tagged members to a protobuf-compatible adjacency list.
|
||||||
-- The Tag is necessary to build a canonical adjacency list.
|
-- The Tag is necessary to build a canonical adjacency list.
|
||||||
|
Loading…
Reference in New Issue
Block a user