GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Main page
  • Contents
  • Current events
  • Random article
  • About Wikipedia
  • Contact us
  • Help
  • Learn to edit
  • Community portal
  • Recent changes
  • Upload file
  • Special pages
  • Search
  • Donate

This view

  • Original page
  • New address

GeezerVison is showing en.wikipedia.org — Union type - Wikipedia

Not to be confused with Union (set theory) or Union (SQL).
icon
This article needs more citations. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Union type" – news · newspapers · books · scholar · JSTOR
(August 2009) (Learn how and when to remove this message)

In computer science, a union is a value that may have any of multiple representations or formats within the same area of memory, or a variable that may hold such a data structure. Some programming languages support a union type for such a data type. In other words, a union type specifies the permitted types that may be stored in its instances, e.g., float and int. In contrast with a record, which could be defined to contain both a float and an integer, a union can hold only one at a time.

A union can be pictured as a chunk of memory that is used to store variables of different data types. Once a new value is assigned to a field, the existing data is overwritten with the new data. The memory area storing the value has no intrinsic type (other than just bytes or words of memory), but the value can be treated as one of several abstract data types, having the type of the value that was last written to the memory area.

In type theory, a union has a sum type; this corresponds to disjoint union in mathematics.

Depending on the language and type, a union value may be used in some operations, such as assignment and comparison for equality, without knowing its specific type. Other operations may require that knowledge, either by some external information, or by the use of a tagged union.

Untagged unions

Because of the limitations of their use, untagged unions are generally only provided in untyped languages or in a type-unsafe way (as in C). They have the advantage over simple tagged unions of not requiring space to store a data type tag.

The name "union" stems from the type's formal definition. If a type is considered as the set of all values that that type can take on, a union type is simply the mathematical union of its constituting types, since it can take on any value any of its fields can. Also, because a mathematical union discards duplicates, if more than one field of the union can take on a single common value, it is impossible to tell from the value alone which field was last written.

However, one useful programming function of unions is to map smaller data elements to larger ones for easier manipulation. A data structure consisting, for example, of 4 bytes and a 32-bit integer, can form a union with an unsigned 64-bit integer, and thus be more readily accessed for purposes of comparison etc.

Unions in various programming languages

ALGOL 68

ALGOL 68 has tagged unions, and uses a case clause to distinguish and extract the constituent type at runtime. A union containing another union is treated as the set of all its constituent possibilities, and if the context requires it a union is automatically coerced into the wider union. A union can explicitly contain no value, which can be distinguished at runtime. An example is:

 mode node = union (real, int, string, void);
 
 node n := "abc";
 
 case n in
   (real r):   print(("real:", r)),
   (int i):    print(("int:", i)),
   (string s): print(("string:", s)),
   (void):     print(("void:", "EMPTY")),
   out         print(("?:", n))
 esac

The syntax of the C/C++ union type and the notion of casts was derived from ALGOL 68, though in an untagged form.[1]

C/C++

In C and C++, untagged unions are expressed nearly exactly like structures (structs), except that each data member is located at the same memory address. The data members, as in structures, need not be primitive values, and in fact may be structures or even other unions. C++ (since C++11) also allows for a data member to be any type that has a full-fledged constructor/destructor and/or copy constructor, or a non-trivial copy assignment operator (for example, a std::string as a member of a union).

The primary use of a union is allowing access to a common location by different data types, for example hardware input/output access, and bitfield and word sharing. Unions can also provide low-level polymorphism. However, there is no checking of types, so it is up to the programmer to be sure that the proper fields are accessed in different contexts. The relevant field of a union variable is typically determined by the state of other variables, possibly in an enclosing struct.

One common C programming idiom uses unions to perform type punning, by assigning to one field of a union and reading from another, as is done in code which depends on the raw representation of the values. In C++, the equivalent feature is similar to a reinterpret_cast, but this cannot be used in most cases due to strict aliasing; instead, std::bit_cast<T>() is used (which reinterprets the raw bit pattern of a parameter of type U, as T). A practical example is the method of computing square roots using the IEEE representation. This is not, however, a safe use of unions in general.

