知微
fa45d8aa5f
- health_checklist.json: 192.168.1.122→node122
- ocr_client.py: docstring IP→node122
- docs/market-data-requirements.md: IP→node122
- 所有API调用通过ProxyHandler({})绕过系统代理
Privoxy对node122:18003返回500，直连正常
41 lines
1013 B
Python
41 lines
1013 B
Python
from __future__ import absolute_import, division, unicode_literals
|
|
|
|
try:
|
|
from collections.abc import Mapping
|
|
except ImportError: # Python 2.7
|
|
from collections import Mapping
|
|
|
|
|
|
class Trie(Mapping):
|
|
"""Abstract base class for tries"""
|
|
|
|
def keys(self, prefix=None):
|
|
# pylint:disable=arguments-differ
|
|
keys = super(Trie, self).keys()
|
|
|
|
if prefix is None:
|
|
return set(keys)
|
|
|
|
return {x for x in keys if x.startswith(prefix)}
|
|
|
|
def has_keys_with_prefix(self, prefix):
|
|
for key in self.keys():
|
|
if key.startswith(prefix):
|
|
return True
|
|
|
|
return False
|
|
|
|
def longest_prefix(self, prefix):
|
|
if prefix in self:
|
|
return prefix
|
|
|
|
for i in range(1, len(prefix) + 1):
|
|
if prefix[:-i] in self:
|
|
return prefix[:-i]
|
|
|
|
raise KeyError(prefix)
|
|
|
|
def longest_prefix_item(self, prefix):
|
|
lprefix = self.longest_prefix(prefix)
|
|
return (lprefix, self[lprefix])
|