var
x: TList;
begin
for i:= x.count-1 downto 0 do
if x.indexOf(x.items[i]) <> -1 then
x.delete(i);
end;
std::sort(x.begin(), x.end());
auto last = std::unique(x.begin(), x.end());
x.erase(last, x.end());
std::vector<std::string> x = {"one", "two", "two", "one", "three"};
std::unordered_set<std::string> t;
for (auto e : x)
t.insert(e);
var uniques = x.Distinct().ToList();
x = redBlackTree(x)[].array;
func deduplicate[S ~[]T, T comparable](x S) S {
seen := make(map[T]bool)
j := 0
for _, v := range x {
if !seen[v] {
x[j] = v
j++
seen[v] = true
}
}
var zero T
for i := j; i < len(x); i++ {
// Avoid memory leak
x[i] = zero
}
return x[:j]
}
y := make(map[T]struct{}, len(x))
for _, v := range x {
y[v] = struct{}{}
}
x2 := make([]T, 0, len(y))
for _, v := range x {
if _, ok := y[v]; ok {
x2 = append(x2, v)
delete(y, v)
}
}
x = x2
slices.Sort(x)
x = slices.Compact(x)
seen := make(map[T]bool)
j := 0
for _, v := range x {
if !seen[v] {
x[j] = v
j++
seen[v] = true
}
}
x = x[:j]
seen := make(map[T]bool)
j := 0
for _, v := range x {
if !seen[v] {
x[j] = v
j++
seen[v] = true
}
}
for i := j; i < len(x); i++ {
x[i] = nil
}
x = x[:j]
x = Array.from(new Set(x));
const seen = new Set();
x = x.filter( v => {
if(seen.has(v))
return false;
seen.add(v);
return true;
});
final HashSet<T> seen = new HashSet<T>();
final Iterator<T> listIt = x.iterator();
while (listIt.hasNext()) {
final T curr = listIt.next();
if (seen.contains(curr)) {
listIt.remove();
} else {
seen.add(curr);
}
}
Set<T> uniques = new HashSet<>(x);
x.clear();
x.addAll(uniques);
x = new ArrayList<T>(new HashSet<T>(x));
local seen = {}
for index,item in ipairs(x) do
if seen[item] then
table.remove(x, index)
else
seen[item] = true
end
end
[NSSet setWithArray:x].allObjects
x = list(OrderedDict(zip(x, x)))
def dedup(x):
y = []
for i in x:
if not i in y:
y.append(i)
return y
let dedup: Vec<_> = x.iter().unique().collect();
(define (remove-duplicates l)
(cond ((null? l)
'())
((member (car l) (cdr l))
(remove-duplicates (cdr l)))
(else
(cons (car l) (remove-duplicates (cdr l))))))
(remove-duplicates x)