Set

Set

15 wrappers generated from Set and Set.prototype. Every entry takes a single object literal whose keys mirror the original parameter names, plus an optional prompt: string for the LLM path.

Method	First signature
add	add(input: { set: <receiver>; value: T; prompt?: string }): Promise<Set<T>>
clear	clear(input: { set: <receiver>; prompt?: string }): Promise<void>
delete	delete(input: { set: <receiver>; value: T; prompt?: string }): Promise<boolean>
difference	difference(input: { set: <receiver>; other: ReadonlySetLike<U>; prompt?: string }): Promise<Set<T>>
entries	entries(input: { set: <receiver>; prompt?: string }): Promise<SetIterator<[T, T]>>
forEach	forEach(input: { set: <receiver>; callbackfn?: (value: T; value2: T; set: Set<T>) => void; thisArg?: any; prompt?: string }): Promise<void>
has	has(input: { set: <receiver>; value: T; prompt?: string }): Promise<boolean>
intersection	intersection(input: { set: <receiver>; other: ReadonlySetLike<U>; prompt?: string }): Promise<Set<T & U>>
isDisjointFrom	isDisjointFrom(input: { set: <receiver>; other: ReadonlySetLike<unknown>; prompt?: string }): Promise<boolean>
isSubsetOf	isSubsetOf(input: { set: <receiver>; other: ReadonlySetLike<unknown>; prompt?: string }): Promise<boolean>
isSupersetOf	isSupersetOf(input: { set: <receiver>; other: ReadonlySetLike<unknown>; prompt?: string }): Promise<boolean>
keys	keys(input: { set: <receiver>; prompt?: string }): Promise<SetIterator<T>>
symmetricDifference	symmetricDifference(input: { set: <receiver>; other: ReadonlySetLike<U>; prompt?: string }): Promise<Set<T | U>>
union	union(input: { set: <receiver>; other: ReadonlySetLike<U>; prompt?: string }): Promise<Set<T | U>>
values	values(input: { set: <receiver>; prompt?: string }): Promise<SetIterator<T>>