def check (self, eList, cList):
# called either when both sizes are one, or we've run out of columns
# to compare. The first set of tests stops the recursion.
if not eList:
self.surplus.extend(cList)
return
if not cList:
self.missing.extend(eList)
return
# There is at least one in each list. Process the first one,
# and then recurse on the shorter lists
row = eList.pop(0)
cell = row.parts
obj = cList.pop(0)
for a in self.columnBindings:
a.target = obj
if a != None:
a.target = obj
Fixture.check(self, cell, a)
cell = cell.more
self.check(eList, cList)
def check(self, eList, cList):
# called either when both sizes are one, or we've run out of columns
# to compare. The first set of tests stops the recursion.
if not eList:
self.surplus.extend(cList)
return
if not cList:
self.missing.extend(eList)
return
# There is at least one in each list. Process the first one,
# and then recurse on the shorter lists
row = eList.pop(0)
cell = row.parts
obj = cList.pop(0)
for a in self.columnBindings:
a.target = obj
if a != None:
a.target = obj
Fixture.check(self, cell, a)
cell = cell.more
self.check(eList, cList)
def check_(self):
text = self.camel(self.cells.more.text())
adapter = adapterOnMethod(self.actor, text)
Fixture.check(self, self.cells.more.more, adapter)
