How about Set.prototype.pop() or Set.prototype.last?

[doasync]

No description provided.

[ljharb]

What's the use case? Sets have insertion order, but beyond being deterministic, the ordering isn't usually relevant in code i've seen.

[doasync]

https://stackoverflow.com/questions/34583643/get-last-value-inserted-into-a-set

[ljharb]

That's asking how to do it; it doesn't contain a use case that I can see. Can you be more specific?

[doasync]

To implement Stack (Last In First Out) behaviour

[ljharb]

If you're wrapping a Set, then you could wrap the add method to keep track of the last item added, no?

[doasync]

Yes, but why bother to wrap it. The only method we need to manage stacks with sets is .pop()

[doasync]

https://www.quora.com/What-are-the-real-life-applications-of-stack-data-structure

[ljharb]

Sets aren't a stack tho, they're a set. Arrays are stacklike as well; is there a reason a Set is needed when an Array already has that semantic?

[doasync]

A value in the Set may only occur once; it is unique in the Set's collection.

[zloirock]

Current proposal contains methods based on set theory, so it's rather an issue for https://github.com/tc39/proposal-collection-methods. Also, I agree with @ljharb argumentation.

[ljharb]

@doasync sure but that's not a property of stacks, it's a property of sets.

[doasync]

Yeah, ok, thanks

[doasync]

They already have an issue about .pop:
tc39/proposal-collection-methods#1