github/semantic
1
1
Fork 0
mirror of https://github.com/github/semantic.git synced 2024-12-26 00:12:29 +03:00
Code Issues Projects Releases Wiki Activity

StrictData is on so we don't need explicit bangs

Browse Source
This commit is contained in:
Patrick Thomson 2018-06-11 14:35:09 -04:00
parent 666524a07b
commit 220aaff435
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/Data/Graph/AdjList.hs
View File

@ -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.