Logo

Programming-Idioms

Create a new map object x, and provide some (key, value) pairs as initial content.
Implementation
Rust

Implementation edit is for fixing errors and enhancing with metadata. Please do not replace the code below with a different implementation.

Instead of changing the code of the snippet, consider creating another Rust implementation.

Be concise.

Be useful.

All contributions dictatorially edited by webmasters to match personal tastes.

Please do not paste any copyright violating material.

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}
const x = {one: 1, two:2}
(define x '(
    ("one" 1) 
    ("two" 2) 
    ("three" 3)))
var x = {
	"one": 1,
	"two": 2
};
$x = ['one' => 1, 'two' => 2];
my %x = ( 
    name => 'Roboticus',
    'foo bar' => 'joe'
);
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.
import Data.Map.Strict
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;
using System.Collections.Generic;
var x = new Dictionary<string, int> {
   {"year", 2019}, {"month", 12}
};
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),
].into_iter().collect();
const x = new Map();
x.set("one", 1);
x.set("two", 2);
#include <unordered_map>
std::unordered_map<std::string, double> mymap = {
    {"mom", 5.4},
    {"dad", 6.1},
    {"bro", 5.9}
};
import java.util.Map;
import java.util.HashMap;
final Map<String, Integer> x = new HashMap<String, Integer>() {{
    put("one", 1);
    put("two", 2);
    put("three", 3);
}};
const x = new Map([["one",1],["two",2]]);
module StringMap = Map.Make(String)

let x =
    StringMap.empty
    |> StringMap.add "one" 1
    |> StringMap.add "two" 2
    |> StringMap.add "three" 3
val x = mapOf("one" to 1, "two" to 2)
#include <search.h>
ENTRY a = {"foo", "twenty"};
ENTRY b = {"bar", "three"};
if (hcreate (23)) {
    hsearch(a, ENTER);
    hsearch(b, ENTER);
}
Imports System.Collections.Generic
Dim x As New Dictionary(Of String, Integer)() From {
    {"one", 1},
    {"two", 2}
}
val x = mutableMapOf<String, Int>().apply { 
    this["one"] = 1
    this["two"] = 2
}
val x = mutableMapOf<String, Int>()
x["one"] = 1
x["two"] = 2
def x = ['un':1, 'dos':2, 'tres':3]
def x = [un:1, dos:2, tres:3]
NSDictionary *x=@{@"one":@1, @"two":@2};
(let ((table (make-hash-table)))
  (setf (gethash 'one table) 1)
  (setf	(gethash 'two table) 2))
x := Dictionary newFrom: {
	#a -> 1.
	#b -> Object new}.
using System.Collections.Generic;
var x = new Dictionary<string, int> {
   ["year"] = 2019,
   ["month"] = 12
};
x = %{one: 1, two: 2}