Structure and union specifiers have the same form. [ . . . ] The size of a union is sufficient to contain the largest of its members. The value of at most one of the members can be stored in a union object at any time. A pointer to a union object, suitably converted, points to each of its members (or if a member is a bit-field, then to the unit in which it resides), and vice versa.

— ANSI/ISO 9899:1990 (the ANSI C standard) Section 6.5.2.1

Anonymous union

In C (since C11) and C++, unions may also be anonymous. Their data members do not need to be referenced, are instead accessed directly. They have some restrictions as opposed to traditional unions: in C11, they must be a member of another structure or union,[2] and in C++, they can not have methods or access specifiers.

Simply omitting the class-name portion of the syntax does not make a union an anonymous union. For a union to qualify as an anonymous union, the declaration must not declare an object. Example:

union {
    float f;
    uint32_t d; // Assumes float is 32 bits wide
};

f = 3.14f;
printf("Hexadecimal representation of 3.14f: %x\n", d);

Anonymous unions are also useful in C struct definitions to provide a sense of namespacing.[3]

Transparent union

In compilers such as GCC, Clang, and IBM XL C for AIX, a [[gnu::transparent_union]] compiler attribute is available for union types. Types contained in the union can be converted transparently to the union type itself in a function call, provided that all types have the same size. It is mainly intended for function with multiple parameter interfaces, a use necessitated by early Unix extensions and later re-standardisation.[4]

COBOL

In COBOL, union data items are defined in two ways. The first uses the RENAMES (66 level) keyword, which effectively maps a second alphanumeric data item on top of the same memory location as a preceding data item. In the example code below, data item PERSON-REC is defined as a group containing another group and a numeric data item. PERSON-DATA is defined as an alphanumeric data item that renames PERSON-REC, treating the data bytes continued within it as character data.

  01  PERSON-REC.
      05  PERSON-NAME.
          10  PERSON-NAME-LAST    PIC X(12).
          10  PERSON-NAME-FIRST   PIC X(16).
          10  PERSON-NAME-MID     PIC X.
      05  PERSON-ID               PIC 9(9) PACKED-DECIMAL.
  
  01  PERSON-DATA                 RENAMES PERSON-REC.

The second way to define a union type is by using the REDEFINES keyword. In the example code below, data item VERS-NUM is defined as a 2-byte binary integer containing a version number. A second data item VERS-BYTES is defined as a two-character alphanumeric variable. Since the second item is redefined over the first item, the two items share the same address in memory, and therefore share the same underlying data bytes. The first item interprets the two data bytes as a binary value, while the second item interprets the bytes as character values.

  01  VERS-INFO.
      05  VERS-NUM        PIC S9(4) COMP.
      05  VERS-BYTES      PIC X(2)
                          REDEFINES VERS-NUM

Pascal

In Pascal, there are two ways to create unions. One is the standard way through a variant record. The second is a nonstandard means of declaring a variable as absolute, meaning it is placed at the same memory location as another variable or at an absolute address. While all Pascal compilers support variant records, only some support absolute variables.

For the purposes of this example, the following are all integer types: a byte consists of 8 bits, a word is 16 bits, and an integer is 32 bits.

The following example shows the non-standard absolute form:

var
    A: Integer;
    B: array[1..4] of Byte absolute A;
    C: Integer absolute 0;

In the first example, each of the elements of the array B maps to one of the specific bytes of the variable A. In the second example, the variable C is assigned to the exact machine address 0.

In the following example, a record has variants, some of which share the same location as others:

type
     Shape = (Circle, Square, Triangle);
     Dimensions = record
        case Figure: Shape of 
           Circle: (Diameter: real);
           Square: (Width: real);
           Triangle: (Side: real; Angle1, Angle2: 0..360)
        end;

PL/I

In PL/I the original term for a union was cell,[5] which is still accepted as a synonym for union by several compilers. The union declaration is similar to the structure definition, where elements at the same level within the union declaration occupy the same storage. Elements of the union can be any data type, including structures and array.[6]: pp192–193  Here vers_num and vers_bytes occupy the same storage locations.

  1  vers_info         union,
     5 vers_num        fixed binary,
     5 vers_bytes      pic '(2)A';

An alternative to a union declaration is the DEFINED attribute, which allows alternative declarations of storage, however the data types of the base and defined variables must match.[6]: pp.289–293 

Rust

