Creating implementation for idiom 112 : Iterate over map entries, ordered by keys

Idiom

# 112 Iterate over map entries, ordered by keys

Created by

Lead paragraph

Print each key k with its value x from an associative array mymap, in ascending order of k.

New implementation

Language

Imports

Code

Documentation URL

Original attribution URL

Online runnable demo

Username

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

#include <iostream>
#include <map>

std::map< K, V > _mymap;
for (const auto& pair : _mymap) {
    std::cout << pair.first << ": " << pair.second << "\n";
}

using System.Collections.Generic;

SortedDictionary<string, string> myMap;
foreach (var item in myMap)
{
  Console.WriteLine($"{item.Key}={item.Value}");
}

import std.algorithm;
import std.array;
import std.stdio;

mymap.byKeyValue
     .array
     .sort!((a, b) => a.key < b.key)
     .each!(p => writeln(p.key, " ", p.value));

var sortedKeys = myMap.keys.toList()..sort();
for (var k in sortedKeys) {
  print("Key=$k Value=${myMap[k]}");
}

import "fmt"
import "sort"

keys := make([]string, 0, len(mymap))
for k := range mymap {
	keys = append(keys, k)
}
sort.Strings(keys)

for _, k := range keys {
	x := mymap[k]
	fmt.Println("Key =", k, ", Value =", x)
}

Demo

mymap.sort { it.key }.each { println it}

Demo

import Data.Map as Map

mapM_ print (Map.toList mymap)

[...mymap.entries()].sort().map(([_, x]) => console.log(x))

import java.util.List;
import java.util.ArrayList;
import java.util.Collections;

List<K> keys = new ArrayList<>(mymap.keySet());
Collections.sort(keys);
for(K k: keys)
	System.out.println("Key=" + k + ", Value=" + mymap.get(k));

Demo
Doc

import java.util.Map.Entry;

mymap.entrySet().stream().sorted(Entry.comparingByKey()).forEach(System.out::println);

import java.util.Map;
import java.util.TreeMap;

var map = Map.of("a", 1, "d", 4, "c", 3, "b", 2);
new TreeMap<>(map).entrySet().forEach(System.out::println);

import java.util.Map;
import java.util.SortedMap;
import java.util.TreeMap;

SortedMap<K, V> mymap = new TreeMap<>();
...
for(Map.Entry<K, V> e: mymap.entrySet())
	System.out.println("Key=" + e.getKey() + ", Value=" + e.getValue());

Demo
Doc

for k, x in pairs(mymap) do
  print(k, x)
end

Doc
Origin

ksort($mymap);
foreach($mymap as $k => $v) {
    echo 'k:', $k, ' ', 'v:', $v, PHP_EOL;
}

Demo
Doc

use 5.010;

for my $k (sort keys %mymap) {
    my $x = $mymap{$k};
    say "$k => $x";
}

dict_pairs(D, _, Ps),
forall(member(K-V, Ps),
       format("~w:~w~n", [K, V]))

Demo

for k in sorted(mymap):
    print(mymap[k])

my_map.sort.each{|k,x| puts "#{k}: #{x}"}

for (k, x) in mymap {
    println!("({}, {})", k, x);
}

Demo
Doc

import scala.collection.immutable.SortedMap

SortedMap.from(mymap).foreach{ case (k, x) => println(s"$k => $x") }

Preview