}

  /**
   * Returns a new range set consisting of the union of this range set and {@code other}.
   *
   * <p>This is essentially the same as {@code TreeRangeSet.create(this).addAll(other)} except it
   * returns an {@code ImmutableRangeSet}.
   *
   * @since 21.0
   */
  public ImmutableRangeSet<C> union(RangeSet<C> other) {
    return unionOf(Iterables.concat(asRanges(), other.asRanges()));
  }

  /**

            Range.openClosed(5, 7),
            Range.open(3, 4));
    subsets:
    for (Set<Range<Integer>> subset : Sets.powerSet(ranges)) {
      assertEquals(TreeRangeSet.create(subset), ImmutableRangeSet.unionOf(subset));

      RangeSet<Integer> mutable = TreeRangeSet.create();
      ImmutableRangeSet.Builder<Integer> builder = ImmutableRangeSet.builder();

      boolean anyOverlaps = false;

    assertMinSize(union(emptySet(), emptySet()), 0);
    assertMinSize(union(setSize(2), setSize(3)), 3);
    assertMinSize(union(setSize(3), setSize(2)), 3);
    assertMinSize(union(setSizeRange(10, 20), setSizeRange(11, 12)), 11);
    assertMinSize(union(setSizeRange(11, 12), setSizeRange(10, 20)), 11);
  }

  public void testUnion_maxSize() {
    assertMaxSize(union(emptySet(), emptySet()), 0);

	typedef struct {
		int count;
		[size_is(count)] ShareInfo502 *array;
	} ShareInfoCtr502;

	typedef [switch_type(int)] union {
		[case(0)] ShareInfo0 *info0;
		[case(1)] ShareInfo1 *info1;
		[case(502)] ShareInfo502 *info1;
	} ShareInfo;

	typedef [switch_type(int)] union {
		[case(0)] ShareInfoCtr0 *info0;
		[case(1)] ShareInfoCtr1 *info1;
		[case(502)] ShareInfoCtr502 *info1;
	} ShareCtr;

	[op(0x0f)]

import static com.google.common.collect.Multisets.difference;
import static com.google.common.collect.Multisets.intersection;
import static com.google.common.collect.Multisets.sum;
import static com.google.common.collect.Multisets.union;
import static com.google.common.collect.Multisets.unmodifiableMultiset;
import static java.util.Arrays.asList;
import static java.util.Collections.sort;

import com.google.common.annotations.GwtIncompatible;

# Always check-out / check-in files with LF line endings.
* text=auto eol=lf

hack/verify-flags/known-flags.txt merge=union
test/test_owners.csv merge=union

**/zz_generated.*.go linguist-generated=true
**/types.generated.go linguist-generated=true
**/generated.pb.go linguist-generated=true
**/generated.proto
**/types_swagger_doc_generated.go linguist-generated=true
api/openapi-spec/*.json linguist-generated=true

	typedef struct {
		int count;
		[size_is(count)] ShareInfo502 *array;
	} ShareInfoCtr502;

	typedef [switch_type(int)] union {
		[case(0)] ShareInfo0 *info0;
		[case(1)] ShareInfo1 *info1;
		[case(502)] ShareInfo502 *info1;
	} ShareInfo;

	typedef [switch_type(int)] union {
		[case(0)] ShareInfoCtr0 *info0;
		[case(1)] ShareInfoCtr1 *info1;
		[case(502)] ShareInfoCtr502 *info1;
	} ShareCtr;

	[op(0x0f)]

import static com.google.common.collect.Multisets.difference;
import static com.google.common.collect.Multisets.intersection;
import static com.google.common.collect.Multisets.sum;
import static com.google.common.collect.Multisets.union;
import static com.google.common.collect.Multisets.unmodifiableMultiset;
import static java.util.Arrays.asList;
import static java.util.Collections.sort;

import com.google.common.annotations.GwtIncompatible;

	typedef struct {
		uint32_t flags;
		[string] wchar_t *dfs_name;
	} DfsInfo300;

	typedef struct {
		uint32_t count;
		[size_is(count)] DfsInfo300 *s;
	} DfsEnumArray300;

	typedef union {
		[case(1)] DfsEnumArray1 *info1;
		[case(3)] DfsEnumArray3 *info3;
		[case(200)] DfsEnumArray200 *info200;
		[case(300)] DfsEnumArray300 *info300;
	} DfsEnumInfo;

	typedef struct {
		uint32_t level,

    this.selfLoopCount = checkNonNegative(selfLoopCount);
    checkState(selfLoopCount <= inEdgeMap.size() && selfLoopCount <= outEdgeMap.size());
  }

  @Override
  public Set<N> adjacentNodes() {
    return Sets.union(predecessors(), successors());
  }

  @Override
  public Set<E> incidentEdges() {
    return new AbstractSet<E>() {
      @Override
      public UnmodifiableIterator<E> iterator() {