From 62a40317f938ef4a3e0bb391965e54132a94824d Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Joakim=20Frosteg=C3=A5rd?= <joakim.frostegard@gmail.com>
Date: Sun, 12 Apr 2020 13:41:35 +0200
Subject: [PATCH] Update TODO

---
 TODO.md | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/TODO.md b/TODO.md
index c48ac22..44a4875 100644
--- a/TODO.md
+++ b/TODO.md
@@ -35,11 +35,7 @@
     * mialloc good?
     * Use less bytes from PeerId for hashing? Would need to implement
       "faulty" PartialEq too (on PeerMapKey, which would be OK)
-    * Seperate dashmap for torrent stats, meaning there will be no
-      contention across announce and scrape requests. Will however
-      require two lookups in announce requests. Do this?
 * bittorrent_udp
-    * ParseError enum maybe, with `Option<TransactionId>`
     * Avoid heap allocation in general if it can be avoided?
       * request from bytes for scrape: use arrayvec with some max size for
         torrents? With Vec, allocation takes quite a bit of CPU time