dict_pairs(D, _, Ps),
transpose_pairs(Ps, TPs),
keysort(TPs, Val_sorted),
forall(member(V-K, Val_sorted),
format("~w:~w~n", [V, K]))
for_each(begin(mymap), end(mymap),
[&s](const auto& kv) { s.insert(kv.second); });
Dictionary<String, String> mymap = new Dictionary<String, String>();
foreach(KeyValuePair<string, string> a in mymap.OrderBy(x => x.Value))
{
Console.WriteLine("Key = {0}, Value = {1}", a.Key, a.Value);
}
mymap.byKeyValue
.array
.sort!((a, b) => a.value < b.value)
.each!(p => writeln(p.key, " ", p.value));
mymap.entries.toList()
..sort((a, b) => a.value.compareTo(b.value))
..forEach(print);
mymap
|> Map.to_list
|> Enum.sort(fn ({_k1, val1}, {_k2, val2}) -> val1 <= val2 end)
|> Enum.each(fn ({k, v}) -> IO.puts("#{k}: #{v}") end)
type entry struct {
key string
value int
}
entries := make([]entry, 0, len(mymap))
for k, x := range mymap {
entries = append(entries, entry{key: k, value: x})
}
sort.Slice(entries, func(i, j int) bool {
return entries[i].value < entries[j].value
})
for _, e := range entries {
fmt.Println("Key =", e.key, ", Value =", e.value)
}
type entry struct {
key string
value int
}
type entries []entry
func (list entries) Len() int { return len(list) }
func (list entries) Less(i, j int) bool { return list[i].value < list[j].value }
func (list entries) Swap(i, j int) { list[i], list[j] = list[j], list[i] }
entries := make(entries, 0, len(mymap))
for k, x := range mymap {
entries = append(entries, entry{key: k, values: x})
}
sort.Sort(entries)
for _, e := range entries {
fmt.Println("Key =", e.key, ", Value =", e.value)
}
mapM_ print $ sortBy (comparing snd) $ Map.toList mymap
mapM_ print . sortOn snd $ Map.toList mymap
Object.entries(mymap)
.sort((a, b) => a[1] - b[1])
.forEach(([key, value]) => {
console.log('key:', key, 'value:', value);
});
mymap.entrySet().stream()
.sorted(Comparator.comparing(Map.Entry::getValue))
.forEach(entry -> {
K k = entry.getKey();
X x = entry.getValue();
System.out.println("k:" + k + ", x:" + x);
});
for my $k (sort {($mymap{$a}<=>$mymap{$b}) or ($a cmp $b)}
keys %mymap) {
print "$k: $mymap{$k}\n";
}
sub by_val_then_key {
return ($mymap{$a} <=> $mymap{$b})
or ($a cmp $b)
}
for my $k (sort by_val_then_key keys %mymap) {
print "$k: $mymap{$k}\n";
}
for x, k in sorted((x, k) for k,x in mymap.items()):
print(k, x)
for key, value in sorted(d.items(), key=operator.itemgetter(1)):
print(key, value)
mymap.sort_by{|k,x| x}.each{|k,x| puts "#{k}: #{x}"}
for (k, x) in mymap.iter().sorted_by_key(|x| x.1) {
println!("[{},{}]", k, x);
}
let mut items: Vec<_> = mymap.iter().collect();
items.sort_by_key(|item| item.1);
for (k, x) in items {
println!("[{},{}]", k, x);
}