hasElementh

hasElementh is a function used in programming contexts to determine whether a collection contains a given element. The name suggests a boolean result that reflects membership within a data structure, and it is described in some libraries or documentation as a generic utility for existence checks.

Typical form and behavior

The common form is hasElementh(collection, element) and it returns a boolean indicating presence. Some implementations allow an optional comparator or key function to customize how equality is determined, which is useful for complex objects. The function is defined for various collection types, including lists, arrays, sets, and maps (where it may check for a value or a key, depending on the type).

Performance and edge cases

Performance depends on the collection type. For unordered collections like sets or hash maps, the average-case lookup is near O(1). For ordered sequences such as arrays or linked lists, the operation is typically O(n). Edge cases include handling of null or undefined elements and deciding whether equality uses reference equality or a user-provided value-based comparator.

Examples

In pseudocode: hasElementh([1, 2, 3], 2) returns true, and hasElementh([1, 2, 3], 4) returns false. For a set s containing "apple", hasElementh(s, "apple") returns true. When working with objects, a custom comparator may be supplied to define what counts as a match.

Relation to related concepts

hasElementh is conceptually similar to includes, contains, or mem, terms used across languages to express membership tests. Some environments provide built-in operators for membership instead of a dedicated function by this name.