It can if last is True. But there's still the open question of what to do with the /last endpoint as ?limit is supposed to be a generalization. So until then I don't know what this should be.

You keep saying/asking that, but the easy hack you're referring to already clarifies in its description that last is not a generalization of limit. I suggest you reread the task description.

I'm saying the contrary, that limit is a generalization of last, which is I think what is written in the task description. Does that mean a /last?limit=N returns the last N nodes ?

The task description specifies that ?limit is for the head, not the tail.

If you want to generalize that to the tail and replace /last, maybe you could use positive numbers for head limits and negative numbers for tail limits?

• ?limit=0 -> No limit
• ?limit=10 -> First 10 results
• ?limit=-10 -> Last 10 results?

This is consistent with what Python uses for indexing negative numbers, but I don't know if it's a good API.

I had the same idea and it's true that it seems weird for an API but why not.
I see two other possible implementations :
Use ?limit only on non /last endpoint.
Use ?limit with /last the same way as non /last but on tail not head.

Tell me what way you'd prefer.

I'm fine with the positive/negative limit idea.
(And once we have it, we can drop /last )