Implementation
JS

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
x := map[string]int {"one": 1, "two": 2}
x = {"one" : 1, "two" : 2}
import java.util.Map;
import java.util.HashMap;
Map<String,Integer> x = new HashMap<>();
x.put("one", 1);
x.put("two", 2);
#include <map>
std::map<const char*, int> x;
x["one"] = 1;
x["two"] = 2;
x = {one: 1, two: 2}
(define x '(
    ("one" 1) 
    ("two" 2) 
    ("three" 3)))
var x = {
	"one": 1,
	"two": 2
};
$x = array( "one"=>1, "two"=>2 );
my %map = ( 
    name=>'Roboticus',
    "foo bar"=>"joe"
);
use std::collections::BTreeMap;
let mut x = BTreeMap::new();
x.insert("one", 1);
x.insert("two", 2);
int[string] x = ["one": 1, "two": 2];
uses fgl;
type TMap = specialize TFPGMap<String, Integer>;
var x: TMap;

begin
  x := TMap.Create;
  x['one'] := 1;
  x['two'] := 2;  
end.
x = Data.Map.Strict.fromList [ ("red", "FF0000"), ("blue", "0000FF") ]

x = %{"one" => 1, "two" => 2}
X = #{one => 1, "two" => 2.0, <<"three">> => [i, i, i]}.
x = {one = 1, two = 2}
with Ada.Containers.Indefinite_Hashed_Maps;
with Ada.Strings.Hash;

use Ada.Containers;
declare
   package Maps is new Indefinite_Hashed_Maps (Key_Type => String,
                                               Element_Type => Integer,
                                               Hash => Ada.Strings.Hash,
                                               Equivalent_Keys => "=");
      
   use Maps;
      
   X : Map := Empty_Map;
begin
   X.Insert ("One", 1);
   X.Insert ("Two", 2);
   X.Insert ("Three", 3);
end;
System.Collections.Generic
Dictionary<int, string> x = new Dictionary<int, string>()
{
    (1, "Value1"),
    (2, "Value2")
};
val x = Map("a" -> 1, "b" -> 2, "c" -> 3)
(def x {"One" 1
	"Two" 2
	"Three" 3})
use std::collections::HashMap;
let x: HashMap<&str, i32> = [
    ("one", 1),
    ("two", 2),
].iter().cloned().collect();