r 3038
I want a list of this node and it's siblings ascending, evidently
I'm missing something.
I get an error in the snippet below, n.h complains that
None type has no headstring.
def get_children_to(p, index):
"""Return a list of children, not going below ``index``
"""
children = []
counter = 0
while True:
children.append(p.getNthChild(counter))
counter = counter + 1
if counter > index: break
return children
p = c.currentPosition()
index = p.childIndex()
result = get_children_to(p, index)
n = result[0]
g.es("%s %s" % (n, p))
g.es(n.h)
Thanks,
Kent
--
You received this message because you are subscribed to the Google Groups
"leo-editor" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/leo-editor?hl=en.
