~ Merge kademlia package.

1 files changed, 38 insertions, 0 deletions

diff --git a/src/Data/Kademlia/Routing/Table.hs b/src/Data/Kademlia/Routing/Table.hs
new file mode 100644
index 00000000..b79a0a31
--- /dev/null
+++ b/src/Data/Kademlia/Routing/Table.hs
@@ -0,0 +1,38 @@
+-- |
+--   Copyright   :  (c) Sam T. 2013
+--   License     :  MIT
+--   Maintainer  :  pxqr.sta@gmail.com
+--   Stability   :  experimental
+--   Portability :  portable
+--
+--   Routing table used to lookup . Internally it uses not balanced tree
+--
+-- TODO write module synopsis
+module Data.Kademlia.Routing.Table
+       ( Table(nodeID)
+       ) where
+
+import Control.Applicative
+import Data.List as L
+import Data.Maybe
+
+import Data.Kademlia.Routing.Tree
+
+
+data Table k v = Table {
+    routeTree     :: Tree k v
+
+    -- | Set degree of parallelism in node lookup calls.
+  , alpha         :: Int
+  , nodeID        :: k
+  }
+
+--insert :: NodeID -> Table -> Table
+--insert x t = undefined
+
+--closest :: InfoHash -> Table -> [NodeID]
+--closest = undefined
+
+
+-- TODO table serialization: usually we need to save table between
+-- target program executions for bootstrapping