I want to add a new Functions - Remove

[Luoxin]

I want to add remove，like:

listA := pie.Strings{"1", "2"}
listB := pie.Strings{"1", "3"}
      
// [ "2" ]
fmt.Println(listA.Remove(listB...))

In some scenarios, there will be a desire to weed out the data in slice A from the data in slice B

[Luoxin]

I have made some attempts
#172

[chocolacula]

@elliotchance What is the actual status? I would be happy to add similar function with index based removing in Go idiomatic(but not perfect) way s = append(s[:idx], s[idx+1:]...) within. I guess behaviour described above is exactly the same as Intersect

[elliotchance]

Intersect creates a set of elements that exist in both sets. I believe what @Luoxin is talking about here is "except" which results in the elements that do not exist in another set.

Speaking more broadly, it would be nice to have a Set type in this library for dealing with unordered unique items where these kinds of operations make sense. Otherwise, union operations on non-unique elements can be ambiguous.

[chocolacula]

Of course, Except

[chocolacula]

Added in #194