20ff108a1349d6a990151309804fde1265e4b964,tgen/planner.py,T,__hash__,#T#,38

Before Change

        Return hash of the tree that is composed of t-lemmas, formemes,
        and parent orders of all nodes in the tree (ordered).
        desc = self.get_descendants(add_self=1, ordered=1)
        return hash("\n".join([str(n.parent.ord) + " " + n.t_lemma + " " + n.formeme
                               for n in desc]))


class CandidateList(DictMixin):
    List of candidate trees that can be quickly checked for membership and

After Change

        Return hash of the tree that is composed of t-lemmas, formemes,
        and parent orders of all nodes in the tree (ordered).
        desc = self.get_descendants(add_self=1, ordered=1)
        return hash(unicode(self))

    def __unicode__(self):
        desc = self.get_descendants(add_self=1, ordered=1)
        return " ".join([n.t_lemma + "|" + n.formeme + "|" + str(n.parent.ord)

Instances