goog.structs.StringSet

Returns an iterator that iterates over the elements in the set. NOTE: creating the iterator copies the whole set so use #forEach when possible.

Adds a single element to the set.

Adds a the elements of an array to this set.

Adds a the elements of a set to this set.

Removes all elements of the set.

Tells if the set contains the given element.

Tells if the set contains all elements of the array.

Removes a single element from the set.

Tells if this set has the same elements as the given set.

Calls a function for each element in the set.

Counts the number of elements in the set in linear time. MOE:begin_strip NOTE: getCount is always called at most once per set instance in google3. MOE:end_strip If this usage pattern won't change, the linear getCount implementation is better, because

• populating a set and getting the number of elements in it takes the same amount of time as keeping a count_ member up to date and getting its value;
• if getCount is not called, adding and removing elements have no overhead.

Calculates the difference of two sets.

Calculates the intersection of this set with another set.

Calculates the symmetric difference of two sets.

Calculates the union of this set and another set.

Tells if the set contains the given element.

Tells if this set and the given set are disjoint.

Tells if this set is the subset of the given set.

Tells if this set is the superset of the given set.

Removes a single element from the set.

Removes all elements of the given array from this set.

Removes all elements of the given set from this set.