From ace11e74d26ec324c06dda0805d38eb6fb85635a Mon Sep 17 00:00:00 2001
From: Max Kellermann <max.kellermann@gmail.com>
Date: Wed, 12 Feb 2020 10:25:41 +0100
Subject: [PATCH] probabilistic/Topk: include cleanup

---
 src/probabilistic/Topk.cc | 1 -
 src/probabilistic/Topk.h  | 3 ++-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/probabilistic/Topk.cc b/src/probabilistic/Topk.cc
index f920ca17b4..f76b3f4086 100644
--- a/src/probabilistic/Topk.cc
+++ b/src/probabilistic/Topk.cc
@@ -8,7 +8,6 @@
 #include "CompHash.h"
 #include "IntrusivePtr.h"
 #include "Reporter.h"
-#include "NetVar.h"
 #include "Dict.h"
 
 namespace probabilistic {
diff --git a/src/probabilistic/Topk.h b/src/probabilistic/Topk.h
index bb1e313346..70df145e19 100644
--- a/src/probabilistic/Topk.h
+++ b/src/probabilistic/Topk.h
@@ -4,12 +4,13 @@
 
 #include <list>
 #include "Val.h"
-#include "CompHash.h"
 #include "OpaqueVal.h"
 
 // This class implements the top-k algorithm. Or - to be more precise - an
 // interpretation of it.
 
+class CompositeHash;
+
 namespace probabilistic {
 
 struct Element;