parameters: (a, b, validate_indices=True)
return_statement: return _set_operation(a, b, "union", validate_indices)
docstring: Compute set union of elements in last dimension of `a` and `b`.
  
    All but the last dimension of `a` and `b` must match.
  
    Args:
      a: `Tensor` or `SparseTensor` of the same type as `b`. If sparse, indices
          must be sorted in row-major order.
      b: `Tensor` or `SparseTensor` of the same type as `a`. Must be
          `SparseTensor` if `a` is `SparseTensor`. If sparse, indices must be
          sorted in row-major order.
      validate_indices: Whether to validate the order and range of sparse indices
         in `a` and `b`.
  
    Returns:
      A `SparseTensor` with the same rank as `a` and `b`, and all but the last
      dimension the same. Elements along the last dimension contain the
      unions.
docstring_summary: Compute set union of elements in last dimension of `a` and `b`.
docstring_tokens: Compute set union of elements in last dimension of a and b .
function: def set_union(a, b, validate_indices=True):
    """Compute set union of elements in last dimension of `a` and `b`.
  
    All but the last dimension of `a` and `b` must match.
  
    Args:
      a: `Tensor` or `SparseTensor` of the same type as `b`. If sparse, indices
          must be sorted in row-major order.
      b: `Tensor` or `SparseTensor` of the same type as `a`. Must be
          `SparseTensor` if `a` is `SparseTensor`. If sparse, indices must be
          sorted in row-major order.
      validate_indices: Whether to validate the order and range of sparse indices
         in `a` and `b`.
  
    Returns:
      A `SparseTensor` with the same rank as `a` and `b`, and all but the last
      dimension the same. Elements along the last dimension contain the
      unions.
    """
    return _set_operation(a, b, "union", validate_indices)
function_tokens: def set_union ( a , b , validate_indices = True ) : return _set_operation ( a , b , "union" , validate_indices )