HashMap.add

Add a new element to the set. Does not add if there is an equivalent already present. Returns true where an element is added, false where it already exists (and was possibly updated). This variation invokes the given retain function when the key does not already exist. You would typically use that to duplicate a char[], or whatever is required.

Time complexity: O(1) average; O(n) worst.

  1. bool add(K key, V element)
  2. bool add(K key, V element, K function(K) retain)
    class HashMap(K, V, alias Hash = Container.hash, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
    final
    bool
    add
    (
    K key
    ,,
    K function
    (
    K
    )
    retain
    )

Meta