Creating implementation for idiom 52 : Check if map contains value

Idiom

# 52 Check if map contains value

Created by

Lead paragraph

Determine whether map _m contains an entry with value _v, for some key.

New implementation

Language

Imports

Code

Documentation URL

Original attribution URL

Online demo

Username

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

#include <algorithm>

std::find_if(m.begin(), m.end(), [v](const auto& mo) {return mo.second == v; }) != m.end();

using System.Collections.Generic;

m.ContainsValue(v)

import std.algorithm;

m.byValue.canFind(v);

m.containsValue(v);

Map.values(m) |> Enum.member?(v)

func containsValue(m map[K]T, v T) bool {
	for _, x := range m {
		if x == v {
			return true
		}
	}
	return false
}

elem v (elems m)

Object.values(m).includes(v)

[...m.values()].includes(v)

import java.util.Map;

m.containsValue(v)

in_array($v, $m, true);

uses fgl;

m.IndexOfData(v) >= 0

print "Found it!" if exists $m{$v};

v in m.values()

m.value?(v)

use std::collections::BTreeMap;

let does_contain = m.values().any(|&val| *val == v);

!m.values.find(_ == v).isEmpty()