Age | Commit message (Collapse) | Author | |
---|---|---|---|
2013-07-16 | ~ A few fixes in session. | Sam T | |
2013-07-14 | ~ Use timestamp peer Id generator. | Sam T | |
2013-07-14 | ~ Minor changes. | Sam T | |
2013-07-14 | ~ Hide PeerSession and SwarmSession. | Sam T | |
2013-07-08 | ~ Unliterate example. | Sam T | |
2013-07-07 | ~ Yet Yet Another Literate Haskell Test. | Sam T | |
2013-07-07 | ~ Yet Another Literate Haskell Test. | Sam T | |
2013-07-07 | ~ Another Literate Haskell test. | Sam T | |
2013-07-07 | ~ Literate Haskell test. | Sam T | |
2013-07-03 | ~ Use lazy bytestring | Sam T | |
This lead to the following consequences: * we could efficiently read from storage - if block intersects files boundaries then we will "view" the block in the two different bytestrings. To avoid concat we now return lazy bytestring; * we could read block from socket without "concat" - again, for the same reason. The pitfail is that now we have a bit more heap object, but blocks lifetime is very short and this shouldnt play the big difference. The lifetime is either (socket -> storage -> unreachable) or (storage -> socket -> unreachable) unless a lib user keep block for their own purposes. | |||
2013-06-30 | ~ Keep track left progress bytes. | Sam T | |
2013-06-30 | + Add very basic storage operations. | Sam T | |
Now we can download and make some progress, but very unstable. | |||
2013-06-29 | + Add throughput bench, simplify example. | Sam T | |
2013-06-28 | + Default P2P. | Sam T | |
2013-06-20 | ~ Fix typo in dirname. | Sam T | |