@mikuroxina/mini-fn
    Preparing search index...

    Function union

    • Unions two sets into one. It will collect items in lhs or rhs either without duplicates in ascending order.

      Type Parameters

      • T

      Parameters

      Returns (rhs: BTree.Set<T>) => (lhs: BTree.Set<T>) => Generator<T>

      The iterator which generates intersection items lhs ∪ rhs without duplicates.