Assertion: set | /r/HasProperty | implemented in same way
Facets:
value: as (partial) maps
type: MANNER
value: commonly
type: TEMPORAL
Source sentences:
text: As sets can be interpreted as a kind of map (by the indicator function), sets are commonly implemented in the same way as (partial) maps (associative arrays) – in this case in which the value of each key-value pair has the unit type or a sentinel value (like 1) – namely, a self-balancing binary search tree for sorted sets (which has O(log n) for most operations), or a hash table for unsorted sets (which has O(1) average-case, but O(n) worst-case, for most operations).