def computedMatchCartesianProductWithPredicate(self, predicate):
"""Return a new ComputedMatch which is the cartesian product of self.termInstanceVectors"""
return ComputedMatch(
self.docId,
list(
lazy.predicated_cartesian_product(predicate,
*self.termInstanceVectors)))
def computedMatchGenerator():
docIdEq = lambda computedMatch: len(frozenset(computedMatch)) == 1
for computedMatches in lazy.predicated_cartesian_product(
docIdEq, *computedMatchVectors):
if len(computedMatches) == 1 or (
len(computedMatches) > 1
and 0 == sum(map(len, computedMatches[1:]))):
yield computedMatches[0]
def computedMatchGenerator():
docIdEq = lambda computedMatch: len(frozenset(computedMatch)) == 1
for computedMatches in lazy.predicated_cartesian_product(
docIdEq, *computedMatchVectors):
if 0 not in map(len, computedMatches):
yield reduce(operator.__add__, computedMatches)
def computedMatchGenerator(): docIdEq = lambda computedMatch: len(frozenset(computedMatch)) == 1 for computedMatches in lazy.predicated_cartesian_product(docIdEq,*computedMatchVectors): if len(computedMatches) == 1 or (len(computedMatches) > 1 and 0 == sum(map(len,computedMatches[1:]))): yield computedMatches[0]
def computedMatchGenerator(): docIdEq = lambda computedMatch: len(frozenset(computedMatch)) == 1 for computedMatches in lazy.predicated_cartesian_product(docIdEq,*computedMatchVectors): if 0 not in map(len,computedMatches): yield reduce(operator.__add__,computedMatches)
def computedMatchCartesianProductWithPredicate(self,predicate): """Return a new ComputedMatch which is the cartesian product of self.termInstanceVectors""" return ComputedMatch(self.docId,list(lazy.predicated_cartesian_product(predicate,*self.termInstanceVectors)))
