question: how to remove sibling nodes from parent? about ast-types

[benjamn]

Does it work if you do something like this?

while (path.name > 0) {
  path.parentPath.shift();
}

When path.parentPath.value is an array, path.name is the index of path.value in the array, and that index/name will be decremented by 1 each time you call path.parentPath.shift() (which removes the first element from the array).

I'm not saying this is the ideal interface for removing elements, but I think it should work currently. I'm tempted to implement Path.prototype.splice, a la Array.prototype.splice, so you could just do: path.parentPath.splice(0, path.name) to remove earlier siblings, or path.parentPath.splice(path.name + 1) to remove later siblings.

[eurekaa]

Thanks for your kind response.
The problem is that when path.node is an AssignmentExpression path.parentPath or path.parent is an Expression node, which is not an array.
I got an error also with path.parent.parentPath.shift() and with path.parent.parent.parentPath.shift() too.
I tried so many combination i can't remember exactly :)

It seems that when a node extends another one, his parent is the super class, may it be?

Anyway i found a solution (coffeescripted):

node_index = path.parent.name
parents = path.parent.parentPath.value
siblings = _.rest parents, node_index + 1
while parents.length > (node_index + 1) then parents.pop()

this way it works!

I can't understand why

parents = _.initial parents, node_index

doesn't work, it seems that direct assignments are not allowed.

If think your ideas are very nice, really a great work, i'm so near to implement a cps transformation with so few code!

Thank you very much!