哪种 Python 2.x DHT 实现最容易移植到 Python 3.x？
之前我问过 哪些 DHT 实现与 Python 3.x 兼容 - StackOverflow 的回答证实了我最担心的事情：到目前为止，还没有人发布过 Python 3.x 兼容的分布式哈希表实现。这意味着我要卷起袖子亲自开始工作。
我的项目不一定需要最高的性能，它只需要是一个真正的DHT。
由于此功能不是我的项目的核心（但可能真的很棒），我不想陷入调整最终性能的困境。我也不想花很多时间修复别人的错误。
我只想选择最容易使用的 DHT 实现，然后将其移植到 3.x。从理论上讲，这项工作不需要对任何特定实施工作方式有深刻的了解。
因此，考虑到上述所有内容，众多 python 2.x DHT 实现中的哪一个将是我最好的选择？
Previously I asked which DHT implementations are compatible with Python 3.x - StackOverflow's answer confirmed my worst fear: So far nobody has released a Python 3.x compatible Distributed Hash Table implementation. That means it's to roll up my sleeves and get to work myself.
My project does not necessarily require the highest performance, it simply needs to be a true DHT.
Since this feature is not core to my project (but could be truly awesome) I do not want to get bogged down tweaking ultimate performance. Nor do I want to spend a lot of time fixing somebody else's bugs.
I just want pick up the DHT implementation that's going to be the easiest to work with and then port it to 3.x. In theory this work should not require a profound knowledge of the way any spesific implementation work.
So given all of the above, which of the many python 2.x DHT implementations are going to be my best bet to start with?
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
尝试在每个上运行 2to3，然后运行生成的代码。如果其中之一有效，那么它就是最容易移植的。如果他们都没有这样做，那么根据你最了解的他们的错误进行猜测。
Try running 2to3 on each of them, then run the resulting code. If one of them works, then it was the easiest to port. If none of them do, then take a guess based on which of their errors you understand best.