# File lib/hashery/lru_hash.rb, line 197
    def store(key, value)
      # same optimization as in Hash
      key = key.dup.freeze if String === key && !key.frozen?

      n = @h[key]

      unless n
        if size == max_size
          # reuse node to optimize memory usage
          n = delete_oldest
          n.key = key
          n.value = value
        else
          n = Node.new key, value
        end

        @h[key] = n
      end

      front(n).value = value
    end