Thanks for using Compiler Explorer
Sponsors
Jakt
C++
Ada
Analysis
Android Java
Android Kotlin
Assembly
C
C3
Carbon
C++ (Circle)
CIRCT
Clean
CMake
CMakeScript
COBOL
C++ for OpenCL
MLIR
Cppx
Cppx-Blue
Cppx-Gold
Cpp2-cppfront
Crystal
C#
CUDA C++
D
Dart
Elixir
Erlang
Fortran
F#
Go
Haskell
HLSL
Hook
Hylo
ispc
Java
Julia
Kotlin
LLVM IR
LLVM MIR
Modula-2
Nim
Objective-C
Objective-C++
OCaml
OpenCL C
Pascal
Pony
Python
Racket
Ruby
Rust
Snowball
Scala
Solidity
Spice
Swift
LLVM TableGen
Toit
TypeScript Native
V
Vala
Visual Basic
Zig
Javascript
GIMPLE
c++ source #1
Output
Compile to binary object
Link to binary
Execute the code
Intel asm syntax
Demangle identifiers
Verbose demangling
Filters
Unused labels
Library functions
Directives
Comments
Horizontal whitespace
Debug intrinsics
Compiler
6502-c++ 11.1.0
ARM GCC 10.2.0
ARM GCC 10.3.0
ARM GCC 10.4.0
ARM GCC 10.5.0
ARM GCC 11.1.0
ARM GCC 11.2.0
ARM GCC 11.3.0
ARM GCC 11.4.0
ARM GCC 12.1.0
ARM GCC 12.2.0
ARM GCC 12.3.0
ARM GCC 13.1.0
ARM GCC 13.2.0
ARM GCC 13.2.0 (unknown-eabi)
ARM GCC 4.5.4
ARM GCC 4.6.4
ARM GCC 5.4
ARM GCC 6.3.0
ARM GCC 6.4.0
ARM GCC 7.3.0
ARM GCC 7.5.0
ARM GCC 8.2.0
ARM GCC 8.5.0
ARM GCC 9.3.0
ARM GCC 9.4.0
ARM GCC 9.5.0
ARM GCC trunk
ARM gcc 10.2.1 (none)
ARM gcc 10.3.1 (2021.07 none)
ARM gcc 10.3.1 (2021.10 none)
ARM gcc 11.2.1 (none)
ARM gcc 5.4.1 (none)
ARM gcc 7.2.1 (none)
ARM gcc 8.2 (WinCE)
ARM gcc 8.3.1 (none)
ARM gcc 9.2.1 (none)
ARM msvc v19.0 (WINE)
ARM msvc v19.10 (WINE)
ARM msvc v19.14 (WINE)
ARM64 Morello gcc 10.1 Alpha 2
ARM64 gcc 10.2
ARM64 gcc 10.3
ARM64 gcc 10.4
ARM64 gcc 10.5.0
ARM64 gcc 11.1
ARM64 gcc 11.2
ARM64 gcc 11.3
ARM64 gcc 11.4.0
ARM64 gcc 12.1
ARM64 gcc 12.2.0
ARM64 gcc 12.3.0
ARM64 gcc 13.1.0
ARM64 gcc 13.2.0
ARM64 gcc 5.4
ARM64 gcc 6.3
ARM64 gcc 6.4
ARM64 gcc 7.3
ARM64 gcc 7.5
ARM64 gcc 8.2
ARM64 gcc 8.5
ARM64 gcc 9.3
ARM64 gcc 9.4
ARM64 gcc 9.5
ARM64 gcc trunk
ARM64 msvc v19.14 (WINE)
AVR gcc 10.3.0
AVR gcc 11.1.0
AVR gcc 12.1.0
AVR gcc 12.2.0
AVR gcc 12.3.0
AVR gcc 13.1.0
AVR gcc 13.2.0
AVR gcc 4.5.4
AVR gcc 4.6.4
AVR gcc 5.4.0
AVR gcc 9.2.0
AVR gcc 9.3.0
Arduino Mega (1.8.9)
Arduino Uno (1.8.9)
BPF clang (trunk)
BPF clang 13.0.0
BPF clang 14.0.0
BPF clang 15.0.0
BPF clang 16.0.0
BPF clang 17.0.1
BPF clang 18.1.0
BPF gcc 13.1.0
BPF gcc 13.2.0
BPF gcc trunk
EDG (experimental reflection)
EDG 6.5
EDG 6.5 (GNU mode gcc 13)
EDG 6.6
EDG 6.6 (GNU mode gcc 13)
FRC 2019
FRC 2020
FRC 2023
KVX ACB 4.1.0 (GCC 7.5.0)
KVX ACB 4.1.0-cd1 (GCC 7.5.0)
KVX ACB 4.10.0 (GCC 10.3.1)
KVX ACB 4.11.1 (GCC 10.3.1)
KVX ACB 4.12.0 (GCC 11.3.0)
KVX ACB 4.2.0 (GCC 7.5.0)
KVX ACB 4.3.0 (GCC 7.5.0)
KVX ACB 4.4.0 (GCC 7.5.0)
KVX ACB 4.6.0 (GCC 9.4.1)
KVX ACB 4.8.0 (GCC 9.4.1)
KVX ACB 4.9.0 (GCC 9.4.1)
M68K gcc 13.1.0
M68K gcc 13.2.0
M68k clang (trunk)
MRISC32 gcc (trunk)
MSP430 gcc 4.5.3
MSP430 gcc 5.3.0
MSP430 gcc 6.2.1
MinGW clang 14.0.3
MinGW clang 14.0.6
MinGW clang 15.0.7
MinGW clang 16.0.0
MinGW clang 16.0.2
MinGW gcc 11.3.0
MinGW gcc 12.1.0
MinGW gcc 12.2.0
MinGW gcc 13.1.0
RISC-V (32-bits) gcc (trunk)
RISC-V (32-bits) gcc 10.2.0
RISC-V (32-bits) gcc 10.3.0
RISC-V (32-bits) gcc 11.2.0
RISC-V (32-bits) gcc 11.3.0
RISC-V (32-bits) gcc 11.4.0
RISC-V (32-bits) gcc 12.1.0
RISC-V (32-bits) gcc 12.2.0
RISC-V (32-bits) gcc 12.3.0
RISC-V (32-bits) gcc 13.1.0
RISC-V (32-bits) gcc 13.2.0
RISC-V (32-bits) gcc 8.2.0
RISC-V (32-bits) gcc 8.5.0
RISC-V (32-bits) gcc 9.4.0
RISC-V (64-bits) gcc (trunk)
RISC-V (64-bits) gcc 10.2.0
RISC-V (64-bits) gcc 10.3.0
RISC-V (64-bits) gcc 11.2.0
RISC-V (64-bits) gcc 11.3.0
RISC-V (64-bits) gcc 11.4.0
RISC-V (64-bits) gcc 12.1.0
RISC-V (64-bits) gcc 12.2.0
RISC-V (64-bits) gcc 12.3.0
RISC-V (64-bits) gcc 13.1.0
RISC-V (64-bits) gcc 13.2.0
RISC-V (64-bits) gcc 8.2.0
RISC-V (64-bits) gcc 8.5.0
RISC-V (64-bits) gcc 9.4.0
RISC-V rv32gc clang (trunk)
RISC-V rv32gc clang 10.0.0
RISC-V rv32gc clang 10.0.1
RISC-V rv32gc clang 11.0.0
RISC-V rv32gc clang 11.0.1
RISC-V rv32gc clang 12.0.0
RISC-V rv32gc clang 12.0.1
RISC-V rv32gc clang 13.0.0
RISC-V rv32gc clang 13.0.1
RISC-V rv32gc clang 14.0.0
RISC-V rv32gc clang 15.0.0
RISC-V rv32gc clang 16.0.0
RISC-V rv32gc clang 17.0.1
RISC-V rv32gc clang 18.1.0
RISC-V rv32gc clang 9.0.0
RISC-V rv32gc clang 9.0.1
RISC-V rv64gc clang (trunk)
RISC-V rv64gc clang 10.0.0
RISC-V rv64gc clang 10.0.1
RISC-V rv64gc clang 11.0.0
RISC-V rv64gc clang 11.0.1
RISC-V rv64gc clang 12.0.0
RISC-V rv64gc clang 12.0.1
RISC-V rv64gc clang 13.0.0
RISC-V rv64gc clang 13.0.1
RISC-V rv64gc clang 14.0.0
RISC-V rv64gc clang 15.0.0
RISC-V rv64gc clang 16.0.0
RISC-V rv64gc clang 17.0.1
RISC-V rv64gc clang 18.1.0
RISC-V rv64gc clang 9.0.0
RISC-V rv64gc clang 9.0.1
Raspbian Buster
Raspbian Stretch
SPARC LEON gcc 12.2.0
SPARC LEON gcc 12.3.0
SPARC LEON gcc 13.1.0
SPARC LEON gcc 13.2.0
SPARC gcc 12.2.0
SPARC gcc 12.3.0
SPARC gcc 13.1.0
SPARC gcc 13.2.0
SPARC64 gcc 12.2.0
SPARC64 gcc 12.3.0
SPARC64 gcc 13.1.0
SPARC64 gcc 13.2.0
TI C6x gcc 12.2.0
TI C6x gcc 12.3.0
TI C6x gcc 13.1.0
TI C6x gcc 13.2.0
TI CL430 21.6.1
VAX gcc NetBSDELF 10.4.0
VAX gcc NetBSDELF 10.5.0 (Nov 15 03:50:22 2023)
WebAssembly clang (trunk)
Xtensa ESP32 gcc 11.2.0 (2022r1)
Xtensa ESP32 gcc 12.2.0 (20230208)
Xtensa ESP32 gcc 8.2.0 (2019r2)
Xtensa ESP32 gcc 8.2.0 (2020r1)
Xtensa ESP32 gcc 8.2.0 (2020r2)
Xtensa ESP32 gcc 8.4.0 (2020r3)
Xtensa ESP32 gcc 8.4.0 (2021r1)
Xtensa ESP32 gcc 8.4.0 (2021r2)
Xtensa ESP32-S2 gcc 11.2.0 (2022r1)
Xtensa ESP32-S2 gcc 12.2.0 (20230208)
Xtensa ESP32-S2 gcc 8.2.0 (2019r2)
Xtensa ESP32-S2 gcc 8.2.0 (2020r1)
Xtensa ESP32-S2 gcc 8.2.0 (2020r2)
Xtensa ESP32-S2 gcc 8.4.0 (2020r3)
Xtensa ESP32-S2 gcc 8.4.0 (2021r1)
Xtensa ESP32-S2 gcc 8.4.0 (2021r2)
Xtensa ESP32-S3 gcc 11.2.0 (2022r1)
Xtensa ESP32-S3 gcc 12.2.0 (20230208)
Xtensa ESP32-S3 gcc 8.4.0 (2020r3)
Xtensa ESP32-S3 gcc 8.4.0 (2021r1)
Xtensa ESP32-S3 gcc 8.4.0 (2021r2)
arm64 msvc v19.28 VS16.9
arm64 msvc v19.29 VS16.10
arm64 msvc v19.29 VS16.11
arm64 msvc v19.30
arm64 msvc v19.31
arm64 msvc v19.32
arm64 msvc v19.33
arm64 msvc v19.34
arm64 msvc v19.35
arm64 msvc v19.36
arm64 msvc v19.37
arm64 msvc v19.38
arm64 msvc v19.latest
armv7-a clang (trunk)
armv7-a clang 10.0.0
armv7-a clang 10.0.1
armv7-a clang 11.0.0
armv7-a clang 11.0.1
armv7-a clang 9.0.0
armv7-a clang 9.0.1
armv8-a clang (all architectural features, trunk)
armv8-a clang (trunk)
armv8-a clang 10.0.0
armv8-a clang 10.0.1
armv8-a clang 11.0.0
armv8-a clang 11.0.1
armv8-a clang 12.0.0
armv8-a clang 13.0.0
armv8-a clang 14.0.0
armv8-a clang 15.0.0
armv8-a clang 16.0.0
armv8-a clang 17.0.1
armv8-a clang 18.1.0
armv8-a clang 9.0.0
armv8-a clang 9.0.1
ellcc 0.1.33
ellcc 0.1.34
ellcc 2017-07-16
hexagon-clang 16.0.5
llvm-mos atari2600-3e
llvm-mos atari2600-4k
llvm-mos atari2600-common
llvm-mos atari5200-supercart
llvm-mos atari8-cart-megacart
llvm-mos atari8-cart-std
llvm-mos atari8-cart-xegs
llvm-mos atari8-common
llvm-mos atari8-dos
llvm-mos c128
llvm-mos c64
llvm-mos commodore
llvm-mos cpm65
llvm-mos cx16
llvm-mos dodo
llvm-mos eater
llvm-mos mega65
llvm-mos nes
llvm-mos nes-action53
llvm-mos nes-cnrom
llvm-mos nes-gtrom
llvm-mos nes-mmc1
llvm-mos nes-mmc3
llvm-mos nes-nrom
llvm-mos nes-unrom
llvm-mos nes-unrom-512
llvm-mos osi-c1p
llvm-mos pce
llvm-mos pce-cd
llvm-mos pce-common
llvm-mos pet
llvm-mos rp6502
llvm-mos rpc8e
llvm-mos supervision
llvm-mos vic20
loongarch64 gcc 12.2.0
loongarch64 gcc 12.3.0
loongarch64 gcc 13.1.0
loongarch64 gcc 13.2.0
mips clang 13.0.0
mips clang 14.0.0
mips clang 15.0.0
mips clang 16.0.0
mips clang 17.0.1
mips clang 18.1.0
mips gcc 11.2.0
mips gcc 12.1.0
mips gcc 12.2.0
mips gcc 12.3.0
mips gcc 13.1.0
mips gcc 13.2.0
mips gcc 4.9.4
mips gcc 5.4
mips gcc 5.5.0
mips gcc 9.3.0 (codescape)
mips gcc 9.5.0
mips64 (el) gcc 12.1.0
mips64 (el) gcc 12.2.0
mips64 (el) gcc 12.3.0
mips64 (el) gcc 13.1.0
mips64 (el) gcc 13.2.0
mips64 (el) gcc 4.9.4
mips64 (el) gcc 5.4.0
mips64 (el) gcc 5.5.0
mips64 (el) gcc 9.5.0
mips64 clang 13.0.0
mips64 clang 14.0.0
mips64 clang 15.0.0
mips64 clang 16.0.0
mips64 clang 17.0.1
mips64 clang 18.1.0
mips64 gcc 11.2.0
mips64 gcc 12.1.0
mips64 gcc 12.2.0
mips64 gcc 12.3.0
mips64 gcc 13.1.0
mips64 gcc 13.2.0
mips64 gcc 4.9.4
mips64 gcc 5.4.0
mips64 gcc 5.5.0
mips64 gcc 9.5.0
mips64el clang 13.0.0
mips64el clang 14.0.0
mips64el clang 15.0.0
mips64el clang 16.0.0
mips64el clang 17.0.1
mips64el clang 18.1.0
mipsel clang 13.0.0
mipsel clang 14.0.0
mipsel clang 15.0.0
mipsel clang 16.0.0
mipsel clang 17.0.1
mipsel clang 18.1.0
mipsel gcc 12.1.0
mipsel gcc 12.2.0
mipsel gcc 12.3.0
mipsel gcc 13.1.0
mipsel gcc 13.2.0
mipsel gcc 4.9.4
mipsel gcc 5.4.0
mipsel gcc 5.5.0
mipsel gcc 9.5.0
nanoMIPS gcc 6.3.0 (mtk)
power gcc 11.2.0
power gcc 12.1.0
power gcc 12.2.0
power gcc 12.3.0
power gcc 13.1.0
power gcc 13.2.0
power gcc 4.8.5
power64 AT12.0 (gcc8)
power64 AT13.0 (gcc9)
power64 gcc 11.2.0
power64 gcc 12.1.0
power64 gcc 12.2.0
power64 gcc 12.3.0
power64 gcc 13.1.0
power64 gcc 13.2.0
power64 gcc trunk
power64le AT12.0 (gcc8)
power64le AT13.0 (gcc9)
power64le clang (trunk)
power64le gcc 11.2.0
power64le gcc 12.1.0
power64le gcc 12.2.0
power64le gcc 12.3.0
power64le gcc 13.1.0
power64le gcc 13.2.0
power64le gcc 6.3.0
power64le gcc trunk
powerpc64 clang (trunk)
s390x gcc 11.2.0
s390x gcc 12.1.0
s390x gcc 12.2.0
s390x gcc 12.3.0
s390x gcc 13.1.0
s390x gcc 13.2.0
sh gcc 12.2.0
sh gcc 12.3.0
sh gcc 13.1.0
sh gcc 13.2.0
sh gcc 4.9.4
sh gcc 9.5.0
vast (trunk)
x64 msvc v19.0 (WINE)
x64 msvc v19.10 (WINE)
x64 msvc v19.14
x64 msvc v19.14 (WINE)
x64 msvc v19.15
x64 msvc v19.16
x64 msvc v19.20
x64 msvc v19.21
x64 msvc v19.22
x64 msvc v19.23
x64 msvc v19.24
x64 msvc v19.25
x64 msvc v19.26
x64 msvc v19.27
x64 msvc v19.28
x64 msvc v19.28 VS16.9
x64 msvc v19.29 VS16.10
x64 msvc v19.29 VS16.11
x64 msvc v19.30
x64 msvc v19.31
x64 msvc v19.32
x64 msvc v19.33
x64 msvc v19.34
x64 msvc v19.35
x64 msvc v19.36
x64 msvc v19.37
x64 msvc v19.38
x64 msvc v19.latest
x86 djgpp 4.9.4
x86 djgpp 5.5.0
x86 djgpp 6.4.0
x86 djgpp 7.2.0
x86 msvc v19.0 (WINE)
x86 msvc v19.10 (WINE)
x86 msvc v19.14
x86 msvc v19.14 (WINE)
x86 msvc v19.15
x86 msvc v19.16
x86 msvc v19.20
x86 msvc v19.21
x86 msvc v19.22
x86 msvc v19.23
x86 msvc v19.24
x86 msvc v19.25
x86 msvc v19.26
x86 msvc v19.27
x86 msvc v19.28
x86 msvc v19.28 VS16.9
x86 msvc v19.29 VS16.10
x86 msvc v19.29 VS16.11
x86 msvc v19.30
x86 msvc v19.31
x86 msvc v19.32
x86 msvc v19.33
x86 msvc v19.34
x86 msvc v19.35
x86 msvc v19.36
x86 msvc v19.37
x86 msvc v19.38
x86 msvc v19.latest
x86 nvc++ 22.11
x86 nvc++ 22.7
x86 nvc++ 22.9
x86 nvc++ 23.1
x86 nvc++ 23.11
x86 nvc++ 23.3
x86 nvc++ 23.5
x86 nvc++ 23.7
x86 nvc++ 23.9
x86 nvc++ 24.1
x86 nvc++ 24.3
x86-64 Zapcc 190308
x86-64 clang (amd-stg-open)
x86-64 clang (assertions trunk)
x86-64 clang (clangir)
x86-64 clang (experimental -Wlifetime)
x86-64 clang (experimental P1061)
x86-64 clang (experimental P1144)
x86-64 clang (experimental P1221)
x86-64 clang (experimental P2996)
x86-64 clang (experimental metaprogramming - P2632)
x86-64 clang (experimental pattern matching)
x86-64 clang (old concepts branch)
x86-64 clang (reflection)
x86-64 clang (resugar)
x86-64 clang (thephd.dev)
x86-64 clang (trunk)
x86-64 clang (variadic friends - P2893)
x86-64 clang (widberg)
x86-64 clang 10.0.0
x86-64 clang 10.0.0 (assertions)
x86-64 clang 10.0.1
x86-64 clang 11.0.0
x86-64 clang 11.0.0 (assertions)
x86-64 clang 11.0.1
x86-64 clang 12.0.0
x86-64 clang 12.0.0 (assertions)
x86-64 clang 12.0.1
x86-64 clang 13.0.0
x86-64 clang 13.0.0 (assertions)
x86-64 clang 13.0.1
x86-64 clang 14.0.0
x86-64 clang 14.0.0 (assertions)
x86-64 clang 15.0.0
x86-64 clang 15.0.0 (assertions)
x86-64 clang 16.0.0
x86-64 clang 16.0.0 (assertions)
x86-64 clang 17.0.1
x86-64 clang 17.0.1 (assertions)
x86-64 clang 18.1.0
x86-64 clang 18.1.0 (assertions)
x86-64 clang 2.6.0 (assertions)
x86-64 clang 2.7.0 (assertions)
x86-64 clang 2.8.0 (assertions)
x86-64 clang 2.9.0 (assertions)
x86-64 clang 3.0.0
x86-64 clang 3.0.0 (assertions)
x86-64 clang 3.1
x86-64 clang 3.1 (assertions)
x86-64 clang 3.2
x86-64 clang 3.2 (assertions)
x86-64 clang 3.3
x86-64 clang 3.3 (assertions)
x86-64 clang 3.4 (assertions)
x86-64 clang 3.4.1
x86-64 clang 3.5
x86-64 clang 3.5 (assertions)
x86-64 clang 3.5.1
x86-64 clang 3.5.2
x86-64 clang 3.6
x86-64 clang 3.6 (assertions)
x86-64 clang 3.7
x86-64 clang 3.7 (assertions)
x86-64 clang 3.7.1
x86-64 clang 3.8
x86-64 clang 3.8 (assertions)
x86-64 clang 3.8.1
x86-64 clang 3.9.0
x86-64 clang 3.9.0 (assertions)
x86-64 clang 3.9.1
x86-64 clang 4.0.0
x86-64 clang 4.0.0 (assertions)
x86-64 clang 4.0.1
x86-64 clang 5.0.0
x86-64 clang 5.0.0 (assertions)
x86-64 clang 5.0.1
x86-64 clang 5.0.2
x86-64 clang 6.0.0
x86-64 clang 6.0.0 (assertions)
x86-64 clang 6.0.1
x86-64 clang 7.0.0
x86-64 clang 7.0.0 (assertions)
x86-64 clang 7.0.1
x86-64 clang 7.1.0
x86-64 clang 8.0.0
x86-64 clang 8.0.0 (assertions)
x86-64 clang 8.0.1
x86-64 clang 9.0.0
x86-64 clang 9.0.0 (assertions)
x86-64 clang 9.0.1
x86-64 clang rocm-4.5.2
x86-64 clang rocm-5.0.2
x86-64 clang rocm-5.1.3
x86-64 clang rocm-5.2.3
x86-64 clang rocm-5.3.3
x86-64 clang rocm-5.7.0
x86-64 gcc (contract labels)
x86-64 gcc (contracts natural syntax)
x86-64 gcc (contracts)
x86-64 gcc (coroutines)
x86-64 gcc (modules)
x86-64 gcc (trunk)
x86-64 gcc 10.1
x86-64 gcc 10.2
x86-64 gcc 10.3
x86-64 gcc 10.4
x86-64 gcc 10.5
x86-64 gcc 11.1
x86-64 gcc 11.2
x86-64 gcc 11.3
x86-64 gcc 11.4
x86-64 gcc 12.1
x86-64 gcc 12.2
x86-64 gcc 12.3
x86-64 gcc 13.1
x86-64 gcc 13.2
x86-64 gcc 4.1.2
x86-64 gcc 4.4.7
x86-64 gcc 4.5.3
x86-64 gcc 4.6.4
x86-64 gcc 4.7.1
x86-64 gcc 4.7.2
x86-64 gcc 4.7.3
x86-64 gcc 4.7.4
x86-64 gcc 4.8.1
x86-64 gcc 4.8.2
x86-64 gcc 4.8.3
x86-64 gcc 4.8.4
x86-64 gcc 4.8.5
x86-64 gcc 4.9.0
x86-64 gcc 4.9.1
x86-64 gcc 4.9.2
x86-64 gcc 4.9.3
x86-64 gcc 4.9.4
x86-64 gcc 5.1
x86-64 gcc 5.2
x86-64 gcc 5.3
x86-64 gcc 5.4
x86-64 gcc 5.5
x86-64 gcc 6.1
x86-64 gcc 6.2
x86-64 gcc 6.3
x86-64 gcc 6.4
x86-64 gcc 7.1
x86-64 gcc 7.2
x86-64 gcc 7.3
x86-64 gcc 7.4
x86-64 gcc 7.5
x86-64 gcc 8.1
x86-64 gcc 8.2
x86-64 gcc 8.3
x86-64 gcc 8.4
x86-64 gcc 8.5
x86-64 gcc 9.1
x86-64 gcc 9.2
x86-64 gcc 9.3
x86-64 gcc 9.4
x86-64 gcc 9.5
x86-64 icc 13.0.1
x86-64 icc 16.0.3
x86-64 icc 17.0.0
x86-64 icc 18.0.0
x86-64 icc 19.0.0
x86-64 icc 19.0.1
x86-64 icc 2021.1.2
x86-64 icc 2021.10.0
x86-64 icc 2021.2.0
x86-64 icc 2021.3.0
x86-64 icc 2021.4.0
x86-64 icc 2021.5.0
x86-64 icc 2021.6.0
x86-64 icc 2021.7.0
x86-64 icc 2021.7.1
x86-64 icc 2021.8.0
x86-64 icc 2021.9.0
x86-64 icx (latest)
x86-64 icx 2021.1.2
x86-64 icx 2021.2.0
x86-64 icx 2021.3.0
x86-64 icx 2021.4.0
x86-64 icx 2022.0.0
x86-64 icx 2022.1.0
x86-64 icx 2022.2.0
x86-64 icx 2022.2.1
x86-64 icx 2023.0.0
x86-64 icx 2023.1.0
x86-64 icx 2023.2.1
x86-64 icx 2024.0.0
zig c++ 0.10.0
zig c++ 0.11.0
zig c++ 0.12.0
zig c++ 0.6.0
zig c++ 0.7.0
zig c++ 0.7.1
zig c++ 0.8.0
zig c++ 0.9.0
zig c++ trunk
Options
Source code
/* mbed Microcontroller Library * Copyright (c) 2018-2018 ARM Limited * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ #ifndef MBED_PLATFORM_SPAN_H_ #define MBED_PLATFORM_SPAN_H_ #include <algorithm> #include <stddef.h> #include <stdint.h> #include <stdlib.h> #define MBED_ASSERT(C) do { if (C) { abort(); } } while(false) #define MBED_STATIC_ASSERT(C, M) static_assert(C, M) //#include "platform/mbed_assert.h" namespace mbed { /** * Special value for the Extent parameter of Span. * If the type use this value then the size of the array is stored in the object * at runtime. */ #define SPAN_DYNAMIC_EXTENT -1 /** * View to an array. * * Spans encapsulate the pointer to an array and its size into a single object. * However, it does not manage the lifetime of the array viewed. You can use * instances of Span to replace the traditional pair of pointer and size * arguments in function calls. * * You can use the size member function to query the number of elements present * in the array, and the subscript operator allow code using this object to * access the content of the array viewed. * * Subspans can be created with the help of the functions first(), last() and * subspan(). * * @note You can create Span instances with the help of the function template * make_Span() and make_const_Span(). * * @note Span<T, Extent> objects can be implicitly converted to Span<T> objects * where required. * * @tparam ElementType type of objects held in the array viewed. * * @tparam Extent The size of the array viewed. The default value * SPAN_DYNAMIC_SIZE is special as it allows construction of Span objects of * any size (set at runtime). */ template<typename ElementType, ptrdiff_t Extent = SPAN_DYNAMIC_EXTENT> struct Span { /** * Type of the element contained */ typedef ElementType element_type; /** * Type of the index. */ typedef ptrdiff_t index_type; /** * Pointer to an ElementType */ typedef element_type *pointer; /** * Reference to an ElementType */ typedef element_type &reference; /** * Size of the Extent; -1 if dynamic. */ static const index_type extent = Extent; MBED_STATIC_ASSERT(Extent >= 0, "Invalid extent for a Span"); /** * Construct an empty span. * * @post a call to size() will return 0, and data() will return NULL. * * @note This function is not accessible if Extent != SPAN_DYNAMIC_EXTENT or * Extent != 0 . */ Span() : _data(NULL) { MBED_STATIC_ASSERT(Extent == 0, "Invalid extent for a Span"); } /** * Construct a Span from a pointer to a buffer and its size. * * @param ptr Pointer to the beginning of the data viewed. * * @param count Number of elements viewed. * * @pre [ptr, ptr + count) must be be a valid range. * @pre count must be equal to extent. * * @post a call to size() will return Extent and data() will return @p ptr. */ Span(pointer ptr, index_type count) : _data(ptr) { MBED_ASSERT(count == Extent); MBED_ASSERT(Extent == 0 || ptr != NULL); } /** * Construct a Span from the range [first, last) * * @param first Pointer to the beginning of the data viewed. * @param last End of the range (element after the last element). * * @pre [first, last) must be be a valid range. * @pre first <= last * @pre last - first must be equal to Extent. * * @post a call to size() will return Extent and data() will return @p first. */ Span(pointer first, pointer last) : _data(first) { MBED_ASSERT(first <= last); MBED_ASSERT((last - first) == Extent); MBED_ASSERT(Extent == 0 || first != NULL); } /** * Construct a Span from the reference to an array. * * @param elements Reference to the array viewed. * * @post a call to size() will return Extent, and data() will return a * pointer to elements. */ Span(element_type (&elements)[Extent]): _data(elements) { } /** * Return the size of the array viewed. * * @return The number of elements present in the array viewed. */ index_type size() const { return Extent; } /** * Return if the array is empty or not. * * @return true if the array is empty and false otherwise */ bool empty() const { return size() == 0; } /** * Returns a reference to the element at position @p index * * @param index Index of the element to access. * * @return A reference to the element at the index specified in input. * * @pre 0 <= index < Extent */ reference operator[](index_type index) const { return _data[index]; } /** * Return a pointer to the first element of the sequence or NULL if the span * is empty(). * * @return The pointer to the first element of the span. */ pointer data() const { return _data; } /** * Create a new span over the first @p Count elements of the existing view. * * @tparam Count The number of element viewed by the new Span * * @return A new Span over the first @p Count elements. * * @pre Count >= 0 && Count <= size(). */ template<ptrdiff_t Count> Span<element_type, Count> first() const { MBED_STATIC_ASSERT( (0 <= Count) && (Count <= Extent), "Invalid subspan extent" ); return Span<element_type, Count>(_data, Count); } /** * Create a new span over the last @p Count elements of the existing view. * * @tparam Count The number of element viewed by the new Span * * @return A new Span over the last @p Count elements. * * @pre Count >= 0 && Count <= size(). */ template<ptrdiff_t Count> Span<element_type, Count> last() const { MBED_STATIC_ASSERT( (0 <= Count) && (Count <= Extent), "Invalid subspan extent" ); return Span<element_type, Count>(_data + (Extent - Count), Count); } /** * Create a subspan that is a view other Count elements; the view starts at * element Offset. * * @tparam Offset The offset of the first element viewed by the subspan. * * @tparam Count The number of elements present in the subspan. If Count * is equal to SPAN_DYNAMIC_EXTENT then a span starting at offset and * containing the rest of the elements is returned. * * @return */ template<std::ptrdiff_t Offset, std::ptrdiff_t Count> Span<element_type, Count == SPAN_DYNAMIC_EXTENT ? Extent - Offset : Count> subspan() const { MBED_STATIC_ASSERT( 0 <= Offset && Offset <= Extent, "Invalid subspan offset" ); MBED_STATIC_ASSERT( (Count == SPAN_DYNAMIC_EXTENT) || (0 <= Count && (Count + Offset) <= Extent), "Invalid subspan count" ); return Span<element_type, Count == SPAN_DYNAMIC_EXTENT ? Extent - Offset : Count>( _data + Offset, Count == SPAN_DYNAMIC_EXTENT ? Extent - Offset : Count ); } /** * Create a new Span over the first @p count elements of the existing view. * * @param count The number of element viewed by the new Span * * @return A new Span over the first @p count elements. */ Span<element_type, SPAN_DYNAMIC_EXTENT> first(index_type count) const { MBED_ASSERT(0 <= count && count <= Extent); return Span<element_type, SPAN_DYNAMIC_EXTENT>(_data, count); } /** * Create a new span over the last @p count elements of the existing view. * * @param count The number of element viewed by the new Span * * @return A new Span over the last @p count elements. */ Span<element_type, SPAN_DYNAMIC_EXTENT> last(index_type count) const { MBED_ASSERT(0 <= count && count <= Extent); return Span<element_type, SPAN_DYNAMIC_EXTENT>( _data + (Extent - count), count ); } /** * Create a subspan that is a view other count elements; the view starts at * element offset. * * @param offset The offset of the first element viewed by the subspan. * * @param count The number of elements present in the subspan. If Count * is equal to SPAN_DYNAMIC_EXTENT then a span starting at offset and * containing the rest of the elements is returned. * * @return */ Span<element_type, SPAN_DYNAMIC_EXTENT> subspan( index_type offset, index_type count = SPAN_DYNAMIC_EXTENT ) const { MBED_ASSERT(0 <= offset && offset <= Extent); MBED_ASSERT( (count == SPAN_DYNAMIC_EXTENT) || (0 <= count && (count + offset) <= Extent) ); return Span<element_type, SPAN_DYNAMIC_EXTENT>( _data + offset, count == SPAN_DYNAMIC_EXTENT ? Extent - offset : count ); } private: pointer _data; }; /** * Span specialisation that handle dynamic array size. */ template<typename ElementType> struct Span<ElementType, SPAN_DYNAMIC_EXTENT> { /** * Type of the element contained */ typedef ElementType element_type; /** * Type of the index. */ typedef ptrdiff_t index_type; /** * Pointer to an ElementType */ typedef element_type *pointer; /** * Reference to an ElementType */ typedef element_type &reference; /** * Size of the Extent; -1 if dynamic. */ static const index_type extent = SPAN_DYNAMIC_EXTENT; /** * Construct an empty span. * * @post a call to size() will return 0, and data() will return NULL. * * @note This function is not accessible if Extent != SPAN_DYNAMIC_EXTENT or * Extent != 0 . */ Span() : _data(NULL), _size(0) { } /** * Construct a Span from a pointer to a buffer and its size. * * @param ptr Pointer to the beginning of the data viewed. * * @param count Number of elements viewed. * * @pre [ptr, ptr + count) must be be a valid range. * @pre count must be equal to extent. * * @post a call to size() will return count and data() will return @p ptr. */ Span(pointer ptr, index_type count) : _data(ptr), _size(count) { MBED_ASSERT(count >= 0); MBED_ASSERT(ptr != NULL || count == 0); } /** * Construct a Span from the range [first, last) * * @param first Pointer to the beginning of the data viewed. * @param last End of the range (element after the last element). * * @pre [first, last) must be be a valid range. * @pre first <= last * * @post a call to size() will return the result of (last - first) and * data() will return @p first. */ Span(pointer first, pointer last) : _data(first), _size(last - first) { MBED_ASSERT(first <= last); MBED_ASSERT(first != NULL || (last - first) == 0); } /** * Construct a Span from the reference to an array. * * @param elements Reference to the array viewed. * * @tparam Count Number of elements of T presents in the array. * * @post a call to size() will return Count, and data() will return a * pointer to elements. */ template<size_t Count> Span(element_type (&elements)[Count]): _data(elements), _size(Count) { } /** * Construct a Span object from another Span. * * @param other The Span object used to construct this. * * @note For span with a positive extent, this function is not accessible. */ template<ptrdiff_t OtherExtent> Span(const Span<element_type, OtherExtent> &other): _data(other.data()), _size(other.size()) { } /** * Return the size of the array viewed. * * @return The number of elements present in the array viewed. */ index_type size() const { return _size; } /** * Return if the array is empty or not. * * @return true if the array is empty and false otherwise */ bool empty() const { return size() == 0; } /** * Access to an element of the array. * * @param index Element index to access. * * @return A reference to the element at the index specified in input. * * @pre index shall be less than size(). */ reference operator[](index_type index) const { #ifdef MINIMAL_CHECK MBED_ASSERT(index < _size); #elif defined(FULL_CHECK) MBED_ASSERT(index <= 0 && index < _size); #else #endif return _data[index]; } /** * Get the raw pointer to the array. * * @return The raw pointer to the array. */ pointer data() const { return _data; } /** * Create a new span over the first @p Count elements of the existing view. * * @tparam Count The number of element viewed by the new Span * * @return A new Span over the first @p Count elements. * * @pre Count >= 0 && Count <= size(). */ template<ptrdiff_t Count> Span<element_type, Count> first() const { MBED_ASSERT((Count >= 0) && (Count <= _size)); return Span<element_type, Count>(_data, Count); } /** * Create a new span over the last @p Count elements of the existing view. * * @tparam Count The number of element viewed by the new Span * * @return A new Span over the last @p Count elements. * * @pre Count >= 0 && Count <= size(). */ template<ptrdiff_t Count> Span<element_type, Count> last() const { MBED_ASSERT((0 <= Count) && (Count <= _size)); return Span<element_type, Count>(_data + (_size - Count), Count); } /** * Create a subspan that is a view other Count elements; the view starts at * element Offset. * * @tparam Offset The offset of the first element viewed by the subspan. * * @tparam Count The number of elements present in the subspan. If Count * is equal to SPAN_DYNAMIC_EXTENT then a span starting at offset and * containing the rest of the elements is returned. * * @return */ template<std::ptrdiff_t Offset, std::ptrdiff_t Count> Span<element_type, Count == SPAN_DYNAMIC_EXTENT ? SPAN_DYNAMIC_EXTENT : Count> subspan() const { MBED_ASSERT(0 <= Offset && Offset <= _size); MBED_ASSERT( (Count == SPAN_DYNAMIC_EXTENT) || (0 <= Count && (Count + Offset) <= _size) ); return Span<element_type, Count == SPAN_DYNAMIC_EXTENT ? SPAN_DYNAMIC_EXTENT : Count>( _data + Offset, Count == SPAN_DYNAMIC_EXTENT ? _size - Offset : Count ); } /** * Create a new Span over the first @p count elements of the existing view. * * @param count The number of element viewed by the new Span * * @return A new Span over the first @p count elements. */ Span<element_type, SPAN_DYNAMIC_EXTENT> first(index_type count) const { MBED_ASSERT(0 <= count && count <= _size); return Span<element_type, SPAN_DYNAMIC_EXTENT>(_data, count); } /** * Create a new span over the last @p count elements of the existing view. * * @param count The number of element viewed by the new Span * * @return A new Span over the last @p count elements. */ Span<element_type, SPAN_DYNAMIC_EXTENT> last(index_type count) const { MBED_ASSERT(0 <= count && count <= _size); return Span<element_type, SPAN_DYNAMIC_EXTENT>( _data + (_size - count), count ); } /** * Create a subspan that is a view other count elements; the view starts at * element offset. * * @param offset The offset of the first element viewed by the subspan. * * @param count The number of elements present in the subspan. If Count * is equal to SPAN_DYNAMIC_EXTENT then a span starting at offset and * containing the rest of the elements is returned. * * @return */ Span<element_type, SPAN_DYNAMIC_EXTENT> subspan( index_type offset, index_type count = SPAN_DYNAMIC_EXTENT ) const { MBED_ASSERT(0 <= offset && offset <= _size); MBED_ASSERT( (count == SPAN_DYNAMIC_EXTENT) || (0 <= count && (count + offset) <= _size) ); return Span<element_type, SPAN_DYNAMIC_EXTENT>( _data + offset, count == SPAN_DYNAMIC_EXTENT ? _size - offset : count ); } private: pointer _data; index_type _size; }; /** * Equality operator between two Span objects. * * @param lhs Left hand side of the binary operation. * @param rhs Right hand side of the binary operation. * * @return True if arrays in input have the same size and the same content * and false otherwise. */ template<typename T, typename U, ptrdiff_t LhsExtent, ptrdiff_t RhsExtent> bool operator==(const Span<T, LhsExtent> &lhs, const Span<U, RhsExtent> &rhs) { if (lhs.size() != rhs.size()) { return false; } if (lhs.data() == rhs.data()) { return true; } return std::equal(lhs.data(), lhs.data() + lhs.size(), rhs.data()); } /** * Equality operation between a span and a reference to a C++ array. * * @param lhs Left hand side of the binary operation. * @param rhs Right hand side of the binary operation. * * @return True if arrays in input have the same size and the same content * and false otherwise. */ template<typename T, ptrdiff_t LhsExtent, ptrdiff_t RhsExtent> bool operator==(const Span<T, LhsExtent> &lhs, T (&rhs)[RhsExtent]) { return lhs == Span<T>(rhs); } /** * Equality operation between a span and a reference to a C++ array. * * @param lhs Left hand side of the binary operation. * @param rhs Right hand side of the binary operation. * * @return True if arrays in input have the same size and the same content * and false otherwise. */ template<typename T, ptrdiff_t LhsExtent, ptrdiff_t RhsExtent> bool operator==(T (&lhs)[LhsExtent], const Span<T, RhsExtent> &rhs) { return Span<T>(lhs) == rhs; } /** * Not equal operator * * @param lhs Left hand side of the binary operation. * @param rhs Right hand side of the binary operation. * * @return True if arrays in input do not have the same size or the same * content and false otherwise. */ template<typename T, typename U, ptrdiff_t LhsExtent, ptrdiff_t RhsExtent> bool operator!=(const Span<T, LhsExtent> &lhs, const Span<U, RhsExtent> &rhs) { return !(lhs == rhs); } /** * Not Equal operation between a span and a reference to a C++ array. * * @param lhs Left hand side of the binary operation. * @param rhs Right hand side of the binary operation. * * @return True if arrays in input have the same size and the same content * and false otherwise. */ template<typename T, ptrdiff_t LhsExtent, ptrdiff_t RhsExtent> bool operator!=(const Span<T, LhsExtent> &lhs, T (&rhs)[RhsExtent]) { return !(lhs == Span<T, RhsExtent>(rhs)); } /** * Not Equal operation between a span and a reference to a C++ array. * * @param lhs Left hand side of the binary operation. * @param rhs Right hand side of the binary operation. * * @return True if arrays in input have the same size and the same content * and false otherwise. */ template<typename T, ptrdiff_t LhsExtent, ptrdiff_t RhsExtent> bool operator!=(T (&lhs)[LhsExtent], const Span<T, RhsExtent> &rhs) { return !(Span<T, LhsExtent>(lhs) == rhs); } /** * Generate a Span from a reference to a C/C++ array. * * @tparam T Type of elements held in elements. * @tparam Extent Number of items held in elements. * * @param elements The reference to the array viewed. * * @return The Span to elements. * * @note This helper avoids the typing of template parameter when Span is * created 'inline'. */ template<typename T, size_t Size> Span<T, Size> make_Span(T (&elements)[Size]) { return Span<T, Size>(elements); } /** * Generate a Span from a pointer to a C/C++ array. * * @tparam Extent Number of items held in elements. * @tparam T Type of elements held in elements. * * @param elements The reference to the array viewed. * * @return The Span to elements. * * @note This helper avoids the typing of template parameter when Span is * created 'inline'. */ template<ptrdiff_t Extent, typename T> Span<T, Extent> make_Span(T *elements) { return Span<T, Extent>(elements, Extent); } /** * Generate a Span from a C/C++ pointer and the size of the array. * * @tparam T Type of elements held in array_ptr. * * @param array_ptr The pointer to the array to viewed. * @param array_size The number of T elements in the array. * * @return The Span to array_ptr with a size of array_size. * * @note This helper avoids the typing of template parameter when Span is * created 'inline'. */ template<typename T> Span<T> make_Span(T *array_ptr, ptrdiff_t array_size) { return Span<T>(array_ptr, array_size); } /** * Generate a Span to a const content from a reference to a C/C++ array. * * @tparam T Type of elements held in elements. * @tparam Extent Number of items held in elements. * * @param elements The array viewed. * @return The Span to elements. * * @note This helper avoids the typing of template parameter when Span is * created 'inline'. */ template<typename T, size_t Extent> Span<const T, Extent> make_const_Span(const T (&elements)[Extent]) { return Span<const T, Extent>(elements); } /** * Generate a Span to a const content from a pointer to a C/C++ array. * * @tparam Extent Number of items held in elements. * @tparam T Type of elements held in elements. * * @param elements The reference to the array viewed. * * @return The Span to elements. * * @note This helper avoids the typing of template parameter when Span is * created 'inline'. */ template<size_t Extent, typename T> Span<const T, Extent> make_const_Span(const T *elements) { return Span<const T, Extent>(elements, Extent); } /** * Generate a Span to a const content from a C/C++ pointer and the size of the * array. * * @tparam T Type of elements held in array_ptr. * * @param array_ptr The pointer to the array to viewed. * @param array_size The number of T elements in the array. * * @return The Span to array_ptr with a size of array_size. * * @note This helper avoids the typing of template parameter when Span is * created 'inline'. */ template<typename T> Span<const T> make_const_Span(T *array_ptr, size_t array_size) { return Span<const T>(array_ptr, array_size); } } // namespace mbed #endif /* MBED_PLATFORM_SPAN_H_ */ size_t sum(const mbed::Span<uint8_t>& values) { size_t result = 0; for (size_t i = 0; i < values.size(); ++i) { result += values[i]; } return result; }
Become a Patron
Sponsor on GitHub
Donate via PayPal
Source on GitHub
Mailing list
Installed libraries
Wiki
Report an issue
How it works
Contact the author
CE on Mastodon
About the author
Statistics
Changelog
Version tree