Logo

Programming-Idioms

Access each key k with its value x from an associative array mymap, and print them.
Implementation
Prolog

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 Prolog 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
for (Map.Entry<Object, Object> entry : mymap.entrySet()) {
    Object k = entry.getKey();
    Object x = entry.getValue();
    System.out.println("Key=" + k + ", Value=" + x);
}
import "fmt"
for k, x := range mymap {
  fmt.Println("Key =", k, ", Value =", x)
}
mymap.each {|k, x| puts "Key= #{k}  Value=#{x}"}
while (my ($k, $x) = each %mymap) {
    print "Key=$k, Value=$x\n";
}
Object.entries(mymap).forEach(([key, value]) => {
	console.log('key:', key, 'value:', value);
});
use std::collections::BTreeMap;
for (k, x) in &mymap {
    println!("Key={key}, Value={val}", key=k, val=x);
}
foreach ($mymap as $k=>$x)
{
    echo "Key=$k, Value=$x <br>";
}
import std.stdio;
int[string] mymap = ["Hello":1 , "World":2];
foreach (k, v; mymap)
    writeln("Key: ", k, " Value: ", v);
for k, v in mymap.items():
    print(k, v)
mymap.forEach((k, v) => print('Key=$k, Value=$v'));
uses fgl;
type TMyMap = specialize TFPGMap<String, Integer>;
for i := 1 to mymap.Count 		do
  WriteLn(mymap.Keys[i], '=', mymap.Data[i]);
Enum.each(mymap, fn({k, x}) ->
  IO.puts("#{k} => #{x}")
end)
import Data.List (intercalate)
import qualified Data.Map as Map
let f k v = [show k, " = ", show v]
    mapped = Map.mapWithKeys f mymap
in putStrLn $ intercalate "," $ mapped
for {k, x} <- mymap do
  IO.puts("#{k} => #{x}")
end
maps:fold(
	fun(K, V, ok) ->
		io:format("~p: ~p~n", [K, V])
	end, ok, MyMap).
for k, x in pairs(mymap) do
	print('Key: '..k..', Value: '..x)
end
#include <iostream>
for (const auto& kx: mymap) {
	std::cout << "Key: " << kx.first << " Value: " << kx.second << std::endl;
}
val x = Map("a" -> 1, "b" -> 2, "c" -> 3)
x.foreach{ case (key, value) => println(s"$key => $value")}
foreach(var entry in map)
{
    Console.WriteLine("Key=" + entry.Key + ", Value=" + entry.Value);
}
with Ada.Containers.Indefinite_Hashed_Maps;
with Ada.Strings.Hash;

use Ada.Containers;
for C in My_Map.Iterate loop
   Put_Line ("Key = " & Key (C) & ", Value = " & Element (C));
end loop;
(doseq [[k x] mymap]
  (println k ":" x))
#include <iostream>
for (const auto& [k, x]: mymap) {
	std::cout << "Key: " << k << " Value: " << x << '\n';
}
for (const key in mymap) {
    console.log('key:', key, 'value:', mymap[key]);
}
mymap.entries.forEach { print("${it.key} ${it.value}") }
printf "Key=%s, Value=%s\n",$_,$mymap{$_} foreach (sort keys %mymap);

mymap.each { k, x ->
	println "Key $k - Value $x"
}
@import Foundation;
for (NSString *k in mymap)
  NSLog(@"Key %@, value %@",k,mymap[k]);
import java.util.Map;
mymap.forEach((k,x) -> System.out.println("Key=" + k + ", Value=" + x));
(loop for k being each hash-key of mymap
      for x being each hash-value of mymap                                                                            
      do (format t "~A ~A~%" k x)))
mymap.foreach { case (k, x) => println(s"$k => $x") }
mymap keysAndValuesDo: [ :k :x |
	Transcript cr;
		show: 'Key = ', k printString;
		show: ', Value = ', x printString]
mymap.forEach { k, v -> println("$k -> $v") }
#include <iostream>
for (auto entry : mymap) {
  auto k = entry.first;
  auto x = entry.second;
  std::cout << k << ": " << x << "\n";
}
import java.util.Map;
for(Map.Entry<K, V> item : mymap.entrySet()) {
	K k = item.getKey();
	V x = item.getValue();
	System.out.printf("%s, %s%n", k, x);
}