This language bar is your friend. Select your favorite languages!
Select your favorite languages :
- Or search :
- Ada
- Clojure
- C++
- C++
- C++
- C#
- D
- Dart
- Elixir
- Erlang
- Go
- Haskell
- Haskell
- JS
- JS
- JS
- Java
- Kotlin
- Lisp
- Lua
- Obj-C
- PHP
- Pascal
- Perl
- Python
- Python
- Ruby
- Ruby
- Ruby
- Rust
- Scala
- Scheme
- Smalltalk
- VB
Map.member k m
Assumes m is an "actual" map,
m :: Map k v.
m :: Map k v.
m.hasOwnProperty(k)
This is like "k in m" except it doesn't check up the prototype chain, which is often not what people want.
(nth-value 1 (gethash k m))
gethash returns a value, and a boolean for whether or not the entry is present.
m.IndexOf(k) >= 0
This works for a number of Pascal containers, including TFPGMap.