The OpenD Programming Language

StringMap.opIndexAssign

Complexity: O(log(s)) (exist) or O(n) (not exist), where s is the count of the strings with the same length as they key.

  1. T opIndexAssign(R value, string key)
  2. T opIndexAssign(T value, string key)
    struct StringMap(T)
    ref @trusted pure nothrow
    T
    opIndexAssign
    ()
    (,
    string key
    )

Meta