|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250 |
-
-
-
-
-
-
-
-
-
- __all__ = ['WordsSearch']
- __author__ = 'Lin Zhijun'
- __date__ = '2020.05.16'
-
- class TrieNode():
- def __init__(self):
- self.Index = 0
- self.Index = 0
- self.Layer = 0
- self.End = False
- self.Char = ''
- self.Results = []
- self.m_values = {}
- self.Failure = None
- self.Parent = None
-
- def Add(self,c):
- if c in self.m_values :
- return self.m_values[c]
- node = TrieNode()
- node.Parent = self
- node.Char = c
- self.m_values[c] = node
- return node
-
- def SetResults(self,index):
- if (self.End == False):
- self.End = True
- self.Results.append(index)
-
- class TrieNode2():
- def __init__(self):
- self.End = False
- self.Results = []
- self.m_values = {}
- self.minflag = 0xffff
- self.maxflag = 0
-
- def Add(self,c,node3):
- if (self.minflag > c):
- self.minflag = c
- if (self.maxflag < c):
- self.maxflag = c
- self.m_values[c] = node3
-
- def SetResults(self,index):
- if (self.End == False) :
- self.End = True
- if (index in self.Results )==False :
- self.Results.append(index)
-
- def HasKey(self,c):
- return c in self.m_values
-
-
- def TryGetValue(self,c):
- if (self.minflag <= c and self.maxflag >= c):
- if c in self.m_values:
- return self.m_values[c]
- return None
-
-
- class WordsSearch():
- def __init__(self):
- self._first = {}
- self._keywords = []
- self._indexs=[]
-
- def SetKeywords(self,keywords):
- self._keywords = keywords
- self._indexs=[]
- for i in range(len(keywords)):
- self._indexs.append(i)
-
- root = TrieNode()
- allNodeLayer={}
-
- for i in range(len(self._keywords)):
- p = self._keywords[i]
- nd = root
- for j in range(len(p)):
- nd = nd.Add(ord(p[j]))
- if (nd.Layer == 0):
- nd.Layer = j + 1
- if nd.Layer in allNodeLayer:
- allNodeLayer[nd.Layer].append(nd)
- else:
- allNodeLayer[nd.Layer]=[]
- allNodeLayer[nd.Layer].append(nd)
- nd.SetResults(i)
-
-
- allNode = []
- allNode.append(root)
- for key in allNodeLayer.keys():
- for nd in allNodeLayer[key]:
- allNode.append(nd)
- allNodeLayer=None
-
- for i in range(len(allNode)):
- if i==0 :
- continue
- nd=allNode[i]
- nd.Index = i
- r = nd.Parent.Failure
- c = nd.Char
- while (r != None and (c in r.m_values)==False):
- r = r.Failure
- if (r == None):
- nd.Failure = root
- else:
- nd.Failure = r.m_values[c]
- for key2 in nd.Failure.Results :
- nd.SetResults(key2)
- root.Failure = root
-
- allNode2 = []
- for i in range(len(allNode)):
- allNode2.append( TrieNode2())
-
- for i in range(len(allNode2)):
- oldNode = allNode[i]
- newNode = allNode2[i]
-
- for key in oldNode.m_values :
- index = oldNode.m_values[key].Index
- newNode.Add(key, allNode2[index])
-
- for index in range(len(oldNode.Results)):
- item = oldNode.Results[index]
- newNode.SetResults(item)
-
- oldNode=oldNode.Failure
- while oldNode != root:
- for key in oldNode.m_values :
- if (newNode.HasKey(key) == False):
- index = oldNode.m_values[key].Index
- newNode.Add(key, allNode2[index])
- for index in range(len(oldNode.Results)):
- item = oldNode.Results[index]
- newNode.SetResults(item)
- oldNode=oldNode.Failure
- allNode = None
- root = None
-
-
-
-
-
-
-
-
- self._first = allNode2[0]
-
-
- def FindFirst(self,text):
- ptr = None
- for index in range(len(text)):
- t =ord(text[index])
- tn = None
- if (ptr == None):
- tn = self._first.TryGetValue(t)
- else:
- tn = ptr.TryGetValue(t)
- if (tn==None):
- tn = self._first.TryGetValue(t)
-
-
- if (tn != None):
- if (tn.End):
- item = tn.Results[0]
- keyword = self._keywords[item]
- return { "Keyword": keyword, "Success": True, "End": index, "Start": index + 1 - len(keyword), "Index": self._indexs[item] }
- ptr = tn
- return None
-
- def FindAll(self,text):
- ptr = None
- list = []
-
- for index in range(len(text)):
- t =ord(text[index])
- tn = None
- if (ptr == None):
- tn = self._first.TryGetValue(t)
- else:
- tn = ptr.TryGetValue(t)
- if (tn==None):
- tn = self._first.TryGetValue(t)
-
-
- if (tn != None):
- if (tn.End):
- for j in range(len(tn.Results)):
- item = tn.Results[j]
- keyword = self._keywords[item]
- list.append({ "Keyword": keyword, "Success": True, "End": index, "Start": index + 1 - len(keyword), "Index": self._indexs[item] })
- ptr = tn
- return list
-
-
- def ContainsAny(self,text):
- ptr = None
- for index in range(len(text)):
- t =ord(text[index])
- tn = None
- if (ptr == None):
- tn = self._first.TryGetValue(t)
- else:
- tn = ptr.TryGetValue(t)
- if (tn==None):
- tn = self._first.TryGetValue(t)
-
- if (tn != None):
- if (tn.End):
- return True
- ptr = tn
- return False
-
- def Replace(self,text, replaceChar = '*'):
- result = list(text)
-
- ptr = None
- for i in range(len(text)):
- t =ord(text[i])
- tn = None
- if (ptr == None):
- tn = self._first.TryGetValue(t)
- else:
- tn = ptr.TryGetValue(t)
- if (tn==None):
- tn = self._first.TryGetValue(t)
-
- if (tn != None):
- if (tn.End):
- maxLength = len( self._keywords[tn.Results[0]])
- start = i + 1 - maxLength
- for j in range(start,i+1):
- result[j] = replaceChar
- ptr = tn
- return ''.join(result)
|