         difference.value.pop(item)
     return difference
 
+  # Returns new Set containing items in this or set, but not both
   __xor__: (set) ->
     diff1 = @__sub__(set)
     diff2 = set.__sub__(xor)

  __iter__: ->
    return new Iterator(@)
  
  __ixor__: (set) ->
    diff1 = @__sub__(set)
    diff2 = set.__sub__(xor)

      @value.pop(deletedKey)
    return @
  
  # ** Unimplemented **
  __init__: ->
  
  # Inplace set union
  __ior__: (set) ->
    for item in set.value
      @add(item)
    return @
  
  # Inplace set difference
  __isub__: (set) ->
    for item in set.value
      if @__contains__(item)
