def unwind ( self ) : return [ QuadKey ( self . key [ : l + 1 ] ) for l in reversed ( range ( len ( self . key ) ) ) ]
python return ancestors of node
Get a list of all ancestors in descending order of level including a new instance of self
def unwind(self):
        """ Get a list of all ancestors in descending order of level, including a new instance  of self
        """
        return [ QuadKey(self.key[:l+1]) for l in reversed(range(len(self.key))) ]