Rust implements both tagged and untagged unions. In Rust, tagged unions are implemented using the enum keyword. Unlike enumerated types in most other languages, enum variants in Rust can contain additional data in the form of a tuple or struct, making them tagged unions rather than simple enumerated types.[7]

Rust also supports untagged unions using the union keyword. The memory layout of unions in Rust is undefined by default,[8] but a union with the #[repr(C)] attribute will be laid out in memory exactly like the equivalent union in C.[9] Reading the fields of a union can only be done within an unsafe function or block, as the compiler cannot guarantee that the data in the union will be valid for the type of the field; if this is not the case, it will result in undefined behavior.[10]

Syntax and example

C

In C, a union is most commonly used to save memory by storing different data types in the same memory location.

union FloatBits {
    float f;
    uint32_t u;
};

A struct can also be a member of a union. In the following example, a struct with bit fields specified is a member of a union. For example, the following example represents a type that may be used as a single raw byte, or individual configuration flags.

union ControlRegister {
    uint8_t full_register;
    struct {  
        uint8_t enable : 1;
        uint8_t mode : 3;
        uint8_t status : 4;
    } bits;
};

union ControlRegister config = {
    .bits = {
        .enable = 1,
        .mode = 2,
    }
};

Additionally, unions are most widely used for type punning, i.e. interpreting the raw binary representation of one data type as another.

#include <stdio.h>

union Ipv4Addr {
    uint32_t address;
    uint8_t octets[4];
};

// Write individual octets
Ipv4Addr ip = {
    .octets = {192, 168, 1, 1}
}
// Read the octets as an integer: 0x0101A8C0
printf("0x%08X\n", ip.address);

// Write as a 32-bit integer
ip.address = 0x0A000001;
// Read the integer as octets: 1.0.0.10
printf("%u.%u.%u.%u\n", ip.octets[0], ip.octets[1], ip.octets[2], ip.octets[3]);

C++

C++ supports C's unions, but these are un-idiomatic due to poor type safety. C++17 introduced a tagged union type in the standard library, called std::variant<Ts...>. The standard library provides free functions for reading and accessing from it std::holds_alternative<T>() is used to check the active type, and std::get<T>() retrieves the type (or throws if T is not the active type).[11][12]

import std;

struct Circle {
    double radius;
};

struct Rectangle {
    double width;
    double height;
};

using Shape = std::variant<Circle, Rectangle>;

int main() {
    Shape s = Circle { .radius = 5.0 };

    // check if s holds a Circle
    if (std::holds_alternative<Circle>(s)) {
        // interpret s as a circle if so
        const Circle& circle = std::get<Circle>(s);
        std::println("s is a Circle with radius {}", circle.radius);
    }
    // s can be reassigned to another alternative
    s = Rectangle { .width = 2.0, .height = 3.0 };
}

C#

Until C# 15, there were no union types in C#. The closest way to emulate them was through records and pattern matching.

namespace Wikipedia.Examples;

using System;

abstract record Shape;
record Circle(double Radius) : Shape;
record Rectangle(double Width, double Height) : Shape;

public class Example
{
    public static double Area(Shape s) => s switch
    {
        Circle c => Math.PI * c.Radius * c.Radius,
        Rectangle r => r.Width * r.Height,
        _ => throw new NotSupportedException()
    };
}

They could also be closely simulated using low-level layout. The following demonstrates such a union, where the fields occupy the same memory, but is not type-safe. This can be used for interoperability, serialization, and unsafe manipulation.

using System.Runtime.InteropServices;

// closest to C union FloatBits { float f; uint32_t u; };
[StructLayout(LayoutKind.Explicit)]
struct FloatBits
{
    [FieldOffset(0)]
    public float f;

    [FieldOffset(0)]
    public uint u;
}

In C# 15, the union keyword was introduced to the language. This declares a tagged union.[13]

public record class Car(string Model);
public record class Bicycle(string Model);
public record class Bus(string Model);

public union Vehicle(Car, Bicycle, Bus);

Vehicle car = new Car("Tesla Model 3");
Console.WriteLine(car.Value); // Car { Model = Tesla Model 3 }

Vehicle bike = new Bicycle("Giant Escape 3");
Console.WriteLine(bike.Value); // Bicycle { Model = Giant Escape 3 }

