Creating implementation for idiom 118 : List to set

Idiom

# 118 List to set

Created by

Lead paragraph

Create set _y from list _x.
_x may contain duplicates. _y is unordered and has no repeated values.

New implementation

Language

Imports

Code

Documentation URL

Original attribution URL

Online demo

Username

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating resource.

Please try to avoid dependencies to third-party libraries and frameworks.

Other implementations

(def y (set x))

#include<unordered_set>

std::unordered_set<T> y (x.begin (), x.end ());

#include <set>

std::set<T> y (x.begin (), x.end ());

using System.Collections.Generic;

static void Main(string[] args)
{
    string[] x = new string[] { "a", "b", "c", "b" };
    HashSet<string> y = new HashSet<string>(x);
}

bool[typeof(x[0])] y;

foreach (e ; x)
    y[e] = true;

import std.container;

auto y = redBlackTree(x);

var y = x.toSet();

y = x |> Enum.uniq |> List.to_tuple

y = MapSet.new(x)

Y = sets:from_list(X).

y := make(map[T]struct{}, len(x))
for _, v := range x {
	y[v] = struct{}{}
}

import qualified Data.Set as Set

y = Set.fromList x

var y = new Set(x);

import java.util.HashSet;
import java.util.List;

Set<T> y = new HashSet<>(x);

import java.util.Set;
import java.util.HashSet;

Set<T> y = new HashSet<T>(x);

(setf y (remove-duplicates x))

local hash = {}
local y = {}
for _,v in ipairs(x) do
   if (not hash[v]) then
       y[#y+1] = v
       hash[v] = true
   end
end

@import Foundation;

NSSet *y=[NSSet setWithArray:x];

$y = array_unique($x);

for i := Low(X) to High(X) do Include(Y,X[i]);

use List::Util qw(uniq);

my @y = uniq @x;

my %y = map {$_=>0} @x;

y = set(x)

require 'set'

y = x.to_set

use std::collections::HashSet;

let y: HashSet<_> = x.into_iter().collect();

val y = x.toSet