Logo

Programming-Idioms

This language bar is your friend. Select your favorite languages!
Select your favorite languages :
  • Or search :
#include <map>
bool key_exists = m.count(k) != 0;
#include <map>
bool key_exists = m.find(k) != m.end();
#include <map>
bool key_exists = m.contains(k);
M.Contains (K)
(contains? m k)
bool keyExists = m.ContainsKey(key)
if (k in m) { }
m.containsKey(k)
Map.has_key?(m, k)
maps:is_key(K, M).
_, ok := m[k]
(/=Nothing) (lookup k m)
import qualified Data.Map.Strict as Map
Map.member k m
_m.has(_k)
k in m
m.hasOwnProperty(k)
import java.util.Map;
m.containsKey(k)
m.containsKey(k)
(nth-value 1 (gethash k m))
m[k] ~= nil
@import Foundation;
if (m[k]) ...
array_key_exists($k, $m)
uses fgl, classes;
m.IndexOf(k) >= 0
exists $m->{$k}
k in m
m.include?(k)
m.has_key?(k)
m.key?(k)
use std::collections::HashMap;
m.contains_key(&k)
m.contains(k)
(assoc k m)
m includesKey: k.
If m.ContainsKey(k) Then...

New implementation...