Vehicle bus = new Bus("Volvo 9700");
Console.WriteLine(bus.Value); // Bus { Model = Volvo 9700 }

Vehicle v = /* some vehicle here */;
string model = v switch
{
    Car c => c.Model,
    Bicycle bk => b.Model,
    Bus bs => bs.Model,
};

The default value of a union is null, but if all types in the union are non-nullable, then a switch expression need not check for null.

Java

Union types do not exist in Java, although they can be somewhat emulated using sealed interfaces.

// "Shape" can be thought of as a union of "Circle", "Rectangle",
// and other types that implement "Shape"
// we can explicitly restrict what is in the union using a sealed interface
sealed interface Shape permits Circle, Rectangle {}

record Circle(double radius) implements Shape {}

record Rectangle(double width, double height) implements Shape {}

class Example {
    double area(Shape s) {
        return switch (s) {
            case Circle(double r) -> Math.PI * r * r;
            case Rectangle(double w, double h) -> w * h;
        };
    }
}

A catch clause can declare a union of multiple exception types. This syntax resembles union type syntax in other languages, but does not actually introduce a new type. The effective type of the exception parameter is the most specific common supertype of the alternatives. The catch clause only catches exceptions of the declared types, no other subclasses of the common supertype.[14]

class FooException extends RuntimeException {
    String name() {
        return "Foo";
    }
}

class BarException extends RuntimeException {
    String name() {
        return "Bar";
    }
}

void main() {
    try {
        throw Math.random() < 0.5 ? new FooException() : new BarException();
    } catch (FooException | BarException e) {
        // e has type RuntimeException, the common supertype of FooException and BarException
        System.out.println(e);
        e.printStackTrace();
        // System.out.println(e.name());
        // Because there is no name() method in RuntimeException, this fails to compile
    }
}

PHP

Union types were introduced to PHP in PHP 8.0.[15] The values are implicitly "tagged" with a type by the language, and may be retrieved by gettype().

class Example
{
    private int|float $foo;

    public function squareAndAdd(float|int $bar): int|float
    {
        return $bar ** 2 + $this->foo;
    }
}

Python

Support for type hints was introduced to Python in Python 3.5.[16] The new syntax for union types were introduced in Python 3.10.[17]

from typing import Union

class Example:
    foo: int = 0

    # old style:
    def square_and_add(self, bar: Union[int, float]) -> Union[int, float]:
        return bar ** 2 + self.foo

    # new style:
    def square_and_add(self, bar: int | float) -> int | float:
        return bar ** 2 + self.foo

TypeScript

Union types are supported in TypeScript.[18] When TypeScript code is transpiled to JavaScript, all type-related information is lost.[19] This means that there is no one way to identify the type of a value at runtime as it appears in TypeScript. However, all JavaScript values are implicitly "tagged" with a type by the language, which may be retrieved using the typeof operator for primitive values and the instanceof operator for classes. Because JavaScript uses a dynamic type system, how operations such as addition or indexing will behave is determined at runtime based on the type of the value. This means if all members of a union type support a given operation, no additional work has to be done to perform said operation.

function length(v: string | any[]): number {
    // Because both strings and arrays have a "length" property,
    // we can use it without having to figure out the actual type of v.
    return v.length;
}

function containsTheLetterA(v: string | string[] | number): boolean {
    // sometimes, it is important to know the exact type of a value.
    if (typeof v === "string") {
        return v.includes("a");
    } else if (v instanceof Array) {
        // Because v is an Array, we want to check if any element includes the letter A.
        return v.some((element) => element.includes("a"));
    } else {
        // Because we know it isn't an array or string, it must be a number.
        // Numbers don't ever contain the letter a.
        return false;
    }
}

Rust

Tagged unions in Rust use the enum keyword, and can contain tuple and struct variants:

enum Shape {
	Circle { radius: f64 },
	Rectangle { width: f64, height: f64 },
}

fn main() {
    let mut s = Shape::Circle { radius: 5.0 };
    if let Shape::Circle { radius } = s {
        println!("s is a Circle with radius {radius}");
    }
    s = Shape::Rectangle { width: 2.0, height: 3.0 };
}

Untagged unions in Rust use the union keyword:

