我是靠谱客的博主 超帅书本,这篇文章主要介绍python模糊匹配算法_用于模糊匹配的Python哈希表,现在分享给大家,希望可以做个参考。

I am trying to implement a data structure which allows rapid look-ups based on keys.

The python dict is great when my look-ups involve an equality

(e.g. key == somevalue translates to datadict[somevalue].

The problem is that I also need to be able to efficiently look up keys based on a more complex comparison, e.g. key > 50, or key.startswith('abc').

Obviously I can't use the same solution in both cases, but at the moment I can't figure out how to solve either case. Can anyone suggest a way of doing this?

解决方案

It doesn't sound like you want a hash algorithm - instead some form of binary tree. Or even a list which you use the bisect module with. It'd be worth looking at: Python's standard library - is there a module for balanced binary tree?

Another option (depending on your data), would be to use use an in-memory sqlite3 database and create appropriate indices for possible lookups -- but you'll trade performance/memory and SQL syntax for flexibility...

最后

以上就是超帅书本最近收集整理的关于python模糊匹配算法_用于模糊匹配的Python哈希表的全部内容,更多相关python模糊匹配算法_用于模糊匹配内容请搜索靠谱客的其他文章。

本图文内容来源于网友提供,作为学习参考使用,或来自网络收集整理,版权属于原作者所有。
点赞(67)

评论列表共有 0 条评论

立即
投稿
返回
顶部