• index
• goog
• structs
• search: Go

The goog.structs.StringSet Class

goog.structs.StringSet(opt_elements)

Creates a set of strings.

opt_elements {!Array=}

Elements to add to the set. The non-string items will be converted to strings, so 15 and '15' will mean the same.

.__iterator__(opt_keys)

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

opt_keys {boolean=}

Ignored for sets.

returns {!goog.iter.Iterator}

An iterator over the elements in the set.

.add(element)

Adds a single element to the set.

element {*}

The element to add. It will be converted to string.

.addArray(arr)

Adds a the elements of an array to this set.

arr {!Array}

The array to add the elements of.

.addSet(stringSet)

Adds a the elements of a set to this set.

stringSet {!goog.structs.StringSet}

The set to add the elements of.

.clear()

Removes all elements of the set.

.clone()

returns {!goog.structs.StringSet}

Clone of the set.

.contains(element)

Tells if the set contains the given element.

element {*}

The element to check.

returns {boolean}

Whether it is in the set.

.containsArray(arr)

Tells if the set contains all elements of the array.

arr {!Array}

The elements to check.

returns {boolean}

Whether they are in the set.

.equals(stringSet)

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

stringSet {!goog.structs.StringSet}

The other set.

returns {boolean}

Whether they have the same elements.

.forEach(f, opt_obj)

Calls a function for each element in the set.

f {function(string, undefined, !goog.structs.StringSet)}

The function to call for every element. It takes the element, undefined (because sets have no notion of keys), and the set.

opt_obj {Object=}

The object to be used as the value of 'this' within {@code f}.

.getCount()

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