union Foo {
	bar: i32,
	baz: bool,
}

Reading from the fields of an untagged union results in undefined behavior if the data in the union is not valid as the type of the field, and thus requires an unsafe block:

let x = Foo { bar: 10 };
let y = unsafe { x.bar }; // This will set y to 10, and does not result in undefined behavior.
let z = unsafe { x.baz }; // This results in undefined behavior, as the value stored in x is not a valid bool.

References

  1. ↑ Ritchie, Dennis M. (March 1993). "The Development of the C Language". ACM SIGPLAN Notices. 28 (3): 201–208. doi:10.1145/155360.155580. The scheme of type composition adopted by C owes considerable debt to Algol 68, although it did not, perhaps, emerge in a form that Algol's adherents would approve of. The central notion I captured from Algol was a type structure based on atomic types (including structures), composed into arrays, pointers (references), and functions (procedures). Algol 68's concept of unions and casts also had an influence that appeared later.
  2. ↑ "6.63 Unnamed Structure and Union Fields". Retrieved 2016-12-29.
  3. ↑ Siebenmann., Chris. "CUnionsForNamespaces". utcc.utoronto.ca.
  4. ↑ "Common Type Attributes: transparent_union". Using the GNU Compiler Collection (GCC).
  5. ↑ IBM Corporation (March 1968). IBM System/360 PL/I Language Specifications (PDF). p. 52. Retrieved Jan 22, 2018.
  6. 1 2 IBM Corporation (Dec 2017). Enterprise PL/I for z/OS PL/I for AIX IBM Developer for z Systems PL/I for windows Language Reference (PDF). Retrieved Jan 22, 2018.
  7. ↑ "How Rust Implements Tagged Unions - Pat Shaughnessy". patshaughnessy.net. Retrieved 2023-04-25.
  8. ↑ "Union types - The Rust Reference". doc.rust-lang.org. Retrieved 2023-04-25.
  9. ↑ "Type layout - The Rust Reference". doc.rust-lang.org. Retrieved 2023-04-25.
  10. ↑ "Unions - The Rust Reference". doc.rust-lang.org. Retrieved 2023-04-25.
  11. ↑ Bancila, Marius (2017). "Using std::variant as a type-safe union". Modern C++ Programming Cookbook. O'Reilly Media. ISBN 9781786465184.
  12. ↑ "std::variant". cppreference.com. Archived from the original on 2025-10-11. Retrieved 2025-12-16.
  13. ↑ Bill Wagner (2 April 2026). "Explore union types in C# 15". devblogs.microsoft.com. Microsoft.
  14. ↑ Gosling, James; Joy, Bill; Steele, Guy; Bracha, Gilad; Buckley, Alex; Smith, Daniel; Bierman, Gavin. "The Java Language Specification. Section 14.20: The try statement". Retrieved 2026-04-22.
  15. ↑ Karunaratne, Ayesh. "PHP 8.0: Union Types". PHP.Watch. Retrieved 30 November 2020.
  16. ↑ "typing — Support for type hints — Python 3.9.7 documentation". docs.python.org. Retrieved 8 September 2021.
  17. ↑ "PEP 604 -- Allow writing union types as X | Y". Python.org. Retrieved 8 September 2021.
  18. ↑ "Handbook - Unions and Intersection Types". www.typescriptlang.org. Retrieved 30 November 2020.
  19. ↑ "TypeScript: Documentation - The Basics". www.typescriptlang.org. Retrieved 21 August 2026.
  • Kernighan, Brian W.; Ritchie, Dennis M. (1978). The C Programming Language (1st ed.). Prentice Hall. p. 138. ISBN 978-0131101630. Retrieved Jan 23, 2018.

External links

  • boost::variant, a type-safe alternative to C++ unions
  • MSDN: Classes, Structures & Unions, for examples and syntax
  • differences, differences between union & structure
  • Difference between struct and union in C++
Retrieved from "https://en.wikipedia.org/w/index.php?title=Union_type&oldid=1385192111"
Categories:
  • Data types
  • Composite data types
  • C (programming language)
Hidden categories:
  • Articles with short description
  • Short description is different from Wikidata
  • Articles needing additional references from August 2009
  • All articles needing additional references
  • Articles with example C code
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.