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
WASM
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 12.4.0
ARM GCC 13.1.0
ARM GCC 13.2.0
ARM GCC 13.2.0 (unknown-eabi)
ARM GCC 13.3.0
ARM GCC 13.3.0 (unknown-eabi)
ARM GCC 14.1.0
ARM GCC 14.1.0 (unknown-eabi)
ARM GCC 14.2.0
ARM GCC 14.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 12.4.0
ARM64 gcc 13.1.0
ARM64 gcc 13.2.0
ARM64 gcc 13.3.0
ARM64 gcc 14.1.0
ARM64 gcc 14.2.0
ARM64 gcc 4.9.4
ARM64 gcc 5.4
ARM64 gcc 5.5.0
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 12.4.0
AVR gcc 13.1.0
AVR gcc 13.2.0
AVR gcc 13.3.0
AVR gcc 14.1.0
AVR gcc 14.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 clang 19.1.0
BPF gcc 13.1.0
BPF gcc 13.2.0
BPF gcc 13.3.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
HPPA gcc 14.2.0
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)
KVX ACB 5.0.0 (GCC 12.2.1)
LoongArch64 clang (trunk)
LoongArch64 clang 17.0.1
LoongArch64 clang 18.1.0
LoongArch64 clang 19.1.0
M68K gcc 13.1.0
M68K gcc 13.2.0
M68K gcc 13.3.0
M68K gcc 14.1.0
M68K gcc 14.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 12.4.0
RISC-V (32-bits) gcc 13.1.0
RISC-V (32-bits) gcc 13.2.0
RISC-V (32-bits) gcc 13.3.0
RISC-V (32-bits) gcc 14.1.0
RISC-V (32-bits) gcc 14.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 12.4.0
RISC-V (64-bits) gcc 13.1.0
RISC-V (64-bits) gcc 13.2.0
RISC-V (64-bits) gcc 13.3.0
RISC-V (64-bits) gcc 14.1.0
RISC-V (64-bits) gcc 14.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 19.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 19.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 12.4.0
SPARC LEON gcc 13.1.0
SPARC LEON gcc 13.2.0
SPARC LEON gcc 13.3.0
SPARC LEON gcc 14.1.0
SPARC LEON gcc 14.2.0
SPARC gcc 12.2.0
SPARC gcc 12.3.0
SPARC gcc 12.4.0
SPARC gcc 13.1.0
SPARC gcc 13.2.0
SPARC gcc 13.3.0
SPARC gcc 14.1.0
SPARC gcc 14.2.0
SPARC64 gcc 12.2.0
SPARC64 gcc 12.3.0
SPARC64 gcc 12.4.0
SPARC64 gcc 13.1.0
SPARC64 gcc 13.2.0
SPARC64 gcc 13.3.0
SPARC64 gcc 14.1.0
SPARC64 gcc 14.2.0
TI C6x gcc 12.2.0
TI C6x gcc 12.3.0
TI C6x gcc 12.4.0
TI C6x gcc 13.1.0
TI C6x gcc 13.2.0
TI C6x gcc 13.3.0
TI C6x gcc 14.1.0
TI C6x gcc 14.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.20 VS16.0
arm64 msvc v19.21 VS16.1
arm64 msvc v19.22 VS16.2
arm64 msvc v19.23 VS16.3
arm64 msvc v19.24 VS16.4
arm64 msvc v19.25 VS16.5
arm64 msvc v19.27 VS16.7
arm64 msvc v19.28 VS16.8
arm64 msvc v19.28 VS16.9
arm64 msvc v19.29 VS16.10
arm64 msvc v19.29 VS16.11
arm64 msvc v19.30 VS17.0
arm64 msvc v19.31 VS17.1
arm64 msvc v19.32 VS17.2
arm64 msvc v19.33 VS17.3
arm64 msvc v19.34 VS17.4
arm64 msvc v19.35 VS17.5
arm64 msvc v19.36 VS17.6
arm64 msvc v19.37 VS17.7
arm64 msvc v19.38 VS17.8
arm64 msvc v19.39 VS17.9
arm64 msvc v19.40 VS17.10
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 12.0.0
armv7-a clang 12.0.1
armv7-a clang 13.0.0
armv7-a clang 13.0.1
armv7-a clang 14.0.0
armv7-a clang 15.0.0
armv7-a clang 16.0.0
armv7-a clang 17.0.1
armv7-a clang 18.1.0
armv7-a clang 19.1.0
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 19.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 12.4.0
loongarch64 gcc 13.1.0
loongarch64 gcc 13.2.0
loongarch64 gcc 13.3.0
loongarch64 gcc 14.1.0
loongarch64 gcc 14.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 clang 19.1.0
mips gcc 11.2.0
mips gcc 12.1.0
mips gcc 12.2.0
mips gcc 12.3.0
mips gcc 12.4.0
mips gcc 13.1.0
mips gcc 13.2.0
mips gcc 13.3.0
mips gcc 14.1.0
mips gcc 14.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 12.4.0
mips64 (el) gcc 13.1.0
mips64 (el) gcc 13.2.0
mips64 (el) gcc 13.3.0
mips64 (el) gcc 14.1.0
mips64 (el) gcc 14.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 clang 19.1.0
mips64 gcc 11.2.0
mips64 gcc 12.1.0
mips64 gcc 12.2.0
mips64 gcc 12.3.0
mips64 gcc 12.4.0
mips64 gcc 13.1.0
mips64 gcc 13.2.0
mips64 gcc 13.3.0
mips64 gcc 14.1.0
mips64 gcc 14.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
mips64el clang 19.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 clang 19.1.0
mipsel gcc 12.1.0
mipsel gcc 12.2.0
mipsel gcc 12.3.0
mipsel gcc 12.4.0
mipsel gcc 13.1.0
mipsel gcc 13.2.0
mipsel gcc 13.3.0
mipsel gcc 14.1.0
mipsel gcc 14.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 12.4.0
power gcc 13.1.0
power gcc 13.2.0
power gcc 13.3.0
power gcc 14.1.0
power gcc 14.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 12.4.0
power64 gcc 13.1.0
power64 gcc 13.2.0
power64 gcc 13.3.0
power64 gcc 14.1.0
power64 gcc 14.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 12.4.0
power64le gcc 13.1.0
power64le gcc 13.2.0
power64le gcc 13.3.0
power64le gcc 14.1.0
power64le gcc 14.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 12.4.0
s390x gcc 13.1.0
s390x gcc 13.2.0
s390x gcc 13.3.0
s390x gcc 14.1.0
s390x gcc 14.2.0
sh gcc 12.2.0
sh gcc 12.3.0
sh gcc 12.4.0
sh gcc 13.1.0
sh gcc 13.2.0
sh gcc 13.3.0
sh gcc 14.1.0
sh gcc 14.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 (WINE)
x64 msvc v19.20 VS16.0
x64 msvc v19.21 VS16.1
x64 msvc v19.22 VS16.2
x64 msvc v19.23 VS16.3
x64 msvc v19.24 VS16.4
x64 msvc v19.25 VS16.5
x64 msvc v19.27 VS16.7
x64 msvc v19.28 VS16.8
x64 msvc v19.28 VS16.9
x64 msvc v19.29 VS16.10
x64 msvc v19.29 VS16.11
x64 msvc v19.30 VS17.0
x64 msvc v19.31 VS17.1
x64 msvc v19.32 VS17.2
x64 msvc v19.33 VS17.3
x64 msvc v19.34 VS17.4
x64 msvc v19.35 VS17.5
x64 msvc v19.36 VS17.6
x64 msvc v19.37 VS17.7
x64 msvc v19.38 VS17.8
x64 msvc v19.39 VS17.9
x64 msvc v19.40 VS17.10
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 (WINE)
x86 msvc v19.20 VS16.0
x86 msvc v19.21 VS16.1
x86 msvc v19.22 VS16.2
x86 msvc v19.23 VS16.3
x86 msvc v19.24 VS16.4
x86 msvc v19.25 VS16.5
x86 msvc v19.27 VS16.7
x86 msvc v19.28 VS16.8
x86 msvc v19.28 VS16.9
x86 msvc v19.29 VS16.10
x86 msvc v19.29 VS16.11
x86 msvc v19.30 VS17.0
x86 msvc v19.31 VS17.1
x86 msvc v19.32 VS17.2
x86 msvc v19.33 VS17.3
x86 msvc v19.34 VS17.4
x86 msvc v19.35 VS17.5
x86 msvc v19.36 VS17.6
x86 msvc v19.37 VS17.7
x86 msvc v19.38 VS17.8
x86 msvc v19.39 VS17.9
x86 msvc v19.40 VS17.10
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 nvc++ 24.5
x86 nvc++ 24.7
x86-64 Zapcc 190308
x86-64 clang (EricWF contracts)
x86-64 clang (amd-staging)
x86-64 clang (assertions trunk)
x86-64 clang (clangir)
x86-64 clang (dascandy contracts)
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 P3068)
x86-64 clang (experimental P3309)
x86-64 clang (experimental P3367)
x86-64 clang (experimental P3372)
x86-64 clang (experimental metaprogramming - P2632)
x86-64 clang (old concepts branch)
x86-64 clang (p1974)
x86-64 clang (pattern matching - P2688)
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 19.1.0
x86-64 clang 19.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 clang rocm-6.0.2
x86-64 clang rocm-6.1.2
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 12.4
x86-64 gcc 13.1
x86-64 gcc 13.2
x86-64 gcc 13.3
x86-64 gcc 14.1
x86-64 gcc 14.2
x86-64 gcc 3.4.6
x86-64 gcc 4.0.4
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 6.5
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
x86-64 icx 2024.1.0
x86-64 icx 2024.2.0
zig c++ 0.10.0
zig c++ 0.11.0
zig c++ 0.12.0
zig c++ 0.12.1
zig c++ 0.13.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
# 1 "t.cc" # 1 "<command-line>" # 1 "t.cc" # 1 "eigen-3.3.7/Eigen/Geometry" 1 # 11 "eigen-3.3.7/Eigen/Geometry" # 1 "eigen-3.3.7/Eigen/Core" 1 # 15 "eigen-3.3.7/Eigen/Core" # 1 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" 1 # 49 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wshadow" #pragma GCC diagnostic ignored "-Wtype-limits" # 16 "eigen-3.3.7/Eigen/Core" 2 # 82 "eigen-3.3.7/Eigen/Core" # 1 "/usr/include/c++/4.7/new" 1 3 # 39 "/usr/include/c++/4.7/new" 3 # 40 "/usr/include/c++/4.7/new" 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++config.h" 1 3 # 171 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++config.h" 3 namespace std { typedef unsigned int size_t; typedef int ptrdiff_t; } # 414 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++config.h" 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/os_defines.h" 1 3 # 40 "/usr/include/c++/4.7/i686-linux-gnu/bits/os_defines.h" 3 # 1 "/usr/include/features.h" 1 3 4 # 324 "/usr/include/features.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/predefs.h" 1 3 4 # 325 "/usr/include/features.h" 2 3 4 # 357 "/usr/include/features.h" 3 4 # 1 "/usr/include/i386-linux-gnu/sys/cdefs.h" 1 3 4 # 378 "/usr/include/i386-linux-gnu/sys/cdefs.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/wordsize.h" 1 3 4 # 379 "/usr/include/i386-linux-gnu/sys/cdefs.h" 2 3 4 # 358 "/usr/include/features.h" 2 3 4 # 389 "/usr/include/features.h" 3 4 # 1 "/usr/include/i386-linux-gnu/gnu/stubs.h" 1 3 4 # 1 "/usr/include/i386-linux-gnu/bits/wordsize.h" 1 3 4 # 5 "/usr/include/i386-linux-gnu/gnu/stubs.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/gnu/stubs-32.h" 1 3 4 # 8 "/usr/include/i386-linux-gnu/gnu/stubs.h" 2 3 4 # 390 "/usr/include/features.h" 2 3 4 # 41 "/usr/include/c++/4.7/i686-linux-gnu/bits/os_defines.h" 2 3 # 415 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++config.h" 2 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/cpu_defines.h" 1 3 # 418 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++config.h" 2 3 # 42 "/usr/include/c++/4.7/new" 2 3 # 1 "/usr/include/c++/4.7/exception" 1 3 # 35 "/usr/include/c++/4.7/exception" 3 # 36 "/usr/include/c++/4.7/exception" 3 #pragma GCC visibility push(default) # 1 "/usr/include/c++/4.7/bits/atomic_lockfree_defines.h" 1 3 # 33 "/usr/include/c++/4.7/bits/atomic_lockfree_defines.h" 3 # 34 "/usr/include/c++/4.7/bits/atomic_lockfree_defines.h" 3 # 41 "/usr/include/c++/4.7/exception" 2 3 extern "C++" { namespace std { # 62 "/usr/include/c++/4.7/exception" 3 class exception { public: exception() throw() { } virtual ~exception() throw(); virtual const char* what() const throw(); }; class bad_exception : public exception { public: bad_exception() throw() { } virtual ~bad_exception() throw(); virtual const char* what() const throw(); }; typedef void (*terminate_handler) (); typedef void (*unexpected_handler) (); terminate_handler set_terminate(terminate_handler) throw(); void terminate() throw() __attribute__ ((__noreturn__)); unexpected_handler set_unexpected(unexpected_handler) throw(); void unexpected() __attribute__ ((__noreturn__)); # 119 "/usr/include/c++/4.7/exception" 3 bool uncaught_exception() throw() __attribute__ ((__pure__)); } namespace __gnu_cxx { # 144 "/usr/include/c++/4.7/exception" 3 void __verbose_terminate_handler(); } } #pragma GCC visibility pop # 43 "/usr/include/c++/4.7/new" 2 3 #pragma GCC visibility push(default) extern "C++" { namespace std { class bad_alloc : public exception { public: bad_alloc() throw() { } virtual ~bad_alloc() throw(); virtual const char* what() const throw(); }; struct nothrow_t { }; extern const nothrow_t nothrow; typedef void (*new_handler)(); new_handler set_new_handler(new_handler) throw(); } # 93 "/usr/include/c++/4.7/new" 3 void* operator new(std::size_t) throw(std::bad_alloc) __attribute__((__externally_visible__)); void* operator new[](std::size_t) throw(std::bad_alloc) __attribute__((__externally_visible__)); void operator delete(void*) throw() __attribute__((__externally_visible__)); void operator delete[](void*) throw() __attribute__((__externally_visible__)); void* operator new(std::size_t, const std::nothrow_t&) throw() __attribute__((__externally_visible__)); void* operator new[](std::size_t, const std::nothrow_t&) throw() __attribute__((__externally_visible__)); void operator delete(void*, const std::nothrow_t&) throw() __attribute__((__externally_visible__)); void operator delete[](void*, const std::nothrow_t&) throw() __attribute__((__externally_visible__)); inline void* operator new(std::size_t, void* __p) throw() { return __p; } inline void* operator new[](std::size_t, void* __p) throw() { return __p; } inline void operator delete (void*, void*) throw() { } inline void operator delete[](void*, void*) throw() { } } #pragma GCC visibility pop # 83 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/Macros.h" 1 # 544 "eigen-3.3.7/Eigen/src/Core/util/Macros.h" namespace Eigen { namespace internal { inline bool copy_bool(bool b) { return b; } } } # 613 "eigen-3.3.7/Eigen/src/Core/util/Macros.h" namespace Eigen { namespace internal { template<typename T> void ignore_unused_variable(const T&) {} } } # 89 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/complex" 1 3 # 41 "/usr/include/c++/4.7/complex" 3 # 42 "/usr/include/c++/4.7/complex" 3 # 1 "/usr/include/c++/4.7/bits/cpp_type_traits.h" 1 3 # 36 "/usr/include/c++/4.7/bits/cpp_type_traits.h" 3 # 37 "/usr/include/c++/4.7/bits/cpp_type_traits.h" 3 # 69 "/usr/include/c++/4.7/bits/cpp_type_traits.h" 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { template<typename _Iterator, typename _Container> class __normal_iterator; } namespace std __attribute__ ((__visibility__ ("default"))) { struct __true_type { }; struct __false_type { }; template<bool> struct __truth_type { typedef __false_type __type; }; template<> struct __truth_type<true> { typedef __true_type __type; }; template<class _Sp, class _Tp> struct __traitor { enum { __value = bool(_Sp::__value) || bool(_Tp::__value) }; typedef typename __truth_type<__value>::__type __type; }; template<typename, typename> struct __are_same { enum { __value = 0 }; typedef __false_type __type; }; template<typename _Tp> struct __are_same<_Tp, _Tp> { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_void { enum { __value = 0 }; typedef __false_type __type; }; template<> struct __is_void<void> { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_integer { enum { __value = 0 }; typedef __false_type __type; }; template<> struct __is_integer<bool> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<char> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<signed char> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<unsigned char> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<wchar_t> { enum { __value = 1 }; typedef __true_type __type; }; # 199 "/usr/include/c++/4.7/bits/cpp_type_traits.h" 3 template<> struct __is_integer<short> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<unsigned short> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<int> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<unsigned int> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<long> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<unsigned long> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<long long> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_integer<unsigned long long> { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_floating { enum { __value = 0 }; typedef __false_type __type; }; template<> struct __is_floating<float> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_floating<double> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_floating<long double> { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_pointer { enum { __value = 0 }; typedef __false_type __type; }; template<typename _Tp> struct __is_pointer<_Tp*> { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_normal_iterator { enum { __value = 0 }; typedef __false_type __type; }; template<typename _Iterator, typename _Container> struct __is_normal_iterator< __gnu_cxx::__normal_iterator<_Iterator, _Container> > { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_arithmetic : public __traitor<__is_integer<_Tp>, __is_floating<_Tp> > { }; template<typename _Tp> struct __is_fundamental : public __traitor<__is_void<_Tp>, __is_arithmetic<_Tp> > { }; template<typename _Tp> struct __is_scalar : public __traitor<__is_arithmetic<_Tp>, __is_pointer<_Tp> > { }; template<typename _Tp> struct __is_char { enum { __value = 0 }; typedef __false_type __type; }; template<> struct __is_char<char> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_char<wchar_t> { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_byte { enum { __value = 0 }; typedef __false_type __type; }; template<> struct __is_byte<char> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_byte<signed char> { enum { __value = 1 }; typedef __true_type __type; }; template<> struct __is_byte<unsigned char> { enum { __value = 1 }; typedef __true_type __type; }; template<typename _Tp> struct __is_move_iterator { enum { __value = 0 }; typedef __false_type __type; }; # 422 "/usr/include/c++/4.7/bits/cpp_type_traits.h" 3 } # 45 "/usr/include/c++/4.7/complex" 2 3 # 1 "/usr/include/c++/4.7/ext/type_traits.h" 1 3 # 32 "/usr/include/c++/4.7/ext/type_traits.h" 3 # 33 "/usr/include/c++/4.7/ext/type_traits.h" 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { template<bool, typename> struct __enable_if { }; template<typename _Tp> struct __enable_if<true, _Tp> { typedef _Tp __type; }; template<bool _Cond, typename _Iftrue, typename _Iffalse> struct __conditional_type { typedef _Iftrue __type; }; template<typename _Iftrue, typename _Iffalse> struct __conditional_type<false, _Iftrue, _Iffalse> { typedef _Iffalse __type; }; template<typename _Tp> struct __add_unsigned { private: typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; public: typedef typename __if_type::__type __type; }; template<> struct __add_unsigned<char> { typedef unsigned char __type; }; template<> struct __add_unsigned<signed char> { typedef unsigned char __type; }; template<> struct __add_unsigned<short> { typedef unsigned short __type; }; template<> struct __add_unsigned<int> { typedef unsigned int __type; }; template<> struct __add_unsigned<long> { typedef unsigned long __type; }; template<> struct __add_unsigned<long long> { typedef unsigned long long __type; }; template<> struct __add_unsigned<bool>; template<> struct __add_unsigned<wchar_t>; template<typename _Tp> struct __remove_unsigned { private: typedef __enable_if<std::__is_integer<_Tp>::__value, _Tp> __if_type; public: typedef typename __if_type::__type __type; }; template<> struct __remove_unsigned<char> { typedef signed char __type; }; template<> struct __remove_unsigned<unsigned char> { typedef signed char __type; }; template<> struct __remove_unsigned<unsigned short> { typedef short __type; }; template<> struct __remove_unsigned<unsigned int> { typedef int __type; }; template<> struct __remove_unsigned<unsigned long> { typedef long __type; }; template<> struct __remove_unsigned<unsigned long long> { typedef long long __type; }; template<> struct __remove_unsigned<bool>; template<> struct __remove_unsigned<wchar_t>; template<typename _Type> inline bool __is_null_pointer(_Type* __ptr) { return __ptr == 0; } template<typename _Type> inline bool __is_null_pointer(_Type) { return false; } template<typename _Tp, bool = std::__is_integer<_Tp>::__value> struct __promote { typedef double __type; }; template<typename _Tp> struct __promote<_Tp, false> { }; template<> struct __promote<long double> { typedef long double __type; }; template<> struct __promote<double> { typedef double __type; }; template<> struct __promote<float> { typedef float __type; }; template<typename _Tp, typename _Up, typename _Tp2 = typename __promote<_Tp>::__type, typename _Up2 = typename __promote<_Up>::__type> struct __promote_2 { typedef __typeof__(_Tp2() + _Up2()) __type; }; template<typename _Tp, typename _Up, typename _Vp, typename _Tp2 = typename __promote<_Tp>::__type, typename _Up2 = typename __promote<_Up>::__type, typename _Vp2 = typename __promote<_Vp>::__type> struct __promote_3 { typedef __typeof__(_Tp2() + _Up2() + _Vp2()) __type; }; template<typename _Tp, typename _Up, typename _Vp, typename _Wp, typename _Tp2 = typename __promote<_Tp>::__type, typename _Up2 = typename __promote<_Up>::__type, typename _Vp2 = typename __promote<_Vp>::__type, typename _Wp2 = typename __promote<_Wp>::__type> struct __promote_4 { typedef __typeof__(_Tp2() + _Up2() + _Vp2() + _Wp2()) __type; }; } # 46 "/usr/include/c++/4.7/complex" 2 3 # 1 "/usr/include/c++/4.7/cmath" 1 3 # 41 "/usr/include/c++/4.7/cmath" 3 # 42 "/usr/include/c++/4.7/cmath" 3 # 1 "/usr/include/math.h" 1 3 4 # 30 "/usr/include/math.h" 3 4 extern "C" { # 1 "/usr/include/i386-linux-gnu/bits/huge_val.h" 1 3 4 # 35 "/usr/include/math.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/huge_valf.h" 1 3 4 # 37 "/usr/include/math.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/huge_vall.h" 1 3 4 # 38 "/usr/include/math.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/inf.h" 1 3 4 # 41 "/usr/include/math.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/nan.h" 1 3 4 # 44 "/usr/include/math.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/mathdef.h" 1 3 4 # 36 "/usr/include/i386-linux-gnu/bits/mathdef.h" 3 4 typedef long double float_t; typedef long double double_t; # 48 "/usr/include/math.h" 2 3 4 # 71 "/usr/include/math.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 1 3 4 # 53 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 3 4 extern double acos (double __x) throw (); extern double __acos (double __x) throw (); extern double asin (double __x) throw (); extern double __asin (double __x) throw (); extern double atan (double __x) throw (); extern double __atan (double __x) throw (); extern double atan2 (double __y, double __x) throw (); extern double __atan2 (double __y, double __x) throw (); extern double cos (double __x) throw (); extern double __cos (double __x) throw (); extern double sin (double __x) throw (); extern double __sin (double __x) throw (); extern double tan (double __x) throw (); extern double __tan (double __x) throw (); extern double cosh (double __x) throw (); extern double __cosh (double __x) throw (); extern double sinh (double __x) throw (); extern double __sinh (double __x) throw (); extern double tanh (double __x) throw (); extern double __tanh (double __x) throw (); extern void sincos (double __x, double *__sinx, double *__cosx) throw (); extern void __sincos (double __x, double *__sinx, double *__cosx) throw () ; extern double acosh (double __x) throw (); extern double __acosh (double __x) throw (); extern double asinh (double __x) throw (); extern double __asinh (double __x) throw (); extern double atanh (double __x) throw (); extern double __atanh (double __x) throw (); extern double exp (double __x) throw (); extern double __exp (double __x) throw (); extern double frexp (double __x, int *__exponent) throw (); extern double __frexp (double __x, int *__exponent) throw (); extern double ldexp (double __x, int __exponent) throw (); extern double __ldexp (double __x, int __exponent) throw (); extern double log (double __x) throw (); extern double __log (double __x) throw (); extern double log10 (double __x) throw (); extern double __log10 (double __x) throw (); extern double modf (double __x, double *__iptr) throw (); extern double __modf (double __x, double *__iptr) throw () __attribute__ ((__nonnull__ (2))); extern double exp10 (double __x) throw (); extern double __exp10 (double __x) throw (); extern double pow10 (double __x) throw (); extern double __pow10 (double __x) throw (); extern double expm1 (double __x) throw (); extern double __expm1 (double __x) throw (); extern double log1p (double __x) throw (); extern double __log1p (double __x) throw (); extern double logb (double __x) throw (); extern double __logb (double __x) throw (); extern double exp2 (double __x) throw (); extern double __exp2 (double __x) throw (); extern double log2 (double __x) throw (); extern double __log2 (double __x) throw (); extern double pow (double __x, double __y) throw (); extern double __pow (double __x, double __y) throw (); extern double sqrt (double __x) throw (); extern double __sqrt (double __x) throw (); extern double hypot (double __x, double __y) throw (); extern double __hypot (double __x, double __y) throw (); extern double cbrt (double __x) throw (); extern double __cbrt (double __x) throw (); extern double ceil (double __x) throw () __attribute__ ((__const__)); extern double __ceil (double __x) throw () __attribute__ ((__const__)); extern double fabs (double __x) throw () __attribute__ ((__const__)); extern double __fabs (double __x) throw () __attribute__ ((__const__)); extern double floor (double __x) throw () __attribute__ ((__const__)); extern double __floor (double __x) throw () __attribute__ ((__const__)); extern double fmod (double __x, double __y) throw (); extern double __fmod (double __x, double __y) throw (); extern int __isinf (double __value) throw () __attribute__ ((__const__)); extern int __finite (double __value) throw () __attribute__ ((__const__)); extern int isinf (double __value) throw () __attribute__ ((__const__)); extern int finite (double __value) throw () __attribute__ ((__const__)); extern double drem (double __x, double __y) throw (); extern double __drem (double __x, double __y) throw (); extern double significand (double __x) throw (); extern double __significand (double __x) throw (); extern double copysign (double __x, double __y) throw () __attribute__ ((__const__)); extern double __copysign (double __x, double __y) throw () __attribute__ ((__const__)); extern double nan (__const char *__tagb) throw () __attribute__ ((__const__)); extern double __nan (__const char *__tagb) throw () __attribute__ ((__const__)); extern int __isnan (double __value) throw () __attribute__ ((__const__)); extern int isnan (double __value) throw () __attribute__ ((__const__)); extern double j0 (double) throw (); extern double __j0 (double) throw (); extern double j1 (double) throw (); extern double __j1 (double) throw (); extern double jn (int, double) throw (); extern double __jn (int, double) throw (); extern double y0 (double) throw (); extern double __y0 (double) throw (); extern double y1 (double) throw (); extern double __y1 (double) throw (); extern double yn (int, double) throw (); extern double __yn (int, double) throw (); extern double erf (double) throw (); extern double __erf (double) throw (); extern double erfc (double) throw (); extern double __erfc (double) throw (); extern double lgamma (double) throw (); extern double __lgamma (double) throw (); extern double tgamma (double) throw (); extern double __tgamma (double) throw (); extern double gamma (double) throw (); extern double __gamma (double) throw (); extern double lgamma_r (double, int *__signgamp) throw (); extern double __lgamma_r (double, int *__signgamp) throw (); extern double rint (double __x) throw (); extern double __rint (double __x) throw (); extern double nextafter (double __x, double __y) throw () __attribute__ ((__const__)); extern double __nextafter (double __x, double __y) throw () __attribute__ ((__const__)); extern double nexttoward (double __x, long double __y) throw () __attribute__ ((__const__)); extern double __nexttoward (double __x, long double __y) throw () __attribute__ ((__const__)); extern double remainder (double __x, double __y) throw (); extern double __remainder (double __x, double __y) throw (); extern double scalbn (double __x, int __n) throw (); extern double __scalbn (double __x, int __n) throw (); extern int ilogb (double __x) throw (); extern int __ilogb (double __x) throw (); extern double scalbln (double __x, long int __n) throw (); extern double __scalbln (double __x, long int __n) throw (); extern double nearbyint (double __x) throw (); extern double __nearbyint (double __x) throw (); extern double round (double __x) throw () __attribute__ ((__const__)); extern double __round (double __x) throw () __attribute__ ((__const__)); extern double trunc (double __x) throw () __attribute__ ((__const__)); extern double __trunc (double __x) throw () __attribute__ ((__const__)); extern double remquo (double __x, double __y, int *__quo) throw (); extern double __remquo (double __x, double __y, int *__quo) throw (); extern long int lrint (double __x) throw (); extern long int __lrint (double __x) throw (); extern long long int llrint (double __x) throw (); extern long long int __llrint (double __x) throw (); extern long int lround (double __x) throw (); extern long int __lround (double __x) throw (); extern long long int llround (double __x) throw (); extern long long int __llround (double __x) throw (); extern double fdim (double __x, double __y) throw (); extern double __fdim (double __x, double __y) throw (); extern double fmax (double __x, double __y) throw (); extern double __fmax (double __x, double __y) throw (); extern double fmin (double __x, double __y) throw (); extern double __fmin (double __x, double __y) throw (); extern int __fpclassify (double __value) throw () __attribute__ ((__const__)); extern int __signbit (double __value) throw () __attribute__ ((__const__)); extern double fma (double __x, double __y, double __z) throw (); extern double __fma (double __x, double __y, double __z) throw (); extern double scalb (double __x, double __n) throw (); extern double __scalb (double __x, double __n) throw (); # 72 "/usr/include/math.h" 2 3 4 # 94 "/usr/include/math.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 1 3 4 # 53 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 3 4 extern float acosf (float __x) throw (); extern float __acosf (float __x) throw (); extern float asinf (float __x) throw (); extern float __asinf (float __x) throw (); extern float atanf (float __x) throw (); extern float __atanf (float __x) throw (); extern float atan2f (float __y, float __x) throw (); extern float __atan2f (float __y, float __x) throw (); extern float cosf (float __x) throw (); extern float __cosf (float __x) throw (); extern float sinf (float __x) throw (); extern float __sinf (float __x) throw (); extern float tanf (float __x) throw (); extern float __tanf (float __x) throw (); extern float coshf (float __x) throw (); extern float __coshf (float __x) throw (); extern float sinhf (float __x) throw (); extern float __sinhf (float __x) throw (); extern float tanhf (float __x) throw (); extern float __tanhf (float __x) throw (); extern void sincosf # 82 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 3 4 (float __x, float *__sinx, float *__cosx) throw (); extern void __sincosf # 82 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 3 4 (float __x, float *__sinx, float *__cosx) throw () ; extern float acoshf (float __x) throw (); extern float __acoshf (float __x) throw (); extern float asinhf (float __x) throw (); extern float __asinhf (float __x) throw (); extern float atanhf (float __x) throw (); extern float __atanhf (float __x) throw (); extern float expf (float __x) throw (); extern float __expf (float __x) throw (); extern float frexpf (float __x, int *__exponent) throw (); extern float __frexpf (float __x, int *__exponent) throw (); extern float ldexpf (float __x, int __exponent) throw (); extern float __ldexpf (float __x, int __exponent) throw (); extern float logf (float __x) throw (); extern float __logf (float __x) throw (); extern float log10f (float __x) throw (); extern float __log10f (float __x) throw (); extern float modff (float __x, float *__iptr) throw (); extern float __modff (float __x, float *__iptr) throw () __attribute__ ((__nonnull__ (2))); extern float exp10f (float __x) throw (); extern float __exp10f (float __x) throw (); extern float pow10f (float __x) throw (); extern float __pow10f (float __x) throw (); extern float expm1f (float __x) throw (); extern float __expm1f (float __x) throw (); extern float log1pf (float __x) throw (); extern float __log1pf (float __x) throw (); extern float logbf (float __x) throw (); extern float __logbf (float __x) throw (); extern float exp2f (float __x) throw (); extern float __exp2f (float __x) throw (); extern float log2f (float __x) throw (); extern float __log2f (float __x) throw (); extern float powf (float __x, float __y) throw (); extern float __powf (float __x, float __y) throw (); extern float sqrtf (float __x) throw (); extern float __sqrtf (float __x) throw (); extern float hypotf (float __x, float __y) throw (); extern float __hypotf (float __x, float __y) throw (); extern float cbrtf (float __x) throw (); extern float __cbrtf (float __x) throw (); extern float ceilf (float __x) throw () __attribute__ ((__const__)); extern float __ceilf (float __x) throw () __attribute__ ((__const__)); extern float fabsf (float __x) throw () __attribute__ ((__const__)); extern float __fabsf (float __x) throw () __attribute__ ((__const__)); extern float floorf (float __x) throw () __attribute__ ((__const__)); extern float __floorf (float __x) throw () __attribute__ ((__const__)); extern float fmodf (float __x, float __y) throw (); extern float __fmodf (float __x, float __y) throw (); extern int __isinff (float __value) throw () __attribute__ ((__const__)); extern int __finitef (float __value) throw () __attribute__ ((__const__)); extern int isinff (float __value) throw () __attribute__ ((__const__)); extern int finitef (float __value) throw () __attribute__ ((__const__)); extern float dremf (float __x, float __y) throw (); extern float __dremf (float __x, float __y) throw (); extern float significandf (float __x) throw (); extern float __significandf (float __x) throw (); extern float copysignf (float __x, float __y) throw () __attribute__ ((__const__)); extern float __copysignf (float __x, float __y) throw () __attribute__ ((__const__)); extern float nanf (__const char *__tagb) throw () __attribute__ ((__const__)); extern float __nanf (__const char *__tagb) throw () __attribute__ ((__const__)); extern int __isnanf (float __value) throw () __attribute__ ((__const__)); extern int isnanf (float __value) throw () __attribute__ ((__const__)); extern float j0f (float) throw (); extern float __j0f (float) throw (); extern float j1f (float) throw (); extern float __j1f (float) throw (); extern float jnf (int, float) throw (); extern float __jnf (int, float) throw (); extern float y0f (float) throw (); extern float __y0f (float) throw (); extern float y1f (float) throw (); extern float __y1f (float) throw (); extern float ynf (int, float) throw (); extern float __ynf (int, float) throw (); extern float erff (float) throw (); extern float __erff (float) throw (); extern float erfcf (float) throw (); extern float __erfcf (float) throw (); extern float lgammaf (float) throw (); extern float __lgammaf (float) throw (); extern float tgammaf (float) throw (); extern float __tgammaf (float) throw (); extern float gammaf (float) throw (); extern float __gammaf (float) throw (); extern float lgammaf_r (float, int *__signgamp) throw (); extern float __lgammaf_r (float, int *__signgamp) throw (); extern float rintf (float __x) throw (); extern float __rintf (float __x) throw (); extern float nextafterf (float __x, float __y) throw () __attribute__ ((__const__)); extern float __nextafterf (float __x, float __y) throw () __attribute__ ((__const__)); extern float nexttowardf (float __x, long double __y) throw () __attribute__ ((__const__)); extern float __nexttowardf (float __x, long double __y) throw () __attribute__ ((__const__)); extern float remainderf (float __x, float __y) throw (); extern float __remainderf (float __x, float __y) throw (); extern float scalbnf (float __x, int __n) throw (); extern float __scalbnf (float __x, int __n) throw (); extern int ilogbf (float __x) throw (); extern int __ilogbf (float __x) throw (); extern float scalblnf (float __x, long int __n) throw (); extern float __scalblnf (float __x, long int __n) throw (); extern float nearbyintf (float __x) throw (); extern float __nearbyintf (float __x) throw (); extern float roundf (float __x) throw () __attribute__ ((__const__)); extern float __roundf (float __x) throw () __attribute__ ((__const__)); extern float truncf (float __x) throw () __attribute__ ((__const__)); extern float __truncf (float __x) throw () __attribute__ ((__const__)); extern float remquof (float __x, float __y, int *__quo) throw (); extern float __remquof (float __x, float __y, int *__quo) throw (); extern long int lrintf (float __x) throw (); extern long int __lrintf (float __x) throw (); extern long long int llrintf (float __x) throw (); extern long long int __llrintf (float __x) throw (); extern long int lroundf (float __x) throw (); extern long int __lroundf (float __x) throw (); extern long long int llroundf (float __x) throw (); extern long long int __llroundf (float __x) throw (); extern float fdimf (float __x, float __y) throw (); extern float __fdimf (float __x, float __y) throw (); extern float fmaxf (float __x, float __y) throw (); extern float __fmaxf (float __x, float __y) throw (); extern float fminf (float __x, float __y) throw (); extern float __fminf (float __x, float __y) throw (); extern int __fpclassifyf (float __value) throw () __attribute__ ((__const__)); extern int __signbitf (float __value) throw () __attribute__ ((__const__)); extern float fmaf (float __x, float __y, float __z) throw (); extern float __fmaf (float __x, float __y, float __z) throw (); extern float scalbf (float __x, float __n) throw (); extern float __scalbf (float __x, float __n) throw (); # 95 "/usr/include/math.h" 2 3 4 # 146 "/usr/include/math.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 1 3 4 # 53 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 3 4 extern long double acosl (long double __x) throw (); extern long double __acosl (long double __x) throw (); extern long double asinl (long double __x) throw (); extern long double __asinl (long double __x) throw (); extern long double atanl (long double __x) throw (); extern long double __atanl (long double __x) throw (); extern long double atan2l (long double __y, long double __x) throw (); extern long double __atan2l (long double __y, long double __x) throw (); extern long double cosl (long double __x) throw (); extern long double __cosl (long double __x) throw (); extern long double sinl (long double __x) throw (); extern long double __sinl (long double __x) throw (); extern long double tanl (long double __x) throw (); extern long double __tanl (long double __x) throw (); extern long double coshl (long double __x) throw (); extern long double __coshl (long double __x) throw (); extern long double sinhl (long double __x) throw (); extern long double __sinhl (long double __x) throw (); extern long double tanhl (long double __x) throw (); extern long double __tanhl (long double __x) throw (); extern void sincosl # 82 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 3 4 (long double __x, long double *__sinx, long double *__cosx) throw (); extern void __sincosl # 82 "/usr/include/i386-linux-gnu/bits/mathcalls.h" 3 4 (long double __x, long double *__sinx, long double *__cosx) throw () ; extern long double acoshl (long double __x) throw (); extern long double __acoshl (long double __x) throw (); extern long double asinhl (long double __x) throw (); extern long double __asinhl (long double __x) throw (); extern long double atanhl (long double __x) throw (); extern long double __atanhl (long double __x) throw (); extern long double expl (long double __x) throw (); extern long double __expl (long double __x) throw (); extern long double frexpl (long double __x, int *__exponent) throw (); extern long double __frexpl (long double __x, int *__exponent) throw (); extern long double ldexpl (long double __x, int __exponent) throw (); extern long double __ldexpl (long double __x, int __exponent) throw (); extern long double logl (long double __x) throw (); extern long double __logl (long double __x) throw (); extern long double log10l (long double __x) throw (); extern long double __log10l (long double __x) throw (); extern long double modfl (long double __x, long double *__iptr) throw (); extern long double __modfl (long double __x, long double *__iptr) throw () __attribute__ ((__nonnull__ (2))); extern long double exp10l (long double __x) throw (); extern long double __exp10l (long double __x) throw (); extern long double pow10l (long double __x) throw (); extern long double __pow10l (long double __x) throw (); extern long double expm1l (long double __x) throw (); extern long double __expm1l (long double __x) throw (); extern long double log1pl (long double __x) throw (); extern long double __log1pl (long double __x) throw (); extern long double logbl (long double __x) throw (); extern long double __logbl (long double __x) throw (); extern long double exp2l (long double __x) throw (); extern long double __exp2l (long double __x) throw (); extern long double log2l (long double __x) throw (); extern long double __log2l (long double __x) throw (); extern long double powl (long double __x, long double __y) throw (); extern long double __powl (long double __x, long double __y) throw (); extern long double sqrtl (long double __x) throw (); extern long double __sqrtl (long double __x) throw (); extern long double hypotl (long double __x, long double __y) throw (); extern long double __hypotl (long double __x, long double __y) throw (); extern long double cbrtl (long double __x) throw (); extern long double __cbrtl (long double __x) throw (); extern long double ceill (long double __x) throw () __attribute__ ((__const__)); extern long double __ceill (long double __x) throw () __attribute__ ((__const__)); extern long double fabsl (long double __x) throw () __attribute__ ((__const__)); extern long double __fabsl (long double __x) throw () __attribute__ ((__const__)); extern long double floorl (long double __x) throw () __attribute__ ((__const__)); extern long double __floorl (long double __x) throw () __attribute__ ((__const__)); extern long double fmodl (long double __x, long double __y) throw (); extern long double __fmodl (long double __x, long double __y) throw (); extern int __isinfl (long double __value) throw () __attribute__ ((__const__)); extern int __finitel (long double __value) throw () __attribute__ ((__const__)); extern int isinfl (long double __value) throw () __attribute__ ((__const__)); extern int finitel (long double __value) throw () __attribute__ ((__const__)); extern long double dreml (long double __x, long double __y) throw (); extern long double __dreml (long double __x, long double __y) throw (); extern long double significandl (long double __x) throw (); extern long double __significandl (long double __x) throw (); extern long double copysignl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __copysignl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double nanl (__const char *__tagb) throw () __attribute__ ((__const__)); extern long double __nanl (__const char *__tagb) throw () __attribute__ ((__const__)); extern int __isnanl (long double __value) throw () __attribute__ ((__const__)); extern int isnanl (long double __value) throw () __attribute__ ((__const__)); extern long double j0l (long double) throw (); extern long double __j0l (long double) throw (); extern long double j1l (long double) throw (); extern long double __j1l (long double) throw (); extern long double jnl (int, long double) throw (); extern long double __jnl (int, long double) throw (); extern long double y0l (long double) throw (); extern long double __y0l (long double) throw (); extern long double y1l (long double) throw (); extern long double __y1l (long double) throw (); extern long double ynl (int, long double) throw (); extern long double __ynl (int, long double) throw (); extern long double erfl (long double) throw (); extern long double __erfl (long double) throw (); extern long double erfcl (long double) throw (); extern long double __erfcl (long double) throw (); extern long double lgammal (long double) throw (); extern long double __lgammal (long double) throw (); extern long double tgammal (long double) throw (); extern long double __tgammal (long double) throw (); extern long double gammal (long double) throw (); extern long double __gammal (long double) throw (); extern long double lgammal_r (long double, int *__signgamp) throw (); extern long double __lgammal_r (long double, int *__signgamp) throw (); extern long double rintl (long double __x) throw (); extern long double __rintl (long double __x) throw (); extern long double nextafterl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __nextafterl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double nexttowardl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double __nexttowardl (long double __x, long double __y) throw () __attribute__ ((__const__)); extern long double remainderl (long double __x, long double __y) throw (); extern long double __remainderl (long double __x, long double __y) throw (); extern long double scalbnl (long double __x, int __n) throw (); extern long double __scalbnl (long double __x, int __n) throw (); extern int ilogbl (long double __x) throw (); extern int __ilogbl (long double __x) throw (); extern long double scalblnl (long double __x, long int __n) throw (); extern long double __scalblnl (long double __x, long int __n) throw (); extern long double nearbyintl (long double __x) throw (); extern long double __nearbyintl (long double __x) throw (); extern long double roundl (long double __x) throw () __attribute__ ((__const__)); extern long double __roundl (long double __x) throw () __attribute__ ((__const__)); extern long double truncl (long double __x) throw () __attribute__ ((__const__)); extern long double __truncl (long double __x) throw () __attribute__ ((__const__)); extern long double remquol (long double __x, long double __y, int *__quo) throw (); extern long double __remquol (long double __x, long double __y, int *__quo) throw (); extern long int lrintl (long double __x) throw (); extern long int __lrintl (long double __x) throw (); extern long long int llrintl (long double __x) throw (); extern long long int __llrintl (long double __x) throw (); extern long int lroundl (long double __x) throw (); extern long int __lroundl (long double __x) throw (); extern long long int llroundl (long double __x) throw (); extern long long int __llroundl (long double __x) throw (); extern long double fdiml (long double __x, long double __y) throw (); extern long double __fdiml (long double __x, long double __y) throw (); extern long double fmaxl (long double __x, long double __y) throw (); extern long double __fmaxl (long double __x, long double __y) throw (); extern long double fminl (long double __x, long double __y) throw (); extern long double __fminl (long double __x, long double __y) throw (); extern int __fpclassifyl (long double __value) throw () __attribute__ ((__const__)); extern int __signbitl (long double __value) throw () __attribute__ ((__const__)); extern long double fmal (long double __x, long double __y, long double __z) throw (); extern long double __fmal (long double __x, long double __y, long double __z) throw (); extern long double scalbl (long double __x, long double __n) throw (); extern long double __scalbl (long double __x, long double __n) throw (); # 147 "/usr/include/math.h" 2 3 4 # 162 "/usr/include/math.h" 3 4 extern int signgam; # 203 "/usr/include/math.h" 3 4 enum { FP_NAN, FP_INFINITE, FP_ZERO, FP_SUBNORMAL, FP_NORMAL }; # 296 "/usr/include/math.h" 3 4 typedef enum { _IEEE_ = -1, _SVID_, _XOPEN_, _POSIX_, _ISOC_ } _LIB_VERSION_TYPE; extern _LIB_VERSION_TYPE _LIB_VERSION; # 319 "/usr/include/math.h" 3 4 struct __exception { int type; char *name; double arg1; double arg2; double retval; }; extern int matherr (struct __exception *__exc) throw (); # 483 "/usr/include/math.h" 3 4 } # 47 "/usr/include/c++/4.7/cmath" 2 3 # 77 "/usr/include/c++/4.7/cmath" 3 namespace std __attribute__ ((__visibility__ ("default"))) { inline double abs(double __x) { return __builtin_fabs(__x); } inline float abs(float __x) { return __builtin_fabsf(__x); } inline long double abs(long double __x) { return __builtin_fabsl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type abs(_Tp __x) { return __builtin_fabs(__x); } using ::acos; inline float acos(float __x) { return __builtin_acosf(__x); } inline long double acos(long double __x) { return __builtin_acosl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type acos(_Tp __x) { return __builtin_acos(__x); } using ::asin; inline float asin(float __x) { return __builtin_asinf(__x); } inline long double asin(long double __x) { return __builtin_asinl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type asin(_Tp __x) { return __builtin_asin(__x); } using ::atan; inline float atan(float __x) { return __builtin_atanf(__x); } inline long double atan(long double __x) { return __builtin_atanl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type atan(_Tp __x) { return __builtin_atan(__x); } using ::atan2; inline float atan2(float __y, float __x) { return __builtin_atan2f(__y, __x); } inline long double atan2(long double __y, long double __x) { return __builtin_atan2l(__y, __x); } template<typename _Tp, typename _Up> inline typename __gnu_cxx::__promote_2<_Tp, _Up>::__type atan2(_Tp __y, _Up __x) { typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type; return atan2(__type(__y), __type(__x)); } using ::ceil; inline float ceil(float __x) { return __builtin_ceilf(__x); } inline long double ceil(long double __x) { return __builtin_ceill(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type ceil(_Tp __x) { return __builtin_ceil(__x); } using ::cos; inline float cos(float __x) { return __builtin_cosf(__x); } inline long double cos(long double __x) { return __builtin_cosl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type cos(_Tp __x) { return __builtin_cos(__x); } using ::cosh; inline float cosh(float __x) { return __builtin_coshf(__x); } inline long double cosh(long double __x) { return __builtin_coshl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type cosh(_Tp __x) { return __builtin_cosh(__x); } using ::exp; inline float exp(float __x) { return __builtin_expf(__x); } inline long double exp(long double __x) { return __builtin_expl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type exp(_Tp __x) { return __builtin_exp(__x); } using ::fabs; inline float fabs(float __x) { return __builtin_fabsf(__x); } inline long double fabs(long double __x) { return __builtin_fabsl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type fabs(_Tp __x) { return __builtin_fabs(__x); } using ::floor; inline float floor(float __x) { return __builtin_floorf(__x); } inline long double floor(long double __x) { return __builtin_floorl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type floor(_Tp __x) { return __builtin_floor(__x); } using ::fmod; inline float fmod(float __x, float __y) { return __builtin_fmodf(__x, __y); } inline long double fmod(long double __x, long double __y) { return __builtin_fmodl(__x, __y); } template<typename _Tp, typename _Up> inline typename __gnu_cxx::__promote_2<_Tp, _Up>::__type fmod(_Tp __x, _Up __y) { typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type; return fmod(__type(__x), __type(__y)); } using ::frexp; inline float frexp(float __x, int* __exp) { return __builtin_frexpf(__x, __exp); } inline long double frexp(long double __x, int* __exp) { return __builtin_frexpl(__x, __exp); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type frexp(_Tp __x, int* __exp) { return __builtin_frexp(__x, __exp); } using ::ldexp; inline float ldexp(float __x, int __exp) { return __builtin_ldexpf(__x, __exp); } inline long double ldexp(long double __x, int __exp) { return __builtin_ldexpl(__x, __exp); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type ldexp(_Tp __x, int __exp) { return __builtin_ldexp(__x, __exp); } using ::log; inline float log(float __x) { return __builtin_logf(__x); } inline long double log(long double __x) { return __builtin_logl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type log(_Tp __x) { return __builtin_log(__x); } using ::log10; inline float log10(float __x) { return __builtin_log10f(__x); } inline long double log10(long double __x) { return __builtin_log10l(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type log10(_Tp __x) { return __builtin_log10(__x); } using ::modf; inline float modf(float __x, float* __iptr) { return __builtin_modff(__x, __iptr); } inline long double modf(long double __x, long double* __iptr) { return __builtin_modfl(__x, __iptr); } using ::pow; inline float pow(float __x, float __y) { return __builtin_powf(__x, __y); } inline long double pow(long double __x, long double __y) { return __builtin_powl(__x, __y); } inline double pow(double __x, int __i) { return __builtin_powi(__x, __i); } inline float pow(float __x, int __n) { return __builtin_powif(__x, __n); } inline long double pow(long double __x, int __n) { return __builtin_powil(__x, __n); } template<typename _Tp, typename _Up> inline typename __gnu_cxx::__promote_2<_Tp, _Up>::__type pow(_Tp __x, _Up __y) { typedef typename __gnu_cxx::__promote_2<_Tp, _Up>::__type __type; return pow(__type(__x), __type(__y)); } using ::sin; inline float sin(float __x) { return __builtin_sinf(__x); } inline long double sin(long double __x) { return __builtin_sinl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type sin(_Tp __x) { return __builtin_sin(__x); } using ::sinh; inline float sinh(float __x) { return __builtin_sinhf(__x); } inline long double sinh(long double __x) { return __builtin_sinhl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type sinh(_Tp __x) { return __builtin_sinh(__x); } using ::sqrt; inline float sqrt(float __x) { return __builtin_sqrtf(__x); } inline long double sqrt(long double __x) { return __builtin_sqrtl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type sqrt(_Tp __x) { return __builtin_sqrt(__x); } using ::tan; inline float tan(float __x) { return __builtin_tanf(__x); } inline long double tan(long double __x) { return __builtin_tanl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type tan(_Tp __x) { return __builtin_tan(__x); } using ::tanh; inline float tanh(float __x) { return __builtin_tanhf(__x); } inline long double tanh(long double __x) { return __builtin_tanhl(__x); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_integer<_Tp>::__value, double>::__type tanh(_Tp __x) { return __builtin_tanh(__x); } } # 558 "/usr/include/c++/4.7/cmath" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 808 "/usr/include/c++/4.7/cmath" 3 template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type fpclassify(_Tp __f) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_fpclassify(FP_NAN, FP_INFINITE, FP_NORMAL, FP_SUBNORMAL, FP_ZERO, __type(__f)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isfinite(_Tp __f) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isfinite(__type(__f)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isinf(_Tp __f) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isinf(__type(__f)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isnan(_Tp __f) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isnan(__type(__f)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isnormal(_Tp __f) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isnormal(__type(__f)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type signbit(_Tp __f) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_signbit(__type(__f)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isgreater(_Tp __f1, _Tp __f2) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isgreater(__type(__f1), __type(__f2)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isgreaterequal(_Tp __f1, _Tp __f2) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isgreaterequal(__type(__f1), __type(__f2)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isless(_Tp __f1, _Tp __f2) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isless(__type(__f1), __type(__f2)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type islessequal(_Tp __f1, _Tp __f2) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_islessequal(__type(__f1), __type(__f2)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type islessgreater(_Tp __f1, _Tp __f2) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_islessgreater(__type(__f1), __type(__f2)); } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_arithmetic<_Tp>::__value, int>::__type isunordered(_Tp __f1, _Tp __f2) { typedef typename __gnu_cxx::__promote<_Tp>::__type __type; return __builtin_isunordered(__type(__f1), __type(__f2)); } } # 47 "/usr/include/c++/4.7/complex" 2 3 # 1 "/usr/include/c++/4.7/sstream" 1 3 # 37 "/usr/include/c++/4.7/sstream" 3 # 38 "/usr/include/c++/4.7/sstream" 3 # 1 "/usr/include/c++/4.7/istream" 1 3 # 38 "/usr/include/c++/4.7/istream" 3 # 39 "/usr/include/c++/4.7/istream" 3 # 1 "/usr/include/c++/4.7/ios" 1 3 # 37 "/usr/include/c++/4.7/ios" 3 # 38 "/usr/include/c++/4.7/ios" 3 # 1 "/usr/include/c++/4.7/iosfwd" 1 3 # 38 "/usr/include/c++/4.7/iosfwd" 3 # 39 "/usr/include/c++/4.7/iosfwd" 3 # 1 "/usr/include/c++/4.7/bits/stringfwd.h" 1 3 # 39 "/usr/include/c++/4.7/bits/stringfwd.h" 3 # 40 "/usr/include/c++/4.7/bits/stringfwd.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _Alloc> class allocator; template<class _CharT> struct char_traits; template<typename _CharT, typename _Traits = char_traits<_CharT>, typename _Alloc = allocator<_CharT> > class basic_string; template<> struct char_traits<char>; typedef basic_string<char> string; template<> struct char_traits<wchar_t>; typedef basic_string<wchar_t> wstring; # 85 "/usr/include/c++/4.7/bits/stringfwd.h" 3 } # 42 "/usr/include/c++/4.7/iosfwd" 2 3 # 1 "/usr/include/c++/4.7/bits/postypes.h" 1 3 # 40 "/usr/include/c++/4.7/bits/postypes.h" 3 # 41 "/usr/include/c++/4.7/bits/postypes.h" 3 # 1 "/usr/include/c++/4.7/cwchar" 1 3 # 41 "/usr/include/c++/4.7/cwchar" 3 # 42 "/usr/include/c++/4.7/cwchar" 3 # 1 "/usr/include/wchar.h" 1 3 4 # 37 "/usr/include/wchar.h" 3 4 # 1 "/usr/include/stdio.h" 1 3 4 # 45 "/usr/include/stdio.h" 3 4 struct _IO_FILE; typedef struct _IO_FILE FILE; # 65 "/usr/include/stdio.h" 3 4 typedef struct _IO_FILE __FILE; # 38 "/usr/include/wchar.h" 2 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stdarg.h" 1 3 4 # 40 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stdarg.h" 3 4 typedef __builtin_va_list __gnuc_va_list; # 41 "/usr/include/wchar.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/wchar.h" 1 3 4 # 43 "/usr/include/wchar.h" 2 3 4 # 52 "/usr/include/wchar.h" 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 213 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 3 4 typedef unsigned int size_t; # 354 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 3 4 typedef unsigned int wint_t; # 53 "/usr/include/wchar.h" 2 3 4 # 83 "/usr/include/wchar.h" 3 4 typedef struct { int __count; union { unsigned int __wch; char __wchb[4]; } __value; } __mbstate_t; # 104 "/usr/include/wchar.h" 3 4 typedef __mbstate_t mbstate_t; # 129 "/usr/include/wchar.h" 3 4 extern "C" { struct tm; extern wchar_t *wcscpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw (); extern wchar_t *wcsncpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw (); extern wchar_t *wcscat (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw (); extern wchar_t *wcsncat (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw (); extern int wcscmp (__const wchar_t *__s1, __const wchar_t *__s2) throw () __attribute__ ((__pure__)); extern int wcsncmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n) throw () __attribute__ ((__pure__)); extern int wcscasecmp (__const wchar_t *__s1, __const wchar_t *__s2) throw (); extern int wcsncasecmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n) throw (); # 1 "/usr/include/xlocale.h" 1 3 4 # 28 "/usr/include/xlocale.h" 3 4 typedef struct __locale_struct { struct __locale_data *__locales[13]; const unsigned short int *__ctype_b; const int *__ctype_tolower; const int *__ctype_toupper; const char *__names[13]; } *__locale_t; typedef __locale_t locale_t; # 178 "/usr/include/wchar.h" 2 3 4 extern int wcscasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2, __locale_t __loc) throw (); extern int wcsncasecmp_l (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n, __locale_t __loc) throw (); extern int wcscoll (__const wchar_t *__s1, __const wchar_t *__s2) throw (); extern size_t wcsxfrm (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw (); extern int wcscoll_l (__const wchar_t *__s1, __const wchar_t *__s2, __locale_t __loc) throw (); extern size_t wcsxfrm_l (wchar_t *__s1, __const wchar_t *__s2, size_t __n, __locale_t __loc) throw (); extern wchar_t *wcsdup (__const wchar_t *__s) throw () __attribute__ ((__malloc__)); extern "C++" wchar_t *wcschr (wchar_t *__wcs, wchar_t __wc) throw () __asm ("wcschr") __attribute__ ((__pure__)); extern "C++" __const wchar_t *wcschr (__const wchar_t *__wcs, wchar_t __wc) throw () __asm ("wcschr") __attribute__ ((__pure__)); extern "C++" wchar_t *wcsrchr (wchar_t *__wcs, wchar_t __wc) throw () __asm ("wcsrchr") __attribute__ ((__pure__)); extern "C++" __const wchar_t *wcsrchr (__const wchar_t *__wcs, wchar_t __wc) throw () __asm ("wcsrchr") __attribute__ ((__pure__)); extern wchar_t *wcschrnul (__const wchar_t *__s, wchar_t __wc) throw () __attribute__ ((__pure__)); extern size_t wcscspn (__const wchar_t *__wcs, __const wchar_t *__reject) throw () __attribute__ ((__pure__)); extern size_t wcsspn (__const wchar_t *__wcs, __const wchar_t *__accept) throw () __attribute__ ((__pure__)); extern "C++" wchar_t *wcspbrk (wchar_t *__wcs, __const wchar_t *__accept) throw () __asm ("wcspbrk") __attribute__ ((__pure__)); extern "C++" __const wchar_t *wcspbrk (__const wchar_t *__wcs, __const wchar_t *__accept) throw () __asm ("wcspbrk") __attribute__ ((__pure__)); extern "C++" wchar_t *wcsstr (wchar_t *__haystack, __const wchar_t *__needle) throw () __asm ("wcsstr") __attribute__ ((__pure__)); extern "C++" __const wchar_t *wcsstr (__const wchar_t *__haystack, __const wchar_t *__needle) throw () __asm ("wcsstr") __attribute__ ((__pure__)); extern wchar_t *wcstok (wchar_t *__restrict __s, __const wchar_t *__restrict __delim, wchar_t **__restrict __ptr) throw (); extern size_t wcslen (__const wchar_t *__s) throw () __attribute__ ((__pure__)); extern "C++" wchar_t *wcswcs (wchar_t *__haystack, __const wchar_t *__needle) throw () __asm ("wcswcs") __attribute__ ((__pure__)); extern "C++" __const wchar_t *wcswcs (__const wchar_t *__haystack, __const wchar_t *__needle) throw () __asm ("wcswcs") __attribute__ ((__pure__)); # 303 "/usr/include/wchar.h" 3 4 extern size_t wcsnlen (__const wchar_t *__s, size_t __maxlen) throw () __attribute__ ((__pure__)); extern "C++" wchar_t *wmemchr (wchar_t *__s, wchar_t __c, size_t __n) throw () __asm ("wmemchr") __attribute__ ((__pure__)); extern "C++" __const wchar_t *wmemchr (__const wchar_t *__s, wchar_t __c, size_t __n) throw () __asm ("wmemchr") __attribute__ ((__pure__)); extern int wmemcmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n) throw () __attribute__ ((__pure__)); extern wchar_t *wmemcpy (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw (); extern wchar_t *wmemmove (wchar_t *__s1, __const wchar_t *__s2, size_t __n) throw (); extern wchar_t *wmemset (wchar_t *__s, wchar_t __c, size_t __n) throw (); extern wchar_t *wmempcpy (wchar_t *__restrict __s1, __const wchar_t *__restrict __s2, size_t __n) throw (); extern wint_t btowc (int __c) throw (); extern int wctob (wint_t __c) throw (); extern int mbsinit (__const mbstate_t *__ps) throw () __attribute__ ((__pure__)); extern size_t mbrtowc (wchar_t *__restrict __pwc, __const char *__restrict __s, size_t __n, mbstate_t *__p) throw (); extern size_t wcrtomb (char *__restrict __s, wchar_t __wc, mbstate_t *__restrict __ps) throw (); extern size_t __mbrlen (__const char *__restrict __s, size_t __n, mbstate_t *__restrict __ps) throw (); extern size_t mbrlen (__const char *__restrict __s, size_t __n, mbstate_t *__restrict __ps) throw (); # 402 "/usr/include/wchar.h" 3 4 extern size_t mbsrtowcs (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw (); extern size_t wcsrtombs (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __len, mbstate_t *__restrict __ps) throw (); extern size_t mbsnrtowcs (wchar_t *__restrict __dst, __const char **__restrict __src, size_t __nmc, size_t __len, mbstate_t *__restrict __ps) throw (); extern size_t wcsnrtombs (char *__restrict __dst, __const wchar_t **__restrict __src, size_t __nwc, size_t __len, mbstate_t *__restrict __ps) throw (); extern int wcwidth (wchar_t __c) throw (); extern int wcswidth (__const wchar_t *__s, size_t __n) throw (); extern double wcstod (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw (); extern float wcstof (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw (); extern long double wcstold (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr) throw (); extern long int wcstol (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw (); extern unsigned long int wcstoul (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw (); __extension__ extern long long int wcstoll (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw (); __extension__ extern unsigned long long int wcstoull (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw (); __extension__ extern long long int wcstoq (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw (); __extension__ extern unsigned long long int wcstouq (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base) throw (); # 527 "/usr/include/wchar.h" 3 4 extern long int wcstol_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw (); extern unsigned long int wcstoul_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw (); __extension__ extern long long int wcstoll_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw (); __extension__ extern unsigned long long int wcstoull_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, int __base, __locale_t __loc) throw (); extern double wcstod_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, __locale_t __loc) throw (); extern float wcstof_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, __locale_t __loc) throw (); extern long double wcstold_l (__const wchar_t *__restrict __nptr, wchar_t **__restrict __endptr, __locale_t __loc) throw (); extern wchar_t *wcpcpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src) throw (); extern wchar_t *wcpncpy (wchar_t *__restrict __dest, __const wchar_t *__restrict __src, size_t __n) throw (); extern __FILE *open_wmemstream (wchar_t **__bufloc, size_t *__sizeloc) throw (); extern int fwide (__FILE *__fp, int __mode) throw (); extern int fwprintf (__FILE *__restrict __stream, __const wchar_t *__restrict __format, ...) ; extern int wprintf (__const wchar_t *__restrict __format, ...) ; extern int swprintf (wchar_t *__restrict __s, size_t __n, __const wchar_t *__restrict __format, ...) throw () ; extern int vfwprintf (__FILE *__restrict __s, __const wchar_t *__restrict __format, __gnuc_va_list __arg) ; extern int vwprintf (__const wchar_t *__restrict __format, __gnuc_va_list __arg) ; extern int vswprintf (wchar_t *__restrict __s, size_t __n, __const wchar_t *__restrict __format, __gnuc_va_list __arg) throw () ; extern int fwscanf (__FILE *__restrict __stream, __const wchar_t *__restrict __format, ...) ; extern int wscanf (__const wchar_t *__restrict __format, ...) ; extern int swscanf (__const wchar_t *__restrict __s, __const wchar_t *__restrict __format, ...) throw () ; # 677 "/usr/include/wchar.h" 3 4 extern int vfwscanf (__FILE *__restrict __s, __const wchar_t *__restrict __format, __gnuc_va_list __arg) ; extern int vwscanf (__const wchar_t *__restrict __format, __gnuc_va_list __arg) ; extern int vswscanf (__const wchar_t *__restrict __s, __const wchar_t *__restrict __format, __gnuc_va_list __arg) throw () ; # 733 "/usr/include/wchar.h" 3 4 extern wint_t fgetwc (__FILE *__stream); extern wint_t getwc (__FILE *__stream); extern wint_t getwchar (void); extern wint_t fputwc (wchar_t __wc, __FILE *__stream); extern wint_t putwc (wchar_t __wc, __FILE *__stream); extern wint_t putwchar (wchar_t __wc); extern wchar_t *fgetws (wchar_t *__restrict __ws, int __n, __FILE *__restrict __stream); extern int fputws (__const wchar_t *__restrict __ws, __FILE *__restrict __stream); extern wint_t ungetwc (wint_t __wc, __FILE *__stream); # 798 "/usr/include/wchar.h" 3 4 extern wint_t getwc_unlocked (__FILE *__stream); extern wint_t getwchar_unlocked (void); extern wint_t fgetwc_unlocked (__FILE *__stream); extern wint_t fputwc_unlocked (wchar_t __wc, __FILE *__stream); # 824 "/usr/include/wchar.h" 3 4 extern wint_t putwc_unlocked (wchar_t __wc, __FILE *__stream); extern wint_t putwchar_unlocked (wchar_t __wc); # 834 "/usr/include/wchar.h" 3 4 extern wchar_t *fgetws_unlocked (wchar_t *__restrict __ws, int __n, __FILE *__restrict __stream); extern int fputws_unlocked (__const wchar_t *__restrict __ws, __FILE *__restrict __stream); extern size_t wcsftime (wchar_t *__restrict __s, size_t __maxsize, __const wchar_t *__restrict __format, __const struct tm *__restrict __tp) throw (); extern size_t wcsftime_l (wchar_t *__restrict __s, size_t __maxsize, __const wchar_t *__restrict __format, __const struct tm *__restrict __tp, __locale_t __loc) throw (); # 888 "/usr/include/wchar.h" 3 4 } # 47 "/usr/include/c++/4.7/cwchar" 2 3 # 64 "/usr/include/c++/4.7/cwchar" 3 namespace std { using ::mbstate_t; } # 137 "/usr/include/c++/4.7/cwchar" 3 namespace std __attribute__ ((__visibility__ ("default"))) { using ::wint_t; using ::btowc; using ::fgetwc; using ::fgetws; using ::fputwc; using ::fputws; using ::fwide; using ::fwprintf; using ::fwscanf; using ::getwc; using ::getwchar; using ::mbrlen; using ::mbrtowc; using ::mbsinit; using ::mbsrtowcs; using ::putwc; using ::putwchar; using ::swprintf; using ::swscanf; using ::ungetwc; using ::vfwprintf; using ::vfwscanf; using ::vswprintf; using ::vswscanf; using ::vwprintf; using ::vwscanf; using ::wcrtomb; using ::wcscat; using ::wcscmp; using ::wcscoll; using ::wcscpy; using ::wcscspn; using ::wcsftime; using ::wcslen; using ::wcsncat; using ::wcsncmp; using ::wcsncpy; using ::wcsrtombs; using ::wcsspn; using ::wcstod; using ::wcstof; using ::wcstok; using ::wcstol; using ::wcstoul; using ::wcsxfrm; using ::wctob; using ::wmemcmp; using ::wmemcpy; using ::wmemmove; using ::wmemset; using ::wprintf; using ::wscanf; using ::wcschr; using ::wcspbrk; using ::wcsrchr; using ::wcsstr; using ::wmemchr; # 234 "/usr/include/c++/4.7/cwchar" 3 } namespace __gnu_cxx { using ::wcstold; # 259 "/usr/include/c++/4.7/cwchar" 3 using ::wcstoll; using ::wcstoull; } namespace std { using ::__gnu_cxx::wcstold; using ::__gnu_cxx::wcstoll; using ::__gnu_cxx::wcstoull; } # 43 "/usr/include/c++/4.7/bits/postypes.h" 2 3 # 70 "/usr/include/c++/4.7/bits/postypes.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 92 "/usr/include/c++/4.7/bits/postypes.h" 3 typedef long long streamoff; typedef ptrdiff_t streamsize; # 113 "/usr/include/c++/4.7/bits/postypes.h" 3 template<typename _StateT> class fpos { private: streamoff _M_off; _StateT _M_state; public: fpos() : _M_off(0), _M_state() { } # 135 "/usr/include/c++/4.7/bits/postypes.h" 3 fpos(streamoff __off) : _M_off(__off), _M_state() { } operator streamoff() const { return _M_off; } void state(_StateT __st) { _M_state = __st; } _StateT state() const { return _M_state; } fpos& operator+=(streamoff __off) { _M_off += __off; return *this; } fpos& operator-=(streamoff __off) { _M_off -= __off; return *this; } fpos operator+(streamoff __off) const { fpos __pos(*this); __pos += __off; return __pos; } fpos operator-(streamoff __off) const { fpos __pos(*this); __pos -= __off; return __pos; } streamoff operator-(const fpos& __other) const { return _M_off - __other._M_off; } }; template<typename _StateT> inline bool operator==(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) { return streamoff(__lhs) == streamoff(__rhs); } template<typename _StateT> inline bool operator!=(const fpos<_StateT>& __lhs, const fpos<_StateT>& __rhs) { return streamoff(__lhs) != streamoff(__rhs); } typedef fpos<mbstate_t> streampos; typedef fpos<mbstate_t> wstreampos; # 241 "/usr/include/c++/4.7/bits/postypes.h" 3 } # 43 "/usr/include/c++/4.7/iosfwd" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 76 "/usr/include/c++/4.7/iosfwd" 3 class ios_base; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_ios; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_streambuf; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_istream; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_ostream; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_iostream; template<typename _CharT, typename _Traits = char_traits<_CharT>, typename _Alloc = allocator<_CharT> > class basic_stringbuf; template<typename _CharT, typename _Traits = char_traits<_CharT>, typename _Alloc = allocator<_CharT> > class basic_istringstream; template<typename _CharT, typename _Traits = char_traits<_CharT>, typename _Alloc = allocator<_CharT> > class basic_ostringstream; template<typename _CharT, typename _Traits = char_traits<_CharT>, typename _Alloc = allocator<_CharT> > class basic_stringstream; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_filebuf; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_ifstream; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_ofstream; template<typename _CharT, typename _Traits = char_traits<_CharT> > class basic_fstream; template<typename _CharT, typename _Traits = char_traits<_CharT> > class istreambuf_iterator; template<typename _CharT, typename _Traits = char_traits<_CharT> > class ostreambuf_iterator; typedef basic_ios<char> ios; typedef basic_streambuf<char> streambuf; typedef basic_istream<char> istream; typedef basic_ostream<char> ostream; typedef basic_iostream<char> iostream; typedef basic_stringbuf<char> stringbuf; typedef basic_istringstream<char> istringstream; typedef basic_ostringstream<char> ostringstream; typedef basic_stringstream<char> stringstream; typedef basic_filebuf<char> filebuf; typedef basic_ifstream<char> ifstream; typedef basic_ofstream<char> ofstream; typedef basic_fstream<char> fstream; typedef basic_ios<wchar_t> wios; typedef basic_streambuf<wchar_t> wstreambuf; typedef basic_istream<wchar_t> wistream; typedef basic_ostream<wchar_t> wostream; typedef basic_iostream<wchar_t> wiostream; typedef basic_stringbuf<wchar_t> wstringbuf; typedef basic_istringstream<wchar_t> wistringstream; typedef basic_ostringstream<wchar_t> wostringstream; typedef basic_stringstream<wchar_t> wstringstream; typedef basic_filebuf<wchar_t> wfilebuf; typedef basic_ifstream<wchar_t> wifstream; typedef basic_ofstream<wchar_t> wofstream; typedef basic_fstream<wchar_t> wfstream; } # 40 "/usr/include/c++/4.7/ios" 2 3 # 1 "/usr/include/c++/4.7/bits/char_traits.h" 1 3 # 39 "/usr/include/c++/4.7/bits/char_traits.h" 3 # 40 "/usr/include/c++/4.7/bits/char_traits.h" 3 # 1 "/usr/include/c++/4.7/bits/stl_algobase.h" 1 3 # 61 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 # 1 "/usr/include/c++/4.7/bits/functexcept.h" 1 3 # 41 "/usr/include/c++/4.7/bits/functexcept.h" 3 # 1 "/usr/include/c++/4.7/bits/exception_defines.h" 1 3 # 42 "/usr/include/c++/4.7/bits/functexcept.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { void __throw_bad_exception(void) __attribute__((__noreturn__)); void __throw_bad_alloc(void) __attribute__((__noreturn__)); void __throw_bad_cast(void) __attribute__((__noreturn__)); void __throw_bad_typeid(void) __attribute__((__noreturn__)); void __throw_logic_error(const char*) __attribute__((__noreturn__)); void __throw_domain_error(const char*) __attribute__((__noreturn__)); void __throw_invalid_argument(const char*) __attribute__((__noreturn__)); void __throw_length_error(const char*) __attribute__((__noreturn__)); void __throw_out_of_range(const char*) __attribute__((__noreturn__)); void __throw_runtime_error(const char*) __attribute__((__noreturn__)); void __throw_range_error(const char*) __attribute__((__noreturn__)); void __throw_overflow_error(const char*) __attribute__((__noreturn__)); void __throw_underflow_error(const char*) __attribute__((__noreturn__)); void __throw_ios_failure(const char*) __attribute__((__noreturn__)); void __throw_system_error(int) __attribute__((__noreturn__)); void __throw_future_error(int) __attribute__((__noreturn__)); void __throw_bad_function_call() __attribute__((__noreturn__)); } # 62 "/usr/include/c++/4.7/bits/stl_algobase.h" 2 3 # 1 "/usr/include/c++/4.7/ext/numeric_traits.h" 1 3 # 32 "/usr/include/c++/4.7/ext/numeric_traits.h" 3 # 33 "/usr/include/c++/4.7/ext/numeric_traits.h" 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { # 54 "/usr/include/c++/4.7/ext/numeric_traits.h" 3 template<typename _Value> struct __numeric_traits_integer { static const _Value __min = (((_Value)(-1) < 0) ? (_Value)1 << (sizeof(_Value) * 8 - ((_Value)(-1) < 0)) : (_Value)0); static const _Value __max = (((_Value)(-1) < 0) ? (((((_Value)1 << ((sizeof(_Value) * 8 - ((_Value)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(_Value)0); static const bool __is_signed = ((_Value)(-1) < 0); static const int __digits = (sizeof(_Value) * 8 - ((_Value)(-1) < 0)); }; template<typename _Value> const _Value __numeric_traits_integer<_Value>::__min; template<typename _Value> const _Value __numeric_traits_integer<_Value>::__max; template<typename _Value> const bool __numeric_traits_integer<_Value>::__is_signed; template<typename _Value> const int __numeric_traits_integer<_Value>::__digits; # 99 "/usr/include/c++/4.7/ext/numeric_traits.h" 3 template<typename _Value> struct __numeric_traits_floating { static const int __max_digits10 = (2 + (std::__are_same<_Value, float>::__value ? 24 : std::__are_same<_Value, double>::__value ? 53 : 64) * 643L / 2136); static const bool __is_signed = true; static const int __digits10 = (std::__are_same<_Value, float>::__value ? 6 : std::__are_same<_Value, double>::__value ? 15 : 18); static const int __max_exponent10 = (std::__are_same<_Value, float>::__value ? 38 : std::__are_same<_Value, double>::__value ? 308 : 4932); }; template<typename _Value> const int __numeric_traits_floating<_Value>::__max_digits10; template<typename _Value> const bool __numeric_traits_floating<_Value>::__is_signed; template<typename _Value> const int __numeric_traits_floating<_Value>::__digits10; template<typename _Value> const int __numeric_traits_floating<_Value>::__max_exponent10; template<typename _Value> struct __numeric_traits : public __conditional_type<std::__is_integer<_Value>::__value, __numeric_traits_integer<_Value>, __numeric_traits_floating<_Value> >::__type { }; } # 65 "/usr/include/c++/4.7/bits/stl_algobase.h" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_pair.h" 1 3 # 61 "/usr/include/c++/4.7/bits/stl_pair.h" 3 # 1 "/usr/include/c++/4.7/bits/move.h" 1 3 # 34 "/usr/include/c++/4.7/bits/move.h" 3 # 1 "/usr/include/c++/4.7/bits/concept_check.h" 1 3 # 33 "/usr/include/c++/4.7/bits/concept_check.h" 3 # 34 "/usr/include/c++/4.7/bits/concept_check.h" 3 # 35 "/usr/include/c++/4.7/bits/move.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _Tp> inline _Tp* __addressof(_Tp& __r) { return reinterpret_cast<_Tp*> (&const_cast<char&>(reinterpret_cast<const volatile char&>(__r))); } } # 150 "/usr/include/c++/4.7/bits/move.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 165 "/usr/include/c++/4.7/bits/move.h" 3 template<typename _Tp> inline void swap(_Tp& __a, _Tp& __b) { _Tp __tmp = (__a); __a = (__b); __b = (__tmp); } template<typename _Tp, size_t _Nm> inline void swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) { for (size_t __n = 0; __n < _Nm; ++__n) swap(__a[__n], __b[__n]); } } # 62 "/usr/include/c++/4.7/bits/stl_pair.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 87 "/usr/include/c++/4.7/bits/stl_pair.h" 3 template<class _T1, class _T2> struct pair { typedef _T1 first_type; typedef _T2 second_type; _T1 first; _T2 second; pair() : first(), second() { } pair(const _T1& __a, const _T2& __b) : first(__a), second(__b) { } template<class _U1, class _U2> pair(const pair<_U1, _U2>& __p) : first(__p.first), second(__p.second) { } # 201 "/usr/include/c++/4.7/bits/stl_pair.h" 3 }; template<class _T1, class _T2> inline bool operator==(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return __x.first == __y.first && __x.second == __y.second; } template<class _T1, class _T2> inline bool operator<(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return __x.first < __y.first || (!(__y.first < __x.first) && __x.second < __y.second); } template<class _T1, class _T2> inline bool operator!=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return !(__x == __y); } template<class _T1, class _T2> inline bool operator>(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return __y < __x; } template<class _T1, class _T2> inline bool operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return !(__y < __x); } template<class _T1, class _T2> inline bool operator>=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y) { return !(__x < __y); } # 276 "/usr/include/c++/4.7/bits/stl_pair.h" 3 template<class _T1, class _T2> inline pair<_T1, _T2> make_pair(_T1 __x, _T2 __y) { return pair<_T1, _T2>(__x, __y); } } # 66 "/usr/include/c++/4.7/bits/stl_algobase.h" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_iterator_base_types.h" 1 3 # 63 "/usr/include/c++/4.7/bits/stl_iterator_base_types.h" 3 # 64 "/usr/include/c++/4.7/bits/stl_iterator_base_types.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 90 "/usr/include/c++/4.7/bits/stl_iterator_base_types.h" 3 struct input_iterator_tag { }; struct output_iterator_tag { }; struct forward_iterator_tag : public input_iterator_tag { }; struct bidirectional_iterator_tag : public forward_iterator_tag { }; struct random_access_iterator_tag : public bidirectional_iterator_tag { }; # 117 "/usr/include/c++/4.7/bits/stl_iterator_base_types.h" 3 template<typename _Category, typename _Tp, typename _Distance = ptrdiff_t, typename _Pointer = _Tp*, typename _Reference = _Tp&> struct iterator { typedef _Category iterator_category; typedef _Tp value_type; typedef _Distance difference_type; typedef _Pointer pointer; typedef _Reference reference; }; # 163 "/usr/include/c++/4.7/bits/stl_iterator_base_types.h" 3 template<typename _Iterator> struct iterator_traits { typedef typename _Iterator::iterator_category iterator_category; typedef typename _Iterator::value_type value_type; typedef typename _Iterator::difference_type difference_type; typedef typename _Iterator::pointer pointer; typedef typename _Iterator::reference reference; }; template<typename _Tp> struct iterator_traits<_Tp*> { typedef random_access_iterator_tag iterator_category; typedef _Tp value_type; typedef ptrdiff_t difference_type; typedef _Tp* pointer; typedef _Tp& reference; }; template<typename _Tp> struct iterator_traits<const _Tp*> { typedef random_access_iterator_tag iterator_category; typedef _Tp value_type; typedef ptrdiff_t difference_type; typedef const _Tp* pointer; typedef const _Tp& reference; }; template<typename _Iter> inline typename iterator_traits<_Iter>::iterator_category __iterator_category(const _Iter&) { return typename iterator_traits<_Iter>::iterator_category(); } template<typename _Iterator, bool _HasBase> struct _Iter_base { typedef _Iterator iterator_type; static iterator_type _S_base(_Iterator __it) { return __it; } }; template<typename _Iterator> struct _Iter_base<_Iterator, true> { typedef typename _Iterator::iterator_type iterator_type; static iterator_type _S_base(_Iterator __it) { return __it.base(); } }; } # 67 "/usr/include/c++/4.7/bits/stl_algobase.h" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_iterator_base_funcs.h" 1 3 # 63 "/usr/include/c++/4.7/bits/stl_iterator_base_funcs.h" 3 # 64 "/usr/include/c++/4.7/bits/stl_iterator_base_funcs.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _InputIterator> inline typename iterator_traits<_InputIterator>::difference_type __distance(_InputIterator __first, _InputIterator __last, input_iterator_tag) { typename iterator_traits<_InputIterator>::difference_type __n = 0; while (__first != __last) { ++__first; ++__n; } return __n; } template<typename _RandomAccessIterator> inline typename iterator_traits<_RandomAccessIterator>::difference_type __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) { return __last - __first; } # 112 "/usr/include/c++/4.7/bits/stl_iterator_base_funcs.h" 3 template<typename _InputIterator> inline typename iterator_traits<_InputIterator>::difference_type distance(_InputIterator __first, _InputIterator __last) { return std::__distance(__first, __last, std::__iterator_category(__first)); } template<typename _InputIterator, typename _Distance> inline void __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) { while (__n--) ++__i; } template<typename _BidirectionalIterator, typename _Distance> inline void __advance(_BidirectionalIterator& __i, _Distance __n, bidirectional_iterator_tag) { if (__n > 0) while (__n--) ++__i; else while (__n++) --__i; } template<typename _RandomAccessIterator, typename _Distance> inline void __advance(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) { __i += __n; } # 170 "/usr/include/c++/4.7/bits/stl_iterator_base_funcs.h" 3 template<typename _InputIterator, typename _Distance> inline void advance(_InputIterator& __i, _Distance __n) { typename iterator_traits<_InputIterator>::difference_type __d = __n; std::__advance(__i, __d, std::__iterator_category(__i)); } # 201 "/usr/include/c++/4.7/bits/stl_iterator_base_funcs.h" 3 } # 68 "/usr/include/c++/4.7/bits/stl_algobase.h" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_iterator.h" 1 3 # 69 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 97 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Iterator> class reverse_iterator : public iterator<typename iterator_traits<_Iterator>::iterator_category, typename iterator_traits<_Iterator>::value_type, typename iterator_traits<_Iterator>::difference_type, typename iterator_traits<_Iterator>::pointer, typename iterator_traits<_Iterator>::reference> { protected: _Iterator current; typedef iterator_traits<_Iterator> __traits_type; public: typedef _Iterator iterator_type; typedef typename __traits_type::difference_type difference_type; typedef typename __traits_type::pointer pointer; typedef typename __traits_type::reference reference; reverse_iterator() : current() { } explicit reverse_iterator(iterator_type __x) : current(__x) { } reverse_iterator(const reverse_iterator& __x) : current(__x.current) { } template<typename _Iter> reverse_iterator(const reverse_iterator<_Iter>& __x) : current(__x.base()) { } iterator_type base() const { return current; } # 161 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 reference operator*() const { _Iterator __tmp = current; return *--__tmp; } pointer operator->() const { return &(operator*()); } reverse_iterator& operator++() { --current; return *this; } reverse_iterator operator++(int) { reverse_iterator __tmp = *this; --current; return __tmp; } reverse_iterator& operator--() { ++current; return *this; } reverse_iterator operator--(int) { reverse_iterator __tmp = *this; ++current; return __tmp; } reverse_iterator operator+(difference_type __n) const { return reverse_iterator(current - __n); } reverse_iterator& operator+=(difference_type __n) { current -= __n; return *this; } reverse_iterator operator-(difference_type __n) const { return reverse_iterator(current + __n); } reverse_iterator& operator-=(difference_type __n) { current += __n; return *this; } reference operator[](difference_type __n) const { return *(*this + __n); } }; # 291 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Iterator> inline bool operator==(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) { return __x.base() == __y.base(); } template<typename _Iterator> inline bool operator<(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) { return __y.base() < __x.base(); } template<typename _Iterator> inline bool operator!=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) { return !(__x == __y); } template<typename _Iterator> inline bool operator>(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) { return __y < __x; } template<typename _Iterator> inline bool operator<=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) { return !(__y < __x); } template<typename _Iterator> inline bool operator>=(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) { return !(__x < __y); } template<typename _Iterator> inline typename reverse_iterator<_Iterator>::difference_type operator-(const reverse_iterator<_Iterator>& __x, const reverse_iterator<_Iterator>& __y) { return __y.base() - __x.base(); } template<typename _Iterator> inline reverse_iterator<_Iterator> operator+(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) { return reverse_iterator<_Iterator>(__x.base() - __n); } template<typename _IteratorL, typename _IteratorR> inline bool operator==(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) { return __x.base() == __y.base(); } template<typename _IteratorL, typename _IteratorR> inline bool operator<(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) { return __y.base() < __x.base(); } template<typename _IteratorL, typename _IteratorR> inline bool operator!=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) { return !(__x == __y); } template<typename _IteratorL, typename _IteratorR> inline bool operator>(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) { return __y < __x; } template<typename _IteratorL, typename _IteratorR> inline bool operator<=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) { return !(__y < __x); } template<typename _IteratorL, typename _IteratorR> inline bool operator>=(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) { return !(__x < __y); } template<typename _IteratorL, typename _IteratorR> inline typename reverse_iterator<_IteratorL>::difference_type operator-(const reverse_iterator<_IteratorL>& __x, const reverse_iterator<_IteratorR>& __y) { return __y.base() - __x.base(); } # 403 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Container> class back_insert_iterator : public iterator<output_iterator_tag, void, void, void, void> { protected: _Container* container; public: typedef _Container container_type; explicit back_insert_iterator(_Container& __x) : container(&__x) { } # 430 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 back_insert_iterator& operator=(typename _Container::const_reference __value) { container->push_back(__value); return *this; } # 453 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 back_insert_iterator& operator*() { return *this; } back_insert_iterator& operator++() { return *this; } back_insert_iterator operator++(int) { return *this; } }; # 479 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Container> inline back_insert_iterator<_Container> back_inserter(_Container& __x) { return back_insert_iterator<_Container>(__x); } # 494 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Container> class front_insert_iterator : public iterator<output_iterator_tag, void, void, void, void> { protected: _Container* container; public: typedef _Container container_type; explicit front_insert_iterator(_Container& __x) : container(&__x) { } # 520 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 front_insert_iterator& operator=(typename _Container::const_reference __value) { container->push_front(__value); return *this; } # 543 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 front_insert_iterator& operator*() { return *this; } front_insert_iterator& operator++() { return *this; } front_insert_iterator operator++(int) { return *this; } }; # 569 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Container> inline front_insert_iterator<_Container> front_inserter(_Container& __x) { return front_insert_iterator<_Container>(__x); } # 588 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Container> class insert_iterator : public iterator<output_iterator_tag, void, void, void, void> { protected: _Container* container; typename _Container::iterator iter; public: typedef _Container container_type; insert_iterator(_Container& __x, typename _Container::iterator __i) : container(&__x), iter(__i) {} # 631 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 insert_iterator& operator=(typename _Container::const_reference __value) { iter = container->insert(iter, __value); ++iter; return *this; } # 657 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 insert_iterator& operator*() { return *this; } insert_iterator& operator++() { return *this; } insert_iterator& operator++(int) { return *this; } }; # 683 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _Container, typename _Iterator> inline insert_iterator<_Container> inserter(_Container& __x, _Iterator __i) { return insert_iterator<_Container>(__x, typename _Container::iterator(__i)); } } namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { # 707 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 using std::iterator_traits; using std::iterator; template<typename _Iterator, typename _Container> class __normal_iterator { protected: _Iterator _M_current; typedef iterator_traits<_Iterator> __traits_type; public: typedef _Iterator iterator_type; typedef typename __traits_type::iterator_category iterator_category; typedef typename __traits_type::value_type value_type; typedef typename __traits_type::difference_type difference_type; typedef typename __traits_type::reference reference; typedef typename __traits_type::pointer pointer; __normal_iterator() : _M_current(_Iterator()) { } explicit __normal_iterator(const _Iterator& __i) : _M_current(__i) { } template<typename _Iter> __normal_iterator(const __normal_iterator<_Iter, typename __enable_if< (std::__are_same<_Iter, typename _Container::pointer>::__value), _Container>::__type>& __i) : _M_current(__i.base()) { } reference operator*() const { return *_M_current; } pointer operator->() const { return _M_current; } __normal_iterator& operator++() { ++_M_current; return *this; } __normal_iterator operator++(int) { return __normal_iterator(_M_current++); } __normal_iterator& operator--() { --_M_current; return *this; } __normal_iterator operator--(int) { return __normal_iterator(_M_current--); } reference operator[](const difference_type& __n) const { return _M_current[__n]; } __normal_iterator& operator+=(const difference_type& __n) { _M_current += __n; return *this; } __normal_iterator operator+(const difference_type& __n) const { return __normal_iterator(_M_current + __n); } __normal_iterator& operator-=(const difference_type& __n) { _M_current -= __n; return *this; } __normal_iterator operator-(const difference_type& __n) const { return __normal_iterator(_M_current - __n); } const _Iterator& base() const { return _M_current; } }; # 805 "/usr/include/c++/4.7/bits/stl_iterator.h" 3 template<typename _IteratorL, typename _IteratorR, typename _Container> inline bool operator==(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) { return __lhs.base() == __rhs.base(); } template<typename _Iterator, typename _Container> inline bool operator==(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) { return __lhs.base() == __rhs.base(); } template<typename _IteratorL, typename _IteratorR, typename _Container> inline bool operator!=(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) { return __lhs.base() != __rhs.base(); } template<typename _Iterator, typename _Container> inline bool operator!=(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) { return __lhs.base() != __rhs.base(); } template<typename _IteratorL, typename _IteratorR, typename _Container> inline bool operator<(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) { return __lhs.base() < __rhs.base(); } template<typename _Iterator, typename _Container> inline bool operator<(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) { return __lhs.base() < __rhs.base(); } template<typename _IteratorL, typename _IteratorR, typename _Container> inline bool operator>(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) { return __lhs.base() > __rhs.base(); } template<typename _Iterator, typename _Container> inline bool operator>(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) { return __lhs.base() > __rhs.base(); } template<typename _IteratorL, typename _IteratorR, typename _Container> inline bool operator<=(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) { return __lhs.base() <= __rhs.base(); } template<typename _Iterator, typename _Container> inline bool operator<=(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) { return __lhs.base() <= __rhs.base(); } template<typename _IteratorL, typename _IteratorR, typename _Container> inline bool operator>=(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) { return __lhs.base() >= __rhs.base(); } template<typename _Iterator, typename _Container> inline bool operator>=(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) { return __lhs.base() >= __rhs.base(); } template<typename _IteratorL, typename _IteratorR, typename _Container> inline typename __normal_iterator<_IteratorL, _Container>::difference_type operator-(const __normal_iterator<_IteratorL, _Container>& __lhs, const __normal_iterator<_IteratorR, _Container>& __rhs) { return __lhs.base() - __rhs.base(); } template<typename _Iterator, typename _Container> inline typename __normal_iterator<_Iterator, _Container>::difference_type operator-(const __normal_iterator<_Iterator, _Container>& __lhs, const __normal_iterator<_Iterator, _Container>& __rhs) { return __lhs.base() - __rhs.base(); } template<typename _Iterator, typename _Container> inline __normal_iterator<_Iterator, _Container> operator+(typename __normal_iterator<_Iterator, _Container>::difference_type __n, const __normal_iterator<_Iterator, _Container>& __i) { return __normal_iterator<_Iterator, _Container>(__i.base() + __n); } } # 69 "/usr/include/c++/4.7/bits/stl_algobase.h" 2 3 # 1 "/usr/include/c++/4.7/debug/debug.h" 1 3 # 47 "/usr/include/c++/4.7/debug/debug.h" 3 namespace std { namespace __debug { } } namespace __gnu_debug { using namespace std::__debug; } # 71 "/usr/include/c++/4.7/bits/stl_algobase.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<bool _BoolType> struct __iter_swap { template<typename _ForwardIterator1, typename _ForwardIterator2> static void iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) { typedef typename iterator_traits<_ForwardIterator1>::value_type _ValueType1; _ValueType1 __tmp = (*__a); *__a = (*__b); *__b = (__tmp); } }; template<> struct __iter_swap<true> { template<typename _ForwardIterator1, typename _ForwardIterator2> static void iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) { swap(*__a, *__b); } }; # 116 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _ForwardIterator1, typename _ForwardIterator2> inline void iter_swap(_ForwardIterator1 __a, _ForwardIterator2 __b) { typedef typename iterator_traits<_ForwardIterator1>::value_type _ValueType1; typedef typename iterator_traits<_ForwardIterator2>::value_type _ValueType2; typedef typename iterator_traits<_ForwardIterator1>::reference _ReferenceType1; typedef typename iterator_traits<_ForwardIterator2>::reference _ReferenceType2; std::__iter_swap<__are_same<_ValueType1, _ValueType2>::__value && __are_same<_ValueType1&, _ReferenceType1>::__value && __are_same<_ValueType2&, _ReferenceType2>::__value>:: iter_swap(__a, __b); } # 157 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _ForwardIterator1, typename _ForwardIterator2> _ForwardIterator2 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { ; for (; __first1 != __last1; ++__first1, ++__first2) std::iter_swap(__first1, __first2); return __first2; } # 185 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _Tp> inline const _Tp& min(const _Tp& __a, const _Tp& __b) { if (__b < __a) return __b; return __a; } # 208 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _Tp> inline const _Tp& max(const _Tp& __a, const _Tp& __b) { if (__a < __b) return __b; return __a; } # 231 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _Tp, typename _Compare> inline const _Tp& min(const _Tp& __a, const _Tp& __b, _Compare __comp) { if (__comp(__b, __a)) return __b; return __a; } # 252 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _Tp, typename _Compare> inline const _Tp& max(const _Tp& __a, const _Tp& __b, _Compare __comp) { if (__comp(__a, __b)) return __b; return __a; } template<typename _Iterator> struct _Niter_base : _Iter_base<_Iterator, __is_normal_iterator<_Iterator>::__value> { }; template<typename _Iterator> inline typename _Niter_base<_Iterator>::iterator_type __niter_base(_Iterator __it) { return std::_Niter_base<_Iterator>::_S_base(__it); } template<typename _Iterator> struct _Miter_base : _Iter_base<_Iterator, __is_move_iterator<_Iterator>::__value> { }; template<typename _Iterator> inline typename _Miter_base<_Iterator>::iterator_type __miter_base(_Iterator __it) { return std::_Miter_base<_Iterator>::_S_base(__it); } template<bool, bool, typename> struct __copy_move { template<typename _II, typename _OI> static _OI __copy_m(_II __first, _II __last, _OI __result) { for (; __first != __last; ++__result, ++__first) *__result = *__first; return __result; } }; # 319 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<> struct __copy_move<false, false, random_access_iterator_tag> { template<typename _II, typename _OI> static _OI __copy_m(_II __first, _II __last, _OI __result) { typedef typename iterator_traits<_II>::difference_type _Distance; for(_Distance __n = __last - __first; __n > 0; --__n) { *__result = *__first; ++__first; ++__result; } return __result; } }; # 357 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<bool _IsMove> struct __copy_move<_IsMove, true, random_access_iterator_tag> { template<typename _Tp> static _Tp* __copy_m(const _Tp* __first, const _Tp* __last, _Tp* __result) { const ptrdiff_t _Num = __last - __first; if (_Num) __builtin_memmove(__result, __first, sizeof(_Tp) * _Num); return __result + _Num; } }; template<bool _IsMove, typename _II, typename _OI> inline _OI __copy_move_a(_II __first, _II __last, _OI __result) { typedef typename iterator_traits<_II>::value_type _ValueTypeI; typedef typename iterator_traits<_OI>::value_type _ValueTypeO; typedef typename iterator_traits<_II>::iterator_category _Category; const bool __simple = (__is_trivial(_ValueTypeI) && __is_pointer<_II>::__value && __is_pointer<_OI>::__value && __are_same<_ValueTypeI, _ValueTypeO>::__value); return std::__copy_move<_IsMove, __simple, _Category>::__copy_m(__first, __last, __result); } template<typename _CharT> struct char_traits; template<typename _CharT, typename _Traits> class istreambuf_iterator; template<typename _CharT, typename _Traits> class ostreambuf_iterator; template<bool _IsMove, typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type __copy_move_a2(_CharT*, _CharT*, ostreambuf_iterator<_CharT, char_traits<_CharT> >); template<bool _IsMove, typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, ostreambuf_iterator<_CharT, char_traits<_CharT> > >::__type __copy_move_a2(const _CharT*, const _CharT*, ostreambuf_iterator<_CharT, char_traits<_CharT> >); template<bool _IsMove, typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, _CharT*>::__type __copy_move_a2(istreambuf_iterator<_CharT, char_traits<_CharT> >, istreambuf_iterator<_CharT, char_traits<_CharT> >, _CharT*); template<bool _IsMove, typename _II, typename _OI> inline _OI __copy_move_a2(_II __first, _II __last, _OI __result) { return _OI(std::__copy_move_a<_IsMove>(std::__niter_base(__first), std::__niter_base(__last), std::__niter_base(__result))); } # 442 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _II, typename _OI> inline _OI copy(_II __first, _II __last, _OI __result) { ; return (std::__copy_move_a2<__is_move_iterator<_II>::__value> (std::__miter_base(__first), std::__miter_base(__last), __result)); } # 494 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<bool, bool, typename> struct __copy_move_backward { template<typename _BI1, typename _BI2> static _BI2 __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) { while (__first != __last) *--__result = *--__last; return __result; } }; # 522 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<> struct __copy_move_backward<false, false, random_access_iterator_tag> { template<typename _BI1, typename _BI2> static _BI2 __copy_move_b(_BI1 __first, _BI1 __last, _BI2 __result) { typename iterator_traits<_BI1>::difference_type __n; for (__n = __last - __first; __n > 0; --__n) *--__result = *--__last; return __result; } }; # 552 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<bool _IsMove> struct __copy_move_backward<_IsMove, true, random_access_iterator_tag> { template<typename _Tp> static _Tp* __copy_move_b(const _Tp* __first, const _Tp* __last, _Tp* __result) { const ptrdiff_t _Num = __last - __first; if (_Num) __builtin_memmove(__result - _Num, __first, sizeof(_Tp) * _Num); return __result - _Num; } }; template<bool _IsMove, typename _BI1, typename _BI2> inline _BI2 __copy_move_backward_a(_BI1 __first, _BI1 __last, _BI2 __result) { typedef typename iterator_traits<_BI1>::value_type _ValueType1; typedef typename iterator_traits<_BI2>::value_type _ValueType2; typedef typename iterator_traits<_BI1>::iterator_category _Category; const bool __simple = (__is_trivial(_ValueType1) && __is_pointer<_BI1>::__value && __is_pointer<_BI2>::__value && __are_same<_ValueType1, _ValueType2>::__value); return std::__copy_move_backward<_IsMove, __simple, _Category>::__copy_move_b(__first, __last, __result); } template<bool _IsMove, typename _BI1, typename _BI2> inline _BI2 __copy_move_backward_a2(_BI1 __first, _BI1 __last, _BI2 __result) { return _BI2(std::__copy_move_backward_a<_IsMove> (std::__niter_base(__first), std::__niter_base(__last), std::__niter_base(__result))); } # 611 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _BI1, typename _BI2> inline _BI2 copy_backward(_BI1 __first, _BI1 __last, _BI2 __result) { ; return (std::__copy_move_backward_a2<__is_move_iterator<_BI1>::__value> (std::__miter_base(__first), std::__miter_base(__last), __result)); } # 669 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _ForwardIterator, typename _Tp> inline typename __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, void>::__type __fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { for (; __first != __last; ++__first) *__first = __value; } template<typename _ForwardIterator, typename _Tp> inline typename __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, void>::__type __fill_a(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { const _Tp __tmp = __value; for (; __first != __last; ++__first) *__first = __tmp; } template<typename _Tp> inline typename __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, void>::__type __fill_a(_Tp* __first, _Tp* __last, const _Tp& __c) { const _Tp __tmp = __c; __builtin_memset(__first, static_cast<unsigned char>(__tmp), __last - __first); } # 713 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _ForwardIterator, typename _Tp> inline void fill(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { ; std::__fill_a(std::__niter_base(__first), std::__niter_base(__last), __value); } template<typename _OutputIterator, typename _Size, typename _Tp> inline typename __gnu_cxx::__enable_if<!__is_scalar<_Tp>::__value, _OutputIterator>::__type __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) { for (__decltype(__n + 0) __niter = __n; __niter > 0; --__niter, ++__first) *__first = __value; return __first; } template<typename _OutputIterator, typename _Size, typename _Tp> inline typename __gnu_cxx::__enable_if<__is_scalar<_Tp>::__value, _OutputIterator>::__type __fill_n_a(_OutputIterator __first, _Size __n, const _Tp& __value) { const _Tp __tmp = __value; for (__decltype(__n + 0) __niter = __n; __niter > 0; --__niter, ++__first) *__first = __tmp; return __first; } template<typename _Size, typename _Tp> inline typename __gnu_cxx::__enable_if<__is_byte<_Tp>::__value, _Tp*>::__type __fill_n_a(_Tp* __first, _Size __n, const _Tp& __c) { std::__fill_a(__first, __first + __n, __c); return __first + __n; } # 773 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _OI, typename _Size, typename _Tp> inline _OI fill_n(_OI __first, _Size __n, const _Tp& __value) { return _OI(std::__fill_n_a(std::__niter_base(__first), __n, __value)); } template<bool _BoolType> struct __equal { template<typename _II1, typename _II2> static bool equal(_II1 __first1, _II1 __last1, _II2 __first2) { for (; __first1 != __last1; ++__first1, ++__first2) if (!(*__first1 == *__first2)) return false; return true; } }; template<> struct __equal<true> { template<typename _Tp> static bool equal(const _Tp* __first1, const _Tp* __last1, const _Tp* __first2) { return !__builtin_memcmp(__first1, __first2, sizeof(_Tp) * (__last1 - __first1)); } }; template<typename _II1, typename _II2> inline bool __equal_aux(_II1 __first1, _II1 __last1, _II2 __first2) { typedef typename iterator_traits<_II1>::value_type _ValueType1; typedef typename iterator_traits<_II2>::value_type _ValueType2; const bool __simple = ((__is_integer<_ValueType1>::__value || __is_pointer<_ValueType1>::__value) && __is_pointer<_II1>::__value && __is_pointer<_II2>::__value && __are_same<_ValueType1, _ValueType2>::__value); return std::__equal<__simple>::equal(__first1, __last1, __first2); } template<typename, typename> struct __lc_rai { template<typename _II1, typename _II2> static _II1 __newlast1(_II1, _II1 __last1, _II2, _II2) { return __last1; } template<typename _II> static bool __cnd2(_II __first, _II __last) { return __first != __last; } }; template<> struct __lc_rai<random_access_iterator_tag, random_access_iterator_tag> { template<typename _RAI1, typename _RAI2> static _RAI1 __newlast1(_RAI1 __first1, _RAI1 __last1, _RAI2 __first2, _RAI2 __last2) { const typename iterator_traits<_RAI1>::difference_type __diff1 = __last1 - __first1; const typename iterator_traits<_RAI2>::difference_type __diff2 = __last2 - __first2; return __diff2 < __diff1 ? __first1 + __diff2 : __last1; } template<typename _RAI> static bool __cnd2(_RAI, _RAI) { return true; } }; template<bool _BoolType> struct __lexicographical_compare { template<typename _II1, typename _II2> static bool __lc(_II1, _II1, _II2, _II2); }; template<bool _BoolType> template<typename _II1, typename _II2> bool __lexicographical_compare<_BoolType>:: __lc(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) { typedef typename iterator_traits<_II1>::iterator_category _Category1; typedef typename iterator_traits<_II2>::iterator_category _Category2; typedef std::__lc_rai<_Category1, _Category2> __rai_type; __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); ++__first1, ++__first2) { if (*__first1 < *__first2) return true; if (*__first2 < *__first1) return false; } return __first1 == __last1 && __first2 != __last2; } template<> struct __lexicographical_compare<true> { template<typename _Tp, typename _Up> static bool __lc(const _Tp* __first1, const _Tp* __last1, const _Up* __first2, const _Up* __last2) { const size_t __len1 = __last1 - __first1; const size_t __len2 = __last2 - __first2; const int __result = __builtin_memcmp(__first1, __first2, std::min(__len1, __len2)); return __result != 0 ? __result < 0 : __len1 < __len2; } }; template<typename _II1, typename _II2> inline bool __lexicographical_compare_aux(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) { typedef typename iterator_traits<_II1>::value_type _ValueType1; typedef typename iterator_traits<_II2>::value_type _ValueType2; const bool __simple = (__is_byte<_ValueType1>::__value && __is_byte<_ValueType2>::__value && !__gnu_cxx::__numeric_traits<_ValueType1>::__is_signed && !__gnu_cxx::__numeric_traits<_ValueType2>::__is_signed && __is_pointer<_II1>::__value && __is_pointer<_II2>::__value); return std::__lexicographical_compare<__simple>::__lc(__first1, __last1, __first2, __last2); } # 935 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _ForwardIterator, typename _Tp> _ForwardIterator lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; typedef typename iterator_traits<_ForwardIterator>::difference_type _DistanceType; ; _DistanceType __len = std::distance(__first, __last); while (__len > 0) { _DistanceType __half = __len >> 1; _ForwardIterator __middle = __first; std::advance(__middle, __half); if (*__middle < __val) { __first = __middle; ++__first; __len = __len - __half - 1; } else __len = __half; } return __first; } template<typename _Size> inline _Size __lg(_Size __n) { _Size __k; for (__k = 0; __n != 0; __n >>= 1) ++__k; return __k - 1; } inline int __lg(int __n) { return sizeof(int) * 8 - 1 - __builtin_clz(__n); } inline unsigned __lg(unsigned __n) { return sizeof(int) * 8 - 1 - __builtin_clz(__n); } inline long __lg(long __n) { return sizeof(long) * 8 - 1 - __builtin_clzl(__n); } inline unsigned long __lg(unsigned long __n) { return sizeof(long) * 8 - 1 - __builtin_clzl(__n); } inline long long __lg(long long __n) { return sizeof(long long) * 8 - 1 - __builtin_clzll(__n); } inline unsigned long long __lg(unsigned long long __n) { return sizeof(long long) * 8 - 1 - __builtin_clzll(__n); } # 1021 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _II1, typename _II2> inline bool equal(_II1 __first1, _II1 __last1, _II2 __first2) { ; return std::__equal_aux(std::__niter_base(__first1), std::__niter_base(__last1), std::__niter_base(__first2)); } # 1053 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> inline bool equal(_IIter1 __first1, _IIter1 __last1, _IIter2 __first2, _BinaryPredicate __binary_pred) { ; for (; __first1 != __last1; ++__first1, ++__first2) if (!bool(__binary_pred(*__first1, *__first2))) return false; return true; } # 1084 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _II1, typename _II2> inline bool lexicographical_compare(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2) { typedef typename iterator_traits<_II1>::value_type _ValueType1; typedef typename iterator_traits<_II2>::value_type _ValueType2; ; ; return std::__lexicographical_compare_aux(std::__niter_base(__first1), std::__niter_base(__last1), std::__niter_base(__first2), std::__niter_base(__last2)); } # 1118 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _II1, typename _II2, typename _Compare> bool lexicographical_compare(_II1 __first1, _II1 __last1, _II2 __first2, _II2 __last2, _Compare __comp) { typedef typename iterator_traits<_II1>::iterator_category _Category1; typedef typename iterator_traits<_II2>::iterator_category _Category2; typedef std::__lc_rai<_Category1, _Category2> __rai_type; ; ; __last1 = __rai_type::__newlast1(__first1, __last1, __first2, __last2); for (; __first1 != __last1 && __rai_type::__cnd2(__first2, __last2); ++__first1, ++__first2) { if (__comp(*__first1, *__first2)) return true; if (__comp(*__first2, *__first1)) return false; } return __first1 == __last1 && __first2 != __last2; } # 1158 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _InputIterator1, typename _InputIterator2> pair<_InputIterator1, _InputIterator2> mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { ; while (__first1 != __last1 && *__first1 == *__first2) { ++__first1; ++__first2; } return pair<_InputIterator1, _InputIterator2>(__first1, __first2); } # 1195 "/usr/include/c++/4.7/bits/stl_algobase.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _BinaryPredicate> pair<_InputIterator1, _InputIterator2> mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate __binary_pred) { ; while (__first1 != __last1 && bool(__binary_pred(*__first1, *__first2))) { ++__first1; ++__first2; } return pair<_InputIterator1, _InputIterator2>(__first1, __first2); } } # 42 "/usr/include/c++/4.7/bits/char_traits.h" 2 3 # 1 "/usr/include/c++/4.7/cwchar" 1 3 # 41 "/usr/include/c++/4.7/cwchar" 3 # 42 "/usr/include/c++/4.7/cwchar" 3 # 1 "/usr/include/wchar.h" 1 3 4 # 47 "/usr/include/c++/4.7/cwchar" 2 3 # 44 "/usr/include/c++/4.7/bits/char_traits.h" 2 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { # 59 "/usr/include/c++/4.7/bits/char_traits.h" 3 template<typename _CharT> struct _Char_types { typedef unsigned long int_type; typedef std::streampos pos_type; typedef std::streamoff off_type; typedef std::mbstate_t state_type; }; # 84 "/usr/include/c++/4.7/bits/char_traits.h" 3 template<typename _CharT> struct char_traits { typedef _CharT char_type; typedef typename _Char_types<_CharT>::int_type int_type; typedef typename _Char_types<_CharT>::pos_type pos_type; typedef typename _Char_types<_CharT>::off_type off_type; typedef typename _Char_types<_CharT>::state_type state_type; static void assign(char_type& __c1, const char_type& __c2) { __c1 = __c2; } static bool eq(const char_type& __c1, const char_type& __c2) { return __c1 == __c2; } static bool lt(const char_type& __c1, const char_type& __c2) { return __c1 < __c2; } static int compare(const char_type* __s1, const char_type* __s2, std::size_t __n); static std::size_t length(const char_type* __s); static const char_type* find(const char_type* __s, std::size_t __n, const char_type& __a); static char_type* move(char_type* __s1, const char_type* __s2, std::size_t __n); static char_type* copy(char_type* __s1, const char_type* __s2, std::size_t __n); static char_type* assign(char_type* __s, std::size_t __n, char_type __a); static char_type to_char_type(const int_type& __c) { return static_cast<char_type>(__c); } static int_type to_int_type(const char_type& __c) { return static_cast<int_type>(__c); } static bool eq_int_type(const int_type& __c1, const int_type& __c2) { return __c1 == __c2; } static int_type eof() { return static_cast<int_type>(-1); } static int_type not_eof(const int_type& __c) { return !eq_int_type(__c, eof()) ? __c : to_int_type(char_type()); } }; template<typename _CharT> int char_traits<_CharT>:: compare(const char_type* __s1, const char_type* __s2, std::size_t __n) { for (std::size_t __i = 0; __i < __n; ++__i) if (lt(__s1[__i], __s2[__i])) return -1; else if (lt(__s2[__i], __s1[__i])) return 1; return 0; } template<typename _CharT> std::size_t char_traits<_CharT>:: length(const char_type* __p) { std::size_t __i = 0; while (!eq(__p[__i], char_type())) ++__i; return __i; } template<typename _CharT> const typename char_traits<_CharT>::char_type* char_traits<_CharT>:: find(const char_type* __s, std::size_t __n, const char_type& __a) { for (std::size_t __i = 0; __i < __n; ++__i) if (eq(__s[__i], __a)) return __s + __i; return 0; } template<typename _CharT> typename char_traits<_CharT>::char_type* char_traits<_CharT>:: move(char_type* __s1, const char_type* __s2, std::size_t __n) { return static_cast<_CharT*>(__builtin_memmove(__s1, __s2, __n * sizeof(char_type))); } template<typename _CharT> typename char_traits<_CharT>::char_type* char_traits<_CharT>:: copy(char_type* __s1, const char_type* __s2, std::size_t __n) { std::copy(__s2, __s2 + __n, __s1); return __s1; } template<typename _CharT> typename char_traits<_CharT>::char_type* char_traits<_CharT>:: assign(char_type* __s, std::size_t __n, char_type __a) { std::fill_n(__s, __n, __a); return __s; } } namespace std __attribute__ ((__visibility__ ("default"))) { # 228 "/usr/include/c++/4.7/bits/char_traits.h" 3 template<class _CharT> struct char_traits : public __gnu_cxx::char_traits<_CharT> { }; template<> struct char_traits<char> { typedef char char_type; typedef int int_type; typedef streampos pos_type; typedef streamoff off_type; typedef mbstate_t state_type; static void assign(char_type& __c1, const char_type& __c2) { __c1 = __c2; } static bool eq(const char_type& __c1, const char_type& __c2) { return __c1 == __c2; } static bool lt(const char_type& __c1, const char_type& __c2) { return __c1 < __c2; } static int compare(const char_type* __s1, const char_type* __s2, size_t __n) { return __builtin_memcmp(__s1, __s2, __n); } static size_t length(const char_type* __s) { return __builtin_strlen(__s); } static const char_type* find(const char_type* __s, size_t __n, const char_type& __a) { return static_cast<const char_type*>(__builtin_memchr(__s, __a, __n)); } static char_type* move(char_type* __s1, const char_type* __s2, size_t __n) { return static_cast<char_type*>(__builtin_memmove(__s1, __s2, __n)); } static char_type* copy(char_type* __s1, const char_type* __s2, size_t __n) { return static_cast<char_type*>(__builtin_memcpy(__s1, __s2, __n)); } static char_type* assign(char_type* __s, size_t __n, char_type __a) { return static_cast<char_type*>(__builtin_memset(__s, __a, __n)); } static char_type to_char_type(const int_type& __c) { return static_cast<char_type>(__c); } static int_type to_int_type(const char_type& __c) { return static_cast<int_type>(static_cast<unsigned char>(__c)); } static bool eq_int_type(const int_type& __c1, const int_type& __c2) { return __c1 == __c2; } static int_type eof() { return static_cast<int_type>(-1); } static int_type not_eof(const int_type& __c) { return (__c == eof()) ? 0 : __c; } }; template<> struct char_traits<wchar_t> { typedef wchar_t char_type; typedef wint_t int_type; typedef streamoff off_type; typedef wstreampos pos_type; typedef mbstate_t state_type; static void assign(char_type& __c1, const char_type& __c2) { __c1 = __c2; } static bool eq(const char_type& __c1, const char_type& __c2) { return __c1 == __c2; } static bool lt(const char_type& __c1, const char_type& __c2) { return __c1 < __c2; } static int compare(const char_type* __s1, const char_type* __s2, size_t __n) { return wmemcmp(__s1, __s2, __n); } static size_t length(const char_type* __s) { return wcslen(__s); } static const char_type* find(const char_type* __s, size_t __n, const char_type& __a) { return wmemchr(__s, __a, __n); } static char_type* move(char_type* __s1, const char_type* __s2, size_t __n) { return wmemmove(__s1, __s2, __n); } static char_type* copy(char_type* __s1, const char_type* __s2, size_t __n) { return wmemcpy(__s1, __s2, __n); } static char_type* assign(char_type* __s, size_t __n, char_type __a) { return wmemset(__s, __a, __n); } static char_type to_char_type(const int_type& __c) { return char_type(__c); } static int_type to_int_type(const char_type& __c) { return int_type(__c); } static bool eq_int_type(const int_type& __c1, const int_type& __c2) { return __c1 == __c2; } static int_type eof() { return static_cast<int_type>((0xffffffffu)); } static int_type not_eof(const int_type& __c) { return eq_int_type(__c, eof()) ? 0 : __c; } }; } # 42 "/usr/include/c++/4.7/ios" 2 3 # 1 "/usr/include/c++/4.7/bits/localefwd.h" 1 3 # 39 "/usr/include/c++/4.7/bits/localefwd.h" 3 # 40 "/usr/include/c++/4.7/bits/localefwd.h" 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++locale.h" 1 3 # 40 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++locale.h" 3 # 41 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++locale.h" 3 # 1 "/usr/include/c++/4.7/clocale" 1 3 # 41 "/usr/include/c++/4.7/clocale" 3 # 42 "/usr/include/c++/4.7/clocale" 3 # 1 "/usr/include/locale.h" 1 3 4 # 29 "/usr/include/locale.h" 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 30 "/usr/include/locale.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/locale.h" 1 3 4 # 27 "/usr/include/i386-linux-gnu/bits/locale.h" 3 4 enum { __LC_CTYPE = 0, __LC_NUMERIC = 1, __LC_TIME = 2, __LC_COLLATE = 3, __LC_MONETARY = 4, __LC_MESSAGES = 5, __LC_ALL = 6, __LC_PAPER = 7, __LC_NAME = 8, __LC_ADDRESS = 9, __LC_TELEPHONE = 10, __LC_MEASUREMENT = 11, __LC_IDENTIFICATION = 12 }; # 31 "/usr/include/locale.h" 2 3 4 extern "C" { # 51 "/usr/include/locale.h" 3 4 struct lconv { char *decimal_point; char *thousands_sep; char *grouping; char *int_curr_symbol; char *currency_symbol; char *mon_decimal_point; char *mon_thousands_sep; char *mon_grouping; char *positive_sign; char *negative_sign; char int_frac_digits; char frac_digits; char p_cs_precedes; char p_sep_by_space; char n_cs_precedes; char n_sep_by_space; char p_sign_posn; char n_sign_posn; char int_p_cs_precedes; char int_p_sep_by_space; char int_n_cs_precedes; char int_n_sep_by_space; char int_p_sign_posn; char int_n_sign_posn; # 121 "/usr/include/locale.h" 3 4 }; extern char *setlocale (int __category, __const char *__locale) throw (); extern struct lconv *localeconv (void) throw (); # 152 "/usr/include/locale.h" 3 4 extern __locale_t newlocale (int __category_mask, __const char *__locale, __locale_t __base) throw (); # 187 "/usr/include/locale.h" 3 4 extern __locale_t duplocale (__locale_t __dataset) throw (); extern void freelocale (__locale_t __dataset) throw (); extern __locale_t uselocale (__locale_t __dataset) throw (); } # 45 "/usr/include/c++/4.7/clocale" 2 3 # 53 "/usr/include/c++/4.7/clocale" 3 namespace std { using ::lconv; using ::setlocale; using ::localeconv; } # 43 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++locale.h" 2 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { extern "C" __typeof(uselocale) __uselocale; } namespace std __attribute__ ((__visibility__ ("default"))) { typedef __locale_t __c_locale; inline int __convert_from_v(const __c_locale& __cloc __attribute__ ((__unused__)), char* __out, const int __size __attribute__ ((__unused__)), const char* __fmt, ...) { __c_locale __old = __gnu_cxx::__uselocale(__cloc); # 89 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++locale.h" 3 __builtin_va_list __args; __builtin_va_start(__args, __fmt); const int __ret = __builtin_vsnprintf(__out, __size, __fmt, __args); __builtin_va_end(__args); __gnu_cxx::__uselocale(__old); return __ret; } } # 43 "/usr/include/c++/4.7/bits/localefwd.h" 2 3 # 1 "/usr/include/c++/4.7/cctype" 1 3 # 41 "/usr/include/c++/4.7/cctype" 3 # 42 "/usr/include/c++/4.7/cctype" 3 # 1 "/usr/include/ctype.h" 1 3 4 # 28 "/usr/include/ctype.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/types.h" 1 3 4 # 28 "/usr/include/i386-linux-gnu/bits/types.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/wordsize.h" 1 3 4 # 29 "/usr/include/i386-linux-gnu/bits/types.h" 2 3 4 typedef unsigned char __u_char; typedef unsigned short int __u_short; typedef unsigned int __u_int; typedef unsigned long int __u_long; typedef signed char __int8_t; typedef unsigned char __uint8_t; typedef signed short int __int16_t; typedef unsigned short int __uint16_t; typedef signed int __int32_t; typedef unsigned int __uint32_t; __extension__ typedef signed long long int __int64_t; __extension__ typedef unsigned long long int __uint64_t; __extension__ typedef long long int __quad_t; __extension__ typedef unsigned long long int __u_quad_t; # 131 "/usr/include/i386-linux-gnu/bits/types.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/typesizes.h" 1 3 4 # 132 "/usr/include/i386-linux-gnu/bits/types.h" 2 3 4 __extension__ typedef __u_quad_t __dev_t; __extension__ typedef unsigned int __uid_t; __extension__ typedef unsigned int __gid_t; __extension__ typedef unsigned long int __ino_t; __extension__ typedef __u_quad_t __ino64_t; __extension__ typedef unsigned int __mode_t; __extension__ typedef unsigned int __nlink_t; __extension__ typedef long int __off_t; __extension__ typedef __quad_t __off64_t; __extension__ typedef int __pid_t; __extension__ typedef struct { int __val[2]; } __fsid_t; __extension__ typedef long int __clock_t; __extension__ typedef unsigned long int __rlim_t; __extension__ typedef __u_quad_t __rlim64_t; __extension__ typedef unsigned int __id_t; __extension__ typedef long int __time_t; __extension__ typedef unsigned int __useconds_t; __extension__ typedef long int __suseconds_t; __extension__ typedef int __daddr_t; __extension__ typedef long int __swblk_t; __extension__ typedef int __key_t; __extension__ typedef int __clockid_t; __extension__ typedef void * __timer_t; __extension__ typedef long int __blksize_t; __extension__ typedef long int __blkcnt_t; __extension__ typedef __quad_t __blkcnt64_t; __extension__ typedef unsigned long int __fsblkcnt_t; __extension__ typedef __u_quad_t __fsblkcnt64_t; __extension__ typedef unsigned long int __fsfilcnt_t; __extension__ typedef __u_quad_t __fsfilcnt64_t; __extension__ typedef int __ssize_t; typedef __off64_t __loff_t; typedef __quad_t *__qaddr_t; typedef char *__caddr_t; __extension__ typedef int __intptr_t; __extension__ typedef unsigned int __socklen_t; # 29 "/usr/include/ctype.h" 2 3 4 extern "C" { # 41 "/usr/include/ctype.h" 3 4 # 1 "/usr/include/endian.h" 1 3 4 # 37 "/usr/include/endian.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/endian.h" 1 3 4 # 38 "/usr/include/endian.h" 2 3 4 # 61 "/usr/include/endian.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/byteswap.h" 1 3 4 # 62 "/usr/include/endian.h" 2 3 4 # 42 "/usr/include/ctype.h" 2 3 4 enum { _ISupper = ((0) < 8 ? ((1 << (0)) << 8) : ((1 << (0)) >> 8)), _ISlower = ((1) < 8 ? ((1 << (1)) << 8) : ((1 << (1)) >> 8)), _ISalpha = ((2) < 8 ? ((1 << (2)) << 8) : ((1 << (2)) >> 8)), _ISdigit = ((3) < 8 ? ((1 << (3)) << 8) : ((1 << (3)) >> 8)), _ISxdigit = ((4) < 8 ? ((1 << (4)) << 8) : ((1 << (4)) >> 8)), _ISspace = ((5) < 8 ? ((1 << (5)) << 8) : ((1 << (5)) >> 8)), _ISprint = ((6) < 8 ? ((1 << (6)) << 8) : ((1 << (6)) >> 8)), _ISgraph = ((7) < 8 ? ((1 << (7)) << 8) : ((1 << (7)) >> 8)), _ISblank = ((8) < 8 ? ((1 << (8)) << 8) : ((1 << (8)) >> 8)), _IScntrl = ((9) < 8 ? ((1 << (9)) << 8) : ((1 << (9)) >> 8)), _ISpunct = ((10) < 8 ? ((1 << (10)) << 8) : ((1 << (10)) >> 8)), _ISalnum = ((11) < 8 ? ((1 << (11)) << 8) : ((1 << (11)) >> 8)) }; # 81 "/usr/include/ctype.h" 3 4 extern __const unsigned short int **__ctype_b_loc (void) throw () __attribute__ ((__const)); extern __const __int32_t **__ctype_tolower_loc (void) throw () __attribute__ ((__const)); extern __const __int32_t **__ctype_toupper_loc (void) throw () __attribute__ ((__const)); # 106 "/usr/include/ctype.h" 3 4 extern int isalnum (int) throw (); extern int isalpha (int) throw (); extern int iscntrl (int) throw (); extern int isdigit (int) throw (); extern int islower (int) throw (); extern int isgraph (int) throw (); extern int isprint (int) throw (); extern int ispunct (int) throw (); extern int isspace (int) throw (); extern int isupper (int) throw (); extern int isxdigit (int) throw (); extern int tolower (int __c) throw (); extern int toupper (int __c) throw (); extern int isblank (int) throw (); extern int isctype (int __c, int __mask) throw (); extern int isascii (int __c) throw (); extern int toascii (int __c) throw (); extern int _toupper (int) throw (); extern int _tolower (int) throw (); # 273 "/usr/include/ctype.h" 3 4 extern int isalnum_l (int, __locale_t) throw (); extern int isalpha_l (int, __locale_t) throw (); extern int iscntrl_l (int, __locale_t) throw (); extern int isdigit_l (int, __locale_t) throw (); extern int islower_l (int, __locale_t) throw (); extern int isgraph_l (int, __locale_t) throw (); extern int isprint_l (int, __locale_t) throw (); extern int ispunct_l (int, __locale_t) throw (); extern int isspace_l (int, __locale_t) throw (); extern int isupper_l (int, __locale_t) throw (); extern int isxdigit_l (int, __locale_t) throw (); extern int isblank_l (int, __locale_t) throw (); extern int __tolower_l (int __c, __locale_t __l) throw (); extern int tolower_l (int __c, __locale_t __l) throw (); extern int __toupper_l (int __c, __locale_t __l) throw (); extern int toupper_l (int __c, __locale_t __l) throw (); # 349 "/usr/include/ctype.h" 3 4 } # 45 "/usr/include/c++/4.7/cctype" 2 3 # 64 "/usr/include/c++/4.7/cctype" 3 namespace std { using ::isalnum; using ::isalpha; using ::iscntrl; using ::isdigit; using ::isgraph; using ::islower; using ::isprint; using ::ispunct; using ::isspace; using ::isupper; using ::isxdigit; using ::tolower; using ::toupper; } # 45 "/usr/include/c++/4.7/bits/localefwd.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 57 "/usr/include/c++/4.7/bits/localefwd.h" 3 class locale; template<typename _Facet> bool has_facet(const locale&) throw(); template<typename _Facet> const _Facet& use_facet(const locale&); template<typename _CharT> bool isspace(_CharT, const locale&); template<typename _CharT> bool isprint(_CharT, const locale&); template<typename _CharT> bool iscntrl(_CharT, const locale&); template<typename _CharT> bool isupper(_CharT, const locale&); template<typename _CharT> bool islower(_CharT, const locale&); template<typename _CharT> bool isalpha(_CharT, const locale&); template<typename _CharT> bool isdigit(_CharT, const locale&); template<typename _CharT> bool ispunct(_CharT, const locale&); template<typename _CharT> bool isxdigit(_CharT, const locale&); template<typename _CharT> bool isalnum(_CharT, const locale&); template<typename _CharT> bool isgraph(_CharT, const locale&); template<typename _CharT> _CharT toupper(_CharT, const locale&); template<typename _CharT> _CharT tolower(_CharT, const locale&); class ctype_base; template<typename _CharT> class ctype; template<> class ctype<char>; template<> class ctype<wchar_t>; template<typename _CharT> class ctype_byname; class codecvt_base; template<typename _InternT, typename _ExternT, typename _StateT> class codecvt; template<> class codecvt<char, char, mbstate_t>; template<> class codecvt<wchar_t, char, mbstate_t>; template<typename _InternT, typename _ExternT, typename _StateT> class codecvt_byname; template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > class num_get; template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > class num_put; template<typename _CharT> class numpunct; template<typename _CharT> class numpunct_byname; template<typename _CharT> class collate; template<typename _CharT> class collate_byname; class time_base; template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > class time_get; template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > class time_get_byname; template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > class time_put; template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > class time_put_byname; class money_base; template<typename _CharT, typename _InIter = istreambuf_iterator<_CharT> > class money_get; template<typename _CharT, typename _OutIter = ostreambuf_iterator<_CharT> > class money_put; template<typename _CharT, bool _Intl = false> class moneypunct; template<typename _CharT, bool _Intl = false> class moneypunct_byname; class messages_base; template<typename _CharT> class messages; template<typename _CharT> class messages_byname; } # 43 "/usr/include/c++/4.7/ios" 2 3 # 1 "/usr/include/c++/4.7/bits/ios_base.h" 1 3 # 39 "/usr/include/c++/4.7/bits/ios_base.h" 3 # 40 "/usr/include/c++/4.7/bits/ios_base.h" 3 # 1 "/usr/include/c++/4.7/ext/atomicity.h" 1 3 # 34 "/usr/include/c++/4.7/ext/atomicity.h" 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr.h" 1 3 # 31 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr.h" 3 #pragma GCC visibility push(default) # 150 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr.h" 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 1 3 # 41 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 # 1 "/usr/include/pthread.h" 1 3 4 # 25 "/usr/include/pthread.h" 3 4 # 1 "/usr/include/sched.h" 1 3 4 # 30 "/usr/include/sched.h" 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 31 "/usr/include/sched.h" 2 3 4 # 1 "/usr/include/time.h" 1 3 4 # 74 "/usr/include/time.h" 3 4 typedef __time_t time_t; # 120 "/usr/include/time.h" 3 4 struct timespec { __time_t tv_sec; long int tv_nsec; }; # 35 "/usr/include/sched.h" 2 3 4 typedef __pid_t pid_t; # 1 "/usr/include/i386-linux-gnu/bits/sched.h" 1 3 4 # 74 "/usr/include/i386-linux-gnu/bits/sched.h" 3 4 struct sched_param { int __sched_priority; }; extern "C" { extern int clone (int (*__fn) (void *__arg), void *__child_stack, int __flags, void *__arg, ...) throw (); extern int unshare (int __flags) throw (); extern int sched_getcpu (void) throw (); extern int setns (int __fd, int __nstype) throw (); } struct __sched_param { int __sched_priority; }; # 120 "/usr/include/i386-linux-gnu/bits/sched.h" 3 4 typedef unsigned long int __cpu_mask; typedef struct { __cpu_mask __bits[1024 / (8 * sizeof (__cpu_mask))]; } cpu_set_t; # 203 "/usr/include/i386-linux-gnu/bits/sched.h" 3 4 extern "C" { extern int __sched_cpucount (size_t __setsize, const cpu_set_t *__setp) throw (); extern cpu_set_t *__sched_cpualloc (size_t __count) throw () ; extern void __sched_cpufree (cpu_set_t *__set) throw (); } # 44 "/usr/include/sched.h" 2 3 4 extern "C" { extern int sched_setparam (__pid_t __pid, __const struct sched_param *__param) throw (); extern int sched_getparam (__pid_t __pid, struct sched_param *__param) throw (); extern int sched_setscheduler (__pid_t __pid, int __policy, __const struct sched_param *__param) throw (); extern int sched_getscheduler (__pid_t __pid) throw (); extern int sched_yield (void) throw (); extern int sched_get_priority_max (int __algorithm) throw (); extern int sched_get_priority_min (int __algorithm) throw (); extern int sched_rr_get_interval (__pid_t __pid, struct timespec *__t) throw (); # 118 "/usr/include/sched.h" 3 4 extern int sched_setaffinity (__pid_t __pid, size_t __cpusetsize, __const cpu_set_t *__cpuset) throw (); extern int sched_getaffinity (__pid_t __pid, size_t __cpusetsize, cpu_set_t *__cpuset) throw (); } # 26 "/usr/include/pthread.h" 2 3 4 # 1 "/usr/include/time.h" 1 3 4 # 30 "/usr/include/time.h" 3 4 extern "C" { # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 39 "/usr/include/time.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/time.h" 1 3 4 # 31 "/usr/include/i386-linux-gnu/bits/time.h" 3 4 struct timeval { __time_t tv_sec; __suseconds_t tv_usec; }; # 86 "/usr/include/i386-linux-gnu/bits/time.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/timex.h" 1 3 4 # 24 "/usr/include/i386-linux-gnu/bits/timex.h" 3 4 struct timex { unsigned int modes; long int offset; long int freq; long int maxerror; long int esterror; int status; long int constant; long int precision; long int tolerance; struct timeval time; long int tick; long int ppsfreq; long int jitter; int shift; long int stabil; long int jitcnt; long int calcnt; long int errcnt; long int stbcnt; int tai; int :32; int :32; int :32; int :32; int :32; int :32; int :32; int :32; int :32; int :32; int :32; }; # 87 "/usr/include/i386-linux-gnu/bits/time.h" 2 3 4 extern "C" { extern int clock_adjtime (__clockid_t __clock_id, struct timex *__utx) throw (); } # 43 "/usr/include/time.h" 2 3 4 # 58 "/usr/include/time.h" 3 4 typedef __clock_t clock_t; # 92 "/usr/include/time.h" 3 4 typedef __clockid_t clockid_t; # 104 "/usr/include/time.h" 3 4 typedef __timer_t timer_t; # 131 "/usr/include/time.h" 3 4 struct tm { int tm_sec; int tm_min; int tm_hour; int tm_mday; int tm_mon; int tm_year; int tm_wday; int tm_yday; int tm_isdst; long int tm_gmtoff; __const char *tm_zone; }; struct itimerspec { struct timespec it_interval; struct timespec it_value; }; struct sigevent; # 180 "/usr/include/time.h" 3 4 extern clock_t clock (void) throw (); extern time_t time (time_t *__timer) throw (); extern double difftime (time_t __time1, time_t __time0) throw () __attribute__ ((__const__)); extern time_t mktime (struct tm *__tp) throw (); extern size_t strftime (char *__restrict __s, size_t __maxsize, __const char *__restrict __format, __const struct tm *__restrict __tp) throw (); extern char *strptime (__const char *__restrict __s, __const char *__restrict __fmt, struct tm *__tp) throw (); extern size_t strftime_l (char *__restrict __s, size_t __maxsize, __const char *__restrict __format, __const struct tm *__restrict __tp, __locale_t __loc) throw (); extern char *strptime_l (__const char *__restrict __s, __const char *__restrict __fmt, struct tm *__tp, __locale_t __loc) throw (); extern struct tm *gmtime (__const time_t *__timer) throw (); extern struct tm *localtime (__const time_t *__timer) throw (); extern struct tm *gmtime_r (__const time_t *__restrict __timer, struct tm *__restrict __tp) throw (); extern struct tm *localtime_r (__const time_t *__restrict __timer, struct tm *__restrict __tp) throw (); extern char *asctime (__const struct tm *__tp) throw (); extern char *ctime (__const time_t *__timer) throw (); extern char *asctime_r (__const struct tm *__restrict __tp, char *__restrict __buf) throw (); extern char *ctime_r (__const time_t *__restrict __timer, char *__restrict __buf) throw (); extern char *__tzname[2]; extern int __daylight; extern long int __timezone; extern char *tzname[2]; extern void tzset (void) throw (); extern int daylight; extern long int timezone; extern int stime (__const time_t *__when) throw (); # 313 "/usr/include/time.h" 3 4 extern time_t timegm (struct tm *__tp) throw (); extern time_t timelocal (struct tm *__tp) throw (); extern int dysize (int __year) throw () __attribute__ ((__const__)); # 328 "/usr/include/time.h" 3 4 extern int nanosleep (__const struct timespec *__requested_time, struct timespec *__remaining); extern int clock_getres (clockid_t __clock_id, struct timespec *__res) throw (); extern int clock_gettime (clockid_t __clock_id, struct timespec *__tp) throw (); extern int clock_settime (clockid_t __clock_id, __const struct timespec *__tp) throw (); extern int clock_nanosleep (clockid_t __clock_id, int __flags, __const struct timespec *__req, struct timespec *__rem); extern int clock_getcpuclockid (pid_t __pid, clockid_t *__clock_id) throw (); extern int timer_create (clockid_t __clock_id, struct sigevent *__restrict __evp, timer_t *__restrict __timerid) throw (); extern int timer_delete (timer_t __timerid) throw (); extern int timer_settime (timer_t __timerid, int __flags, __const struct itimerspec *__restrict __value, struct itimerspec *__restrict __ovalue) throw (); extern int timer_gettime (timer_t __timerid, struct itimerspec *__value) throw (); extern int timer_getoverrun (timer_t __timerid) throw (); # 390 "/usr/include/time.h" 3 4 extern int getdate_err; # 399 "/usr/include/time.h" 3 4 extern struct tm *getdate (__const char *__string); # 413 "/usr/include/time.h" 3 4 extern int getdate_r (__const char *__restrict __string, struct tm *__restrict __resbufp); } # 27 "/usr/include/pthread.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/pthreadtypes.h" 1 3 4 # 36 "/usr/include/i386-linux-gnu/bits/pthreadtypes.h" 3 4 typedef unsigned long int pthread_t; typedef union { char __size[36]; long int __align; } pthread_attr_t; typedef struct __pthread_internal_slist { struct __pthread_internal_slist *__next; } __pthread_slist_t; typedef union { struct __pthread_mutex_s { int __lock; unsigned int __count; int __owner; int __kind; unsigned int __nusers; __extension__ union { int __spins; __pthread_slist_t __list; }; } __data; char __size[24]; long int __align; } pthread_mutex_t; typedef union { char __size[4]; long int __align; } pthread_mutexattr_t; typedef union { struct { int __lock; unsigned int __futex; __extension__ unsigned long long int __total_seq; __extension__ unsigned long long int __wakeup_seq; __extension__ unsigned long long int __woken_seq; void *__mutex; unsigned int __nwaiters; unsigned int __broadcast_seq; } __data; char __size[48]; __extension__ long long int __align; } pthread_cond_t; typedef union { char __size[4]; long int __align; } pthread_condattr_t; typedef unsigned int pthread_key_t; typedef int pthread_once_t; typedef union { struct { int __lock; unsigned int __nr_readers; unsigned int __readers_wakeup; unsigned int __writer_wakeup; unsigned int __nr_readers_queued; unsigned int __nr_writers_queued; unsigned char __flags; unsigned char __shared; unsigned char __pad1; unsigned char __pad2; int __writer; } __data; char __size[32]; long int __align; } pthread_rwlock_t; typedef union { char __size[8]; long int __align; } pthread_rwlockattr_t; typedef volatile int pthread_spinlock_t; typedef union { char __size[20]; long int __align; } pthread_barrier_t; typedef union { char __size[4]; int __align; } pthread_barrierattr_t; # 29 "/usr/include/pthread.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/setjmp.h" 1 3 4 # 29 "/usr/include/i386-linux-gnu/bits/setjmp.h" 3 4 typedef int __jmp_buf[6]; # 30 "/usr/include/pthread.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/wordsize.h" 1 3 4 # 31 "/usr/include/pthread.h" 2 3 4 enum { PTHREAD_CREATE_JOINABLE, PTHREAD_CREATE_DETACHED }; enum { PTHREAD_MUTEX_TIMED_NP, PTHREAD_MUTEX_RECURSIVE_NP, PTHREAD_MUTEX_ERRORCHECK_NP, PTHREAD_MUTEX_ADAPTIVE_NP , PTHREAD_MUTEX_NORMAL = PTHREAD_MUTEX_TIMED_NP, PTHREAD_MUTEX_RECURSIVE = PTHREAD_MUTEX_RECURSIVE_NP, PTHREAD_MUTEX_ERRORCHECK = PTHREAD_MUTEX_ERRORCHECK_NP, PTHREAD_MUTEX_DEFAULT = PTHREAD_MUTEX_NORMAL , PTHREAD_MUTEX_FAST_NP = PTHREAD_MUTEX_TIMED_NP }; enum { PTHREAD_MUTEX_STALLED, PTHREAD_MUTEX_STALLED_NP = PTHREAD_MUTEX_STALLED, PTHREAD_MUTEX_ROBUST, PTHREAD_MUTEX_ROBUST_NP = PTHREAD_MUTEX_ROBUST }; enum { PTHREAD_PRIO_NONE, PTHREAD_PRIO_INHERIT, PTHREAD_PRIO_PROTECT }; # 115 "/usr/include/pthread.h" 3 4 enum { PTHREAD_RWLOCK_PREFER_READER_NP, PTHREAD_RWLOCK_PREFER_WRITER_NP, PTHREAD_RWLOCK_PREFER_WRITER_NONRECURSIVE_NP, PTHREAD_RWLOCK_DEFAULT_NP = PTHREAD_RWLOCK_PREFER_READER_NP }; # 147 "/usr/include/pthread.h" 3 4 enum { PTHREAD_INHERIT_SCHED, PTHREAD_EXPLICIT_SCHED }; enum { PTHREAD_SCOPE_SYSTEM, PTHREAD_SCOPE_PROCESS }; enum { PTHREAD_PROCESS_PRIVATE, PTHREAD_PROCESS_SHARED }; # 182 "/usr/include/pthread.h" 3 4 struct _pthread_cleanup_buffer { void (*__routine) (void *); void *__arg; int __canceltype; struct _pthread_cleanup_buffer *__prev; }; enum { PTHREAD_CANCEL_ENABLE, PTHREAD_CANCEL_DISABLE }; enum { PTHREAD_CANCEL_DEFERRED, PTHREAD_CANCEL_ASYNCHRONOUS }; # 220 "/usr/include/pthread.h" 3 4 extern "C" { extern int pthread_create (pthread_t *__restrict __newthread, __const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) throw () __attribute__ ((__nonnull__ (1, 3))); extern void pthread_exit (void *__retval) __attribute__ ((__noreturn__)); extern int pthread_join (pthread_t __th, void **__thread_return); extern int pthread_tryjoin_np (pthread_t __th, void **__thread_return) throw (); extern int pthread_timedjoin_np (pthread_t __th, void **__thread_return, __const struct timespec *__abstime); extern int pthread_detach (pthread_t __th) throw (); extern pthread_t pthread_self (void) throw () __attribute__ ((__const__)); extern int pthread_equal (pthread_t __thread1, pthread_t __thread2) throw (); extern int pthread_attr_init (pthread_attr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_destroy (pthread_attr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_getdetachstate (__const pthread_attr_t *__attr, int *__detachstate) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_setdetachstate (pthread_attr_t *__attr, int __detachstate) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_getguardsize (__const pthread_attr_t *__attr, size_t *__guardsize) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_setguardsize (pthread_attr_t *__attr, size_t __guardsize) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_getschedparam (__const pthread_attr_t *__restrict __attr, struct sched_param *__restrict __param) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_setschedparam (pthread_attr_t *__restrict __attr, __const struct sched_param *__restrict __param) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_getschedpolicy (__const pthread_attr_t *__restrict __attr, int *__restrict __policy) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_setschedpolicy (pthread_attr_t *__attr, int __policy) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_getinheritsched (__const pthread_attr_t *__restrict __attr, int *__restrict __inherit) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_setinheritsched (pthread_attr_t *__attr, int __inherit) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_getscope (__const pthread_attr_t *__restrict __attr, int *__restrict __scope) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_setscope (pthread_attr_t *__attr, int __scope) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_getstackaddr (__const pthread_attr_t *__restrict __attr, void **__restrict __stackaddr) throw () __attribute__ ((__nonnull__ (1, 2))) __attribute__ ((__deprecated__)); extern int pthread_attr_setstackaddr (pthread_attr_t *__attr, void *__stackaddr) throw () __attribute__ ((__nonnull__ (1))) __attribute__ ((__deprecated__)); extern int pthread_attr_getstacksize (__const pthread_attr_t *__restrict __attr, size_t *__restrict __stacksize) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_attr_setstacksize (pthread_attr_t *__attr, size_t __stacksize) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_getstack (__const pthread_attr_t *__restrict __attr, void **__restrict __stackaddr, size_t *__restrict __stacksize) throw () __attribute__ ((__nonnull__ (1, 2, 3))); extern int pthread_attr_setstack (pthread_attr_t *__attr, void *__stackaddr, size_t __stacksize) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_attr_setaffinity_np (pthread_attr_t *__attr, size_t __cpusetsize, __const cpu_set_t *__cpuset) throw () __attribute__ ((__nonnull__ (1, 3))); extern int pthread_attr_getaffinity_np (__const pthread_attr_t *__attr, size_t __cpusetsize, cpu_set_t *__cpuset) throw () __attribute__ ((__nonnull__ (1, 3))); extern int pthread_getattr_np (pthread_t __th, pthread_attr_t *__attr) throw () __attribute__ ((__nonnull__ (2))); extern int pthread_setschedparam (pthread_t __target_thread, int __policy, __const struct sched_param *__param) throw () __attribute__ ((__nonnull__ (3))); extern int pthread_getschedparam (pthread_t __target_thread, int *__restrict __policy, struct sched_param *__restrict __param) throw () __attribute__ ((__nonnull__ (2, 3))); extern int pthread_setschedprio (pthread_t __target_thread, int __prio) throw (); extern int pthread_getname_np (pthread_t __target_thread, char *__buf, size_t __buflen) throw () __attribute__ ((__nonnull__ (2))); extern int pthread_setname_np (pthread_t __target_thread, __const char *__name) throw () __attribute__ ((__nonnull__ (2))); extern int pthread_getconcurrency (void) throw (); extern int pthread_setconcurrency (int __level) throw (); extern int pthread_yield (void) throw (); extern int pthread_setaffinity_np (pthread_t __th, size_t __cpusetsize, __const cpu_set_t *__cpuset) throw () __attribute__ ((__nonnull__ (3))); extern int pthread_getaffinity_np (pthread_t __th, size_t __cpusetsize, cpu_set_t *__cpuset) throw () __attribute__ ((__nonnull__ (3))); # 478 "/usr/include/pthread.h" 3 4 extern int pthread_once (pthread_once_t *__once_control, void (*__init_routine) (void)) __attribute__ ((__nonnull__ (1, 2))); # 490 "/usr/include/pthread.h" 3 4 extern int pthread_setcancelstate (int __state, int *__oldstate); extern int pthread_setcanceltype (int __type, int *__oldtype); extern int pthread_cancel (pthread_t __th); extern void pthread_testcancel (void); typedef struct { struct { __jmp_buf __cancel_jmp_buf; int __mask_was_saved; } __cancel_jmp_buf[1]; void *__pad[4]; } __pthread_unwind_buf_t __attribute__ ((__aligned__)); # 524 "/usr/include/pthread.h" 3 4 struct __pthread_cleanup_frame { void (*__cancel_routine) (void *); void *__cancel_arg; int __do_it; int __cancel_type; }; class __pthread_cleanup_class { void (*__cancel_routine) (void *); void *__cancel_arg; int __do_it; int __cancel_type; public: __pthread_cleanup_class (void (*__fct) (void *), void *__arg) : __cancel_routine (__fct), __cancel_arg (__arg), __do_it (1) { } ~__pthread_cleanup_class () { if (__do_it) __cancel_routine (__cancel_arg); } void __setdoit (int __newval) { __do_it = __newval; } void __defer () { pthread_setcanceltype (PTHREAD_CANCEL_DEFERRED, &__cancel_type); } void __restore () const { pthread_setcanceltype (__cancel_type, 0); } }; # 726 "/usr/include/pthread.h" 3 4 struct __jmp_buf_tag; extern int __sigsetjmp (struct __jmp_buf_tag *__env, int __savemask) throw (); extern int pthread_mutex_init (pthread_mutex_t *__mutex, __const pthread_mutexattr_t *__mutexattr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutex_destroy (pthread_mutex_t *__mutex) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutex_trylock (pthread_mutex_t *__mutex) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutex_lock (pthread_mutex_t *__mutex) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutex_timedlock (pthread_mutex_t *__restrict __mutex, __const struct timespec *__restrict __abstime) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutex_unlock (pthread_mutex_t *__mutex) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutex_getprioceiling (__const pthread_mutex_t * __restrict __mutex, int *__restrict __prioceiling) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutex_setprioceiling (pthread_mutex_t *__restrict __mutex, int __prioceiling, int *__restrict __old_ceiling) throw () __attribute__ ((__nonnull__ (1, 3))); extern int pthread_mutex_consistent (pthread_mutex_t *__mutex) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutex_consistent_np (pthread_mutex_t *__mutex) throw () __attribute__ ((__nonnull__ (1))); # 790 "/usr/include/pthread.h" 3 4 extern int pthread_mutexattr_init (pthread_mutexattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutexattr_destroy (pthread_mutexattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutexattr_getpshared (__const pthread_mutexattr_t * __restrict __attr, int *__restrict __pshared) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutexattr_setpshared (pthread_mutexattr_t *__attr, int __pshared) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutexattr_gettype (__const pthread_mutexattr_t *__restrict __attr, int *__restrict __kind) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutexattr_settype (pthread_mutexattr_t *__attr, int __kind) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutexattr_getprotocol (__const pthread_mutexattr_t * __restrict __attr, int *__restrict __protocol) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutexattr_setprotocol (pthread_mutexattr_t *__attr, int __protocol) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutexattr_getprioceiling (__const pthread_mutexattr_t * __restrict __attr, int *__restrict __prioceiling) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutexattr_setprioceiling (pthread_mutexattr_t *__attr, int __prioceiling) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutexattr_getrobust (__const pthread_mutexattr_t *__attr, int *__robustness) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutexattr_getrobust_np (__const pthread_mutexattr_t *__attr, int *__robustness) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_mutexattr_setrobust (pthread_mutexattr_t *__attr, int __robustness) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_mutexattr_setrobust_np (pthread_mutexattr_t *__attr, int __robustness) throw () __attribute__ ((__nonnull__ (1))); # 872 "/usr/include/pthread.h" 3 4 extern int pthread_rwlock_init (pthread_rwlock_t *__restrict __rwlock, __const pthread_rwlockattr_t *__restrict __attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlock_destroy (pthread_rwlock_t *__rwlock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlock_rdlock (pthread_rwlock_t *__rwlock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlock_tryrdlock (pthread_rwlock_t *__rwlock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlock_timedrdlock (pthread_rwlock_t *__restrict __rwlock, __const struct timespec *__restrict __abstime) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_rwlock_wrlock (pthread_rwlock_t *__rwlock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlock_trywrlock (pthread_rwlock_t *__rwlock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlock_timedwrlock (pthread_rwlock_t *__restrict __rwlock, __const struct timespec *__restrict __abstime) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_rwlock_unlock (pthread_rwlock_t *__rwlock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlockattr_init (pthread_rwlockattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlockattr_destroy (pthread_rwlockattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlockattr_getpshared (__const pthread_rwlockattr_t * __restrict __attr, int *__restrict __pshared) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_rwlockattr_setpshared (pthread_rwlockattr_t *__attr, int __pshared) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_rwlockattr_getkind_np (__const pthread_rwlockattr_t * __restrict __attr, int *__restrict __pref) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_rwlockattr_setkind_np (pthread_rwlockattr_t *__attr, int __pref) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_cond_init (pthread_cond_t *__restrict __cond, __const pthread_condattr_t *__restrict __cond_attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_cond_destroy (pthread_cond_t *__cond) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_cond_signal (pthread_cond_t *__cond) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_cond_broadcast (pthread_cond_t *__cond) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_cond_wait (pthread_cond_t *__restrict __cond, pthread_mutex_t *__restrict __mutex) __attribute__ ((__nonnull__ (1, 2))); # 984 "/usr/include/pthread.h" 3 4 extern int pthread_cond_timedwait (pthread_cond_t *__restrict __cond, pthread_mutex_t *__restrict __mutex, __const struct timespec *__restrict __abstime) __attribute__ ((__nonnull__ (1, 2, 3))); extern int pthread_condattr_init (pthread_condattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_condattr_destroy (pthread_condattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_condattr_getpshared (__const pthread_condattr_t * __restrict __attr, int *__restrict __pshared) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_condattr_setpshared (pthread_condattr_t *__attr, int __pshared) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_condattr_getclock (__const pthread_condattr_t * __restrict __attr, __clockid_t *__restrict __clock_id) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_condattr_setclock (pthread_condattr_t *__attr, __clockid_t __clock_id) throw () __attribute__ ((__nonnull__ (1))); # 1028 "/usr/include/pthread.h" 3 4 extern int pthread_spin_init (pthread_spinlock_t *__lock, int __pshared) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_spin_destroy (pthread_spinlock_t *__lock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_spin_lock (pthread_spinlock_t *__lock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_spin_trylock (pthread_spinlock_t *__lock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_spin_unlock (pthread_spinlock_t *__lock) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_barrier_init (pthread_barrier_t *__restrict __barrier, __const pthread_barrierattr_t *__restrict __attr, unsigned int __count) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_barrier_destroy (pthread_barrier_t *__barrier) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_barrier_wait (pthread_barrier_t *__barrier) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_barrierattr_init (pthread_barrierattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_barrierattr_destroy (pthread_barrierattr_t *__attr) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_barrierattr_getpshared (__const pthread_barrierattr_t * __restrict __attr, int *__restrict __pshared) throw () __attribute__ ((__nonnull__ (1, 2))); extern int pthread_barrierattr_setpshared (pthread_barrierattr_t *__attr, int __pshared) throw () __attribute__ ((__nonnull__ (1))); # 1095 "/usr/include/pthread.h" 3 4 extern int pthread_key_create (pthread_key_t *__key, void (*__destr_function) (void *)) throw () __attribute__ ((__nonnull__ (1))); extern int pthread_key_delete (pthread_key_t __key) throw (); extern void *pthread_getspecific (pthread_key_t __key) throw (); extern int pthread_setspecific (pthread_key_t __key, __const void *__pointer) throw () ; extern int pthread_getcpuclockid (pthread_t __thread_id, __clockid_t *__clock_id) throw () __attribute__ ((__nonnull__ (2))); # 1129 "/usr/include/pthread.h" 3 4 extern int pthread_atfork (void (*__prepare) (void), void (*__parent) (void), void (*__child) (void)) throw (); # 1143 "/usr/include/pthread.h" 3 4 } # 42 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 2 3 # 53 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 typedef pthread_t __gthread_t; typedef pthread_key_t __gthread_key_t; typedef pthread_once_t __gthread_once_t; typedef pthread_mutex_t __gthread_mutex_t; typedef pthread_mutex_t __gthread_recursive_mutex_t; typedef pthread_cond_t __gthread_cond_t; typedef struct timespec __gthread_time_t; # 140 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 static __typeof(pthread_once) __gthrw_pthread_once __attribute__ ((__weakref__("pthread_once"))); static __typeof(pthread_getspecific) __gthrw_pthread_getspecific __attribute__ ((__weakref__("pthread_getspecific"))); static __typeof(pthread_setspecific) __gthrw_pthread_setspecific __attribute__ ((__weakref__("pthread_setspecific"))); static __typeof(pthread_create) __gthrw_pthread_create __attribute__ ((__weakref__("pthread_create"))); static __typeof(pthread_join) __gthrw_pthread_join __attribute__ ((__weakref__("pthread_join"))); static __typeof(pthread_equal) __gthrw_pthread_equal __attribute__ ((__weakref__("pthread_equal"))); static __typeof(pthread_self) __gthrw_pthread_self __attribute__ ((__weakref__("pthread_self"))); static __typeof(pthread_detach) __gthrw_pthread_detach __attribute__ ((__weakref__("pthread_detach"))); static __typeof(pthread_cancel) __gthrw_pthread_cancel __attribute__ ((__weakref__("pthread_cancel"))); static __typeof(sched_yield) __gthrw_sched_yield __attribute__ ((__weakref__("sched_yield"))); static __typeof(pthread_mutex_lock) __gthrw_pthread_mutex_lock __attribute__ ((__weakref__("pthread_mutex_lock"))); static __typeof(pthread_mutex_trylock) __gthrw_pthread_mutex_trylock __attribute__ ((__weakref__("pthread_mutex_trylock"))); static __typeof(pthread_mutex_timedlock) __gthrw_pthread_mutex_timedlock __attribute__ ((__weakref__("pthread_mutex_timedlock"))); static __typeof(pthread_mutex_unlock) __gthrw_pthread_mutex_unlock __attribute__ ((__weakref__("pthread_mutex_unlock"))); static __typeof(pthread_mutex_init) __gthrw_pthread_mutex_init __attribute__ ((__weakref__("pthread_mutex_init"))); static __typeof(pthread_mutex_destroy) __gthrw_pthread_mutex_destroy __attribute__ ((__weakref__("pthread_mutex_destroy"))); static __typeof(pthread_cond_init) __gthrw_pthread_cond_init __attribute__ ((__weakref__("pthread_cond_init"))); static __typeof(pthread_cond_broadcast) __gthrw_pthread_cond_broadcast __attribute__ ((__weakref__("pthread_cond_broadcast"))); static __typeof(pthread_cond_signal) __gthrw_pthread_cond_signal __attribute__ ((__weakref__("pthread_cond_signal"))); static __typeof(pthread_cond_wait) __gthrw_pthread_cond_wait __attribute__ ((__weakref__("pthread_cond_wait"))); static __typeof(pthread_cond_timedwait) __gthrw_pthread_cond_timedwait __attribute__ ((__weakref__("pthread_cond_timedwait"))); static __typeof(pthread_cond_destroy) __gthrw_pthread_cond_destroy __attribute__ ((__weakref__("pthread_cond_destroy"))); static __typeof(pthread_key_create) __gthrw_pthread_key_create __attribute__ ((__weakref__("pthread_key_create"))); static __typeof(pthread_key_delete) __gthrw_pthread_key_delete __attribute__ ((__weakref__("pthread_key_delete"))); static __typeof(pthread_mutexattr_init) __gthrw_pthread_mutexattr_init __attribute__ ((__weakref__("pthread_mutexattr_init"))); static __typeof(pthread_mutexattr_settype) __gthrw_pthread_mutexattr_settype __attribute__ ((__weakref__("pthread_mutexattr_settype"))); static __typeof(pthread_mutexattr_destroy) __gthrw_pthread_mutexattr_destroy __attribute__ ((__weakref__("pthread_mutexattr_destroy"))); # 258 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 static inline int __gthread_active_p (void) { static void *const __gthread_active_ptr = __extension__ (void *) &__gthrw_pthread_cancel; return __gthread_active_ptr != 0; } # 677 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 static inline int __gthread_create (__gthread_t *__threadid, void *(*__func) (void*), void *__args) { return __gthrw_pthread_create (__threadid, __null, __func, __args); } static inline int __gthread_join (__gthread_t __threadid, void **__value_ptr) { return __gthrw_pthread_join (__threadid, __value_ptr); } static inline int __gthread_detach (__gthread_t __threadid) { return __gthrw_pthread_detach (__threadid); } static inline int __gthread_equal (__gthread_t __t1, __gthread_t __t2) { return __gthrw_pthread_equal (__t1, __t2); } static inline __gthread_t __gthread_self (void) { return __gthrw_pthread_self (); } static inline int __gthread_yield (void) { return __gthrw_sched_yield (); } static inline int __gthread_once (__gthread_once_t *__once, void (*__func) (void)) { if (__gthread_active_p ()) return __gthrw_pthread_once (__once, __func); else return -1; } static inline int __gthread_key_create (__gthread_key_t *__key, void (*__dtor) (void *)) { return __gthrw_pthread_key_create (__key, __dtor); } static inline int __gthread_key_delete (__gthread_key_t __key) { return __gthrw_pthread_key_delete (__key); } static inline void * __gthread_getspecific (__gthread_key_t __key) { return __gthrw_pthread_getspecific (__key); } static inline int __gthread_setspecific (__gthread_key_t __key, const void *__ptr) { return __gthrw_pthread_setspecific (__key, __ptr); } # 756 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 static inline int __gthread_mutex_destroy (__gthread_mutex_t *__mutex) { if (__gthread_active_p ()) return __gthrw_pthread_mutex_destroy (__mutex); else return 0; } static inline int __gthread_mutex_lock (__gthread_mutex_t *__mutex) { if (__gthread_active_p ()) return __gthrw_pthread_mutex_lock (__mutex); else return 0; } static inline int __gthread_mutex_trylock (__gthread_mutex_t *__mutex) { if (__gthread_active_p ()) return __gthrw_pthread_mutex_trylock (__mutex); else return 0; } static inline int __gthread_mutex_timedlock (__gthread_mutex_t *__mutex, const __gthread_time_t *__abs_timeout) { if (__gthread_active_p ()) return __gthrw_pthread_mutex_timedlock (__mutex, __abs_timeout); else return 0; } static inline int __gthread_mutex_unlock (__gthread_mutex_t *__mutex) { if (__gthread_active_p ()) return __gthrw_pthread_mutex_unlock (__mutex); else return 0; } # 828 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 static inline int __gthread_recursive_mutex_lock (__gthread_recursive_mutex_t *__mutex) { return __gthread_mutex_lock (__mutex); } static inline int __gthread_recursive_mutex_trylock (__gthread_recursive_mutex_t *__mutex) { return __gthread_mutex_trylock (__mutex); } static inline int __gthread_recursive_mutex_timedlock (__gthread_recursive_mutex_t *__mutex, const __gthread_time_t *__abs_timeout) { return __gthread_mutex_timedlock (__mutex, __abs_timeout); } static inline int __gthread_recursive_mutex_unlock (__gthread_recursive_mutex_t *__mutex) { return __gthread_mutex_unlock (__mutex); } # 864 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr-default.h" 3 static inline int __gthread_cond_broadcast (__gthread_cond_t *__cond) { return __gthrw_pthread_cond_broadcast (__cond); } static inline int __gthread_cond_signal (__gthread_cond_t *__cond) { return __gthrw_pthread_cond_signal (__cond); } static inline int __gthread_cond_wait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex) { return __gthrw_pthread_cond_wait (__cond, __mutex); } static inline int __gthread_cond_timedwait (__gthread_cond_t *__cond, __gthread_mutex_t *__mutex, const __gthread_time_t *__abs_timeout) { return __gthrw_pthread_cond_timedwait (__cond, __mutex, __abs_timeout); } static inline int __gthread_cond_wait_recursive (__gthread_cond_t *__cond, __gthread_recursive_mutex_t *__mutex) { return __gthread_cond_wait (__cond, __mutex); } static inline int __gthread_cond_timedwait_recursive (__gthread_cond_t *__cond, __gthread_recursive_mutex_t *__mutex, const __gthread_time_t *__abs_timeout) { return __gthread_cond_timedwait (__cond, __mutex, __abs_timeout); } static inline int __gthread_cond_destroy (__gthread_cond_t* __cond) { return __gthrw_pthread_cond_destroy (__cond); } # 151 "/usr/include/c++/4.7/i686-linux-gnu/bits/gthr.h" 2 3 #pragma GCC visibility pop # 35 "/usr/include/c++/4.7/ext/atomicity.h" 2 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/atomic_word.h" 1 3 # 32 "/usr/include/c++/4.7/i686-linux-gnu/bits/atomic_word.h" 3 typedef int _Atomic_word; # 36 "/usr/include/c++/4.7/ext/atomicity.h" 2 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { static inline _Atomic_word __exchange_and_add(volatile _Atomic_word* __mem, int __val) { return __atomic_fetch_add(__mem, __val, 4); } static inline void __atomic_add(volatile _Atomic_word* __mem, int __val) { __atomic_fetch_add(__mem, __val, 4); } # 63 "/usr/include/c++/4.7/ext/atomicity.h" 3 static inline _Atomic_word __exchange_and_add_single(_Atomic_word* __mem, int __val) { _Atomic_word __result = *__mem; *__mem += __val; return __result; } static inline void __atomic_add_single(_Atomic_word* __mem, int __val) { *__mem += __val; } static inline _Atomic_word __attribute__ ((__unused__)) __exchange_and_add_dispatch(_Atomic_word* __mem, int __val) { if (__gthread_active_p()) return __exchange_and_add(__mem, __val); else return __exchange_and_add_single(__mem, __val); } static inline void __attribute__ ((__unused__)) __atomic_add_dispatch(_Atomic_word* __mem, int __val) { if (__gthread_active_p()) __atomic_add(__mem, __val); else __atomic_add_single(__mem, __val); } } # 42 "/usr/include/c++/4.7/bits/ios_base.h" 2 3 # 1 "/usr/include/c++/4.7/bits/locale_classes.h" 1 3 # 39 "/usr/include/c++/4.7/bits/locale_classes.h" 3 # 40 "/usr/include/c++/4.7/bits/locale_classes.h" 3 # 1 "/usr/include/c++/4.7/string" 1 3 # 38 "/usr/include/c++/4.7/string" 3 # 39 "/usr/include/c++/4.7/string" 3 # 1 "/usr/include/c++/4.7/bits/allocator.h" 1 3 # 48 "/usr/include/c++/4.7/bits/allocator.h" 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++allocator.h" 1 3 # 34 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++allocator.h" 3 # 1 "/usr/include/c++/4.7/ext/new_allocator.h" 1 3 # 38 "/usr/include/c++/4.7/ext/new_allocator.h" 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { using std::size_t; using std::ptrdiff_t; # 53 "/usr/include/c++/4.7/ext/new_allocator.h" 3 template<typename _Tp> class new_allocator { public: typedef size_t size_type; typedef ptrdiff_t difference_type; typedef _Tp* pointer; typedef const _Tp* const_pointer; typedef _Tp& reference; typedef const _Tp& const_reference; typedef _Tp value_type; template<typename _Tp1> struct rebind { typedef new_allocator<_Tp1> other; }; new_allocator() throw() { } new_allocator(const new_allocator&) throw() { } template<typename _Tp1> new_allocator(const new_allocator<_Tp1>&) throw() { } ~new_allocator() throw() { } pointer address(reference __x) const { return std::__addressof(__x); } const_pointer address(const_reference __x) const { return std::__addressof(__x); } pointer allocate(size_type __n, const void* = 0) { if (__n > this->max_size()) std::__throw_bad_alloc(); return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp))); } void deallocate(pointer __p, size_type) { ::operator delete(__p); } size_type max_size() const throw() { return size_t(-1) / sizeof(_Tp); } # 118 "/usr/include/c++/4.7/ext/new_allocator.h" 3 void construct(pointer __p, const _Tp& __val) { ::new((void *)__p) _Tp(__val); } void destroy(pointer __p) { __p->~_Tp(); } }; template<typename _Tp> inline bool operator==(const new_allocator<_Tp>&, const new_allocator<_Tp>&) { return true; } template<typename _Tp> inline bool operator!=(const new_allocator<_Tp>&, const new_allocator<_Tp>&) { return false; } } # 35 "/usr/include/c++/4.7/i686-linux-gnu/bits/c++allocator.h" 2 3 # 49 "/usr/include/c++/4.7/bits/allocator.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 63 "/usr/include/c++/4.7/bits/allocator.h" 3 template<typename _Tp> class allocator; template<> class allocator<void> { public: typedef size_t size_type; typedef ptrdiff_t difference_type; typedef void* pointer; typedef const void* const_pointer; typedef void value_type; template<typename _Tp1> struct rebind { typedef allocator<_Tp1> other; }; }; template<typename _Tp> class allocator: public __gnu_cxx::new_allocator<_Tp> { public: typedef size_t size_type; typedef ptrdiff_t difference_type; typedef _Tp* pointer; typedef const _Tp* const_pointer; typedef _Tp& reference; typedef const _Tp& const_reference; typedef _Tp value_type; template<typename _Tp1> struct rebind { typedef allocator<_Tp1> other; }; allocator() throw() { } allocator(const allocator& __a) throw() : __gnu_cxx::new_allocator<_Tp>(__a) { } template<typename _Tp1> allocator(const allocator<_Tp1>&) throw() { } ~allocator() throw() { } }; template<typename _T1, typename _T2> inline bool operator==(const allocator<_T1>&, const allocator<_T2>&) { return true; } template<typename _Tp> inline bool operator==(const allocator<_Tp>&, const allocator<_Tp>&) { return true; } template<typename _T1, typename _T2> inline bool operator!=(const allocator<_T1>&, const allocator<_T2>&) { return false; } template<typename _Tp> inline bool operator!=(const allocator<_Tp>&, const allocator<_Tp>&) { return false; } # 144 "/usr/include/c++/4.7/bits/allocator.h" 3 extern template class allocator<char>; extern template class allocator<wchar_t>; template<typename _Alloc, bool = __is_empty(_Alloc)> struct __alloc_swap { static void _S_do_it(_Alloc&, _Alloc&) { } }; template<typename _Alloc> struct __alloc_swap<_Alloc, false> { static void _S_do_it(_Alloc& __one, _Alloc& __two) { if (__one != __two) swap(__one, __two); } }; template<typename _Alloc, bool = __is_empty(_Alloc)> struct __alloc_neq { static bool _S_do_it(const _Alloc&, const _Alloc&) { return false; } }; template<typename _Alloc> struct __alloc_neq<_Alloc, false> { static bool _S_do_it(const _Alloc& __one, const _Alloc& __two) { return __one != __two; } }; # 215 "/usr/include/c++/4.7/bits/allocator.h" 3 } # 44 "/usr/include/c++/4.7/string" 2 3 # 1 "/usr/include/c++/4.7/bits/ostream_insert.h" 1 3 # 33 "/usr/include/c++/4.7/bits/ostream_insert.h" 3 # 34 "/usr/include/c++/4.7/bits/ostream_insert.h" 3 # 1 "/usr/include/c++/4.7/bits/cxxabi_forced.h" 1 3 # 34 "/usr/include/c++/4.7/bits/cxxabi_forced.h" 3 # 35 "/usr/include/c++/4.7/bits/cxxabi_forced.h" 3 #pragma GCC visibility push(default) namespace __cxxabiv1 { class __forced_unwind { virtual ~__forced_unwind() throw(); virtual void __pure_dummy() = 0; }; } #pragma GCC visibility pop # 37 "/usr/include/c++/4.7/bits/ostream_insert.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _CharT, typename _Traits> inline void __ostream_write(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) { typedef basic_ostream<_CharT, _Traits> __ostream_type; typedef typename __ostream_type::ios_base __ios_base; const streamsize __put = __out.rdbuf()->sputn(__s, __n); if (__put != __n) __out.setstate(__ios_base::badbit); } template<typename _CharT, typename _Traits> inline void __ostream_fill(basic_ostream<_CharT, _Traits>& __out, streamsize __n) { typedef basic_ostream<_CharT, _Traits> __ostream_type; typedef typename __ostream_type::ios_base __ios_base; const _CharT __c = __out.fill(); for (; __n > 0; --__n) { const typename _Traits::int_type __put = __out.rdbuf()->sputc(__c); if (_Traits::eq_int_type(__put, _Traits::eof())) { __out.setstate(__ios_base::badbit); break; } } } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& __ostream_insert(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s, streamsize __n) { typedef basic_ostream<_CharT, _Traits> __ostream_type; typedef typename __ostream_type::ios_base __ios_base; typename __ostream_type::sentry __cerb(__out); if (__cerb) { try { const streamsize __w = __out.width(); if (__w > __n) { const bool __left = ((__out.flags() & __ios_base::adjustfield) == __ios_base::left); if (!__left) __ostream_fill(__out, __w - __n); if (__out.good()) __ostream_write(__out, __s, __n); if (__left && __out.good()) __ostream_fill(__out, __w - __n); } else __ostream_write(__out, __s, __n); __out.width(0); } catch(__cxxabiv1::__forced_unwind&) { __out._M_setstate(__ios_base::badbit); throw; } catch(...) { __out._M_setstate(__ios_base::badbit); } } return __out; } extern template ostream& __ostream_insert(ostream&, const char*, streamsize); extern template wostream& __ostream_insert(wostream&, const wchar_t*, streamsize); } # 47 "/usr/include/c++/4.7/string" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_function.h" 1 3 # 61 "/usr/include/c++/4.7/bits/stl_function.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 102 "/usr/include/c++/4.7/bits/stl_function.h" 3 template<typename _Arg, typename _Result> struct unary_function { typedef _Arg argument_type; typedef _Result result_type; }; template<typename _Arg1, typename _Arg2, typename _Result> struct binary_function { typedef _Arg1 first_argument_type; typedef _Arg2 second_argument_type; typedef _Result result_type; }; # 141 "/usr/include/c++/4.7/bits/stl_function.h" 3 template<typename _Tp> struct plus : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x + __y; } }; template<typename _Tp> struct minus : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x - __y; } }; template<typename _Tp> struct multiplies : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x * __y; } }; template<typename _Tp> struct divides : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x / __y; } }; template<typename _Tp> struct modulus : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x % __y; } }; template<typename _Tp> struct negate : public unary_function<_Tp, _Tp> { _Tp operator()(const _Tp& __x) const { return -__x; } }; # 205 "/usr/include/c++/4.7/bits/stl_function.h" 3 template<typename _Tp> struct equal_to : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x == __y; } }; template<typename _Tp> struct not_equal_to : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x != __y; } }; template<typename _Tp> struct greater : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x > __y; } }; template<typename _Tp> struct less : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x < __y; } }; template<typename _Tp> struct greater_equal : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x >= __y; } }; template<typename _Tp> struct less_equal : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x <= __y; } }; # 269 "/usr/include/c++/4.7/bits/stl_function.h" 3 template<typename _Tp> struct logical_and : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x && __y; } }; template<typename _Tp> struct logical_or : public binary_function<_Tp, _Tp, bool> { bool operator()(const _Tp& __x, const _Tp& __y) const { return __x || __y; } }; template<typename _Tp> struct logical_not : public unary_function<_Tp, bool> { bool operator()(const _Tp& __x) const { return !__x; } }; template<typename _Tp> struct bit_and : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x & __y; } }; template<typename _Tp> struct bit_or : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x | __y; } }; template<typename _Tp> struct bit_xor : public binary_function<_Tp, _Tp, _Tp> { _Tp operator()(const _Tp& __x, const _Tp& __y) const { return __x ^ __y; } }; # 352 "/usr/include/c++/4.7/bits/stl_function.h" 3 template<typename _Predicate> class unary_negate : public unary_function<typename _Predicate::argument_type, bool> { protected: _Predicate _M_pred; public: explicit unary_negate(const _Predicate& __x) : _M_pred(__x) { } bool operator()(const typename _Predicate::argument_type& __x) const { return !_M_pred(__x); } }; template<typename _Predicate> inline unary_negate<_Predicate> not1(const _Predicate& __pred) { return unary_negate<_Predicate>(__pred); } template<typename _Predicate> class binary_negate : public binary_function<typename _Predicate::first_argument_type, typename _Predicate::second_argument_type, bool> { protected: _Predicate _M_pred; public: explicit binary_negate(const _Predicate& __x) : _M_pred(__x) { } bool operator()(const typename _Predicate::first_argument_type& __x, const typename _Predicate::second_argument_type& __y) const { return !_M_pred(__x, __y); } }; template<typename _Predicate> inline binary_negate<_Predicate> not2(const _Predicate& __pred) { return binary_negate<_Predicate>(__pred); } # 423 "/usr/include/c++/4.7/bits/stl_function.h" 3 template<typename _Arg, typename _Result> class pointer_to_unary_function : public unary_function<_Arg, _Result> { protected: _Result (*_M_ptr)(_Arg); public: pointer_to_unary_function() { } explicit pointer_to_unary_function(_Result (*__x)(_Arg)) : _M_ptr(__x) { } _Result operator()(_Arg __x) const { return _M_ptr(__x); } }; template<typename _Arg, typename _Result> inline pointer_to_unary_function<_Arg, _Result> ptr_fun(_Result (*__x)(_Arg)) { return pointer_to_unary_function<_Arg, _Result>(__x); } template<typename _Arg1, typename _Arg2, typename _Result> class pointer_to_binary_function : public binary_function<_Arg1, _Arg2, _Result> { protected: _Result (*_M_ptr)(_Arg1, _Arg2); public: pointer_to_binary_function() { } explicit pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2)) : _M_ptr(__x) { } _Result operator()(_Arg1 __x, _Arg2 __y) const { return _M_ptr(__x, __y); } }; template<typename _Arg1, typename _Arg2, typename _Result> inline pointer_to_binary_function<_Arg1, _Arg2, _Result> ptr_fun(_Result (*__x)(_Arg1, _Arg2)) { return pointer_to_binary_function<_Arg1, _Arg2, _Result>(__x); } template<typename _Tp> struct _Identity : public unary_function<_Tp,_Tp> { _Tp& operator()(_Tp& __x) const { return __x; } const _Tp& operator()(const _Tp& __x) const { return __x; } }; template<typename _Pair> struct _Select1st : public unary_function<_Pair, typename _Pair::first_type> { typename _Pair::first_type& operator()(_Pair& __x) const { return __x.first; } const typename _Pair::first_type& operator()(const _Pair& __x) const { return __x.first; } # 516 "/usr/include/c++/4.7/bits/stl_function.h" 3 }; template<typename _Pair> struct _Select2nd : public unary_function<_Pair, typename _Pair::second_type> { typename _Pair::second_type& operator()(_Pair& __x) const { return __x.second; } const typename _Pair::second_type& operator()(const _Pair& __x) const { return __x.second; } }; # 551 "/usr/include/c++/4.7/bits/stl_function.h" 3 template<typename _Ret, typename _Tp> class mem_fun_t : public unary_function<_Tp*, _Ret> { public: explicit mem_fun_t(_Ret (_Tp::*__pf)()) : _M_f(__pf) { } _Ret operator()(_Tp* __p) const { return (__p->*_M_f)(); } private: _Ret (_Tp::*_M_f)(); }; template<typename _Ret, typename _Tp> class const_mem_fun_t : public unary_function<const _Tp*, _Ret> { public: explicit const_mem_fun_t(_Ret (_Tp::*__pf)() const) : _M_f(__pf) { } _Ret operator()(const _Tp* __p) const { return (__p->*_M_f)(); } private: _Ret (_Tp::*_M_f)() const; }; template<typename _Ret, typename _Tp> class mem_fun_ref_t : public unary_function<_Tp, _Ret> { public: explicit mem_fun_ref_t(_Ret (_Tp::*__pf)()) : _M_f(__pf) { } _Ret operator()(_Tp& __r) const { return (__r.*_M_f)(); } private: _Ret (_Tp::*_M_f)(); }; template<typename _Ret, typename _Tp> class const_mem_fun_ref_t : public unary_function<_Tp, _Ret> { public: explicit const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const) : _M_f(__pf) { } _Ret operator()(const _Tp& __r) const { return (__r.*_M_f)(); } private: _Ret (_Tp::*_M_f)() const; }; template<typename _Ret, typename _Tp, typename _Arg> class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret> { public: explicit mem_fun1_t(_Ret (_Tp::*__pf)(_Arg)) : _M_f(__pf) { } _Ret operator()(_Tp* __p, _Arg __x) const { return (__p->*_M_f)(__x); } private: _Ret (_Tp::*_M_f)(_Arg); }; template<typename _Ret, typename _Tp, typename _Arg> class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret> { public: explicit const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const) : _M_f(__pf) { } _Ret operator()(const _Tp* __p, _Arg __x) const { return (__p->*_M_f)(__x); } private: _Ret (_Tp::*_M_f)(_Arg) const; }; template<typename _Ret, typename _Tp, typename _Arg> class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> { public: explicit mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg)) : _M_f(__pf) { } _Ret operator()(_Tp& __r, _Arg __x) const { return (__r.*_M_f)(__x); } private: _Ret (_Tp::*_M_f)(_Arg); }; template<typename _Ret, typename _Tp, typename _Arg> class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret> { public: explicit const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const) : _M_f(__pf) { } _Ret operator()(const _Tp& __r, _Arg __x) const { return (__r.*_M_f)(__x); } private: _Ret (_Tp::*_M_f)(_Arg) const; }; template<typename _Ret, typename _Tp> inline mem_fun_t<_Ret, _Tp> mem_fun(_Ret (_Tp::*__f)()) { return mem_fun_t<_Ret, _Tp>(__f); } template<typename _Ret, typename _Tp> inline const_mem_fun_t<_Ret, _Tp> mem_fun(_Ret (_Tp::*__f)() const) { return const_mem_fun_t<_Ret, _Tp>(__f); } template<typename _Ret, typename _Tp> inline mem_fun_ref_t<_Ret, _Tp> mem_fun_ref(_Ret (_Tp::*__f)()) { return mem_fun_ref_t<_Ret, _Tp>(__f); } template<typename _Ret, typename _Tp> inline const_mem_fun_ref_t<_Ret, _Tp> mem_fun_ref(_Ret (_Tp::*__f)() const) { return const_mem_fun_ref_t<_Ret, _Tp>(__f); } template<typename _Ret, typename _Tp, typename _Arg> inline mem_fun1_t<_Ret, _Tp, _Arg> mem_fun(_Ret (_Tp::*__f)(_Arg)) { return mem_fun1_t<_Ret, _Tp, _Arg>(__f); } template<typename _Ret, typename _Tp, typename _Arg> inline const_mem_fun1_t<_Ret, _Tp, _Arg> mem_fun(_Ret (_Tp::*__f)(_Arg) const) { return const_mem_fun1_t<_Ret, _Tp, _Arg>(__f); } template<typename _Ret, typename _Tp, typename _Arg> inline mem_fun1_ref_t<_Ret, _Tp, _Arg> mem_fun_ref(_Ret (_Tp::*__f)(_Arg)) { return mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } template<typename _Ret, typename _Tp, typename _Arg> inline const_mem_fun1_ref_t<_Ret, _Tp, _Arg> mem_fun_ref(_Ret (_Tp::*__f)(_Arg) const) { return const_mem_fun1_ref_t<_Ret, _Tp, _Arg>(__f); } } # 1 "/usr/include/c++/4.7/backward/binders.h" 1 3 # 60 "/usr/include/c++/4.7/backward/binders.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 104 "/usr/include/c++/4.7/backward/binders.h" 3 template<typename _Operation> class binder1st : public unary_function<typename _Operation::second_argument_type, typename _Operation::result_type> { protected: _Operation op; typename _Operation::first_argument_type value; public: binder1st(const _Operation& __x, const typename _Operation::first_argument_type& __y) : op(__x), value(__y) { } typename _Operation::result_type operator()(const typename _Operation::second_argument_type& __x) const { return op(value, __x); } typename _Operation::result_type operator()(typename _Operation::second_argument_type& __x) const { return op(value, __x); } } ; template<typename _Operation, typename _Tp> inline binder1st<_Operation> bind1st(const _Operation& __fn, const _Tp& __x) { typedef typename _Operation::first_argument_type _Arg1_type; return binder1st<_Operation>(__fn, _Arg1_type(__x)); } template<typename _Operation> class binder2nd : public unary_function<typename _Operation::first_argument_type, typename _Operation::result_type> { protected: _Operation op; typename _Operation::second_argument_type value; public: binder2nd(const _Operation& __x, const typename _Operation::second_argument_type& __y) : op(__x), value(__y) { } typename _Operation::result_type operator()(const typename _Operation::first_argument_type& __x) const { return op(__x, value); } typename _Operation::result_type operator()(typename _Operation::first_argument_type& __x) const { return op(__x, value); } } ; template<typename _Operation, typename _Tp> inline binder2nd<_Operation> bind2nd(const _Operation& __fn, const _Tp& __x) { typedef typename _Operation::second_argument_type _Arg2_type; return binder2nd<_Operation>(__fn, _Arg2_type(__x)); } } # 742 "/usr/include/c++/4.7/bits/stl_function.h" 2 3 # 51 "/usr/include/c++/4.7/string" 2 3 # 1 "/usr/include/c++/4.7/bits/range_access.h" 1 3 # 33 "/usr/include/c++/4.7/bits/range_access.h" 3 # 34 "/usr/include/c++/4.7/bits/range_access.h" 3 # 54 "/usr/include/c++/4.7/string" 2 3 # 1 "/usr/include/c++/4.7/bits/basic_string.h" 1 3 # 39 "/usr/include/c++/4.7/bits/basic_string.h" 3 # 40 "/usr/include/c++/4.7/bits/basic_string.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 108 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> class basic_string { typedef typename _Alloc::template rebind<_CharT>::other _CharT_alloc_type; public: typedef _Traits traits_type; typedef typename _Traits::char_type value_type; typedef _Alloc allocator_type; typedef typename _CharT_alloc_type::size_type size_type; typedef typename _CharT_alloc_type::difference_type difference_type; typedef typename _CharT_alloc_type::reference reference; typedef typename _CharT_alloc_type::const_reference const_reference; typedef typename _CharT_alloc_type::pointer pointer; typedef typename _CharT_alloc_type::const_pointer const_pointer; typedef __gnu_cxx::__normal_iterator<pointer, basic_string> iterator; typedef __gnu_cxx::__normal_iterator<const_pointer, basic_string> const_iterator; typedef std::reverse_iterator<const_iterator> const_reverse_iterator; typedef std::reverse_iterator<iterator> reverse_iterator; private: # 145 "/usr/include/c++/4.7/bits/basic_string.h" 3 struct _Rep_base { size_type _M_length; size_type _M_capacity; _Atomic_word _M_refcount; }; struct _Rep : _Rep_base { typedef typename _Alloc::template rebind<char>::other _Raw_bytes_alloc; # 170 "/usr/include/c++/4.7/bits/basic_string.h" 3 static const size_type _S_max_size; static const _CharT _S_terminal; static size_type _S_empty_rep_storage[]; static _Rep& _S_empty_rep() { void* __p = reinterpret_cast<void*>(&_S_empty_rep_storage); return *reinterpret_cast<_Rep*>(__p); } bool _M_is_leaked() const { return this->_M_refcount < 0; } bool _M_is_shared() const { return this->_M_refcount > 0; } void _M_set_leaked() { this->_M_refcount = -1; } void _M_set_sharable() { this->_M_refcount = 0; } void _M_set_length_and_sharable(size_type __n) { if (__builtin_expect(this != &_S_empty_rep(), false)) { this->_M_set_sharable(); this->_M_length = __n; traits_type::assign(this->_M_refdata()[__n], _S_terminal); } } _CharT* _M_refdata() throw() { return reinterpret_cast<_CharT*>(this + 1); } _CharT* _M_grab(const _Alloc& __alloc1, const _Alloc& __alloc2) { return (!_M_is_leaked() && __alloc1 == __alloc2) ? _M_refcopy() : _M_clone(__alloc1); } static _Rep* _S_create(size_type, size_type, const _Alloc&); void _M_dispose(const _Alloc& __a) { if (__builtin_expect(this != &_S_empty_rep(), false)) { ; if (__gnu_cxx::__exchange_and_add_dispatch(&this->_M_refcount, -1) <= 0) { ; _M_destroy(__a); } } } void _M_destroy(const _Alloc&) throw(); _CharT* _M_refcopy() throw() { if (__builtin_expect(this != &_S_empty_rep(), false)) __gnu_cxx::__atomic_add_dispatch(&this->_M_refcount, 1); return _M_refdata(); } _CharT* _M_clone(const _Alloc&, size_type __res = 0); }; struct _Alloc_hider : _Alloc { _Alloc_hider(_CharT* __dat, const _Alloc& __a) : _Alloc(__a), _M_p(__dat) { } _CharT* _M_p; }; public: static const size_type npos = static_cast<size_type>(-1); private: mutable _Alloc_hider _M_dataplus; _CharT* _M_data() const { return _M_dataplus._M_p; } _CharT* _M_data(_CharT* __p) { return (_M_dataplus._M_p = __p); } _Rep* _M_rep() const { return &((reinterpret_cast<_Rep*> (_M_data()))[-1]); } iterator _M_ibegin() const { return iterator(_M_data()); } iterator _M_iend() const { return iterator(_M_data() + this->size()); } void _M_leak() { if (!_M_rep()->_M_is_leaked()) _M_leak_hard(); } size_type _M_check(size_type __pos, const char* __s) const { if (__pos > this->size()) __throw_out_of_range((__s)); return __pos; } void _M_check_length(size_type __n1, size_type __n2, const char* __s) const { if (this->max_size() - (this->size() - __n1) < __n2) __throw_length_error((__s)); } size_type _M_limit(size_type __pos, size_type __off) const { const bool __testoff = __off < this->size() - __pos; return __testoff ? __off : this->size() - __pos; } bool _M_disjunct(const _CharT* __s) const { return (less<const _CharT*>()(__s, _M_data()) || less<const _CharT*>()(_M_data() + this->size(), __s)); } static void _M_copy(_CharT* __d, const _CharT* __s, size_type __n) { if (__n == 1) traits_type::assign(*__d, *__s); else traits_type::copy(__d, __s, __n); } static void _M_move(_CharT* __d, const _CharT* __s, size_type __n) { if (__n == 1) traits_type::assign(*__d, *__s); else traits_type::move(__d, __s, __n); } static void _M_assign(_CharT* __d, size_type __n, _CharT __c) { if (__n == 1) traits_type::assign(*__d, __c); else traits_type::assign(__d, __n, __c); } template<class _Iterator> static void _S_copy_chars(_CharT* __p, _Iterator __k1, _Iterator __k2) { for (; __k1 != __k2; ++__k1, ++__p) traits_type::assign(*__p, *__k1); } static void _S_copy_chars(_CharT* __p, iterator __k1, iterator __k2) { _S_copy_chars(__p, __k1.base(), __k2.base()); } static void _S_copy_chars(_CharT* __p, const_iterator __k1, const_iterator __k2) { _S_copy_chars(__p, __k1.base(), __k2.base()); } static void _S_copy_chars(_CharT* __p, _CharT* __k1, _CharT* __k2) { _M_copy(__p, __k1, __k2 - __k1); } static void _S_copy_chars(_CharT* __p, const _CharT* __k1, const _CharT* __k2) { _M_copy(__p, __k1, __k2 - __k1); } static int _S_compare(size_type __n1, size_type __n2) { const difference_type __d = difference_type(__n1 - __n2); if (__d > __gnu_cxx::__numeric_traits<int>::__max) return __gnu_cxx::__numeric_traits<int>::__max; else if (__d < __gnu_cxx::__numeric_traits<int>::__min) return __gnu_cxx::__numeric_traits<int>::__min; else return int(__d); } void _M_mutate(size_type __pos, size_type __len1, size_type __len2); void _M_leak_hard(); static _Rep& _S_empty_rep() { return _Rep::_S_empty_rep(); } public: basic_string() : _M_dataplus(_S_empty_rep()._M_refdata(), _Alloc()) { } explicit basic_string(const _Alloc& __a); basic_string(const basic_string& __str); basic_string(const basic_string& __str, size_type __pos, size_type __n = npos); basic_string(const basic_string& __str, size_type __pos, size_type __n, const _Alloc& __a); # 480 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string(const _CharT* __s, size_type __n, const _Alloc& __a = _Alloc()); basic_string(const _CharT* __s, const _Alloc& __a = _Alloc()); basic_string(size_type __n, _CharT __c, const _Alloc& __a = _Alloc()); # 528 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<class _InputIterator> basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a = _Alloc()); ~basic_string() { _M_rep()->_M_dispose(this->get_allocator()); } basic_string& operator=(const basic_string& __str) { return this->assign(__str); } basic_string& operator=(const _CharT* __s) { return this->assign(__s); } # 561 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& operator=(_CharT __c) { this->assign(1, __c); return *this; } # 601 "/usr/include/c++/4.7/bits/basic_string.h" 3 iterator begin() { _M_leak(); return iterator(_M_data()); } const_iterator begin() const { return const_iterator(_M_data()); } iterator end() { _M_leak(); return iterator(_M_data() + this->size()); } const_iterator end() const { return const_iterator(_M_data() + this->size()); } reverse_iterator rbegin() { return reverse_iterator(this->end()); } const_reverse_iterator rbegin() const { return const_reverse_iterator(this->end()); } reverse_iterator rend() { return reverse_iterator(this->begin()); } const_reverse_iterator rend() const { return const_reverse_iterator(this->begin()); } # 707 "/usr/include/c++/4.7/bits/basic_string.h" 3 public: size_type size() const { return _M_rep()->_M_length; } size_type length() const { return _M_rep()->_M_length; } size_type max_size() const { return _Rep::_S_max_size; } # 736 "/usr/include/c++/4.7/bits/basic_string.h" 3 void resize(size_type __n, _CharT __c); # 749 "/usr/include/c++/4.7/bits/basic_string.h" 3 void resize(size_type __n) { this->resize(__n, _CharT()); } # 772 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type capacity() const { return _M_rep()->_M_capacity; } # 793 "/usr/include/c++/4.7/bits/basic_string.h" 3 void reserve(size_type __res_arg = 0); void clear() { _M_mutate(0, this->size(), 0); } bool empty() const { return this->size() == 0; } # 822 "/usr/include/c++/4.7/bits/basic_string.h" 3 const_reference operator[] (size_type __pos) const { ; return _M_data()[__pos]; } # 839 "/usr/include/c++/4.7/bits/basic_string.h" 3 reference operator[](size_type __pos) { ; ; _M_leak(); return _M_data()[__pos]; } # 860 "/usr/include/c++/4.7/bits/basic_string.h" 3 const_reference at(size_type __n) const { if (__n >= this->size()) __throw_out_of_range(("basic_string::at")); return _M_data()[__n]; } # 879 "/usr/include/c++/4.7/bits/basic_string.h" 3 reference at(size_type __n) { if (__n >= size()) __throw_out_of_range(("basic_string::at")); _M_leak(); return _M_data()[__n]; } # 928 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& operator+=(const basic_string& __str) { return this->append(__str); } basic_string& operator+=(const _CharT* __s) { return this->append(__s); } basic_string& operator+=(_CharT __c) { this->push_back(__c); return *this; } # 969 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& append(const basic_string& __str); # 985 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& append(const basic_string& __str, size_type __pos, size_type __n); basic_string& append(const _CharT* __s, size_type __n); basic_string& append(const _CharT* __s) { ; return this->append(__s, traits_type::length(__s)); } # 1017 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& append(size_type __n, _CharT __c); # 1039 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<class _InputIterator> basic_string& append(_InputIterator __first, _InputIterator __last) { return this->replace(_M_iend(), _M_iend(), __first, __last); } void push_back(_CharT __c) { const size_type __len = 1 + this->size(); if (__len > this->capacity() || _M_rep()->_M_is_shared()) this->reserve(__len); traits_type::assign(_M_data()[this->size()], __c); _M_rep()->_M_set_length_and_sharable(__len); } basic_string& assign(const basic_string& __str); # 1096 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& assign(const basic_string& __str, size_type __pos, size_type __n) { return this->assign(__str._M_data() + __str._M_check(__pos, "basic_string::assign"), __str._M_limit(__pos, __n)); } # 1112 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& assign(const _CharT* __s, size_type __n); # 1124 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& assign(const _CharT* __s) { ; return this->assign(__s, traits_type::length(__s)); } # 1140 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& assign(size_type __n, _CharT __c) { return _M_replace_aux(size_type(0), this->size(), __n, __c); } # 1152 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<class _InputIterator> basic_string& assign(_InputIterator __first, _InputIterator __last) { return this->replace(_M_ibegin(), _M_iend(), __first, __last); } # 1181 "/usr/include/c++/4.7/bits/basic_string.h" 3 void insert(iterator __p, size_type __n, _CharT __c) { this->replace(__p, __p, __n, __c); } # 1197 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<class _InputIterator> void insert(iterator __p, _InputIterator __beg, _InputIterator __end) { this->replace(__p, __p, __beg, __end); } # 1229 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& insert(size_type __pos1, const basic_string& __str) { return this->insert(__pos1, __str, size_type(0), __str.size()); } # 1251 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& insert(size_type __pos1, const basic_string& __str, size_type __pos2, size_type __n) { return this->insert(__pos1, __str._M_data() + __str._M_check(__pos2, "basic_string::insert"), __str._M_limit(__pos2, __n)); } # 1274 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& insert(size_type __pos, const _CharT* __s, size_type __n); # 1292 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& insert(size_type __pos, const _CharT* __s) { ; return this->insert(__pos, __s, traits_type::length(__s)); } # 1315 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& insert(size_type __pos, size_type __n, _CharT __c) { return _M_replace_aux(_M_check(__pos, "basic_string::insert"), size_type(0), __n, __c); } # 1333 "/usr/include/c++/4.7/bits/basic_string.h" 3 iterator insert(iterator __p, _CharT __c) { ; const size_type __pos = __p - _M_ibegin(); _M_replace_aux(__pos, size_type(0), size_type(1), __c); _M_rep()->_M_set_leaked(); return iterator(_M_data() + __pos); } # 1358 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& erase(size_type __pos = 0, size_type __n = npos) { _M_mutate(_M_check(__pos, "basic_string::erase"), _M_limit(__pos, __n), size_type(0)); return *this; } # 1374 "/usr/include/c++/4.7/bits/basic_string.h" 3 iterator erase(iterator __position) { ; const size_type __pos = __position - _M_ibegin(); _M_mutate(__pos, size_type(1), size_type(0)); _M_rep()->_M_set_leaked(); return iterator(_M_data() + __pos); } # 1394 "/usr/include/c++/4.7/bits/basic_string.h" 3 iterator erase(iterator __first, iterator __last); # 1425 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(size_type __pos, size_type __n, const basic_string& __str) { return this->replace(__pos, __n, __str._M_data(), __str.size()); } # 1447 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) { return this->replace(__pos1, __n1, __str._M_data() + __str._M_check(__pos2, "basic_string::replace"), __str._M_limit(__pos2, __n2)); } # 1472 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2); # 1492 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(size_type __pos, size_type __n1, const _CharT* __s) { ; return this->replace(__pos, __n1, __s, traits_type::length(__s)); } # 1516 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) { return _M_replace_aux(_M_check(__pos, "basic_string::replace"), _M_limit(__pos, __n1), __n2, __c); } # 1534 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(iterator __i1, iterator __i2, const basic_string& __str) { return this->replace(__i1, __i2, __str._M_data(), __str.size()); } # 1553 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(iterator __i1, iterator __i2, const _CharT* __s, size_type __n) { ; return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __s, __n); } # 1574 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(iterator __i1, iterator __i2, const _CharT* __s) { ; return this->replace(__i1, __i2, __s, traits_type::length(__s)); } # 1595 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string& replace(iterator __i1, iterator __i2, size_type __n, _CharT __c) { ; return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __c); } # 1618 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<class _InputIterator> basic_string& replace(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2) { ; ; typedef typename std::__is_integer<_InputIterator>::__type _Integral; return _M_replace_dispatch(__i1, __i2, __k1, __k2, _Integral()); } basic_string& replace(iterator __i1, iterator __i2, _CharT* __k1, _CharT* __k2) { ; ; return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __k1, __k2 - __k1); } basic_string& replace(iterator __i1, iterator __i2, const _CharT* __k1, const _CharT* __k2) { ; ; return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __k1, __k2 - __k1); } basic_string& replace(iterator __i1, iterator __i2, iterator __k1, iterator __k2) { ; ; return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __k1.base(), __k2 - __k1); } basic_string& replace(iterator __i1, iterator __i2, const_iterator __k1, const_iterator __k2) { ; ; return this->replace(__i1 - _M_ibegin(), __i2 - __i1, __k1.base(), __k2 - __k1); } # 1694 "/usr/include/c++/4.7/bits/basic_string.h" 3 private: template<class _Integer> basic_string& _M_replace_dispatch(iterator __i1, iterator __i2, _Integer __n, _Integer __val, __true_type) { return _M_replace_aux(__i1 - _M_ibegin(), __i2 - __i1, __n, __val); } template<class _InputIterator> basic_string& _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2, __false_type); basic_string& _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, _CharT __c); basic_string& _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2); template<class _InIterator> static _CharT* _S_construct_aux(_InIterator __beg, _InIterator __end, const _Alloc& __a, __false_type) { typedef typename iterator_traits<_InIterator>::iterator_category _Tag; return _S_construct(__beg, __end, __a, _Tag()); } template<class _Integer> static _CharT* _S_construct_aux(_Integer __beg, _Integer __end, const _Alloc& __a, __true_type) { return _S_construct_aux_2(static_cast<size_type>(__beg), __end, __a); } static _CharT* _S_construct_aux_2(size_type __req, _CharT __c, const _Alloc& __a) { return _S_construct(__req, __c, __a); } template<class _InIterator> static _CharT* _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a) { typedef typename std::__is_integer<_InIterator>::__type _Integral; return _S_construct_aux(__beg, __end, __a, _Integral()); } template<class _InIterator> static _CharT* _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, input_iterator_tag); template<class _FwdIterator> static _CharT* _S_construct(_FwdIterator __beg, _FwdIterator __end, const _Alloc& __a, forward_iterator_tag); static _CharT* _S_construct(size_type __req, _CharT __c, const _Alloc& __a); public: # 1776 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type copy(_CharT* __s, size_type __n, size_type __pos = 0) const; # 1786 "/usr/include/c++/4.7/bits/basic_string.h" 3 void swap(basic_string& __s); # 1796 "/usr/include/c++/4.7/bits/basic_string.h" 3 const _CharT* c_str() const { return _M_data(); } const _CharT* data() const { return _M_data(); } allocator_type get_allocator() const { return _M_dataplus; } # 1829 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find(const _CharT* __s, size_type __pos, size_type __n) const; # 1842 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find(const basic_string& __str, size_type __pos = 0) const { return this->find(__str.data(), __pos, __str.size()); } # 1857 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find(const _CharT* __s, size_type __pos = 0) const { ; return this->find(__s, __pos, traits_type::length(__s)); } # 1874 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find(_CharT __c, size_type __pos = 0) const ; # 1887 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type rfind(const basic_string& __str, size_type __pos = npos) const { return this->rfind(__str.data(), __pos, __str.size()); } # 1904 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type rfind(const _CharT* __s, size_type __pos, size_type __n) const; # 1917 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type rfind(const _CharT* __s, size_type __pos = npos) const { ; return this->rfind(__s, __pos, traits_type::length(__s)); } # 1934 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type rfind(_CharT __c, size_type __pos = npos) const ; # 1948 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_of(const basic_string& __str, size_type __pos = 0) const { return this->find_first_of(__str.data(), __pos, __str.size()); } # 1965 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_of(const _CharT* __s, size_type __pos, size_type __n) const; # 1978 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_of(const _CharT* __s, size_type __pos = 0) const { ; return this->find_first_of(__s, __pos, traits_type::length(__s)); } # 1997 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_of(_CharT __c, size_type __pos = 0) const { return this->find(__c, __pos); } # 2012 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_of(const basic_string& __str, size_type __pos = npos) const { return this->find_last_of(__str.data(), __pos, __str.size()); } # 2029 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_of(const _CharT* __s, size_type __pos, size_type __n) const; # 2042 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_of(const _CharT* __s, size_type __pos = npos) const { ; return this->find_last_of(__s, __pos, traits_type::length(__s)); } # 2061 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_of(_CharT __c, size_type __pos = npos) const { return this->rfind(__c, __pos); } # 2075 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_not_of(const basic_string& __str, size_type __pos = 0) const { return this->find_first_not_of(__str.data(), __pos, __str.size()); } # 2092 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const; # 2106 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_not_of(const _CharT* __s, size_type __pos = 0) const { ; return this->find_first_not_of(__s, __pos, traits_type::length(__s)); } # 2123 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_first_not_of(_CharT __c, size_type __pos = 0) const ; # 2138 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_not_of(const basic_string& __str, size_type __pos = npos) const { return this->find_last_not_of(__str.data(), __pos, __str.size()); } # 2155 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const; # 2169 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_not_of(const _CharT* __s, size_type __pos = npos) const { ; return this->find_last_not_of(__s, __pos, traits_type::length(__s)); } # 2186 "/usr/include/c++/4.7/bits/basic_string.h" 3 size_type find_last_not_of(_CharT __c, size_type __pos = npos) const ; # 2202 "/usr/include/c++/4.7/bits/basic_string.h" 3 basic_string substr(size_type __pos = 0, size_type __n = npos) const { return basic_string(*this, _M_check(__pos, "basic_string::substr"), __n); } # 2221 "/usr/include/c++/4.7/bits/basic_string.h" 3 int compare(const basic_string& __str) const { const size_type __size = this->size(); const size_type __osize = __str.size(); const size_type __len = std::min(__size, __osize); int __r = traits_type::compare(_M_data(), __str.data(), __len); if (!__r) __r = _S_compare(__size, __osize); return __r; } # 2253 "/usr/include/c++/4.7/bits/basic_string.h" 3 int compare(size_type __pos, size_type __n, const basic_string& __str) const; # 2279 "/usr/include/c++/4.7/bits/basic_string.h" 3 int compare(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) const; # 2297 "/usr/include/c++/4.7/bits/basic_string.h" 3 int compare(const _CharT* __s) const; # 2321 "/usr/include/c++/4.7/bits/basic_string.h" 3 int compare(size_type __pos, size_type __n1, const _CharT* __s) const; # 2348 "/usr/include/c++/4.7/bits/basic_string.h" 3 int compare(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) const; }; # 2360 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc> operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { basic_string<_CharT, _Traits, _Alloc> __str(__lhs); __str.append(__rhs); return __str; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT,_Traits,_Alloc> operator+(const _CharT* __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs); template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT,_Traits,_Alloc> operator+(_CharT __lhs, const basic_string<_CharT,_Traits,_Alloc>& __rhs); template<typename _CharT, typename _Traits, typename _Alloc> inline basic_string<_CharT, _Traits, _Alloc> operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) { basic_string<_CharT, _Traits, _Alloc> __str(__lhs); __str.append(__rhs); return __str; } template<typename _CharT, typename _Traits, typename _Alloc> inline basic_string<_CharT, _Traits, _Alloc> operator+(const basic_string<_CharT, _Traits, _Alloc>& __lhs, _CharT __rhs) { typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef typename __string_type::size_type __size_type; __string_type __str(__lhs); __str.append(__size_type(1), __rhs); return __str; } # 2481 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __lhs.compare(__rhs) == 0; } template<typename _CharT> inline typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, bool>::__type operator==(const basic_string<_CharT>& __lhs, const basic_string<_CharT>& __rhs) { return (__lhs.size() == __rhs.size() && !std::char_traits<_CharT>::compare(__lhs.data(), __rhs.data(), __lhs.size())); } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator==(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __rhs.compare(__lhs) == 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator==(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) { return __lhs.compare(__rhs) == 0; } # 2527 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return !(__lhs == __rhs); } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator!=(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return !(__lhs == __rhs); } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator!=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) { return !(__lhs == __rhs); } # 2564 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __lhs.compare(__rhs) < 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator<(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) { return __lhs.compare(__rhs) < 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator<(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __rhs.compare(__lhs) > 0; } # 2601 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __lhs.compare(__rhs) > 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator>(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) { return __lhs.compare(__rhs) > 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator>(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __rhs.compare(__lhs) < 0; } # 2638 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __lhs.compare(__rhs) <= 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) { return __lhs.compare(__rhs) <= 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator<=(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __rhs.compare(__lhs) >= 0; } # 2675 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __lhs.compare(__rhs) >= 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator>=(const basic_string<_CharT, _Traits, _Alloc>& __lhs, const _CharT* __rhs) { return __lhs.compare(__rhs) >= 0; } template<typename _CharT, typename _Traits, typename _Alloc> inline bool operator>=(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { return __rhs.compare(__lhs) <= 0; } # 2712 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline void swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, basic_string<_CharT, _Traits, _Alloc>& __rhs) { __lhs.swap(__rhs); } # 2730 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> basic_istream<_CharT, _Traits>& operator>>(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str); template<> basic_istream<char>& operator>>(basic_istream<char>& __is, basic_string<char>& __str); # 2748 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline basic_ostream<_CharT, _Traits>& operator<<(basic_ostream<_CharT, _Traits>& __os, const basic_string<_CharT, _Traits, _Alloc>& __str) { return __ostream_insert(__os, __str.data(), __str.size()); } # 2772 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> basic_istream<_CharT, _Traits>& getline(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim); # 2790 "/usr/include/c++/4.7/bits/basic_string.h" 3 template<typename _CharT, typename _Traits, typename _Alloc> inline basic_istream<_CharT, _Traits>& getline(basic_istream<_CharT, _Traits>& __is, basic_string<_CharT, _Traits, _Alloc>& __str) { return getline(__is, __str, __is.widen('\n')); } template<> basic_istream<char>& getline(basic_istream<char>& __in, basic_string<char>& __str, char __delim); template<> basic_istream<wchar_t>& getline(basic_istream<wchar_t>& __in, basic_string<wchar_t>& __str, wchar_t __delim); } # 55 "/usr/include/c++/4.7/string" 2 3 # 1 "/usr/include/c++/4.7/bits/basic_string.tcc" 1 3 # 42 "/usr/include/c++/4.7/bits/basic_string.tcc" 3 # 43 "/usr/include/c++/4.7/bits/basic_string.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _CharT, typename _Traits, typename _Alloc> const typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: _Rep::_S_max_size = (((npos - sizeof(_Rep_base))/sizeof(_CharT)) - 1) / 4; template<typename _CharT, typename _Traits, typename _Alloc> const _CharT basic_string<_CharT, _Traits, _Alloc>:: _Rep::_S_terminal = _CharT(); template<typename _CharT, typename _Traits, typename _Alloc> const typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>::npos; template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>::_Rep::_S_empty_rep_storage[ (sizeof(_Rep_base) + sizeof(_CharT) + sizeof(size_type) - 1) / sizeof(size_type)]; template<typename _CharT, typename _Traits, typename _Alloc> template<typename _InIterator> _CharT* basic_string<_CharT, _Traits, _Alloc>:: _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, input_iterator_tag) { if (__beg == __end && __a == _Alloc()) return _S_empty_rep()._M_refdata(); _CharT __buf[128]; size_type __len = 0; while (__beg != __end && __len < sizeof(__buf) / sizeof(_CharT)) { __buf[__len++] = *__beg; ++__beg; } _Rep* __r = _Rep::_S_create(__len, size_type(0), __a); _M_copy(__r->_M_refdata(), __buf, __len); try { while (__beg != __end) { if (__len == __r->_M_capacity) { _Rep* __another = _Rep::_S_create(__len + 1, __len, __a); _M_copy(__another->_M_refdata(), __r->_M_refdata(), __len); __r->_M_destroy(__a); __r = __another; } __r->_M_refdata()[__len++] = *__beg; ++__beg; } } catch(...) { __r->_M_destroy(__a); throw; } __r->_M_set_length_and_sharable(__len); return __r->_M_refdata(); } template<typename _CharT, typename _Traits, typename _Alloc> template <typename _InIterator> _CharT* basic_string<_CharT, _Traits, _Alloc>:: _S_construct(_InIterator __beg, _InIterator __end, const _Alloc& __a, forward_iterator_tag) { if (__beg == __end && __a == _Alloc()) return _S_empty_rep()._M_refdata(); if (__gnu_cxx::__is_null_pointer(__beg) && __beg != __end) __throw_logic_error(("basic_string::_S_construct null not valid")); const size_type __dnew = static_cast<size_type>(std::distance(__beg, __end)); _Rep* __r = _Rep::_S_create(__dnew, size_type(0), __a); try { _S_copy_chars(__r->_M_refdata(), __beg, __end); } catch(...) { __r->_M_destroy(__a); throw; } __r->_M_set_length_and_sharable(__dnew); return __r->_M_refdata(); } template<typename _CharT, typename _Traits, typename _Alloc> _CharT* basic_string<_CharT, _Traits, _Alloc>:: _S_construct(size_type __n, _CharT __c, const _Alloc& __a) { if (__n == 0 && __a == _Alloc()) return _S_empty_rep()._M_refdata(); _Rep* __r = _Rep::_S_create(__n, size_type(0), __a); if (__n) _M_assign(__r->_M_refdata(), __n, __c); __r->_M_set_length_and_sharable(__n); return __r->_M_refdata(); } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>:: basic_string(const basic_string& __str) : _M_dataplus(__str._M_rep()->_M_grab(_Alloc(__str.get_allocator()), __str.get_allocator()), __str.get_allocator()) { } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>:: basic_string(const _Alloc& __a) : _M_dataplus(_S_construct(size_type(), _CharT(), __a), __a) { } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>:: basic_string(const basic_string& __str, size_type __pos, size_type __n) : _M_dataplus(_S_construct(__str._M_data() + __str._M_check(__pos, "basic_string::basic_string"), __str._M_data() + __str._M_limit(__pos, __n) + __pos, _Alloc()), _Alloc()) { } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>:: basic_string(const basic_string& __str, size_type __pos, size_type __n, const _Alloc& __a) : _M_dataplus(_S_construct(__str._M_data() + __str._M_check(__pos, "basic_string::basic_string"), __str._M_data() + __str._M_limit(__pos, __n) + __pos, __a), __a) { } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>:: basic_string(const _CharT* __s, size_type __n, const _Alloc& __a) : _M_dataplus(_S_construct(__s, __s + __n, __a), __a) { } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>:: basic_string(const _CharT* __s, const _Alloc& __a) : _M_dataplus(_S_construct(__s, __s ? __s + traits_type::length(__s) : __s + npos, __a), __a) { } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>:: basic_string(size_type __n, _CharT __c, const _Alloc& __a) : _M_dataplus(_S_construct(__n, __c, __a), __a) { } template<typename _CharT, typename _Traits, typename _Alloc> template<typename _InputIterator> basic_string<_CharT, _Traits, _Alloc>:: basic_string(_InputIterator __beg, _InputIterator __end, const _Alloc& __a) : _M_dataplus(_S_construct(__beg, __end, __a), __a) { } # 242 "/usr/include/c++/4.7/bits/basic_string.tcc" 3 template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: assign(const basic_string& __str) { if (_M_rep() != __str._M_rep()) { const allocator_type __a = this->get_allocator(); _CharT* __tmp = __str._M_rep()->_M_grab(__a, __str.get_allocator()); _M_rep()->_M_dispose(__a); _M_data(__tmp); } return *this; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: assign(const _CharT* __s, size_type __n) { ; _M_check_length(this->size(), __n, "basic_string::assign"); if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) return _M_replace_safe(size_type(0), this->size(), __s, __n); else { const size_type __pos = __s - _M_data(); if (__pos >= __n) _M_copy(_M_data(), __s, __n); else if (__pos) _M_move(_M_data(), __s, __n); _M_rep()->_M_set_length_and_sharable(__n); return *this; } } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: append(size_type __n, _CharT __c) { if (__n) { _M_check_length(size_type(0), __n, "basic_string::append"); const size_type __len = __n + this->size(); if (__len > this->capacity() || _M_rep()->_M_is_shared()) this->reserve(__len); _M_assign(_M_data() + this->size(), __n, __c); _M_rep()->_M_set_length_and_sharable(__len); } return *this; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: append(const _CharT* __s, size_type __n) { ; if (__n) { _M_check_length(size_type(0), __n, "basic_string::append"); const size_type __len = __n + this->size(); if (__len > this->capacity() || _M_rep()->_M_is_shared()) { if (_M_disjunct(__s)) this->reserve(__len); else { const size_type __off = __s - _M_data(); this->reserve(__len); __s = _M_data() + __off; } } _M_copy(_M_data() + this->size(), __s, __n); _M_rep()->_M_set_length_and_sharable(__len); } return *this; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: append(const basic_string& __str) { const size_type __size = __str.size(); if (__size) { const size_type __len = __size + this->size(); if (__len > this->capacity() || _M_rep()->_M_is_shared()) this->reserve(__len); _M_copy(_M_data() + this->size(), __str._M_data(), __size); _M_rep()->_M_set_length_and_sharable(__len); } return *this; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: append(const basic_string& __str, size_type __pos, size_type __n) { __str._M_check(__pos, "basic_string::append"); __n = __str._M_limit(__pos, __n); if (__n) { const size_type __len = __n + this->size(); if (__len > this->capacity() || _M_rep()->_M_is_shared()) this->reserve(__len); _M_copy(_M_data() + this->size(), __str._M_data() + __pos, __n); _M_rep()->_M_set_length_and_sharable(__len); } return *this; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: insert(size_type __pos, const _CharT* __s, size_type __n) { ; _M_check(__pos, "basic_string::insert"); _M_check_length(size_type(0), __n, "basic_string::insert"); if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) return _M_replace_safe(__pos, size_type(0), __s, __n); else { const size_type __off = __s - _M_data(); _M_mutate(__pos, 0, __n); __s = _M_data() + __off; _CharT* __p = _M_data() + __pos; if (__s + __n <= __p) _M_copy(__p, __s, __n); else if (__s >= __p) _M_copy(__p, __s + __n, __n); else { const size_type __nleft = __p - __s; _M_copy(__p, __s, __nleft); _M_copy(__p + __nleft, __p + __n, __n - __nleft); } return *this; } } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::iterator basic_string<_CharT, _Traits, _Alloc>:: erase(iterator __first, iterator __last) { ; const size_type __size = __last - __first; if (__size) { const size_type __pos = __first - _M_ibegin(); _M_mutate(__pos, __size, size_type(0)); _M_rep()->_M_set_leaked(); return iterator(_M_data() + __pos); } else return __first; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) { ; _M_check(__pos, "basic_string::replace"); __n1 = _M_limit(__pos, __n1); _M_check_length(__n1, __n2, "basic_string::replace"); bool __left; if (_M_disjunct(__s) || _M_rep()->_M_is_shared()) return _M_replace_safe(__pos, __n1, __s, __n2); else if ((__left = __s + __n2 <= _M_data() + __pos) || _M_data() + __pos + __n1 <= __s) { size_type __off = __s - _M_data(); __left ? __off : (__off += __n2 - __n1); _M_mutate(__pos, __n1, __n2); _M_copy(_M_data() + __pos, _M_data() + __off, __n2); return *this; } else { const basic_string __tmp(__s, __n2); return _M_replace_safe(__pos, __n1, __tmp._M_data(), __n2); } } template<typename _CharT, typename _Traits, typename _Alloc> void basic_string<_CharT, _Traits, _Alloc>::_Rep:: _M_destroy(const _Alloc& __a) throw () { const size_type __size = sizeof(_Rep_base) + (this->_M_capacity + 1) * sizeof(_CharT); _Raw_bytes_alloc(__a).deallocate(reinterpret_cast<char*>(this), __size); } template<typename _CharT, typename _Traits, typename _Alloc> void basic_string<_CharT, _Traits, _Alloc>:: _M_leak_hard() { if (_M_rep() == &_S_empty_rep()) return; if (_M_rep()->_M_is_shared()) _M_mutate(0, 0, 0); _M_rep()->_M_set_leaked(); } template<typename _CharT, typename _Traits, typename _Alloc> void basic_string<_CharT, _Traits, _Alloc>:: _M_mutate(size_type __pos, size_type __len1, size_type __len2) { const size_type __old_size = this->size(); const size_type __new_size = __old_size + __len2 - __len1; const size_type __how_much = __old_size - __pos - __len1; if (__new_size > this->capacity() || _M_rep()->_M_is_shared()) { const allocator_type __a = get_allocator(); _Rep* __r = _Rep::_S_create(__new_size, this->capacity(), __a); if (__pos) _M_copy(__r->_M_refdata(), _M_data(), __pos); if (__how_much) _M_copy(__r->_M_refdata() + __pos + __len2, _M_data() + __pos + __len1, __how_much); _M_rep()->_M_dispose(__a); _M_data(__r->_M_refdata()); } else if (__how_much && __len1 != __len2) { _M_move(_M_data() + __pos + __len2, _M_data() + __pos + __len1, __how_much); } _M_rep()->_M_set_length_and_sharable(__new_size); } template<typename _CharT, typename _Traits, typename _Alloc> void basic_string<_CharT, _Traits, _Alloc>:: reserve(size_type __res) { if (__res != this->capacity() || _M_rep()->_M_is_shared()) { if (__res < this->size()) __res = this->size(); const allocator_type __a = get_allocator(); _CharT* __tmp = _M_rep()->_M_clone(__a, __res - this->size()); _M_rep()->_M_dispose(__a); _M_data(__tmp); } } template<typename _CharT, typename _Traits, typename _Alloc> void basic_string<_CharT, _Traits, _Alloc>:: swap(basic_string& __s) { if (_M_rep()->_M_is_leaked()) _M_rep()->_M_set_sharable(); if (__s._M_rep()->_M_is_leaked()) __s._M_rep()->_M_set_sharable(); if (this->get_allocator() == __s.get_allocator()) { _CharT* __tmp = _M_data(); _M_data(__s._M_data()); __s._M_data(__tmp); } else { const basic_string __tmp1(_M_ibegin(), _M_iend(), __s.get_allocator()); const basic_string __tmp2(__s._M_ibegin(), __s._M_iend(), this->get_allocator()); *this = __tmp2; __s = __tmp1; } } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::_Rep* basic_string<_CharT, _Traits, _Alloc>::_Rep:: _S_create(size_type __capacity, size_type __old_capacity, const _Alloc& __alloc) { if (__capacity > _S_max_size) __throw_length_error(("basic_string::_S_create")); # 579 "/usr/include/c++/4.7/bits/basic_string.tcc" 3 const size_type __pagesize = 4096; const size_type __malloc_header_size = 4 * sizeof(void*); if (__capacity > __old_capacity && __capacity < 2 * __old_capacity) __capacity = 2 * __old_capacity; size_type __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); const size_type __adj_size = __size + __malloc_header_size; if (__adj_size > __pagesize && __capacity > __old_capacity) { const size_type __extra = __pagesize - __adj_size % __pagesize; __capacity += __extra / sizeof(_CharT); if (__capacity > _S_max_size) __capacity = _S_max_size; __size = (__capacity + 1) * sizeof(_CharT) + sizeof(_Rep); } void* __place = _Raw_bytes_alloc(__alloc).allocate(__size); _Rep *__p = new (__place) _Rep; __p->_M_capacity = __capacity; __p->_M_set_sharable(); return __p; } template<typename _CharT, typename _Traits, typename _Alloc> _CharT* basic_string<_CharT, _Traits, _Alloc>::_Rep:: _M_clone(const _Alloc& __alloc, size_type __res) { const size_type __requested_cap = this->_M_length + __res; _Rep* __r = _Rep::_S_create(__requested_cap, this->_M_capacity, __alloc); if (this->_M_length) _M_copy(__r->_M_refdata(), _M_refdata(), this->_M_length); __r->_M_set_length_and_sharable(this->_M_length); return __r->_M_refdata(); } template<typename _CharT, typename _Traits, typename _Alloc> void basic_string<_CharT, _Traits, _Alloc>:: resize(size_type __n, _CharT __c) { const size_type __size = this->size(); _M_check_length(__size, __n, "basic_string::resize"); if (__size < __n) this->append(__n - __size, __c); else if (__n < __size) this->erase(__n); } template<typename _CharT, typename _Traits, typename _Alloc> template<typename _InputIterator> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: _M_replace_dispatch(iterator __i1, iterator __i2, _InputIterator __k1, _InputIterator __k2, __false_type) { const basic_string __s(__k1, __k2); const size_type __n1 = __i2 - __i1; _M_check_length(__n1, __s.size(), "basic_string::_M_replace_dispatch"); return _M_replace_safe(__i1 - _M_ibegin(), __n1, __s._M_data(), __s.size()); } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: _M_replace_aux(size_type __pos1, size_type __n1, size_type __n2, _CharT __c) { _M_check_length(__n1, __n2, "basic_string::_M_replace_aux"); _M_mutate(__pos1, __n1, __n2); if (__n2) _M_assign(_M_data() + __pos1, __n2, __c); return *this; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc>& basic_string<_CharT, _Traits, _Alloc>:: _M_replace_safe(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) { _M_mutate(__pos1, __n1, __n2); if (__n2) _M_copy(_M_data() + __pos1, __s, __n2); return *this; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc> operator+(const _CharT* __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { ; typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef typename __string_type::size_type __size_type; const __size_type __len = _Traits::length(__lhs); __string_type __str; __str.reserve(__len + __rhs.size()); __str.append(__lhs, __len); __str.append(__rhs); return __str; } template<typename _CharT, typename _Traits, typename _Alloc> basic_string<_CharT, _Traits, _Alloc> operator+(_CharT __lhs, const basic_string<_CharT, _Traits, _Alloc>& __rhs) { typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef typename __string_type::size_type __size_type; __string_type __str; const __size_type __len = __rhs.size(); __str.reserve(__len + 1); __str.append(__size_type(1), __lhs); __str.append(__rhs); return __str; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: copy(_CharT* __s, size_type __n, size_type __pos) const { _M_check(__pos, "basic_string::copy"); __n = _M_limit(__pos, __n); ; if (__n) _M_copy(__s, _M_data() + __pos, __n); return __n; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find(const _CharT* __s, size_type __pos, size_type __n) const { ; const size_type __size = this->size(); const _CharT* __data = _M_data(); if (__n == 0) return __pos <= __size ? __pos : npos; if (__n <= __size) { for (; __pos <= __size - __n; ++__pos) if (traits_type::eq(__data[__pos], __s[0]) && traits_type::compare(__data + __pos + 1, __s + 1, __n - 1) == 0) return __pos; } return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find(_CharT __c, size_type __pos) const { size_type __ret = npos; const size_type __size = this->size(); if (__pos < __size) { const _CharT* __data = _M_data(); const size_type __n = __size - __pos; const _CharT* __p = traits_type::find(__data + __pos, __n, __c); if (__p) __ret = __p - __data; } return __ret; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: rfind(const _CharT* __s, size_type __pos, size_type __n) const { ; const size_type __size = this->size(); if (__n <= __size) { __pos = std::min(size_type(__size - __n), __pos); const _CharT* __data = _M_data(); do { if (traits_type::compare(__data + __pos, __s, __n) == 0) return __pos; } while (__pos-- > 0); } return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: rfind(_CharT __c, size_type __pos) const { size_type __size = this->size(); if (__size) { if (--__size > __pos) __size = __pos; for (++__size; __size-- > 0; ) if (traits_type::eq(_M_data()[__size], __c)) return __size; } return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find_first_of(const _CharT* __s, size_type __pos, size_type __n) const { ; for (; __n && __pos < this->size(); ++__pos) { const _CharT* __p = traits_type::find(__s, __n, _M_data()[__pos]); if (__p) return __pos; } return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find_last_of(const _CharT* __s, size_type __pos, size_type __n) const { ; size_type __size = this->size(); if (__size && __n) { if (--__size > __pos) __size = __pos; do { if (traits_type::find(__s, __n, _M_data()[__size])) return __size; } while (__size-- != 0); } return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find_first_not_of(const _CharT* __s, size_type __pos, size_type __n) const { ; for (; __pos < this->size(); ++__pos) if (!traits_type::find(__s, __n, _M_data()[__pos])) return __pos; return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find_first_not_of(_CharT __c, size_type __pos) const { for (; __pos < this->size(); ++__pos) if (!traits_type::eq(_M_data()[__pos], __c)) return __pos; return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find_last_not_of(const _CharT* __s, size_type __pos, size_type __n) const { ; size_type __size = this->size(); if (__size) { if (--__size > __pos) __size = __pos; do { if (!traits_type::find(__s, __n, _M_data()[__size])) return __size; } while (__size--); } return npos; } template<typename _CharT, typename _Traits, typename _Alloc> typename basic_string<_CharT, _Traits, _Alloc>::size_type basic_string<_CharT, _Traits, _Alloc>:: find_last_not_of(_CharT __c, size_type __pos) const { size_type __size = this->size(); if (__size) { if (--__size > __pos) __size = __pos; do { if (!traits_type::eq(_M_data()[__size], __c)) return __size; } while (__size--); } return npos; } template<typename _CharT, typename _Traits, typename _Alloc> int basic_string<_CharT, _Traits, _Alloc>:: compare(size_type __pos, size_type __n, const basic_string& __str) const { _M_check(__pos, "basic_string::compare"); __n = _M_limit(__pos, __n); const size_type __osize = __str.size(); const size_type __len = std::min(__n, __osize); int __r = traits_type::compare(_M_data() + __pos, __str.data(), __len); if (!__r) __r = _S_compare(__n, __osize); return __r; } template<typename _CharT, typename _Traits, typename _Alloc> int basic_string<_CharT, _Traits, _Alloc>:: compare(size_type __pos1, size_type __n1, const basic_string& __str, size_type __pos2, size_type __n2) const { _M_check(__pos1, "basic_string::compare"); __str._M_check(__pos2, "basic_string::compare"); __n1 = _M_limit(__pos1, __n1); __n2 = __str._M_limit(__pos2, __n2); const size_type __len = std::min(__n1, __n2); int __r = traits_type::compare(_M_data() + __pos1, __str.data() + __pos2, __len); if (!__r) __r = _S_compare(__n1, __n2); return __r; } template<typename _CharT, typename _Traits, typename _Alloc> int basic_string<_CharT, _Traits, _Alloc>:: compare(const _CharT* __s) const { ; const size_type __size = this->size(); const size_type __osize = traits_type::length(__s); const size_type __len = std::min(__size, __osize); int __r = traits_type::compare(_M_data(), __s, __len); if (!__r) __r = _S_compare(__size, __osize); return __r; } template<typename _CharT, typename _Traits, typename _Alloc> int basic_string <_CharT, _Traits, _Alloc>:: compare(size_type __pos, size_type __n1, const _CharT* __s) const { ; _M_check(__pos, "basic_string::compare"); __n1 = _M_limit(__pos, __n1); const size_type __osize = traits_type::length(__s); const size_type __len = std::min(__n1, __osize); int __r = traits_type::compare(_M_data() + __pos, __s, __len); if (!__r) __r = _S_compare(__n1, __osize); return __r; } template<typename _CharT, typename _Traits, typename _Alloc> int basic_string <_CharT, _Traits, _Alloc>:: compare(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) const { ; _M_check(__pos, "basic_string::compare"); __n1 = _M_limit(__pos, __n1); const size_type __len = std::min(__n1, __n2); int __r = traits_type::compare(_M_data() + __pos, __s, __len); if (!__r) __r = _S_compare(__n1, __n2); return __r; } template<typename _CharT, typename _Traits, typename _Alloc> basic_istream<_CharT, _Traits>& operator>>(basic_istream<_CharT, _Traits>& __in, basic_string<_CharT, _Traits, _Alloc>& __str) { typedef basic_istream<_CharT, _Traits> __istream_type; typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef typename __istream_type::ios_base __ios_base; typedef typename __istream_type::int_type __int_type; typedef typename __string_type::size_type __size_type; typedef ctype<_CharT> __ctype_type; typedef typename __ctype_type::ctype_base __ctype_base; __size_type __extracted = 0; typename __ios_base::iostate __err = __ios_base::goodbit; typename __istream_type::sentry __cerb(__in, false); if (__cerb) { try { __str.erase(); _CharT __buf[128]; __size_type __len = 0; const streamsize __w = __in.width(); const __size_type __n = __w > 0 ? static_cast<__size_type>(__w) : __str.max_size(); const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); const __int_type __eof = _Traits::eof(); __int_type __c = __in.rdbuf()->sgetc(); while (__extracted < __n && !_Traits::eq_int_type(__c, __eof) && !__ct.is(__ctype_base::space, _Traits::to_char_type(__c))) { if (__len == sizeof(__buf) / sizeof(_CharT)) { __str.append(__buf, sizeof(__buf) / sizeof(_CharT)); __len = 0; } __buf[__len++] = _Traits::to_char_type(__c); ++__extracted; __c = __in.rdbuf()->snextc(); } __str.append(__buf, __len); if (_Traits::eq_int_type(__c, __eof)) __err |= __ios_base::eofbit; __in.width(0); } catch(__cxxabiv1::__forced_unwind&) { __in._M_setstate(__ios_base::badbit); throw; } catch(...) { __in._M_setstate(__ios_base::badbit); } } if (!__extracted) __err |= __ios_base::failbit; if (__err) __in.setstate(__err); return __in; } template<typename _CharT, typename _Traits, typename _Alloc> basic_istream<_CharT, _Traits>& getline(basic_istream<_CharT, _Traits>& __in, basic_string<_CharT, _Traits, _Alloc>& __str, _CharT __delim) { typedef basic_istream<_CharT, _Traits> __istream_type; typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef typename __istream_type::ios_base __ios_base; typedef typename __istream_type::int_type __int_type; typedef typename __string_type::size_type __size_type; __size_type __extracted = 0; const __size_type __n = __str.max_size(); typename __ios_base::iostate __err = __ios_base::goodbit; typename __istream_type::sentry __cerb(__in, true); if (__cerb) { try { __str.erase(); const __int_type __idelim = _Traits::to_int_type(__delim); const __int_type __eof = _Traits::eof(); __int_type __c = __in.rdbuf()->sgetc(); while (__extracted < __n && !_Traits::eq_int_type(__c, __eof) && !_Traits::eq_int_type(__c, __idelim)) { __str += _Traits::to_char_type(__c); ++__extracted; __c = __in.rdbuf()->snextc(); } if (_Traits::eq_int_type(__c, __eof)) __err |= __ios_base::eofbit; else if (_Traits::eq_int_type(__c, __idelim)) { ++__extracted; __in.rdbuf()->sbumpc(); } else __err |= __ios_base::failbit; } catch(__cxxabiv1::__forced_unwind&) { __in._M_setstate(__ios_base::badbit); throw; } catch(...) { __in._M_setstate(__ios_base::badbit); } } if (!__extracted) __err |= __ios_base::failbit; if (__err) __in.setstate(__err); return __in; } extern template class basic_string<char>; extern template basic_istream<char>& operator>>(basic_istream<char>&, string&); extern template basic_ostream<char>& operator<<(basic_ostream<char>&, const string&); extern template basic_istream<char>& getline(basic_istream<char>&, string&, char); extern template basic_istream<char>& getline(basic_istream<char>&, string&); extern template class basic_string<wchar_t>; extern template basic_istream<wchar_t>& operator>>(basic_istream<wchar_t>&, wstring&); extern template basic_ostream<wchar_t>& operator<<(basic_ostream<wchar_t>&, const wstring&); extern template basic_istream<wchar_t>& getline(basic_istream<wchar_t>&, wstring&, wchar_t); extern template basic_istream<wchar_t>& getline(basic_istream<wchar_t>&, wstring&); } # 56 "/usr/include/c++/4.7/string" 2 3 # 43 "/usr/include/c++/4.7/bits/locale_classes.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 64 "/usr/include/c++/4.7/bits/locale_classes.h" 3 class locale { public: typedef int category; class facet; class id; class _Impl; friend class facet; friend class _Impl; template<typename _Facet> friend bool has_facet(const locale&) throw(); template<typename _Facet> friend const _Facet& use_facet(const locale&); template<typename _Cache> friend struct __use_cache; # 100 "/usr/include/c++/4.7/bits/locale_classes.h" 3 static const category none = 0; static const category ctype = 1L << 0; static const category numeric = 1L << 1; static const category collate = 1L << 2; static const category time = 1L << 3; static const category monetary = 1L << 4; static const category messages = 1L << 5; static const category all = (ctype | numeric | collate | time | monetary | messages); # 119 "/usr/include/c++/4.7/bits/locale_classes.h" 3 locale() throw(); # 128 "/usr/include/c++/4.7/bits/locale_classes.h" 3 locale(const locale& __other) throw(); # 138 "/usr/include/c++/4.7/bits/locale_classes.h" 3 explicit locale(const char* __s); # 153 "/usr/include/c++/4.7/bits/locale_classes.h" 3 locale(const locale& __base, const char* __s, category __cat); # 166 "/usr/include/c++/4.7/bits/locale_classes.h" 3 locale(const locale& __base, const locale& __add, category __cat); # 179 "/usr/include/c++/4.7/bits/locale_classes.h" 3 template<typename _Facet> locale(const locale& __other, _Facet* __f); ~locale() throw(); # 193 "/usr/include/c++/4.7/bits/locale_classes.h" 3 const locale& operator=(const locale& __other) throw(); # 208 "/usr/include/c++/4.7/bits/locale_classes.h" 3 template<typename _Facet> locale combine(const locale& __other) const; string name() const; # 227 "/usr/include/c++/4.7/bits/locale_classes.h" 3 bool operator==(const locale& __other) const throw(); bool operator!=(const locale& __other) const throw() { return !(this->operator==(__other)); } # 255 "/usr/include/c++/4.7/bits/locale_classes.h" 3 template<typename _Char, typename _Traits, typename _Alloc> bool operator()(const basic_string<_Char, _Traits, _Alloc>& __s1, const basic_string<_Char, _Traits, _Alloc>& __s2) const; # 271 "/usr/include/c++/4.7/bits/locale_classes.h" 3 static locale global(const locale& __loc); static const locale& classic(); private: _Impl* _M_impl; static _Impl* _S_classic; static _Impl* _S_global; static const char* const* const _S_categories; # 306 "/usr/include/c++/4.7/bits/locale_classes.h" 3 enum { _S_categories_size = 6 + 6 }; static __gthread_once_t _S_once; explicit locale(_Impl*) throw(); static void _S_initialize(); static void _S_initialize_once() throw(); static category _S_normalize_category(category); void _M_coalesce(const locale& __base, const locale& __add, category __cat); }; # 340 "/usr/include/c++/4.7/bits/locale_classes.h" 3 class locale::facet { private: friend class locale; friend class locale::_Impl; mutable _Atomic_word _M_refcount; static __c_locale _S_c_locale; static const char _S_c_name[2]; static __gthread_once_t _S_once; static void _S_initialize_once(); protected: # 371 "/usr/include/c++/4.7/bits/locale_classes.h" 3 explicit facet(size_t __refs = 0) throw() : _M_refcount(__refs ? 1 : 0) { } virtual ~facet(); static void _S_create_c_locale(__c_locale& __cloc, const char* __s, __c_locale __old = 0); static __c_locale _S_clone_c_locale(__c_locale& __cloc) throw(); static void _S_destroy_c_locale(__c_locale& __cloc); static __c_locale _S_lc_ctype_c_locale(__c_locale __cloc, const char* __s); static __c_locale _S_get_c_locale(); __attribute__ ((__const__)) static const char* _S_get_c_name() throw(); private: void _M_add_reference() const throw() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } void _M_remove_reference() const throw() { ; if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) { ; try { delete this; } catch(...) { } } } facet(const facet&); facet& operator=(const facet&); }; # 438 "/usr/include/c++/4.7/bits/locale_classes.h" 3 class locale::id { private: friend class locale; friend class locale::_Impl; template<typename _Facet> friend const _Facet& use_facet(const locale&); template<typename _Facet> friend bool has_facet(const locale&) throw(); mutable size_t _M_index; static _Atomic_word _S_refcount; void operator=(const id&); id(const id&); public: id() { } size_t _M_id() const throw(); }; class locale::_Impl { public: friend class locale; friend class locale::facet; template<typename _Facet> friend bool has_facet(const locale&) throw(); template<typename _Facet> friend const _Facet& use_facet(const locale&); template<typename _Cache> friend struct __use_cache; private: _Atomic_word _M_refcount; const facet** _M_facets; size_t _M_facets_size; const facet** _M_caches; char** _M_names; static const locale::id* const _S_id_ctype[]; static const locale::id* const _S_id_numeric[]; static const locale::id* const _S_id_collate[]; static const locale::id* const _S_id_time[]; static const locale::id* const _S_id_monetary[]; static const locale::id* const _S_id_messages[]; static const locale::id* const* const _S_facet_categories[]; void _M_add_reference() throw() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } void _M_remove_reference() throw() { ; if (__gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1) == 1) { ; try { delete this; } catch(...) { } } } _Impl(const _Impl&, size_t); _Impl(const char*, size_t); _Impl(size_t) throw(); ~_Impl() throw(); _Impl(const _Impl&); void operator=(const _Impl&); bool _M_check_same_name() { bool __ret = true; if (_M_names[1]) for (size_t __i = 0; __ret && __i < _S_categories_size - 1; ++__i) __ret = __builtin_strcmp(_M_names[__i], _M_names[__i + 1]) == 0; return __ret; } void _M_replace_categories(const _Impl*, category); void _M_replace_category(const _Impl*, const locale::id* const*); void _M_replace_facet(const _Impl*, const locale::id*); void _M_install_facet(const locale::id*, const facet*); template<typename _Facet> void _M_init_facet(_Facet* __facet) { _M_install_facet(&_Facet::id, __facet); } void _M_install_cache(const facet*, size_t); }; # 585 "/usr/include/c++/4.7/bits/locale_classes.h" 3 template<typename _CharT> class collate : public locale::facet { public: typedef _CharT char_type; typedef basic_string<_CharT> string_type; protected: __c_locale _M_c_locale_collate; public: static locale::id id; # 612 "/usr/include/c++/4.7/bits/locale_classes.h" 3 explicit collate(size_t __refs = 0) : facet(__refs), _M_c_locale_collate(_S_get_c_locale()) { } # 626 "/usr/include/c++/4.7/bits/locale_classes.h" 3 explicit collate(__c_locale __cloc, size_t __refs = 0) : facet(__refs), _M_c_locale_collate(_S_clone_c_locale(__cloc)) { } # 643 "/usr/include/c++/4.7/bits/locale_classes.h" 3 int compare(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const { return this->do_compare(__lo1, __hi1, __lo2, __hi2); } # 662 "/usr/include/c++/4.7/bits/locale_classes.h" 3 string_type transform(const _CharT* __lo, const _CharT* __hi) const { return this->do_transform(__lo, __hi); } # 676 "/usr/include/c++/4.7/bits/locale_classes.h" 3 long hash(const _CharT* __lo, const _CharT* __hi) const { return this->do_hash(__lo, __hi); } int _M_compare(const _CharT*, const _CharT*) const throw(); size_t _M_transform(_CharT*, const _CharT*, size_t) const throw(); protected: virtual ~collate() { _S_destroy_c_locale(_M_c_locale_collate); } # 705 "/usr/include/c++/4.7/bits/locale_classes.h" 3 virtual int do_compare(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const; # 719 "/usr/include/c++/4.7/bits/locale_classes.h" 3 virtual string_type do_transform(const _CharT* __lo, const _CharT* __hi) const; # 732 "/usr/include/c++/4.7/bits/locale_classes.h" 3 virtual long do_hash(const _CharT* __lo, const _CharT* __hi) const; }; template<typename _CharT> locale::id collate<_CharT>::id; template<> int collate<char>::_M_compare(const char*, const char*) const throw(); template<> size_t collate<char>::_M_transform(char*, const char*, size_t) const throw(); template<> int collate<wchar_t>::_M_compare(const wchar_t*, const wchar_t*) const throw(); template<> size_t collate<wchar_t>::_M_transform(wchar_t*, const wchar_t*, size_t) const throw(); template<typename _CharT> class collate_byname : public collate<_CharT> { public: typedef _CharT char_type; typedef basic_string<_CharT> string_type; explicit collate_byname(const char* __s, size_t __refs = 0) : collate<_CharT>(__refs) { if (__builtin_strcmp(__s, "C") != 0 && __builtin_strcmp(__s, "POSIX") != 0) { this->_S_destroy_c_locale(this->_M_c_locale_collate); this->_S_create_c_locale(this->_M_c_locale_collate, __s); } } protected: virtual ~collate_byname() { } }; } # 1 "/usr/include/c++/4.7/bits/locale_classes.tcc" 1 3 # 37 "/usr/include/c++/4.7/bits/locale_classes.tcc" 3 # 38 "/usr/include/c++/4.7/bits/locale_classes.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _Facet> locale:: locale(const locale& __other, _Facet* __f) { _M_impl = new _Impl(*__other._M_impl, 1); try { _M_impl->_M_install_facet(&_Facet::id, __f); } catch(...) { _M_impl->_M_remove_reference(); throw; } delete [] _M_impl->_M_names[0]; _M_impl->_M_names[0] = 0; } template<typename _Facet> locale locale:: combine(const locale& __other) const { _Impl* __tmp = new _Impl(*_M_impl, 1); try { __tmp->_M_replace_facet(__other._M_impl, &_Facet::id); } catch(...) { __tmp->_M_remove_reference(); throw; } return locale(__tmp); } template<typename _CharT, typename _Traits, typename _Alloc> bool locale:: operator()(const basic_string<_CharT, _Traits, _Alloc>& __s1, const basic_string<_CharT, _Traits, _Alloc>& __s2) const { typedef std::collate<_CharT> __collate_type; const __collate_type& __collate = use_facet<__collate_type>(*this); return (__collate.compare(__s1.data(), __s1.data() + __s1.length(), __s2.data(), __s2.data() + __s2.length()) < 0); } # 101 "/usr/include/c++/4.7/bits/locale_classes.tcc" 3 template<typename _Facet> bool has_facet(const locale& __loc) throw() { const size_t __i = _Facet::id._M_id(); const locale::facet** __facets = __loc._M_impl->_M_facets; return (__i < __loc._M_impl->_M_facets_size && dynamic_cast<const _Facet*>(__facets[__i])); } # 128 "/usr/include/c++/4.7/bits/locale_classes.tcc" 3 template<typename _Facet> const _Facet& use_facet(const locale& __loc) { const size_t __i = _Facet::id._M_id(); const locale::facet** __facets = __loc._M_impl->_M_facets; if (__i >= __loc._M_impl->_M_facets_size || !__facets[__i]) __throw_bad_cast(); return dynamic_cast<const _Facet&>(*__facets[__i]); } template<typename _CharT> int collate<_CharT>::_M_compare(const _CharT*, const _CharT*) const throw () { return 0; } template<typename _CharT> size_t collate<_CharT>::_M_transform(_CharT*, const _CharT*, size_t) const throw () { return 0; } template<typename _CharT> int collate<_CharT>:: do_compare(const _CharT* __lo1, const _CharT* __hi1, const _CharT* __lo2, const _CharT* __hi2) const { const string_type __one(__lo1, __hi1); const string_type __two(__lo2, __hi2); const _CharT* __p = __one.c_str(); const _CharT* __pend = __one.data() + __one.length(); const _CharT* __q = __two.c_str(); const _CharT* __qend = __two.data() + __two.length(); for (;;) { const int __res = _M_compare(__p, __q); if (__res) return __res; __p += char_traits<_CharT>::length(__p); __q += char_traits<_CharT>::length(__q); if (__p == __pend && __q == __qend) return 0; else if (__p == __pend) return -1; else if (__q == __qend) return 1; __p++; __q++; } } template<typename _CharT> typename collate<_CharT>::string_type collate<_CharT>:: do_transform(const _CharT* __lo, const _CharT* __hi) const { string_type __ret; const string_type __str(__lo, __hi); const _CharT* __p = __str.c_str(); const _CharT* __pend = __str.data() + __str.length(); size_t __len = (__hi - __lo) * 2; _CharT* __c = new _CharT[__len]; try { for (;;) { size_t __res = _M_transform(__c, __p, __len); if (__res >= __len) { __len = __res + 1; delete [] __c, __c = 0; __c = new _CharT[__len]; __res = _M_transform(__c, __p, __len); } __ret.append(__c, __res); __p += char_traits<_CharT>::length(__p); if (__p == __pend) break; __p++; __ret.push_back(_CharT()); } } catch(...) { delete [] __c; throw; } delete [] __c; return __ret; } template<typename _CharT> long collate<_CharT>:: do_hash(const _CharT* __lo, const _CharT* __hi) const { unsigned long __val = 0; for (; __lo < __hi; ++__lo) __val = *__lo + ((__val << 7) | (__val >> (__gnu_cxx::__numeric_traits<unsigned long>:: __digits - 7))); return static_cast<long>(__val); } extern template class collate<char>; extern template class collate_byname<char>; extern template const collate<char>& use_facet<collate<char> >(const locale&); extern template bool has_facet<collate<char> >(const locale&); extern template class collate<wchar_t>; extern template class collate_byname<wchar_t>; extern template const collate<wchar_t>& use_facet<collate<wchar_t> >(const locale&); extern template bool has_facet<collate<wchar_t> >(const locale&); } # 790 "/usr/include/c++/4.7/bits/locale_classes.h" 2 3 # 44 "/usr/include/c++/4.7/bits/ios_base.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { enum _Ios_Fmtflags { _S_boolalpha = 1L << 0, _S_dec = 1L << 1, _S_fixed = 1L << 2, _S_hex = 1L << 3, _S_internal = 1L << 4, _S_left = 1L << 5, _S_oct = 1L << 6, _S_right = 1L << 7, _S_scientific = 1L << 8, _S_showbase = 1L << 9, _S_showpoint = 1L << 10, _S_showpos = 1L << 11, _S_skipws = 1L << 12, _S_unitbuf = 1L << 13, _S_uppercase = 1L << 14, _S_adjustfield = _S_left | _S_right | _S_internal, _S_basefield = _S_dec | _S_oct | _S_hex, _S_floatfield = _S_scientific | _S_fixed, _S_ios_fmtflags_end = 1L << 16 }; inline _Ios_Fmtflags operator&(_Ios_Fmtflags __a, _Ios_Fmtflags __b) { return _Ios_Fmtflags(static_cast<int>(__a) & static_cast<int>(__b)); } inline _Ios_Fmtflags operator|(_Ios_Fmtflags __a, _Ios_Fmtflags __b) { return _Ios_Fmtflags(static_cast<int>(__a) | static_cast<int>(__b)); } inline _Ios_Fmtflags operator^(_Ios_Fmtflags __a, _Ios_Fmtflags __b) { return _Ios_Fmtflags(static_cast<int>(__a) ^ static_cast<int>(__b)); } inline _Ios_Fmtflags operator~(_Ios_Fmtflags __a) { return _Ios_Fmtflags(~static_cast<int>(__a)); } inline const _Ios_Fmtflags& operator|=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) { return __a = __a | __b; } inline const _Ios_Fmtflags& operator&=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) { return __a = __a & __b; } inline const _Ios_Fmtflags& operator^=(_Ios_Fmtflags& __a, _Ios_Fmtflags __b) { return __a = __a ^ __b; } enum _Ios_Openmode { _S_app = 1L << 0, _S_ate = 1L << 1, _S_bin = 1L << 2, _S_in = 1L << 3, _S_out = 1L << 4, _S_trunc = 1L << 5, _S_ios_openmode_end = 1L << 16 }; inline _Ios_Openmode operator&(_Ios_Openmode __a, _Ios_Openmode __b) { return _Ios_Openmode(static_cast<int>(__a) & static_cast<int>(__b)); } inline _Ios_Openmode operator|(_Ios_Openmode __a, _Ios_Openmode __b) { return _Ios_Openmode(static_cast<int>(__a) | static_cast<int>(__b)); } inline _Ios_Openmode operator^(_Ios_Openmode __a, _Ios_Openmode __b) { return _Ios_Openmode(static_cast<int>(__a) ^ static_cast<int>(__b)); } inline _Ios_Openmode operator~(_Ios_Openmode __a) { return _Ios_Openmode(~static_cast<int>(__a)); } inline const _Ios_Openmode& operator|=(_Ios_Openmode& __a, _Ios_Openmode __b) { return __a = __a | __b; } inline const _Ios_Openmode& operator&=(_Ios_Openmode& __a, _Ios_Openmode __b) { return __a = __a & __b; } inline const _Ios_Openmode& operator^=(_Ios_Openmode& __a, _Ios_Openmode __b) { return __a = __a ^ __b; } enum _Ios_Iostate { _S_goodbit = 0, _S_badbit = 1L << 0, _S_eofbit = 1L << 1, _S_failbit = 1L << 2, _S_ios_iostate_end = 1L << 16 }; inline _Ios_Iostate operator&(_Ios_Iostate __a, _Ios_Iostate __b) { return _Ios_Iostate(static_cast<int>(__a) & static_cast<int>(__b)); } inline _Ios_Iostate operator|(_Ios_Iostate __a, _Ios_Iostate __b) { return _Ios_Iostate(static_cast<int>(__a) | static_cast<int>(__b)); } inline _Ios_Iostate operator^(_Ios_Iostate __a, _Ios_Iostate __b) { return _Ios_Iostate(static_cast<int>(__a) ^ static_cast<int>(__b)); } inline _Ios_Iostate operator~(_Ios_Iostate __a) { return _Ios_Iostate(~static_cast<int>(__a)); } inline const _Ios_Iostate& operator|=(_Ios_Iostate& __a, _Ios_Iostate __b) { return __a = __a | __b; } inline const _Ios_Iostate& operator&=(_Ios_Iostate& __a, _Ios_Iostate __b) { return __a = __a & __b; } inline const _Ios_Iostate& operator^=(_Ios_Iostate& __a, _Ios_Iostate __b) { return __a = __a ^ __b; } enum _Ios_Seekdir { _S_beg = 0, _S_cur = 1, _S_end = 2, _S_ios_seekdir_end = 1L << 16 }; # 201 "/usr/include/c++/4.7/bits/ios_base.h" 3 class ios_base { public: class failure : public exception { public: explicit failure(const string& __str) throw(); virtual ~failure() throw(); virtual const char* what() const throw(); private: string _M_msg; }; # 257 "/usr/include/c++/4.7/bits/ios_base.h" 3 typedef _Ios_Fmtflags fmtflags; static const fmtflags boolalpha = _S_boolalpha; static const fmtflags dec = _S_dec; static const fmtflags fixed = _S_fixed; static const fmtflags hex = _S_hex; static const fmtflags internal = _S_internal; static const fmtflags left = _S_left; static const fmtflags oct = _S_oct; static const fmtflags right = _S_right; static const fmtflags scientific = _S_scientific; static const fmtflags showbase = _S_showbase; static const fmtflags showpoint = _S_showpoint; static const fmtflags showpos = _S_showpos; static const fmtflags skipws = _S_skipws; static const fmtflags unitbuf = _S_unitbuf; static const fmtflags uppercase = _S_uppercase; static const fmtflags adjustfield = _S_adjustfield; static const fmtflags basefield = _S_basefield; static const fmtflags floatfield = _S_floatfield; # 332 "/usr/include/c++/4.7/bits/ios_base.h" 3 typedef _Ios_Iostate iostate; static const iostate badbit = _S_badbit; static const iostate eofbit = _S_eofbit; static const iostate failbit = _S_failbit; static const iostate goodbit = _S_goodbit; # 363 "/usr/include/c++/4.7/bits/ios_base.h" 3 typedef _Ios_Openmode openmode; static const openmode app = _S_app; static const openmode ate = _S_ate; static const openmode binary = _S_bin; static const openmode in = _S_in; static const openmode out = _S_out; static const openmode trunc = _S_trunc; # 395 "/usr/include/c++/4.7/bits/ios_base.h" 3 typedef _Ios_Seekdir seekdir; static const seekdir beg = _S_beg; static const seekdir cur = _S_cur; static const seekdir end = _S_end; typedef int io_state; typedef int open_mode; typedef int seek_dir; typedef std::streampos streampos; typedef std::streamoff streamoff; # 421 "/usr/include/c++/4.7/bits/ios_base.h" 3 enum event { erase_event, imbue_event, copyfmt_event }; # 438 "/usr/include/c++/4.7/bits/ios_base.h" 3 typedef void (*event_callback) (event __e, ios_base& __b, int __i); # 450 "/usr/include/c++/4.7/bits/ios_base.h" 3 void register_callback(event_callback __fn, int __index); protected: streamsize _M_precision; streamsize _M_width; fmtflags _M_flags; iostate _M_exception; iostate _M_streambuf_state; struct _Callback_list { _Callback_list* _M_next; ios_base::event_callback _M_fn; int _M_index; _Atomic_word _M_refcount; _Callback_list(ios_base::event_callback __fn, int __index, _Callback_list* __cb) : _M_next(__cb), _M_fn(__fn), _M_index(__index), _M_refcount(0) { } void _M_add_reference() { __gnu_cxx::__atomic_add_dispatch(&_M_refcount, 1); } int _M_remove_reference() { ; int __res = __gnu_cxx::__exchange_and_add_dispatch(&_M_refcount, -1); if (__res == 0) { ; } return __res; } }; _Callback_list* _M_callbacks; void _M_call_callbacks(event __ev) throw(); void _M_dispose_callbacks(void) throw(); struct _Words { void* _M_pword; long _M_iword; _Words() : _M_pword(0), _M_iword(0) { } }; _Words _M_word_zero; enum { _S_local_word_size = 8 }; _Words _M_local_word[_S_local_word_size]; int _M_word_size; _Words* _M_word; _Words& _M_grow_words(int __index, bool __iword); locale _M_ios_locale; void _M_init() throw(); public: class Init { friend class ios_base; public: Init(); ~Init(); private: static _Atomic_word _S_refcount; static bool _S_synced_with_stdio; }; fmtflags flags() const { return _M_flags; } # 563 "/usr/include/c++/4.7/bits/ios_base.h" 3 fmtflags flags(fmtflags __fmtfl) { fmtflags __old = _M_flags; _M_flags = __fmtfl; return __old; } # 579 "/usr/include/c++/4.7/bits/ios_base.h" 3 fmtflags setf(fmtflags __fmtfl) { fmtflags __old = _M_flags; _M_flags |= __fmtfl; return __old; } # 596 "/usr/include/c++/4.7/bits/ios_base.h" 3 fmtflags setf(fmtflags __fmtfl, fmtflags __mask) { fmtflags __old = _M_flags; _M_flags &= ~__mask; _M_flags |= (__fmtfl & __mask); return __old; } void unsetf(fmtflags __mask) { _M_flags &= ~__mask; } # 622 "/usr/include/c++/4.7/bits/ios_base.h" 3 streamsize precision() const { return _M_precision; } streamsize precision(streamsize __prec) { streamsize __old = _M_precision; _M_precision = __prec; return __old; } streamsize width() const { return _M_width; } streamsize width(streamsize __wide) { streamsize __old = _M_width; _M_width = __wide; return __old; } # 673 "/usr/include/c++/4.7/bits/ios_base.h" 3 static bool sync_with_stdio(bool __sync = true); # 685 "/usr/include/c++/4.7/bits/ios_base.h" 3 locale imbue(const locale& __loc) throw(); # 696 "/usr/include/c++/4.7/bits/ios_base.h" 3 locale getloc() const { return _M_ios_locale; } # 707 "/usr/include/c++/4.7/bits/ios_base.h" 3 const locale& _M_getloc() const { return _M_ios_locale; } # 726 "/usr/include/c++/4.7/bits/ios_base.h" 3 static int xalloc() throw(); # 742 "/usr/include/c++/4.7/bits/ios_base.h" 3 long& iword(int __ix) { _Words& __word = (__ix < _M_word_size) ? _M_word[__ix] : _M_grow_words(__ix, true); return __word._M_iword; } # 763 "/usr/include/c++/4.7/bits/ios_base.h" 3 void*& pword(int __ix) { _Words& __word = (__ix < _M_word_size) ? _M_word[__ix] : _M_grow_words(__ix, false); return __word._M_pword; } # 780 "/usr/include/c++/4.7/bits/ios_base.h" 3 virtual ~ios_base(); protected: ios_base() throw (); private: ios_base(const ios_base&); ios_base& operator=(const ios_base&); }; inline ios_base& boolalpha(ios_base& __base) { __base.setf(ios_base::boolalpha); return __base; } inline ios_base& noboolalpha(ios_base& __base) { __base.unsetf(ios_base::boolalpha); return __base; } inline ios_base& showbase(ios_base& __base) { __base.setf(ios_base::showbase); return __base; } inline ios_base& noshowbase(ios_base& __base) { __base.unsetf(ios_base::showbase); return __base; } inline ios_base& showpoint(ios_base& __base) { __base.setf(ios_base::showpoint); return __base; } inline ios_base& noshowpoint(ios_base& __base) { __base.unsetf(ios_base::showpoint); return __base; } inline ios_base& showpos(ios_base& __base) { __base.setf(ios_base::showpos); return __base; } inline ios_base& noshowpos(ios_base& __base) { __base.unsetf(ios_base::showpos); return __base; } inline ios_base& skipws(ios_base& __base) { __base.setf(ios_base::skipws); return __base; } inline ios_base& noskipws(ios_base& __base) { __base.unsetf(ios_base::skipws); return __base; } inline ios_base& uppercase(ios_base& __base) { __base.setf(ios_base::uppercase); return __base; } inline ios_base& nouppercase(ios_base& __base) { __base.unsetf(ios_base::uppercase); return __base; } inline ios_base& unitbuf(ios_base& __base) { __base.setf(ios_base::unitbuf); return __base; } inline ios_base& nounitbuf(ios_base& __base) { __base.unsetf(ios_base::unitbuf); return __base; } inline ios_base& internal(ios_base& __base) { __base.setf(ios_base::internal, ios_base::adjustfield); return __base; } inline ios_base& left(ios_base& __base) { __base.setf(ios_base::left, ios_base::adjustfield); return __base; } inline ios_base& right(ios_base& __base) { __base.setf(ios_base::right, ios_base::adjustfield); return __base; } inline ios_base& dec(ios_base& __base) { __base.setf(ios_base::dec, ios_base::basefield); return __base; } inline ios_base& hex(ios_base& __base) { __base.setf(ios_base::hex, ios_base::basefield); return __base; } inline ios_base& oct(ios_base& __base) { __base.setf(ios_base::oct, ios_base::basefield); return __base; } inline ios_base& fixed(ios_base& __base) { __base.setf(ios_base::fixed, ios_base::floatfield); return __base; } inline ios_base& scientific(ios_base& __base) { __base.setf(ios_base::scientific, ios_base::floatfield); return __base; } } # 44 "/usr/include/c++/4.7/ios" 2 3 # 1 "/usr/include/c++/4.7/streambuf" 1 3 # 37 "/usr/include/c++/4.7/streambuf" 3 # 38 "/usr/include/c++/4.7/streambuf" 3 # 46 "/usr/include/c++/4.7/streambuf" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _CharT, typename _Traits> streamsize __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>*, basic_streambuf<_CharT, _Traits>*, bool&); # 116 "/usr/include/c++/4.7/streambuf" 3 template<typename _CharT, typename _Traits> class basic_streambuf { public: typedef _CharT char_type; typedef _Traits traits_type; typedef typename traits_type::int_type int_type; typedef typename traits_type::pos_type pos_type; typedef typename traits_type::off_type off_type; typedef basic_streambuf<char_type, traits_type> __streambuf_type; friend class basic_ios<char_type, traits_type>; friend class basic_istream<char_type, traits_type>; friend class basic_ostream<char_type, traits_type>; friend class istreambuf_iterator<char_type, traits_type>; friend class ostreambuf_iterator<char_type, traits_type>; friend streamsize __copy_streambufs_eof<>(__streambuf_type*, __streambuf_type*, bool&); template<bool _IsMove, typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, _CharT2*>::__type __copy_move_a2(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, _CharT2*); template<typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, istreambuf_iterator<_CharT2> >::__type find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, const _CharT2&); template<typename _CharT2, typename _Traits2> friend basic_istream<_CharT2, _Traits2>& operator>>(basic_istream<_CharT2, _Traits2>&, _CharT2*); template<typename _CharT2, typename _Traits2, typename _Alloc> friend basic_istream<_CharT2, _Traits2>& operator>>(basic_istream<_CharT2, _Traits2>&, basic_string<_CharT2, _Traits2, _Alloc>&); template<typename _CharT2, typename _Traits2, typename _Alloc> friend basic_istream<_CharT2, _Traits2>& getline(basic_istream<_CharT2, _Traits2>&, basic_string<_CharT2, _Traits2, _Alloc>&, _CharT2); protected: # 182 "/usr/include/c++/4.7/streambuf" 3 char_type* _M_in_beg; char_type* _M_in_cur; char_type* _M_in_end; char_type* _M_out_beg; char_type* _M_out_cur; char_type* _M_out_end; locale _M_buf_locale; public: virtual ~basic_streambuf() { } # 206 "/usr/include/c++/4.7/streambuf" 3 locale pubimbue(const locale& __loc) { locale __tmp(this->getloc()); this->imbue(__loc); _M_buf_locale = __loc; return __tmp; } # 223 "/usr/include/c++/4.7/streambuf" 3 locale getloc() const { return _M_buf_locale; } # 236 "/usr/include/c++/4.7/streambuf" 3 __streambuf_type* pubsetbuf(char_type* __s, streamsize __n) { return this->setbuf(__s, __n); } # 248 "/usr/include/c++/4.7/streambuf" 3 pos_type pubseekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out) { return this->seekoff(__off, __way, __mode); } # 260 "/usr/include/c++/4.7/streambuf" 3 pos_type pubseekpos(pos_type __sp, ios_base::openmode __mode = ios_base::in | ios_base::out) { return this->seekpos(__sp, __mode); } int pubsync() { return this->sync(); } # 281 "/usr/include/c++/4.7/streambuf" 3 streamsize in_avail() { const streamsize __ret = this->egptr() - this->gptr(); return __ret ? __ret : this->showmanyc(); } # 295 "/usr/include/c++/4.7/streambuf" 3 int_type snextc() { int_type __ret = traits_type::eof(); if (__builtin_expect(!traits_type::eq_int_type(this->sbumpc(), __ret), true)) __ret = this->sgetc(); return __ret; } # 313 "/usr/include/c++/4.7/streambuf" 3 int_type sbumpc() { int_type __ret; if (__builtin_expect(this->gptr() < this->egptr(), true)) { __ret = traits_type::to_int_type(*this->gptr()); this->gbump(1); } else __ret = this->uflow(); return __ret; } # 335 "/usr/include/c++/4.7/streambuf" 3 int_type sgetc() { int_type __ret; if (__builtin_expect(this->gptr() < this->egptr(), true)) __ret = traits_type::to_int_type(*this->gptr()); else __ret = this->underflow(); return __ret; } # 354 "/usr/include/c++/4.7/streambuf" 3 streamsize sgetn(char_type* __s, streamsize __n) { return this->xsgetn(__s, __n); } # 369 "/usr/include/c++/4.7/streambuf" 3 int_type sputbackc(char_type __c) { int_type __ret; const bool __testpos = this->eback() < this->gptr(); if (__builtin_expect(!__testpos || !traits_type::eq(__c, this->gptr()[-1]), false)) __ret = this->pbackfail(traits_type::to_int_type(__c)); else { this->gbump(-1); __ret = traits_type::to_int_type(*this->gptr()); } return __ret; } # 394 "/usr/include/c++/4.7/streambuf" 3 int_type sungetc() { int_type __ret; if (__builtin_expect(this->eback() < this->gptr(), true)) { this->gbump(-1); __ret = traits_type::to_int_type(*this->gptr()); } else __ret = this->pbackfail(); return __ret; } # 421 "/usr/include/c++/4.7/streambuf" 3 int_type sputc(char_type __c) { int_type __ret; if (__builtin_expect(this->pptr() < this->epptr(), true)) { *this->pptr() = __c; this->pbump(1); __ret = traits_type::to_int_type(__c); } else __ret = this->overflow(traits_type::to_int_type(__c)); return __ret; } # 447 "/usr/include/c++/4.7/streambuf" 3 streamsize sputn(const char_type* __s, streamsize __n) { return this->xsputn(__s, __n); } protected: # 461 "/usr/include/c++/4.7/streambuf" 3 basic_streambuf() : _M_in_beg(0), _M_in_cur(0), _M_in_end(0), _M_out_beg(0), _M_out_cur(0), _M_out_end(0), _M_buf_locale(locale()) { } # 479 "/usr/include/c++/4.7/streambuf" 3 char_type* eback() const { return _M_in_beg; } char_type* gptr() const { return _M_in_cur; } char_type* egptr() const { return _M_in_end; } # 495 "/usr/include/c++/4.7/streambuf" 3 void gbump(int __n) { _M_in_cur += __n; } # 506 "/usr/include/c++/4.7/streambuf" 3 void setg(char_type* __gbeg, char_type* __gnext, char_type* __gend) { _M_in_beg = __gbeg; _M_in_cur = __gnext; _M_in_end = __gend; } # 526 "/usr/include/c++/4.7/streambuf" 3 char_type* pbase() const { return _M_out_beg; } char_type* pptr() const { return _M_out_cur; } char_type* epptr() const { return _M_out_end; } # 542 "/usr/include/c++/4.7/streambuf" 3 void pbump(int __n) { _M_out_cur += __n; } # 552 "/usr/include/c++/4.7/streambuf" 3 void setp(char_type* __pbeg, char_type* __pend) { _M_out_beg = _M_out_cur = __pbeg; _M_out_end = __pend; } # 573 "/usr/include/c++/4.7/streambuf" 3 virtual void imbue(const locale& __loc) { } # 588 "/usr/include/c++/4.7/streambuf" 3 virtual basic_streambuf<char_type,_Traits>* setbuf(char_type*, streamsize) { return this; } # 599 "/usr/include/c++/4.7/streambuf" 3 virtual pos_type seekoff(off_type, ios_base::seekdir, ios_base::openmode = ios_base::in | ios_base::out) { return pos_type(off_type(-1)); } # 611 "/usr/include/c++/4.7/streambuf" 3 virtual pos_type seekpos(pos_type, ios_base::openmode = ios_base::in | ios_base::out) { return pos_type(off_type(-1)); } # 624 "/usr/include/c++/4.7/streambuf" 3 virtual int sync() { return 0; } # 646 "/usr/include/c++/4.7/streambuf" 3 virtual streamsize showmanyc() { return 0; } # 662 "/usr/include/c++/4.7/streambuf" 3 virtual streamsize xsgetn(char_type* __s, streamsize __n); # 684 "/usr/include/c++/4.7/streambuf" 3 virtual int_type underflow() { return traits_type::eof(); } # 697 "/usr/include/c++/4.7/streambuf" 3 virtual int_type uflow() { int_type __ret = traits_type::eof(); const bool __testeof = traits_type::eq_int_type(this->underflow(), __ret); if (!__testeof) { __ret = traits_type::to_int_type(*this->gptr()); this->gbump(1); } return __ret; } # 721 "/usr/include/c++/4.7/streambuf" 3 virtual int_type pbackfail(int_type __c = traits_type::eof()) { return traits_type::eof(); } # 739 "/usr/include/c++/4.7/streambuf" 3 virtual streamsize xsputn(const char_type* __s, streamsize __n); # 765 "/usr/include/c++/4.7/streambuf" 3 virtual int_type overflow(int_type __c = traits_type::eof()) { return traits_type::eof(); } public: # 780 "/usr/include/c++/4.7/streambuf" 3 void stossc() { if (this->gptr() < this->egptr()) this->gbump(1); else this->uflow(); } void __safe_gbump(streamsize __n) { _M_in_cur += __n; } void __safe_pbump(streamsize __n) { _M_out_cur += __n; } private: basic_streambuf(const __streambuf_type& __sb) : _M_in_beg(__sb._M_in_beg), _M_in_cur(__sb._M_in_cur), _M_in_end(__sb._M_in_end), _M_out_beg(__sb._M_out_beg), _M_out_cur(__sb._M_out_cur), _M_out_end(__sb._M_out_cur), _M_buf_locale(__sb._M_buf_locale) { } __streambuf_type& operator=(const __streambuf_type&) { return *this; }; }; template<> streamsize __copy_streambufs_eof(basic_streambuf<char>* __sbin, basic_streambuf<char>* __sbout, bool& __ineof); template<> streamsize __copy_streambufs_eof(basic_streambuf<wchar_t>* __sbin, basic_streambuf<wchar_t>* __sbout, bool& __ineof); } # 1 "/usr/include/c++/4.7/bits/streambuf.tcc" 1 3 # 38 "/usr/include/c++/4.7/bits/streambuf.tcc" 3 # 39 "/usr/include/c++/4.7/bits/streambuf.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _CharT, typename _Traits> streamsize basic_streambuf<_CharT, _Traits>:: xsgetn(char_type* __s, streamsize __n) { streamsize __ret = 0; while (__ret < __n) { const streamsize __buf_len = this->egptr() - this->gptr(); if (__buf_len) { const streamsize __remaining = __n - __ret; const streamsize __len = std::min(__buf_len, __remaining); traits_type::copy(__s, this->gptr(), __len); __ret += __len; __s += __len; this->__safe_gbump(__len); } if (__ret < __n) { const int_type __c = this->uflow(); if (!traits_type::eq_int_type(__c, traits_type::eof())) { traits_type::assign(*__s++, traits_type::to_char_type(__c)); ++__ret; } else break; } } return __ret; } template<typename _CharT, typename _Traits> streamsize basic_streambuf<_CharT, _Traits>:: xsputn(const char_type* __s, streamsize __n) { streamsize __ret = 0; while (__ret < __n) { const streamsize __buf_len = this->epptr() - this->pptr(); if (__buf_len) { const streamsize __remaining = __n - __ret; const streamsize __len = std::min(__buf_len, __remaining); traits_type::copy(this->pptr(), __s, __len); __ret += __len; __s += __len; this->__safe_pbump(__len); } if (__ret < __n) { int_type __c = this->overflow(traits_type::to_int_type(*__s)); if (!traits_type::eq_int_type(__c, traits_type::eof())) { ++__ret; ++__s; } else break; } } return __ret; } template<typename _CharT, typename _Traits> streamsize __copy_streambufs_eof(basic_streambuf<_CharT, _Traits>* __sbin, basic_streambuf<_CharT, _Traits>* __sbout, bool& __ineof) { streamsize __ret = 0; __ineof = true; typename _Traits::int_type __c = __sbin->sgetc(); while (!_Traits::eq_int_type(__c, _Traits::eof())) { __c = __sbout->sputc(_Traits::to_char_type(__c)); if (_Traits::eq_int_type(__c, _Traits::eof())) { __ineof = false; break; } ++__ret; __c = __sbin->snextc(); } return __ret; } template<typename _CharT, typename _Traits> inline streamsize __copy_streambufs(basic_streambuf<_CharT, _Traits>* __sbin, basic_streambuf<_CharT, _Traits>* __sbout) { bool __ineof; return __copy_streambufs_eof(__sbin, __sbout, __ineof); } extern template class basic_streambuf<char>; extern template streamsize __copy_streambufs(basic_streambuf<char>*, basic_streambuf<char>*); extern template streamsize __copy_streambufs_eof(basic_streambuf<char>*, basic_streambuf<char>*, bool&); extern template class basic_streambuf<wchar_t>; extern template streamsize __copy_streambufs(basic_streambuf<wchar_t>*, basic_streambuf<wchar_t>*); extern template streamsize __copy_streambufs_eof(basic_streambuf<wchar_t>*, basic_streambuf<wchar_t>*, bool&); } # 827 "/usr/include/c++/4.7/streambuf" 2 3 # 45 "/usr/include/c++/4.7/ios" 2 3 # 1 "/usr/include/c++/4.7/bits/basic_ios.h" 1 3 # 35 "/usr/include/c++/4.7/bits/basic_ios.h" 3 # 36 "/usr/include/c++/4.7/bits/basic_ios.h" 3 # 1 "/usr/include/c++/4.7/bits/locale_facets.h" 1 3 # 39 "/usr/include/c++/4.7/bits/locale_facets.h" 3 # 40 "/usr/include/c++/4.7/bits/locale_facets.h" 3 # 1 "/usr/include/c++/4.7/cwctype" 1 3 # 41 "/usr/include/c++/4.7/cwctype" 3 # 42 "/usr/include/c++/4.7/cwctype" 3 # 52 "/usr/include/c++/4.7/cwctype" 3 # 1 "/usr/include/wctype.h" 1 3 4 # 34 "/usr/include/wctype.h" 3 4 # 1 "/usr/include/wchar.h" 1 3 4 # 35 "/usr/include/wctype.h" 2 3 4 # 50 "/usr/include/wctype.h" 3 4 typedef unsigned long int wctype_t; # 72 "/usr/include/wctype.h" 3 4 enum { __ISwupper = 0, __ISwlower = 1, __ISwalpha = 2, __ISwdigit = 3, __ISwxdigit = 4, __ISwspace = 5, __ISwprint = 6, __ISwgraph = 7, __ISwblank = 8, __ISwcntrl = 9, __ISwpunct = 10, __ISwalnum = 11, _ISwupper = ((__ISwupper) < 8 ? (int) ((1UL << (__ISwupper)) << 24) : ((__ISwupper) < 16 ? (int) ((1UL << (__ISwupper)) << 8) : ((__ISwupper) < 24 ? (int) ((1UL << (__ISwupper)) >> 8) : (int) ((1UL << (__ISwupper)) >> 24)))), _ISwlower = ((__ISwlower) < 8 ? (int) ((1UL << (__ISwlower)) << 24) : ((__ISwlower) < 16 ? (int) ((1UL << (__ISwlower)) << 8) : ((__ISwlower) < 24 ? (int) ((1UL << (__ISwlower)) >> 8) : (int) ((1UL << (__ISwlower)) >> 24)))), _ISwalpha = ((__ISwalpha) < 8 ? (int) ((1UL << (__ISwalpha)) << 24) : ((__ISwalpha) < 16 ? (int) ((1UL << (__ISwalpha)) << 8) : ((__ISwalpha) < 24 ? (int) ((1UL << (__ISwalpha)) >> 8) : (int) ((1UL << (__ISwalpha)) >> 24)))), _ISwdigit = ((__ISwdigit) < 8 ? (int) ((1UL << (__ISwdigit)) << 24) : ((__ISwdigit) < 16 ? (int) ((1UL << (__ISwdigit)) << 8) : ((__ISwdigit) < 24 ? (int) ((1UL << (__ISwdigit)) >> 8) : (int) ((1UL << (__ISwdigit)) >> 24)))), _ISwxdigit = ((__ISwxdigit) < 8 ? (int) ((1UL << (__ISwxdigit)) << 24) : ((__ISwxdigit) < 16 ? (int) ((1UL << (__ISwxdigit)) << 8) : ((__ISwxdigit) < 24 ? (int) ((1UL << (__ISwxdigit)) >> 8) : (int) ((1UL << (__ISwxdigit)) >> 24)))), _ISwspace = ((__ISwspace) < 8 ? (int) ((1UL << (__ISwspace)) << 24) : ((__ISwspace) < 16 ? (int) ((1UL << (__ISwspace)) << 8) : ((__ISwspace) < 24 ? (int) ((1UL << (__ISwspace)) >> 8) : (int) ((1UL << (__ISwspace)) >> 24)))), _ISwprint = ((__ISwprint) < 8 ? (int) ((1UL << (__ISwprint)) << 24) : ((__ISwprint) < 16 ? (int) ((1UL << (__ISwprint)) << 8) : ((__ISwprint) < 24 ? (int) ((1UL << (__ISwprint)) >> 8) : (int) ((1UL << (__ISwprint)) >> 24)))), _ISwgraph = ((__ISwgraph) < 8 ? (int) ((1UL << (__ISwgraph)) << 24) : ((__ISwgraph) < 16 ? (int) ((1UL << (__ISwgraph)) << 8) : ((__ISwgraph) < 24 ? (int) ((1UL << (__ISwgraph)) >> 8) : (int) ((1UL << (__ISwgraph)) >> 24)))), _ISwblank = ((__ISwblank) < 8 ? (int) ((1UL << (__ISwblank)) << 24) : ((__ISwblank) < 16 ? (int) ((1UL << (__ISwblank)) << 8) : ((__ISwblank) < 24 ? (int) ((1UL << (__ISwblank)) >> 8) : (int) ((1UL << (__ISwblank)) >> 24)))), _ISwcntrl = ((__ISwcntrl) < 8 ? (int) ((1UL << (__ISwcntrl)) << 24) : ((__ISwcntrl) < 16 ? (int) ((1UL << (__ISwcntrl)) << 8) : ((__ISwcntrl) < 24 ? (int) ((1UL << (__ISwcntrl)) >> 8) : (int) ((1UL << (__ISwcntrl)) >> 24)))), _ISwpunct = ((__ISwpunct) < 8 ? (int) ((1UL << (__ISwpunct)) << 24) : ((__ISwpunct) < 16 ? (int) ((1UL << (__ISwpunct)) << 8) : ((__ISwpunct) < 24 ? (int) ((1UL << (__ISwpunct)) >> 8) : (int) ((1UL << (__ISwpunct)) >> 24)))), _ISwalnum = ((__ISwalnum) < 8 ? (int) ((1UL << (__ISwalnum)) << 24) : ((__ISwalnum) < 16 ? (int) ((1UL << (__ISwalnum)) << 8) : ((__ISwalnum) < 24 ? (int) ((1UL << (__ISwalnum)) >> 8) : (int) ((1UL << (__ISwalnum)) >> 24)))) }; extern "C" { extern int iswalnum (wint_t __wc) throw (); extern int iswalpha (wint_t __wc) throw (); extern int iswcntrl (wint_t __wc) throw (); extern int iswdigit (wint_t __wc) throw (); extern int iswgraph (wint_t __wc) throw (); extern int iswlower (wint_t __wc) throw (); extern int iswprint (wint_t __wc) throw (); extern int iswpunct (wint_t __wc) throw (); extern int iswspace (wint_t __wc) throw (); extern int iswupper (wint_t __wc) throw (); extern int iswxdigit (wint_t __wc) throw (); extern int iswblank (wint_t __wc) throw (); # 172 "/usr/include/wctype.h" 3 4 extern wctype_t wctype (__const char *__property) throw (); extern int iswctype (wint_t __wc, wctype_t __desc) throw (); typedef __const __int32_t *wctrans_t; extern wint_t towlower (wint_t __wc) throw (); extern wint_t towupper (wint_t __wc) throw (); } # 214 "/usr/include/wctype.h" 3 4 extern "C" { extern wctrans_t wctrans (__const char *__property) throw (); extern wint_t towctrans (wint_t __wc, wctrans_t __desc) throw (); extern int iswalnum_l (wint_t __wc, __locale_t __locale) throw (); extern int iswalpha_l (wint_t __wc, __locale_t __locale) throw (); extern int iswcntrl_l (wint_t __wc, __locale_t __locale) throw (); extern int iswdigit_l (wint_t __wc, __locale_t __locale) throw (); extern int iswgraph_l (wint_t __wc, __locale_t __locale) throw (); extern int iswlower_l (wint_t __wc, __locale_t __locale) throw (); extern int iswprint_l (wint_t __wc, __locale_t __locale) throw (); extern int iswpunct_l (wint_t __wc, __locale_t __locale) throw (); extern int iswspace_l (wint_t __wc, __locale_t __locale) throw (); extern int iswupper_l (wint_t __wc, __locale_t __locale) throw (); extern int iswxdigit_l (wint_t __wc, __locale_t __locale) throw (); extern int iswblank_l (wint_t __wc, __locale_t __locale) throw (); extern wctype_t wctype_l (__const char *__property, __locale_t __locale) throw (); extern int iswctype_l (wint_t __wc, wctype_t __desc, __locale_t __locale) throw (); extern wint_t towlower_l (wint_t __wc, __locale_t __locale) throw (); extern wint_t towupper_l (wint_t __wc, __locale_t __locale) throw (); extern wctrans_t wctrans_l (__const char *__property, __locale_t __locale) throw (); extern wint_t towctrans_l (wint_t __wc, wctrans_t __desc, __locale_t __locale) throw (); } # 53 "/usr/include/c++/4.7/cwctype" 2 3 # 82 "/usr/include/c++/4.7/cwctype" 3 namespace std { using ::wctrans_t; using ::wctype_t; using ::wint_t; using ::iswalnum; using ::iswalpha; using ::iswblank; using ::iswcntrl; using ::iswctype; using ::iswdigit; using ::iswgraph; using ::iswlower; using ::iswprint; using ::iswpunct; using ::iswspace; using ::iswupper; using ::iswxdigit; using ::towctrans; using ::towlower; using ::towupper; using ::wctrans; using ::wctype; } # 42 "/usr/include/c++/4.7/bits/locale_facets.h" 2 3 # 1 "/usr/include/c++/4.7/cctype" 1 3 # 41 "/usr/include/c++/4.7/cctype" 3 # 42 "/usr/include/c++/4.7/cctype" 3 # 43 "/usr/include/c++/4.7/bits/locale_facets.h" 2 3 # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/ctype_base.h" 1 3 # 37 "/usr/include/c++/4.7/i686-linux-gnu/bits/ctype_base.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { struct ctype_base { typedef const int* __to_type; typedef unsigned short mask; static const mask upper = _ISupper; static const mask lower = _ISlower; static const mask alpha = _ISalpha; static const mask digit = _ISdigit; static const mask xdigit = _ISxdigit; static const mask space = _ISspace; static const mask print = _ISprint; static const mask graph = _ISalpha | _ISdigit | _ISpunct; static const mask cntrl = _IScntrl; static const mask punct = _ISpunct; static const mask alnum = _ISalpha | _ISdigit; }; } # 44 "/usr/include/c++/4.7/bits/locale_facets.h" 2 3 # 1 "/usr/include/c++/4.7/bits/streambuf_iterator.h" 1 3 # 35 "/usr/include/c++/4.7/bits/streambuf_iterator.h" 3 # 36 "/usr/include/c++/4.7/bits/streambuf_iterator.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 51 "/usr/include/c++/4.7/bits/streambuf_iterator.h" 3 template<typename _CharT, typename _Traits> class istreambuf_iterator : public iterator<input_iterator_tag, _CharT, typename _Traits::off_type, _CharT*, _CharT&> { public: typedef _CharT char_type; typedef _Traits traits_type; typedef typename _Traits::int_type int_type; typedef basic_streambuf<_CharT, _Traits> streambuf_type; typedef basic_istream<_CharT, _Traits> istream_type; template<typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, ostreambuf_iterator<_CharT2> >::__type copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, ostreambuf_iterator<_CharT2>); template<bool _IsMove, typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, _CharT2*>::__type __copy_move_a2(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, _CharT2*); template<typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, istreambuf_iterator<_CharT2> >::__type find(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, const _CharT2&); private: mutable streambuf_type* _M_sbuf; mutable int_type _M_c; public: istreambuf_iterator() throw() : _M_sbuf(0), _M_c(traits_type::eof()) { } # 114 "/usr/include/c++/4.7/bits/streambuf_iterator.h" 3 istreambuf_iterator(istream_type& __s) throw() : _M_sbuf(__s.rdbuf()), _M_c(traits_type::eof()) { } istreambuf_iterator(streambuf_type* __s) throw() : _M_sbuf(__s), _M_c(traits_type::eof()) { } char_type operator*() const { return traits_type::to_char_type(_M_get()); } istreambuf_iterator& operator++() { ; if (_M_sbuf) { _M_sbuf->sbumpc(); _M_c = traits_type::eof(); } return *this; } istreambuf_iterator operator++(int) { ; istreambuf_iterator __old = *this; if (_M_sbuf) { __old._M_c = _M_sbuf->sbumpc(); _M_c = traits_type::eof(); } return __old; } bool equal(const istreambuf_iterator& __b) const { return _M_at_eof() == __b._M_at_eof(); } private: int_type _M_get() const { const int_type __eof = traits_type::eof(); int_type __ret = __eof; if (_M_sbuf) { if (!traits_type::eq_int_type(_M_c, __eof)) __ret = _M_c; else if (!traits_type::eq_int_type((__ret = _M_sbuf->sgetc()), __eof)) _M_c = __ret; else _M_sbuf = 0; } return __ret; } bool _M_at_eof() const { const int_type __eof = traits_type::eof(); return traits_type::eq_int_type(_M_get(), __eof); } }; template<typename _CharT, typename _Traits> inline bool operator==(const istreambuf_iterator<_CharT, _Traits>& __a, const istreambuf_iterator<_CharT, _Traits>& __b) { return __a.equal(__b); } template<typename _CharT, typename _Traits> inline bool operator!=(const istreambuf_iterator<_CharT, _Traits>& __a, const istreambuf_iterator<_CharT, _Traits>& __b) { return !__a.equal(__b); } template<typename _CharT, typename _Traits> class ostreambuf_iterator : public iterator<output_iterator_tag, void, void, void, void> { public: typedef _CharT char_type; typedef _Traits traits_type; typedef basic_streambuf<_CharT, _Traits> streambuf_type; typedef basic_ostream<_CharT, _Traits> ostream_type; template<typename _CharT2> friend typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, ostreambuf_iterator<_CharT2> >::__type copy(istreambuf_iterator<_CharT2>, istreambuf_iterator<_CharT2>, ostreambuf_iterator<_CharT2>); private: streambuf_type* _M_sbuf; bool _M_failed; public: ostreambuf_iterator(ostream_type& __s) throw() : _M_sbuf(__s.rdbuf()), _M_failed(!_M_sbuf) { } ostreambuf_iterator(streambuf_type* __s) throw() : _M_sbuf(__s), _M_failed(!_M_sbuf) { } ostreambuf_iterator& operator=(_CharT __c) { if (!_M_failed && _Traits::eq_int_type(_M_sbuf->sputc(__c), _Traits::eof())) _M_failed = true; return *this; } ostreambuf_iterator& operator*() { return *this; } ostreambuf_iterator& operator++(int) { return *this; } ostreambuf_iterator& operator++() { return *this; } bool failed() const throw() { return _M_failed; } ostreambuf_iterator& _M_put(const _CharT* __ws, streamsize __len) { if (__builtin_expect(!_M_failed, true) && __builtin_expect(this->_M_sbuf->sputn(__ws, __len) != __len, false)) _M_failed = true; return *this; } }; template<typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, ostreambuf_iterator<_CharT> >::__type copy(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, ostreambuf_iterator<_CharT> __result) { if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed) { bool __ineof; __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof); if (!__ineof) __result._M_failed = true; } return __result; } template<bool _IsMove, typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, ostreambuf_iterator<_CharT> >::__type __copy_move_a2(_CharT* __first, _CharT* __last, ostreambuf_iterator<_CharT> __result) { const streamsize __num = __last - __first; if (__num > 0) __result._M_put(__first, __num); return __result; } template<bool _IsMove, typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, ostreambuf_iterator<_CharT> >::__type __copy_move_a2(const _CharT* __first, const _CharT* __last, ostreambuf_iterator<_CharT> __result) { const streamsize __num = __last - __first; if (__num > 0) __result._M_put(__first, __num); return __result; } template<bool _IsMove, typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, _CharT*>::__type __copy_move_a2(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, _CharT* __result) { typedef istreambuf_iterator<_CharT> __is_iterator_type; typedef typename __is_iterator_type::traits_type traits_type; typedef typename __is_iterator_type::streambuf_type streambuf_type; typedef typename traits_type::int_type int_type; if (__first._M_sbuf && !__last._M_sbuf) { streambuf_type* __sb = __first._M_sbuf; int_type __c = __sb->sgetc(); while (!traits_type::eq_int_type(__c, traits_type::eof())) { const streamsize __n = __sb->egptr() - __sb->gptr(); if (__n > 1) { traits_type::copy(__result, __sb->gptr(), __n); __sb->__safe_gbump(__n); __result += __n; __c = __sb->underflow(); } else { *__result++ = traits_type::to_char_type(__c); __c = __sb->snextc(); } } } return __result; } template<typename _CharT> typename __gnu_cxx::__enable_if<__is_char<_CharT>::__value, istreambuf_iterator<_CharT> >::__type find(istreambuf_iterator<_CharT> __first, istreambuf_iterator<_CharT> __last, const _CharT& __val) { typedef istreambuf_iterator<_CharT> __is_iterator_type; typedef typename __is_iterator_type::traits_type traits_type; typedef typename __is_iterator_type::streambuf_type streambuf_type; typedef typename traits_type::int_type int_type; if (__first._M_sbuf && !__last._M_sbuf) { const int_type __ival = traits_type::to_int_type(__val); streambuf_type* __sb = __first._M_sbuf; int_type __c = __sb->sgetc(); while (!traits_type::eq_int_type(__c, traits_type::eof()) && !traits_type::eq_int_type(__c, __ival)) { streamsize __n = __sb->egptr() - __sb->gptr(); if (__n > 1) { const _CharT* __p = traits_type::find(__sb->gptr(), __n, __val); if (__p) __n = __p - __sb->gptr(); __sb->__safe_gbump(__n); __c = __sb->sgetc(); } else __c = __sb->snextc(); } if (!traits_type::eq_int_type(__c, traits_type::eof())) __first._M_c = __c; else __first._M_sbuf = 0; } return __first; } } # 51 "/usr/include/c++/4.7/bits/locale_facets.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 66 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<typename _Tp> void __convert_to_v(const char*, _Tp&, ios_base::iostate&, const __c_locale&) throw(); template<> void __convert_to_v(const char*, float&, ios_base::iostate&, const __c_locale&) throw(); template<> void __convert_to_v(const char*, double&, ios_base::iostate&, const __c_locale&) throw(); template<> void __convert_to_v(const char*, long double&, ios_base::iostate&, const __c_locale&) throw(); template<typename _CharT, typename _Traits> struct __pad { static void _S_pad(ios_base& __io, _CharT __fill, _CharT* __news, const _CharT* __olds, streamsize __newlen, streamsize __oldlen); }; template<typename _CharT> _CharT* __add_grouping(_CharT* __s, _CharT __sep, const char* __gbeg, size_t __gsize, const _CharT* __first, const _CharT* __last); template<typename _CharT> inline ostreambuf_iterator<_CharT> __write(ostreambuf_iterator<_CharT> __s, const _CharT* __ws, int __len) { __s._M_put(__ws, __len); return __s; } template<typename _CharT, typename _OutIter> inline _OutIter __write(_OutIter __s, const _CharT* __ws, int __len) { for (int __j = 0; __j < __len; __j++, ++__s) *__s = __ws[__j]; return __s; } # 144 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<typename _CharT> class __ctype_abstract_base : public locale::facet, public ctype_base { public: typedef _CharT char_type; # 163 "/usr/include/c++/4.7/bits/locale_facets.h" 3 bool is(mask __m, char_type __c) const { return this->do_is(__m, __c); } # 180 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* is(const char_type *__lo, const char_type *__hi, mask *__vec) const { return this->do_is(__lo, __hi, __vec); } # 196 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* scan_is(mask __m, const char_type* __lo, const char_type* __hi) const { return this->do_scan_is(__m, __lo, __hi); } # 212 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* scan_not(mask __m, const char_type* __lo, const char_type* __hi) const { return this->do_scan_not(__m, __lo, __hi); } # 226 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type toupper(char_type __c) const { return this->do_toupper(__c); } # 241 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* toupper(char_type *__lo, const char_type* __hi) const { return this->do_toupper(__lo, __hi); } # 255 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type tolower(char_type __c) const { return this->do_tolower(__c); } # 270 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* tolower(char_type* __lo, const char_type* __hi) const { return this->do_tolower(__lo, __hi); } # 287 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type widen(char __c) const { return this->do_widen(__c); } # 306 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char* widen(const char* __lo, const char* __hi, char_type* __to) const { return this->do_widen(__lo, __hi, __to); } # 325 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char narrow(char_type __c, char __dfault) const { return this->do_narrow(__c, __dfault); } # 347 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* narrow(const char_type* __lo, const char_type* __hi, char __dfault, char* __to) const { return this->do_narrow(__lo, __hi, __dfault, __to); } protected: explicit __ctype_abstract_base(size_t __refs = 0): facet(__refs) { } virtual ~__ctype_abstract_base() { } # 372 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual bool do_is(mask __m, char_type __c) const = 0; # 391 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const = 0; # 410 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const = 0; # 429 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_scan_not(mask __m, const char_type* __lo, const char_type* __hi) const = 0; # 447 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_toupper(char_type __c) const = 0; # 464 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_toupper(char_type* __lo, const char_type* __hi) const = 0; # 480 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_tolower(char_type __c) const = 0; # 497 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_tolower(char_type* __lo, const char_type* __hi) const = 0; # 516 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_widen(char __c) const = 0; # 537 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char* do_widen(const char* __lo, const char* __hi, char_type* __to) const = 0; # 558 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char do_narrow(char_type __c, char __dfault) const = 0; # 583 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_narrow(const char_type* __lo, const char_type* __hi, char __dfault, char* __to) const = 0; }; # 606 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<typename _CharT> class ctype : public __ctype_abstract_base<_CharT> { public: typedef _CharT char_type; typedef typename __ctype_abstract_base<_CharT>::mask mask; static locale::id id; explicit ctype(size_t __refs = 0) : __ctype_abstract_base<_CharT>(__refs) { } protected: virtual ~ctype(); virtual bool do_is(mask __m, char_type __c) const; virtual const char_type* do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; virtual const char_type* do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; virtual const char_type* do_scan_not(mask __m, const char_type* __lo, const char_type* __hi) const; virtual char_type do_toupper(char_type __c) const; virtual const char_type* do_toupper(char_type* __lo, const char_type* __hi) const; virtual char_type do_tolower(char_type __c) const; virtual const char_type* do_tolower(char_type* __lo, const char_type* __hi) const; virtual char_type do_widen(char __c) const; virtual const char* do_widen(const char* __lo, const char* __hi, char_type* __dest) const; virtual char do_narrow(char_type, char __dfault) const; virtual const char_type* do_narrow(const char_type* __lo, const char_type* __hi, char __dfault, char* __to) const; }; template<typename _CharT> locale::id ctype<_CharT>::id; # 675 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<> class ctype<char> : public locale::facet, public ctype_base { public: typedef char char_type; protected: __c_locale _M_c_locale_ctype; bool _M_del; __to_type _M_toupper; __to_type _M_tolower; const mask* _M_table; mutable char _M_widen_ok; mutable char _M_widen[1 + static_cast<unsigned char>(-1)]; mutable char _M_narrow[1 + static_cast<unsigned char>(-1)]; mutable char _M_narrow_ok; public: static locale::id id; static const size_t table_size = 1 + static_cast<unsigned char>(-1); # 712 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit ctype(const mask* __table = 0, bool __del = false, size_t __refs = 0); # 725 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit ctype(__c_locale __cloc, const mask* __table = 0, bool __del = false, size_t __refs = 0); # 738 "/usr/include/c++/4.7/bits/locale_facets.h" 3 inline bool is(mask __m, char __c) const; # 753 "/usr/include/c++/4.7/bits/locale_facets.h" 3 inline const char* is(const char* __lo, const char* __hi, mask* __vec) const; # 767 "/usr/include/c++/4.7/bits/locale_facets.h" 3 inline const char* scan_is(mask __m, const char* __lo, const char* __hi) const; # 781 "/usr/include/c++/4.7/bits/locale_facets.h" 3 inline const char* scan_not(mask __m, const char* __lo, const char* __hi) const; # 796 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type toupper(char_type __c) const { return this->do_toupper(__c); } # 813 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* toupper(char_type *__lo, const char_type* __hi) const { return this->do_toupper(__lo, __hi); } # 829 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type tolower(char_type __c) const { return this->do_tolower(__c); } # 846 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* tolower(char_type* __lo, const char_type* __hi) const { return this->do_tolower(__lo, __hi); } # 866 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type widen(char __c) const { if (_M_widen_ok) return _M_widen[static_cast<unsigned char>(__c)]; this->_M_widen_init(); return this->do_widen(__c); } # 893 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char* widen(const char* __lo, const char* __hi, char_type* __to) const { if (_M_widen_ok == 1) { __builtin_memcpy(__to, __lo, __hi - __lo); return __hi; } if (!_M_widen_ok) _M_widen_init(); return this->do_widen(__lo, __hi, __to); } # 924 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char narrow(char_type __c, char __dfault) const { if (_M_narrow[static_cast<unsigned char>(__c)]) return _M_narrow[static_cast<unsigned char>(__c)]; const char __t = do_narrow(__c, __dfault); if (__t != __dfault) _M_narrow[static_cast<unsigned char>(__c)] = __t; return __t; } # 957 "/usr/include/c++/4.7/bits/locale_facets.h" 3 const char_type* narrow(const char_type* __lo, const char_type* __hi, char __dfault, char* __to) const { if (__builtin_expect(_M_narrow_ok == 1, true)) { __builtin_memcpy(__to, __lo, __hi - __lo); return __hi; } if (!_M_narrow_ok) _M_narrow_init(); return this->do_narrow(__lo, __hi, __dfault, __to); } const mask* table() const throw() { return _M_table; } static const mask* classic_table() throw(); protected: virtual ~ctype(); # 1006 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_toupper(char_type __c) const; # 1023 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_toupper(char_type* __lo, const char_type* __hi) const; # 1039 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_tolower(char_type __c) const; # 1056 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_tolower(char_type* __lo, const char_type* __hi) const; # 1076 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_widen(char __c) const { return __c; } # 1099 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char* do_widen(const char* __lo, const char* __hi, char_type* __to) const { __builtin_memcpy(__to, __lo, __hi - __lo); return __hi; } # 1125 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char do_narrow(char_type __c, char __dfault) const { return __c; } # 1151 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_narrow(const char_type* __lo, const char_type* __hi, char __dfault, char* __to) const { __builtin_memcpy(__to, __lo, __hi - __lo); return __hi; } private: void _M_narrow_init() const; void _M_widen_init() const; }; # 1176 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<> class ctype<wchar_t> : public __ctype_abstract_base<wchar_t> { public: typedef wchar_t char_type; typedef wctype_t __wmask_type; protected: __c_locale _M_c_locale_ctype; bool _M_narrow_ok; char _M_narrow[128]; wint_t _M_widen[1 + static_cast<unsigned char>(-1)]; mask _M_bit[16]; __wmask_type _M_wmask[16]; public: static locale::id id; # 1209 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit ctype(size_t __refs = 0); # 1220 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit ctype(__c_locale __cloc, size_t __refs = 0); protected: __wmask_type _M_convert_to_wmask(const mask __m) const throw(); virtual ~ctype(); # 1244 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual bool do_is(mask __m, char_type __c) const; # 1263 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_is(const char_type* __lo, const char_type* __hi, mask* __vec) const; # 1281 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_scan_is(mask __m, const char_type* __lo, const char_type* __hi) const; # 1299 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_scan_not(mask __m, const char_type* __lo, const char_type* __hi) const; # 1316 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_toupper(char_type __c) const; # 1333 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_toupper(char_type* __lo, const char_type* __hi) const; # 1349 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_tolower(char_type __c) const; # 1366 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_tolower(char_type* __lo, const char_type* __hi) const; # 1386 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_widen(char __c) const; # 1408 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char* do_widen(const char* __lo, const char* __hi, char_type* __to) const; # 1431 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char do_narrow(char_type __c, char __dfault) const; # 1457 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual const char_type* do_narrow(const char_type* __lo, const char_type* __hi, char __dfault, char* __to) const; void _M_initialize_ctype() throw(); }; template<typename _CharT> class ctype_byname : public ctype<_CharT> { public: typedef typename ctype<_CharT>::mask mask; explicit ctype_byname(const char* __s, size_t __refs = 0); protected: virtual ~ctype_byname() { }; }; template<> class ctype_byname<char> : public ctype<char> { public: explicit ctype_byname(const char* __s, size_t __refs = 0); protected: virtual ~ctype_byname(); }; template<> class ctype_byname<wchar_t> : public ctype<wchar_t> { public: explicit ctype_byname(const char* __s, size_t __refs = 0); protected: virtual ~ctype_byname(); }; } # 1 "/usr/include/c++/4.7/i686-linux-gnu/bits/ctype_inline.h" 1 3 # 37 "/usr/include/c++/4.7/i686-linux-gnu/bits/ctype_inline.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { bool ctype<char>:: is(mask __m, char __c) const { return _M_table[static_cast<unsigned char>(__c)] & __m; } const char* ctype<char>:: is(const char* __low, const char* __high, mask* __vec) const { while (__low < __high) *__vec++ = _M_table[static_cast<unsigned char>(*__low++)]; return __high; } const char* ctype<char>:: scan_is(mask __m, const char* __low, const char* __high) const { while (__low < __high && !(_M_table[static_cast<unsigned char>(*__low)] & __m)) ++__low; return __low; } const char* ctype<char>:: scan_not(mask __m, const char* __low, const char* __high) const { while (__low < __high && (_M_table[static_cast<unsigned char>(*__low)] & __m) != 0) ++__low; return __low; } } # 1514 "/usr/include/c++/4.7/bits/locale_facets.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { class __num_base { public: enum { _S_ominus, _S_oplus, _S_ox, _S_oX, _S_odigits, _S_odigits_end = _S_odigits + 16, _S_oudigits = _S_odigits_end, _S_oudigits_end = _S_oudigits + 16, _S_oe = _S_odigits + 14, _S_oE = _S_oudigits + 14, _S_oend = _S_oudigits_end }; static const char* _S_atoms_out; static const char* _S_atoms_in; enum { _S_iminus, _S_iplus, _S_ix, _S_iX, _S_izero, _S_ie = _S_izero + 14, _S_iE = _S_izero + 20, _S_iend = 26 }; static void _S_format_float(const ios_base& __io, char* __fptr, char __mod) throw(); }; template<typename _CharT> struct __numpunct_cache : public locale::facet { const char* _M_grouping; size_t _M_grouping_size; bool _M_use_grouping; const _CharT* _M_truename; size_t _M_truename_size; const _CharT* _M_falsename; size_t _M_falsename_size; _CharT _M_decimal_point; _CharT _M_thousands_sep; _CharT _M_atoms_out[__num_base::_S_oend]; _CharT _M_atoms_in[__num_base::_S_iend]; bool _M_allocated; __numpunct_cache(size_t __refs = 0) : facet(__refs), _M_grouping(0), _M_grouping_size(0), _M_use_grouping(false), _M_truename(0), _M_truename_size(0), _M_falsename(0), _M_falsename_size(0), _M_decimal_point(_CharT()), _M_thousands_sep(_CharT()), _M_allocated(false) { } ~__numpunct_cache(); void _M_cache(const locale& __loc); private: __numpunct_cache& operator=(const __numpunct_cache&); explicit __numpunct_cache(const __numpunct_cache&); }; template<typename _CharT> __numpunct_cache<_CharT>::~__numpunct_cache() { if (_M_allocated) { delete [] _M_grouping; delete [] _M_truename; delete [] _M_falsename; } } # 1642 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<typename _CharT> class numpunct : public locale::facet { public: typedef _CharT char_type; typedef basic_string<_CharT> string_type; typedef __numpunct_cache<_CharT> __cache_type; protected: __cache_type* _M_data; public: static locale::id id; explicit numpunct(size_t __refs = 0) : facet(__refs), _M_data(0) { _M_initialize_numpunct(); } # 1680 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit numpunct(__cache_type* __cache, size_t __refs = 0) : facet(__refs), _M_data(__cache) { _M_initialize_numpunct(); } # 1694 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit numpunct(__c_locale __cloc, size_t __refs = 0) : facet(__refs), _M_data(0) { _M_initialize_numpunct(__cloc); } # 1708 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type decimal_point() const { return this->do_decimal_point(); } # 1721 "/usr/include/c++/4.7/bits/locale_facets.h" 3 char_type thousands_sep() const { return this->do_thousands_sep(); } # 1752 "/usr/include/c++/4.7/bits/locale_facets.h" 3 string grouping() const { return this->do_grouping(); } # 1765 "/usr/include/c++/4.7/bits/locale_facets.h" 3 string_type truename() const { return this->do_truename(); } # 1778 "/usr/include/c++/4.7/bits/locale_facets.h" 3 string_type falsename() const { return this->do_falsename(); } protected: virtual ~numpunct(); # 1795 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_decimal_point() const { return _M_data->_M_decimal_point; } # 1807 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual char_type do_thousands_sep() const { return _M_data->_M_thousands_sep; } # 1820 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual string do_grouping() const { return _M_data->_M_grouping; } # 1833 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual string_type do_truename() const { return _M_data->_M_truename; } # 1846 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual string_type do_falsename() const { return _M_data->_M_falsename; } void _M_initialize_numpunct(__c_locale __cloc = 0); }; template<typename _CharT> locale::id numpunct<_CharT>::id; template<> numpunct<char>::~numpunct(); template<> void numpunct<char>::_M_initialize_numpunct(__c_locale __cloc); template<> numpunct<wchar_t>::~numpunct(); template<> void numpunct<wchar_t>::_M_initialize_numpunct(__c_locale __cloc); template<typename _CharT> class numpunct_byname : public numpunct<_CharT> { public: typedef _CharT char_type; typedef basic_string<_CharT> string_type; explicit numpunct_byname(const char* __s, size_t __refs = 0) : numpunct<_CharT>(__refs) { if (__builtin_strcmp(__s, "C") != 0 && __builtin_strcmp(__s, "POSIX") != 0) { __c_locale __tmp; this->_S_create_c_locale(__tmp, __s); this->_M_initialize_numpunct(__tmp); this->_S_destroy_c_locale(__tmp); } } protected: virtual ~numpunct_byname() { } }; # 1916 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<typename _CharT, typename _InIter> class num_get : public locale::facet { public: typedef _CharT char_type; typedef _InIter iter_type; static locale::id id; # 1937 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit num_get(size_t __refs = 0) : facet(__refs) { } # 1963 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, bool& __v) const { return this->do_get(__in, __end, __io, __err, __v); } # 1999 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long& __v) const { return this->do_get(__in, __end, __io, __err, __v); } iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned short& __v) const { return this->do_get(__in, __end, __io, __err, __v); } iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned int& __v) const { return this->do_get(__in, __end, __io, __err, __v); } iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long& __v) const { return this->do_get(__in, __end, __io, __err, __v); } iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long long& __v) const { return this->do_get(__in, __end, __io, __err, __v); } iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long long& __v) const { return this->do_get(__in, __end, __io, __err, __v); } # 2058 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, float& __v) const { return this->do_get(__in, __end, __io, __err, __v); } iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const { return this->do_get(__in, __end, __io, __err, __v); } iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, long double& __v) const { return this->do_get(__in, __end, __io, __err, __v); } # 2100 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type get(iter_type __in, iter_type __end, ios_base& __io, ios_base::iostate& __err, void*& __v) const { return this->do_get(__in, __end, __io, __err, __v); } protected: virtual ~num_get() { } iter_type _M_extract_float(iter_type, iter_type, ios_base&, ios_base::iostate&, string&) const; template<typename _ValueT> iter_type _M_extract_int(iter_type, iter_type, ios_base&, ios_base::iostate&, _ValueT&) const; template<typename _CharT2> typename __gnu_cxx::__enable_if<__is_char<_CharT2>::__value, int>::__type _M_find(const _CharT2*, size_t __len, _CharT2 __c) const { int __ret = -1; if (__len <= 10) { if (__c >= _CharT2('0') && __c < _CharT2(_CharT2('0') + __len)) __ret = __c - _CharT2('0'); } else { if (__c >= _CharT2('0') && __c <= _CharT2('9')) __ret = __c - _CharT2('0'); else if (__c >= _CharT2('a') && __c <= _CharT2('f')) __ret = 10 + (__c - _CharT2('a')); else if (__c >= _CharT2('A') && __c <= _CharT2('F')) __ret = 10 + (__c - _CharT2('A')); } return __ret; } template<typename _CharT2> typename __gnu_cxx::__enable_if<!__is_char<_CharT2>::__value, int>::__type _M_find(const _CharT2* __zero, size_t __len, _CharT2 __c) const { int __ret = -1; const char_type* __q = char_traits<_CharT2>::find(__zero, __len, __c); if (__q) { __ret = __q - __zero; if (__ret > 15) __ret -= 6; } return __ret; } # 2171 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual iter_type do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, bool&) const; virtual iter_type do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long& __v) const { return _M_extract_int(__beg, __end, __io, __err, __v); } virtual iter_type do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned short& __v) const { return _M_extract_int(__beg, __end, __io, __err, __v); } virtual iter_type do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned int& __v) const { return _M_extract_int(__beg, __end, __io, __err, __v); } virtual iter_type do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long& __v) const { return _M_extract_int(__beg, __end, __io, __err, __v); } virtual iter_type do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long long& __v) const { return _M_extract_int(__beg, __end, __io, __err, __v); } virtual iter_type do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, unsigned long long& __v) const { return _M_extract_int(__beg, __end, __io, __err, __v); } virtual iter_type do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, float&) const; virtual iter_type do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, double&) const; virtual iter_type do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, long double&) const; virtual iter_type do_get(iter_type, iter_type, ios_base&, ios_base::iostate&, void*&) const; # 2234 "/usr/include/c++/4.7/bits/locale_facets.h" 3 }; template<typename _CharT, typename _InIter> locale::id num_get<_CharT, _InIter>::id; # 2252 "/usr/include/c++/4.7/bits/locale_facets.h" 3 template<typename _CharT, typename _OutIter> class num_put : public locale::facet { public: typedef _CharT char_type; typedef _OutIter iter_type; static locale::id id; # 2273 "/usr/include/c++/4.7/bits/locale_facets.h" 3 explicit num_put(size_t __refs = 0) : facet(__refs) { } # 2291 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const { return this->do_put(__s, __io, __fill, __v); } # 2333 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type put(iter_type __s, ios_base& __io, char_type __fill, long __v) const { return this->do_put(__s, __io, __fill, __v); } iter_type put(iter_type __s, ios_base& __io, char_type __fill, unsigned long __v) const { return this->do_put(__s, __io, __fill, __v); } iter_type put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const { return this->do_put(__s, __io, __fill, __v); } iter_type put(iter_type __s, ios_base& __io, char_type __fill, unsigned long long __v) const { return this->do_put(__s, __io, __fill, __v); } # 2396 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type put(iter_type __s, ios_base& __io, char_type __fill, double __v) const { return this->do_put(__s, __io, __fill, __v); } iter_type put(iter_type __s, ios_base& __io, char_type __fill, long double __v) const { return this->do_put(__s, __io, __fill, __v); } # 2421 "/usr/include/c++/4.7/bits/locale_facets.h" 3 iter_type put(iter_type __s, ios_base& __io, char_type __fill, const void* __v) const { return this->do_put(__s, __io, __fill, __v); } protected: template<typename _ValueT> iter_type _M_insert_float(iter_type, ios_base& __io, char_type __fill, char __mod, _ValueT __v) const; void _M_group_float(const char* __grouping, size_t __grouping_size, char_type __sep, const char_type* __p, char_type* __new, char_type* __cs, int& __len) const; template<typename _ValueT> iter_type _M_insert_int(iter_type, ios_base& __io, char_type __fill, _ValueT __v) const; void _M_group_int(const char* __grouping, size_t __grouping_size, char_type __sep, ios_base& __io, char_type* __new, char_type* __cs, int& __len) const; void _M_pad(char_type __fill, streamsize __w, ios_base& __io, char_type* __new, const char_type* __cs, int& __len) const; virtual ~num_put() { }; # 2469 "/usr/include/c++/4.7/bits/locale_facets.h" 3 virtual iter_type do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const; virtual iter_type do_put(iter_type __s, ios_base& __io, char_type __fill, long __v) const { return _M_insert_int(__s, __io, __fill, __v); } virtual iter_type do_put(iter_type __s, ios_base& __io, char_type __fill, unsigned long __v) const { return _M_insert_int(__s, __io, __fill, __v); } virtual iter_type do_put(iter_type __s, ios_base& __io, char_type __fill, long long __v) const { return _M_insert_int(__s, __io, __fill, __v); } virtual iter_type do_put(iter_type __s, ios_base& __io, char_type __fill, unsigned long long __v) const { return _M_insert_int(__s, __io, __fill, __v); } virtual iter_type do_put(iter_type, ios_base&, char_type, double) const; virtual iter_type do_put(iter_type, ios_base&, char_type, long double) const; virtual iter_type do_put(iter_type, ios_base&, char_type, const void*) const; }; template <typename _CharT, typename _OutIter> locale::id num_put<_CharT, _OutIter>::id; template<typename _CharT> inline bool isspace(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::space, __c); } template<typename _CharT> inline bool isprint(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::print, __c); } template<typename _CharT> inline bool iscntrl(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::cntrl, __c); } template<typename _CharT> inline bool isupper(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::upper, __c); } template<typename _CharT> inline bool islower(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::lower, __c); } template<typename _CharT> inline bool isalpha(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alpha, __c); } template<typename _CharT> inline bool isdigit(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::digit, __c); } template<typename _CharT> inline bool ispunct(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::punct, __c); } template<typename _CharT> inline bool isxdigit(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::xdigit, __c); } template<typename _CharT> inline bool isalnum(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::alnum, __c); } template<typename _CharT> inline bool isgraph(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).is(ctype_base::graph, __c); } template<typename _CharT> inline _CharT toupper(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).toupper(__c); } template<typename _CharT> inline _CharT tolower(_CharT __c, const locale& __loc) { return use_facet<ctype<_CharT> >(__loc).tolower(__c); } } # 1 "/usr/include/c++/4.7/bits/locale_facets.tcc" 1 3 # 35 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 # 36 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _Facet> struct __use_cache { const _Facet* operator() (const locale& __loc) const; }; template<typename _CharT> struct __use_cache<__numpunct_cache<_CharT> > { const __numpunct_cache<_CharT>* operator() (const locale& __loc) const { const size_t __i = numpunct<_CharT>::id._M_id(); const locale::facet** __caches = __loc._M_impl->_M_caches; if (!__caches[__i]) { __numpunct_cache<_CharT>* __tmp = 0; try { __tmp = new __numpunct_cache<_CharT>; __tmp->_M_cache(__loc); } catch(...) { delete __tmp; throw; } __loc._M_impl->_M_install_cache(__tmp, __i); } return static_cast<const __numpunct_cache<_CharT>*>(__caches[__i]); } }; template<typename _CharT> void __numpunct_cache<_CharT>::_M_cache(const locale& __loc) { _M_allocated = true; const numpunct<_CharT>& __np = use_facet<numpunct<_CharT> >(__loc); char* __grouping = 0; _CharT* __truename = 0; _CharT* __falsename = 0; try { _M_grouping_size = __np.grouping().size(); __grouping = new char[_M_grouping_size]; __np.grouping().copy(__grouping, _M_grouping_size); _M_grouping = __grouping; _M_use_grouping = (_M_grouping_size && static_cast<signed char>(_M_grouping[0]) > 0 && (_M_grouping[0] != __gnu_cxx::__numeric_traits<char>::__max)); _M_truename_size = __np.truename().size(); __truename = new _CharT[_M_truename_size]; __np.truename().copy(__truename, _M_truename_size); _M_truename = __truename; _M_falsename_size = __np.falsename().size(); __falsename = new _CharT[_M_falsename_size]; __np.falsename().copy(__falsename, _M_falsename_size); _M_falsename = __falsename; _M_decimal_point = __np.decimal_point(); _M_thousands_sep = __np.thousands_sep(); const ctype<_CharT>& __ct = use_facet<ctype<_CharT> >(__loc); __ct.widen(__num_base::_S_atoms_out, __num_base::_S_atoms_out + __num_base::_S_oend, _M_atoms_out); __ct.widen(__num_base::_S_atoms_in, __num_base::_S_atoms_in + __num_base::_S_iend, _M_atoms_in); } catch(...) { delete [] __grouping; delete [] __truename; delete [] __falsename; throw; } } # 138 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 __attribute__ ((__pure__)) bool __verify_grouping(const char* __grouping, size_t __grouping_size, const string& __grouping_tmp) throw (); template<typename _CharT, typename _InIter> _InIter num_get<_CharT, _InIter>:: _M_extract_float(_InIter __beg, _InIter __end, ios_base& __io, ios_base::iostate& __err, string& __xtrc) const { typedef char_traits<_CharT> __traits_type; typedef __numpunct_cache<_CharT> __cache_type; __use_cache<__cache_type> __uc; const locale& __loc = __io._M_getloc(); const __cache_type* __lc = __uc(__loc); const _CharT* __lit = __lc->_M_atoms_in; char_type __c = char_type(); bool __testeof = __beg == __end; if (!__testeof) { __c = *__beg; const bool __plus = __c == __lit[__num_base::_S_iplus]; if ((__plus || __c == __lit[__num_base::_S_iminus]) && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) && !(__c == __lc->_M_decimal_point)) { __xtrc += __plus ? '+' : '-'; if (++__beg != __end) __c = *__beg; else __testeof = true; } } bool __found_mantissa = false; int __sep_pos = 0; while (!__testeof) { if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) || __c == __lc->_M_decimal_point) break; else if (__c == __lit[__num_base::_S_izero]) { if (!__found_mantissa) { __xtrc += '0'; __found_mantissa = true; } ++__sep_pos; if (++__beg != __end) __c = *__beg; else __testeof = true; } else break; } bool __found_dec = false; bool __found_sci = false; string __found_grouping; if (__lc->_M_use_grouping) __found_grouping.reserve(32); const char_type* __lit_zero = __lit + __num_base::_S_izero; if (!__lc->_M_allocated) while (!__testeof) { const int __digit = _M_find(__lit_zero, 10, __c); if (__digit != -1) { __xtrc += '0' + __digit; __found_mantissa = true; } else if (__c == __lc->_M_decimal_point && !__found_dec && !__found_sci) { __xtrc += '.'; __found_dec = true; } else if ((__c == __lit[__num_base::_S_ie] || __c == __lit[__num_base::_S_iE]) && !__found_sci && __found_mantissa) { __xtrc += 'e'; __found_sci = true; if (++__beg != __end) { __c = *__beg; const bool __plus = __c == __lit[__num_base::_S_iplus]; if (__plus || __c == __lit[__num_base::_S_iminus]) __xtrc += __plus ? '+' : '-'; else continue; } else { __testeof = true; break; } } else break; if (++__beg != __end) __c = *__beg; else __testeof = true; } else while (!__testeof) { if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) { if (!__found_dec && !__found_sci) { if (__sep_pos) { __found_grouping += static_cast<char>(__sep_pos); __sep_pos = 0; } else { __xtrc.clear(); break; } } else break; } else if (__c == __lc->_M_decimal_point) { if (!__found_dec && !__found_sci) { if (__found_grouping.size()) __found_grouping += static_cast<char>(__sep_pos); __xtrc += '.'; __found_dec = true; } else break; } else { const char_type* __q = __traits_type::find(__lit_zero, 10, __c); if (__q) { __xtrc += '0' + (__q - __lit_zero); __found_mantissa = true; ++__sep_pos; } else if ((__c == __lit[__num_base::_S_ie] || __c == __lit[__num_base::_S_iE]) && !__found_sci && __found_mantissa) { if (__found_grouping.size() && !__found_dec) __found_grouping += static_cast<char>(__sep_pos); __xtrc += 'e'; __found_sci = true; if (++__beg != __end) { __c = *__beg; const bool __plus = __c == __lit[__num_base::_S_iplus]; if ((__plus || __c == __lit[__num_base::_S_iminus]) && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) && !(__c == __lc->_M_decimal_point)) __xtrc += __plus ? '+' : '-'; else continue; } else { __testeof = true; break; } } else break; } if (++__beg != __end) __c = *__beg; else __testeof = true; } if (__found_grouping.size()) { if (!__found_dec && !__found_sci) __found_grouping += static_cast<char>(__sep_pos); if (!std::__verify_grouping(__lc->_M_grouping, __lc->_M_grouping_size, __found_grouping)) __err = ios_base::failbit; } return __beg; } template<typename _CharT, typename _InIter> template<typename _ValueT> _InIter num_get<_CharT, _InIter>:: _M_extract_int(_InIter __beg, _InIter __end, ios_base& __io, ios_base::iostate& __err, _ValueT& __v) const { typedef char_traits<_CharT> __traits_type; using __gnu_cxx::__add_unsigned; typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; typedef __numpunct_cache<_CharT> __cache_type; __use_cache<__cache_type> __uc; const locale& __loc = __io._M_getloc(); const __cache_type* __lc = __uc(__loc); const _CharT* __lit = __lc->_M_atoms_in; char_type __c = char_type(); const ios_base::fmtflags __basefield = __io.flags() & ios_base::basefield; const bool __oct = __basefield == ios_base::oct; int __base = __oct ? 8 : (__basefield == ios_base::hex ? 16 : 10); bool __testeof = __beg == __end; bool __negative = false; if (!__testeof) { __c = *__beg; __negative = __c == __lit[__num_base::_S_iminus]; if ((__negative || __c == __lit[__num_base::_S_iplus]) && !(__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) && !(__c == __lc->_M_decimal_point)) { if (++__beg != __end) __c = *__beg; else __testeof = true; } } bool __found_zero = false; int __sep_pos = 0; while (!__testeof) { if ((__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) || __c == __lc->_M_decimal_point) break; else if (__c == __lit[__num_base::_S_izero] && (!__found_zero || __base == 10)) { __found_zero = true; ++__sep_pos; if (__basefield == 0) __base = 8; if (__base == 8) __sep_pos = 0; } else if (__found_zero && (__c == __lit[__num_base::_S_ix] || __c == __lit[__num_base::_S_iX])) { if (__basefield == 0) __base = 16; if (__base == 16) { __found_zero = false; __sep_pos = 0; } else break; } else break; if (++__beg != __end) { __c = *__beg; if (!__found_zero) break; } else __testeof = true; } const size_t __len = (__base == 16 ? __num_base::_S_iend - __num_base::_S_izero : __base); string __found_grouping; if (__lc->_M_use_grouping) __found_grouping.reserve(32); bool __testfail = false; bool __testoverflow = false; const __unsigned_type __max = (__negative && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) ? -__gnu_cxx::__numeric_traits<_ValueT>::__min : __gnu_cxx::__numeric_traits<_ValueT>::__max; const __unsigned_type __smax = __max / __base; __unsigned_type __result = 0; int __digit = 0; const char_type* __lit_zero = __lit + __num_base::_S_izero; if (!__lc->_M_allocated) while (!__testeof) { __digit = _M_find(__lit_zero, __len, __c); if (__digit == -1) break; if (__result > __smax) __testoverflow = true; else { __result *= __base; __testoverflow |= __result > __max - __digit; __result += __digit; ++__sep_pos; } if (++__beg != __end) __c = *__beg; else __testeof = true; } else while (!__testeof) { if (__lc->_M_use_grouping && __c == __lc->_M_thousands_sep) { if (__sep_pos) { __found_grouping += static_cast<char>(__sep_pos); __sep_pos = 0; } else { __testfail = true; break; } } else if (__c == __lc->_M_decimal_point) break; else { const char_type* __q = __traits_type::find(__lit_zero, __len, __c); if (!__q) break; __digit = __q - __lit_zero; if (__digit > 15) __digit -= 6; if (__result > __smax) __testoverflow = true; else { __result *= __base; __testoverflow |= __result > __max - __digit; __result += __digit; ++__sep_pos; } } if (++__beg != __end) __c = *__beg; else __testeof = true; } if (__found_grouping.size()) { __found_grouping += static_cast<char>(__sep_pos); if (!std::__verify_grouping(__lc->_M_grouping, __lc->_M_grouping_size, __found_grouping)) __err = ios_base::failbit; } if ((!__sep_pos && !__found_zero && !__found_grouping.size()) || __testfail) { __v = 0; __err = ios_base::failbit; } else if (__testoverflow) { if (__negative && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) __v = __gnu_cxx::__numeric_traits<_ValueT>::__min; else __v = __gnu_cxx::__numeric_traits<_ValueT>::__max; __err = ios_base::failbit; } else __v = __negative ? -__result : __result; if (__testeof) __err |= ios_base::eofbit; return __beg; } template<typename _CharT, typename _InIter> _InIter num_get<_CharT, _InIter>:: do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, bool& __v) const { if (!(__io.flags() & ios_base::boolalpha)) { long __l = -1; __beg = _M_extract_int(__beg, __end, __io, __err, __l); if (__l == 0 || __l == 1) __v = bool(__l); else { __v = true; __err = ios_base::failbit; if (__beg == __end) __err |= ios_base::eofbit; } } else { typedef __numpunct_cache<_CharT> __cache_type; __use_cache<__cache_type> __uc; const locale& __loc = __io._M_getloc(); const __cache_type* __lc = __uc(__loc); bool __testf = true; bool __testt = true; bool __donef = __lc->_M_falsename_size == 0; bool __donet = __lc->_M_truename_size == 0; bool __testeof = false; size_t __n = 0; while (!__donef || !__donet) { if (__beg == __end) { __testeof = true; break; } const char_type __c = *__beg; if (!__donef) __testf = __c == __lc->_M_falsename[__n]; if (!__testf && __donet) break; if (!__donet) __testt = __c == __lc->_M_truename[__n]; if (!__testt && __donef) break; if (!__testt && !__testf) break; ++__n; ++__beg; __donef = !__testf || __n >= __lc->_M_falsename_size; __donet = !__testt || __n >= __lc->_M_truename_size; } if (__testf && __n == __lc->_M_falsename_size && __n) { __v = false; if (__testt && __n == __lc->_M_truename_size) __err = ios_base::failbit; else __err = __testeof ? ios_base::eofbit : ios_base::goodbit; } else if (__testt && __n == __lc->_M_truename_size && __n) { __v = true; __err = __testeof ? ios_base::eofbit : ios_base::goodbit; } else { __v = false; __err = ios_base::failbit; if (__testeof) __err |= ios_base::eofbit; } } return __beg; } template<typename _CharT, typename _InIter> _InIter num_get<_CharT, _InIter>:: do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, float& __v) const { string __xtrc; __xtrc.reserve(32); __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); if (__beg == __end) __err |= ios_base::eofbit; return __beg; } template<typename _CharT, typename _InIter> _InIter num_get<_CharT, _InIter>:: do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, double& __v) const { string __xtrc; __xtrc.reserve(32); __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); if (__beg == __end) __err |= ios_base::eofbit; return __beg; } # 732 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 template<typename _CharT, typename _InIter> _InIter num_get<_CharT, _InIter>:: do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, long double& __v) const { string __xtrc; __xtrc.reserve(32); __beg = _M_extract_float(__beg, __end, __io, __err, __xtrc); std::__convert_to_v(__xtrc.c_str(), __v, __err, _S_get_c_locale()); if (__beg == __end) __err |= ios_base::eofbit; return __beg; } template<typename _CharT, typename _InIter> _InIter num_get<_CharT, _InIter>:: do_get(iter_type __beg, iter_type __end, ios_base& __io, ios_base::iostate& __err, void*& __v) const { typedef ios_base::fmtflags fmtflags; const fmtflags __fmt = __io.flags(); __io.flags((__fmt & ~ios_base::basefield) | ios_base::hex); typedef __gnu_cxx::__conditional_type<(sizeof(void*) <= sizeof(unsigned long)), unsigned long, unsigned long long>::__type _UIntPtrType; _UIntPtrType __ul; __beg = _M_extract_int(__beg, __end, __io, __err, __ul); __io.flags(__fmt); __v = reinterpret_cast<void*>(__ul); return __beg; } template<typename _CharT, typename _OutIter> void num_put<_CharT, _OutIter>:: _M_pad(_CharT __fill, streamsize __w, ios_base& __io, _CharT* __new, const _CharT* __cs, int& __len) const { __pad<_CharT, char_traits<_CharT> >::_S_pad(__io, __fill, __new, __cs, __w, __len); __len = static_cast<int>(__w); } template<typename _CharT, typename _ValueT> int __int_to_char(_CharT* __bufend, _ValueT __v, const _CharT* __lit, ios_base::fmtflags __flags, bool __dec) { _CharT* __buf = __bufend; if (__builtin_expect(__dec, true)) { do { *--__buf = __lit[(__v % 10) + __num_base::_S_odigits]; __v /= 10; } while (__v != 0); } else if ((__flags & ios_base::basefield) == ios_base::oct) { do { *--__buf = __lit[(__v & 0x7) + __num_base::_S_odigits]; __v >>= 3; } while (__v != 0); } else { const bool __uppercase = __flags & ios_base::uppercase; const int __case_offset = __uppercase ? __num_base::_S_oudigits : __num_base::_S_odigits; do { *--__buf = __lit[(__v & 0xf) + __case_offset]; __v >>= 4; } while (__v != 0); } return __bufend - __buf; } template<typename _CharT, typename _OutIter> void num_put<_CharT, _OutIter>:: _M_group_int(const char* __grouping, size_t __grouping_size, _CharT __sep, ios_base&, _CharT* __new, _CharT* __cs, int& __len) const { _CharT* __p = std::__add_grouping(__new, __sep, __grouping, __grouping_size, __cs, __cs + __len); __len = __p - __new; } template<typename _CharT, typename _OutIter> template<typename _ValueT> _OutIter num_put<_CharT, _OutIter>:: _M_insert_int(_OutIter __s, ios_base& __io, _CharT __fill, _ValueT __v) const { using __gnu_cxx::__add_unsigned; typedef typename __add_unsigned<_ValueT>::__type __unsigned_type; typedef __numpunct_cache<_CharT> __cache_type; __use_cache<__cache_type> __uc; const locale& __loc = __io._M_getloc(); const __cache_type* __lc = __uc(__loc); const _CharT* __lit = __lc->_M_atoms_out; const ios_base::fmtflags __flags = __io.flags(); const int __ilen = 5 * sizeof(_ValueT); _CharT* __cs = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __ilen)); const ios_base::fmtflags __basefield = __flags & ios_base::basefield; const bool __dec = (__basefield != ios_base::oct && __basefield != ios_base::hex); const __unsigned_type __u = ((__v > 0 || !__dec) ? __unsigned_type(__v) : -__unsigned_type(__v)); int __len = __int_to_char(__cs + __ilen, __u, __lit, __flags, __dec); __cs += __ilen - __len; if (__lc->_M_use_grouping) { _CharT* __cs2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * (__len + 1) * 2)); _M_group_int(__lc->_M_grouping, __lc->_M_grouping_size, __lc->_M_thousands_sep, __io, __cs2 + 2, __cs, __len); __cs = __cs2 + 2; } if (__builtin_expect(__dec, true)) { if (__v >= 0) { if (bool(__flags & ios_base::showpos) && __gnu_cxx::__numeric_traits<_ValueT>::__is_signed) *--__cs = __lit[__num_base::_S_oplus], ++__len; } else *--__cs = __lit[__num_base::_S_ominus], ++__len; } else if (bool(__flags & ios_base::showbase) && __v) { if (__basefield == ios_base::oct) *--__cs = __lit[__num_base::_S_odigits], ++__len; else { const bool __uppercase = __flags & ios_base::uppercase; *--__cs = __lit[__num_base::_S_ox + __uppercase]; *--__cs = __lit[__num_base::_S_odigits]; __len += 2; } } const streamsize __w = __io.width(); if (__w > static_cast<streamsize>(__len)) { _CharT* __cs3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __w)); _M_pad(__fill, __w, __io, __cs3, __cs, __len); __cs = __cs3; } __io.width(0); return std::__write(__s, __cs, __len); } template<typename _CharT, typename _OutIter> void num_put<_CharT, _OutIter>:: _M_group_float(const char* __grouping, size_t __grouping_size, _CharT __sep, const _CharT* __p, _CharT* __new, _CharT* __cs, int& __len) const { const int __declen = __p ? __p - __cs : __len; _CharT* __p2 = std::__add_grouping(__new, __sep, __grouping, __grouping_size, __cs, __cs + __declen); int __newlen = __p2 - __new; if (__p) { char_traits<_CharT>::copy(__p2, __p, __len - __declen); __newlen += __len - __declen; } __len = __newlen; } # 968 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 template<typename _CharT, typename _OutIter> template<typename _ValueT> _OutIter num_put<_CharT, _OutIter>:: _M_insert_float(_OutIter __s, ios_base& __io, _CharT __fill, char __mod, _ValueT __v) const { typedef __numpunct_cache<_CharT> __cache_type; __use_cache<__cache_type> __uc; const locale& __loc = __io._M_getloc(); const __cache_type* __lc = __uc(__loc); const streamsize __prec = __io.precision() < 0 ? 6 : __io.precision(); const int __max_digits = __gnu_cxx::__numeric_traits<_ValueT>::__digits10; int __len; char __fbuf[16]; __num_base::_S_format_float(__io, __fbuf, __mod); int __cs_size = __max_digits * 3; char* __cs = static_cast<char*>(__builtin_alloca(__cs_size)); __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, __fbuf, __prec, __v); if (__len >= __cs_size) { __cs_size = __len + 1; __cs = static_cast<char*>(__builtin_alloca(__cs_size)); __len = std::__convert_from_v(_S_get_c_locale(), __cs, __cs_size, __fbuf, __prec, __v); } # 1029 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); _CharT* __ws = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __len)); __ctype.widen(__cs, __cs + __len, __ws); _CharT* __wp = 0; const char* __p = char_traits<char>::find(__cs, __len, '.'); if (__p) { __wp = __ws + (__p - __cs); *__wp = __lc->_M_decimal_point; } if (__lc->_M_use_grouping && (__wp || __len < 3 || (__cs[1] <= '9' && __cs[2] <= '9' && __cs[1] >= '0' && __cs[2] >= '0'))) { _CharT* __ws2 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __len * 2)); streamsize __off = 0; if (__cs[0] == '-' || __cs[0] == '+') { __off = 1; __ws2[0] = __ws[0]; __len -= 1; } _M_group_float(__lc->_M_grouping, __lc->_M_grouping_size, __lc->_M_thousands_sep, __wp, __ws2 + __off, __ws + __off, __len); __len += __off; __ws = __ws2; } const streamsize __w = __io.width(); if (__w > static_cast<streamsize>(__len)) { _CharT* __ws3 = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __w)); _M_pad(__fill, __w, __io, __ws3, __ws, __len); __ws = __ws3; } __io.width(0); return std::__write(__s, __ws, __len); } template<typename _CharT, typename _OutIter> _OutIter num_put<_CharT, _OutIter>:: do_put(iter_type __s, ios_base& __io, char_type __fill, bool __v) const { const ios_base::fmtflags __flags = __io.flags(); if ((__flags & ios_base::boolalpha) == 0) { const long __l = __v; __s = _M_insert_int(__s, __io, __fill, __l); } else { typedef __numpunct_cache<_CharT> __cache_type; __use_cache<__cache_type> __uc; const locale& __loc = __io._M_getloc(); const __cache_type* __lc = __uc(__loc); const _CharT* __name = __v ? __lc->_M_truename : __lc->_M_falsename; int __len = __v ? __lc->_M_truename_size : __lc->_M_falsename_size; const streamsize __w = __io.width(); if (__w > static_cast<streamsize>(__len)) { const streamsize __plen = __w - __len; _CharT* __ps = static_cast<_CharT*>(__builtin_alloca(sizeof(_CharT) * __plen)); char_traits<_CharT>::assign(__ps, __plen, __fill); __io.width(0); if ((__flags & ios_base::adjustfield) == ios_base::left) { __s = std::__write(__s, __name, __len); __s = std::__write(__s, __ps, __plen); } else { __s = std::__write(__s, __ps, __plen); __s = std::__write(__s, __name, __len); } return __s; } __io.width(0); __s = std::__write(__s, __name, __len); } return __s; } template<typename _CharT, typename _OutIter> _OutIter num_put<_CharT, _OutIter>:: do_put(iter_type __s, ios_base& __io, char_type __fill, double __v) const { return _M_insert_float(__s, __io, __fill, char(), __v); } # 1154 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 template<typename _CharT, typename _OutIter> _OutIter num_put<_CharT, _OutIter>:: do_put(iter_type __s, ios_base& __io, char_type __fill, long double __v) const { return _M_insert_float(__s, __io, __fill, 'L', __v); } template<typename _CharT, typename _OutIter> _OutIter num_put<_CharT, _OutIter>:: do_put(iter_type __s, ios_base& __io, char_type __fill, const void* __v) const { const ios_base::fmtflags __flags = __io.flags(); const ios_base::fmtflags __fmt = ~(ios_base::basefield | ios_base::uppercase); __io.flags((__flags & __fmt) | (ios_base::hex | ios_base::showbase)); typedef __gnu_cxx::__conditional_type<(sizeof(const void*) <= sizeof(unsigned long)), unsigned long, unsigned long long>::__type _UIntPtrType; __s = _M_insert_int(__s, __io, __fill, reinterpret_cast<_UIntPtrType>(__v)); __io.flags(__flags); return __s; } # 1191 "/usr/include/c++/4.7/bits/locale_facets.tcc" 3 template<typename _CharT, typename _Traits> void __pad<_CharT, _Traits>::_S_pad(ios_base& __io, _CharT __fill, _CharT* __news, const _CharT* __olds, streamsize __newlen, streamsize __oldlen) { const size_t __plen = static_cast<size_t>(__newlen - __oldlen); const ios_base::fmtflags __adjust = __io.flags() & ios_base::adjustfield; if (__adjust == ios_base::left) { _Traits::copy(__news, __olds, __oldlen); _Traits::assign(__news + __oldlen, __plen, __fill); return; } size_t __mod = 0; if (__adjust == ios_base::internal) { const locale& __loc = __io._M_getloc(); const ctype<_CharT>& __ctype = use_facet<ctype<_CharT> >(__loc); if (__ctype.widen('-') == __olds[0] || __ctype.widen('+') == __olds[0]) { __news[0] = __olds[0]; __mod = 1; ++__news; } else if (__ctype.widen('0') == __olds[0] && __oldlen > 1 && (__ctype.widen('x') == __olds[1] || __ctype.widen('X') == __olds[1])) { __news[0] = __olds[0]; __news[1] = __olds[1]; __mod = 2; __news += 2; } } _Traits::assign(__news, __plen, __fill); _Traits::copy(__news + __plen, __olds + __mod, __oldlen - __mod); } template<typename _CharT> _CharT* __add_grouping(_CharT* __s, _CharT __sep, const char* __gbeg, size_t __gsize, const _CharT* __first, const _CharT* __last) { size_t __idx = 0; size_t __ctr = 0; while (__last - __first > __gbeg[__idx] && static_cast<signed char>(__gbeg[__idx]) > 0 && __gbeg[__idx] != __gnu_cxx::__numeric_traits<char>::__max) { __last -= __gbeg[__idx]; __idx < __gsize - 1 ? ++__idx : ++__ctr; } while (__first != __last) *__s++ = *__first++; while (__ctr--) { *__s++ = __sep; for (char __i = __gbeg[__idx]; __i > 0; --__i) *__s++ = *__first++; } while (__idx--) { *__s++ = __sep; for (char __i = __gbeg[__idx]; __i > 0; --__i) *__s++ = *__first++; } return __s; } extern template class numpunct<char>; extern template class numpunct_byname<char>; extern template class num_get<char>; extern template class num_put<char>; extern template class ctype_byname<char>; extern template const ctype<char>& use_facet<ctype<char> >(const locale&); extern template const numpunct<char>& use_facet<numpunct<char> >(const locale&); extern template const num_put<char>& use_facet<num_put<char> >(const locale&); extern template const num_get<char>& use_facet<num_get<char> >(const locale&); extern template bool has_facet<ctype<char> >(const locale&); extern template bool has_facet<numpunct<char> >(const locale&); extern template bool has_facet<num_put<char> >(const locale&); extern template bool has_facet<num_get<char> >(const locale&); extern template class numpunct<wchar_t>; extern template class numpunct_byname<wchar_t>; extern template class num_get<wchar_t>; extern template class num_put<wchar_t>; extern template class ctype_byname<wchar_t>; extern template const ctype<wchar_t>& use_facet<ctype<wchar_t> >(const locale&); extern template const numpunct<wchar_t>& use_facet<numpunct<wchar_t> >(const locale&); extern template const num_put<wchar_t>& use_facet<num_put<wchar_t> >(const locale&); extern template const num_get<wchar_t>& use_facet<num_get<wchar_t> >(const locale&); extern template bool has_facet<ctype<wchar_t> >(const locale&); extern template bool has_facet<numpunct<wchar_t> >(const locale&); extern template bool has_facet<num_put<wchar_t> >(const locale&); extern template bool has_facet<num_get<wchar_t> >(const locale&); } # 2608 "/usr/include/c++/4.7/bits/locale_facets.h" 2 3 # 40 "/usr/include/c++/4.7/bits/basic_ios.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _Facet> inline const _Facet& __check_facet(const _Facet* __f) { if (!__f) __throw_bad_cast(); return *__f; } # 63 "/usr/include/c++/4.7/bits/basic_ios.h" 3 template<typename _CharT, typename _Traits> class basic_ios : public ios_base { public: typedef _CharT char_type; typedef typename _Traits::int_type int_type; typedef typename _Traits::pos_type pos_type; typedef typename _Traits::off_type off_type; typedef _Traits traits_type; typedef ctype<_CharT> __ctype_type; typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > __num_put_type; typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > __num_get_type; protected: basic_ostream<_CharT, _Traits>* _M_tie; mutable char_type _M_fill; mutable bool _M_fill_init; basic_streambuf<_CharT, _Traits>* _M_streambuf; const __ctype_type* _M_ctype; const __num_put_type* _M_num_put; const __num_get_type* _M_num_get; public: operator void*() const { return this->fail() ? 0 : const_cast<basic_ios*>(this); } bool operator!() const { return this->fail(); } # 128 "/usr/include/c++/4.7/bits/basic_ios.h" 3 iostate rdstate() const { return _M_streambuf_state; } # 139 "/usr/include/c++/4.7/bits/basic_ios.h" 3 void clear(iostate __state = goodbit); void setstate(iostate __state) { this->clear(this->rdstate() | __state); } void _M_setstate(iostate __state) { _M_streambuf_state |= __state; if (this->exceptions() & __state) throw; } bool good() const { return this->rdstate() == 0; } bool eof() const { return (this->rdstate() & eofbit) != 0; } # 192 "/usr/include/c++/4.7/bits/basic_ios.h" 3 bool fail() const { return (this->rdstate() & (badbit | failbit)) != 0; } bool bad() const { return (this->rdstate() & badbit) != 0; } # 213 "/usr/include/c++/4.7/bits/basic_ios.h" 3 iostate exceptions() const { return _M_exception; } # 248 "/usr/include/c++/4.7/bits/basic_ios.h" 3 void exceptions(iostate __except) { _M_exception = __except; this->clear(_M_streambuf_state); } explicit basic_ios(basic_streambuf<_CharT, _Traits>* __sb) : ios_base(), _M_tie(0), _M_fill(), _M_fill_init(false), _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0) { this->init(__sb); } virtual ~basic_ios() { } # 286 "/usr/include/c++/4.7/bits/basic_ios.h" 3 basic_ostream<_CharT, _Traits>* tie() const { return _M_tie; } # 298 "/usr/include/c++/4.7/bits/basic_ios.h" 3 basic_ostream<_CharT, _Traits>* tie(basic_ostream<_CharT, _Traits>* __tiestr) { basic_ostream<_CharT, _Traits>* __old = _M_tie; _M_tie = __tiestr; return __old; } basic_streambuf<_CharT, _Traits>* rdbuf() const { return _M_streambuf; } # 338 "/usr/include/c++/4.7/bits/basic_ios.h" 3 basic_streambuf<_CharT, _Traits>* rdbuf(basic_streambuf<_CharT, _Traits>* __sb); # 352 "/usr/include/c++/4.7/bits/basic_ios.h" 3 basic_ios& copyfmt(const basic_ios& __rhs); char_type fill() const { if (!_M_fill_init) { _M_fill = this->widen(' '); _M_fill_init = true; } return _M_fill; } # 381 "/usr/include/c++/4.7/bits/basic_ios.h" 3 char_type fill(char_type __ch) { char_type __old = this->fill(); _M_fill = __ch; return __old; } # 401 "/usr/include/c++/4.7/bits/basic_ios.h" 3 locale imbue(const locale& __loc); # 421 "/usr/include/c++/4.7/bits/basic_ios.h" 3 char narrow(char_type __c, char __dfault) const { return __check_facet(_M_ctype).narrow(__c, __dfault); } # 440 "/usr/include/c++/4.7/bits/basic_ios.h" 3 char_type widen(char __c) const { return __check_facet(_M_ctype).widen(__c); } protected: basic_ios() : ios_base(), _M_tie(0), _M_fill(char_type()), _M_fill_init(false), _M_streambuf(0), _M_ctype(0), _M_num_put(0), _M_num_get(0) { } void init(basic_streambuf<_CharT, _Traits>* __sb); void _M_cache_locale(const locale& __loc); }; } # 1 "/usr/include/c++/4.7/bits/basic_ios.tcc" 1 3 # 34 "/usr/include/c++/4.7/bits/basic_ios.tcc" 3 # 35 "/usr/include/c++/4.7/bits/basic_ios.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _CharT, typename _Traits> void basic_ios<_CharT, _Traits>::clear(iostate __state) { if (this->rdbuf()) _M_streambuf_state = __state; else _M_streambuf_state = __state | badbit; if (this->exceptions() & this->rdstate()) __throw_ios_failure(("basic_ios::clear")); } template<typename _CharT, typename _Traits> basic_streambuf<_CharT, _Traits>* basic_ios<_CharT, _Traits>::rdbuf(basic_streambuf<_CharT, _Traits>* __sb) { basic_streambuf<_CharT, _Traits>* __old = _M_streambuf; _M_streambuf = __sb; this->clear(); return __old; } template<typename _CharT, typename _Traits> basic_ios<_CharT, _Traits>& basic_ios<_CharT, _Traits>::copyfmt(const basic_ios& __rhs) { if (this != &__rhs) { _Words* __words = (__rhs._M_word_size <= _S_local_word_size) ? _M_local_word : new _Words[__rhs._M_word_size]; _Callback_list* __cb = __rhs._M_callbacks; if (__cb) __cb->_M_add_reference(); _M_call_callbacks(erase_event); if (_M_word != _M_local_word) { delete [] _M_word; _M_word = 0; } _M_dispose_callbacks(); _M_callbacks = __cb; for (int __i = 0; __i < __rhs._M_word_size; ++__i) __words[__i] = __rhs._M_word[__i]; _M_word = __words; _M_word_size = __rhs._M_word_size; this->flags(__rhs.flags()); this->width(__rhs.width()); this->precision(__rhs.precision()); this->tie(__rhs.tie()); this->fill(__rhs.fill()); _M_ios_locale = __rhs.getloc(); _M_cache_locale(_M_ios_locale); _M_call_callbacks(copyfmt_event); this->exceptions(__rhs.exceptions()); } return *this; } template<typename _CharT, typename _Traits> locale basic_ios<_CharT, _Traits>::imbue(const locale& __loc) { locale __old(this->getloc()); ios_base::imbue(__loc); _M_cache_locale(__loc); if (this->rdbuf() != 0) this->rdbuf()->pubimbue(__loc); return __old; } template<typename _CharT, typename _Traits> void basic_ios<_CharT, _Traits>::init(basic_streambuf<_CharT, _Traits>* __sb) { ios_base::_M_init(); _M_cache_locale(_M_ios_locale); # 147 "/usr/include/c++/4.7/bits/basic_ios.tcc" 3 _M_fill = _CharT(); _M_fill_init = false; _M_tie = 0; _M_exception = goodbit; _M_streambuf = __sb; _M_streambuf_state = __sb ? goodbit : badbit; } template<typename _CharT, typename _Traits> void basic_ios<_CharT, _Traits>::_M_cache_locale(const locale& __loc) { if (__builtin_expect(has_facet<__ctype_type>(__loc), true)) _M_ctype = &use_facet<__ctype_type>(__loc); else _M_ctype = 0; if (__builtin_expect(has_facet<__num_put_type>(__loc), true)) _M_num_put = &use_facet<__num_put_type>(__loc); else _M_num_put = 0; if (__builtin_expect(has_facet<__num_get_type>(__loc), true)) _M_num_get = &use_facet<__num_get_type>(__loc); else _M_num_get = 0; } extern template class basic_ios<char>; extern template class basic_ios<wchar_t>; } # 474 "/usr/include/c++/4.7/bits/basic_ios.h" 2 3 # 46 "/usr/include/c++/4.7/ios" 2 3 # 41 "/usr/include/c++/4.7/istream" 2 3 # 1 "/usr/include/c++/4.7/ostream" 1 3 # 38 "/usr/include/c++/4.7/ostream" 3 # 39 "/usr/include/c++/4.7/ostream" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 55 "/usr/include/c++/4.7/ostream" 3 template<typename _CharT, typename _Traits> class basic_ostream : virtual public basic_ios<_CharT, _Traits> { public: typedef _CharT char_type; typedef typename _Traits::int_type int_type; typedef typename _Traits::pos_type pos_type; typedef typename _Traits::off_type off_type; typedef _Traits traits_type; typedef basic_streambuf<_CharT, _Traits> __streambuf_type; typedef basic_ios<_CharT, _Traits> __ios_type; typedef basic_ostream<_CharT, _Traits> __ostream_type; typedef num_put<_CharT, ostreambuf_iterator<_CharT, _Traits> > __num_put_type; typedef ctype<_CharT> __ctype_type; # 81 "/usr/include/c++/4.7/ostream" 3 explicit basic_ostream(__streambuf_type* __sb) { this->init(__sb); } virtual ~basic_ostream() { } class sentry; friend class sentry; # 105 "/usr/include/c++/4.7/ostream" 3 __ostream_type& operator<<(__ostream_type& (*__pf)(__ostream_type&)) { return __pf(*this); } __ostream_type& operator<<(__ios_type& (*__pf)(__ios_type&)) { __pf(*this); return *this; } __ostream_type& operator<<(ios_base& (*__pf) (ios_base&)) { __pf(*this); return *this; } # 163 "/usr/include/c++/4.7/ostream" 3 __ostream_type& operator<<(long __n) { return _M_insert(__n); } __ostream_type& operator<<(unsigned long __n) { return _M_insert(__n); } __ostream_type& operator<<(bool __n) { return _M_insert(__n); } __ostream_type& operator<<(short __n); __ostream_type& operator<<(unsigned short __n) { return _M_insert(static_cast<unsigned long>(__n)); } __ostream_type& operator<<(int __n); __ostream_type& operator<<(unsigned int __n) { return _M_insert(static_cast<unsigned long>(__n)); } __ostream_type& operator<<(long long __n) { return _M_insert(__n); } __ostream_type& operator<<(unsigned long long __n) { return _M_insert(__n); } # 217 "/usr/include/c++/4.7/ostream" 3 __ostream_type& operator<<(double __f) { return _M_insert(__f); } __ostream_type& operator<<(float __f) { return _M_insert(static_cast<double>(__f)); } __ostream_type& operator<<(long double __f) { return _M_insert(__f); } # 242 "/usr/include/c++/4.7/ostream" 3 __ostream_type& operator<<(const void* __p) { return _M_insert(__p); } # 267 "/usr/include/c++/4.7/ostream" 3 __ostream_type& operator<<(__streambuf_type* __sb); # 300 "/usr/include/c++/4.7/ostream" 3 __ostream_type& put(char_type __c); void _M_write(const char_type* __s, streamsize __n) { const streamsize __put = this->rdbuf()->sputn(__s, __n); if (__put != __n) this->setstate(ios_base::badbit); } # 332 "/usr/include/c++/4.7/ostream" 3 __ostream_type& write(const char_type* __s, streamsize __n); # 345 "/usr/include/c++/4.7/ostream" 3 __ostream_type& flush(); # 355 "/usr/include/c++/4.7/ostream" 3 pos_type tellp(); # 366 "/usr/include/c++/4.7/ostream" 3 __ostream_type& seekp(pos_type); # 378 "/usr/include/c++/4.7/ostream" 3 __ostream_type& seekp(off_type, ios_base::seekdir); protected: basic_ostream() { this->init(0); } template<typename _ValueT> __ostream_type& _M_insert(_ValueT __v); }; # 397 "/usr/include/c++/4.7/ostream" 3 template <typename _CharT, typename _Traits> class basic_ostream<_CharT, _Traits>::sentry { bool _M_ok; basic_ostream<_CharT, _Traits>& _M_os; public: # 416 "/usr/include/c++/4.7/ostream" 3 explicit sentry(basic_ostream<_CharT, _Traits>& __os); # 426 "/usr/include/c++/4.7/ostream" 3 ~sentry() { if (bool(_M_os.flags() & ios_base::unitbuf) && !uncaught_exception()) { if (_M_os.rdbuf() && _M_os.rdbuf()->pubsync() == -1) _M_os.setstate(ios_base::badbit); } } # 447 "/usr/include/c++/4.7/ostream" 3 operator bool() const { return _M_ok; } }; # 467 "/usr/include/c++/4.7/ostream" 3 template<typename _CharT, typename _Traits> inline basic_ostream<_CharT, _Traits>& operator<<(basic_ostream<_CharT, _Traits>& __out, _CharT __c) { return __ostream_insert(__out, &__c, 1); } template<typename _CharT, typename _Traits> inline basic_ostream<_CharT, _Traits>& operator<<(basic_ostream<_CharT, _Traits>& __out, char __c) { return (__out << __out.widen(__c)); } template <class _Traits> inline basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>& __out, char __c) { return __ostream_insert(__out, &__c, 1); } template<class _Traits> inline basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>& __out, signed char __c) { return (__out << static_cast<char>(__c)); } template<class _Traits> inline basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>& __out, unsigned char __c) { return (__out << static_cast<char>(__c)); } # 509 "/usr/include/c++/4.7/ostream" 3 template<typename _CharT, typename _Traits> inline basic_ostream<_CharT, _Traits>& operator<<(basic_ostream<_CharT, _Traits>& __out, const _CharT* __s) { if (!__s) __out.setstate(ios_base::badbit); else __ostream_insert(__out, __s, static_cast<streamsize>(_Traits::length(__s))); return __out; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits> & operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s); template<class _Traits> inline basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>& __out, const char* __s) { if (!__s) __out.setstate(ios_base::badbit); else __ostream_insert(__out, __s, static_cast<streamsize>(_Traits::length(__s))); return __out; } template<class _Traits> inline basic_ostream<char, _Traits>& operator<<(basic_ostream<char, _Traits>& __out, const signed char* __s) { return (__out << reinterpret_cast<const char*>(__s)); } template<class _Traits> inline basic_ostream<char, _Traits> & operator<<(basic_ostream<char, _Traits>& __out, const unsigned char* __s) { return (__out << reinterpret_cast<const char*>(__s)); } # 560 "/usr/include/c++/4.7/ostream" 3 template<typename _CharT, typename _Traits> inline basic_ostream<_CharT, _Traits>& endl(basic_ostream<_CharT, _Traits>& __os) { return flush(__os.put(__os.widen('\n'))); } # 572 "/usr/include/c++/4.7/ostream" 3 template<typename _CharT, typename _Traits> inline basic_ostream<_CharT, _Traits>& ends(basic_ostream<_CharT, _Traits>& __os) { return __os.put(_CharT()); } template<typename _CharT, typename _Traits> inline basic_ostream<_CharT, _Traits>& flush(basic_ostream<_CharT, _Traits>& __os) { return __os.flush(); } # 604 "/usr/include/c++/4.7/ostream" 3 } # 1 "/usr/include/c++/4.7/bits/ostream.tcc" 1 3 # 39 "/usr/include/c++/4.7/bits/ostream.tcc" 3 # 40 "/usr/include/c++/4.7/bits/ostream.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>::sentry:: sentry(basic_ostream<_CharT, _Traits>& __os) : _M_ok(false), _M_os(__os) { if (__os.tie() && __os.good()) __os.tie()->flush(); if (__os.good()) _M_ok = true; else __os.setstate(ios_base::failbit); } template<typename _CharT, typename _Traits> template<typename _ValueT> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: _M_insert(_ValueT __v) { sentry __cerb(*this); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const __num_put_type& __np = __check_facet(this->_M_num_put); if (__np.put(*this, *this, this->fill(), __v).failed()) __err |= ios_base::badbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: operator<<(short __n) { const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; if (__fmt == ios_base::oct || __fmt == ios_base::hex) return _M_insert(static_cast<long>(static_cast<unsigned short>(__n))); else return _M_insert(static_cast<long>(__n)); } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: operator<<(int __n) { const ios_base::fmtflags __fmt = this->flags() & ios_base::basefield; if (__fmt == ios_base::oct || __fmt == ios_base::hex) return _M_insert(static_cast<long>(static_cast<unsigned int>(__n))); else return _M_insert(static_cast<long>(__n)); } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: operator<<(__streambuf_type* __sbin) { ios_base::iostate __err = ios_base::goodbit; sentry __cerb(*this); if (__cerb && __sbin) { try { if (!__copy_streambufs(__sbin, this->rdbuf())) __err |= ios_base::failbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::failbit); } } else if (!__sbin) __err |= ios_base::badbit; if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: put(char_type __c) { sentry __cerb(*this); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const int_type __put = this->rdbuf()->sputc(__c); if (traits_type::eq_int_type(__put, traits_type::eof())) __err |= ios_base::badbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: write(const _CharT* __s, streamsize __n) { sentry __cerb(*this); if (__cerb) { try { _M_write(__s, __n); } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } } return *this; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: flush() { ios_base::iostate __err = ios_base::goodbit; try { if (this->rdbuf() && this->rdbuf()->pubsync() == -1) __err |= ios_base::badbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> typename basic_ostream<_CharT, _Traits>::pos_type basic_ostream<_CharT, _Traits>:: tellp() { pos_type __ret = pos_type(-1); try { if (!this->fail()) __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::out); } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } return __ret; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: seekp(pos_type __pos) { ios_base::iostate __err = ios_base::goodbit; try { if (!this->fail()) { const pos_type __p = this->rdbuf()->pubseekpos(__pos, ios_base::out); if (__p == pos_type(off_type(-1))) __err |= ios_base::failbit; } } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& basic_ostream<_CharT, _Traits>:: seekp(off_type __off, ios_base::seekdir __dir) { ios_base::iostate __err = ios_base::goodbit; try { if (!this->fail()) { const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, ios_base::out); if (__p == pos_type(off_type(-1))) __err |= ios_base::failbit; } } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> basic_ostream<_CharT, _Traits>& operator<<(basic_ostream<_CharT, _Traits>& __out, const char* __s) { if (!__s) __out.setstate(ios_base::badbit); else { const size_t __clen = char_traits<char>::length(__s); try { struct __ptr_guard { _CharT *__p; __ptr_guard (_CharT *__ip): __p(__ip) { } ~__ptr_guard() { delete[] __p; } _CharT* __get() { return __p; } } __pg (new _CharT[__clen]); _CharT *__ws = __pg.__get(); for (size_t __i = 0; __i < __clen; ++__i) __ws[__i] = __out.widen(__s[__i]); __ostream_insert(__out, __ws, __clen); } catch(__cxxabiv1::__forced_unwind&) { __out._M_setstate(ios_base::badbit); throw; } catch(...) { __out._M_setstate(ios_base::badbit); } } return __out; } extern template class basic_ostream<char>; extern template ostream& endl(ostream&); extern template ostream& ends(ostream&); extern template ostream& flush(ostream&); extern template ostream& operator<<(ostream&, char); extern template ostream& operator<<(ostream&, unsigned char); extern template ostream& operator<<(ostream&, signed char); extern template ostream& operator<<(ostream&, const char*); extern template ostream& operator<<(ostream&, const unsigned char*); extern template ostream& operator<<(ostream&, const signed char*); extern template ostream& ostream::_M_insert(long); extern template ostream& ostream::_M_insert(unsigned long); extern template ostream& ostream::_M_insert(bool); extern template ostream& ostream::_M_insert(long long); extern template ostream& ostream::_M_insert(unsigned long long); extern template ostream& ostream::_M_insert(double); extern template ostream& ostream::_M_insert(long double); extern template ostream& ostream::_M_insert(const void*); extern template class basic_ostream<wchar_t>; extern template wostream& endl(wostream&); extern template wostream& ends(wostream&); extern template wostream& flush(wostream&); extern template wostream& operator<<(wostream&, wchar_t); extern template wostream& operator<<(wostream&, char); extern template wostream& operator<<(wostream&, const wchar_t*); extern template wostream& operator<<(wostream&, const char*); extern template wostream& wostream::_M_insert(long); extern template wostream& wostream::_M_insert(unsigned long); extern template wostream& wostream::_M_insert(bool); extern template wostream& wostream::_M_insert(long long); extern template wostream& wostream::_M_insert(unsigned long long); extern template wostream& wostream::_M_insert(double); extern template wostream& wostream::_M_insert(long double); extern template wostream& wostream::_M_insert(const void*); } # 608 "/usr/include/c++/4.7/ostream" 2 3 # 42 "/usr/include/c++/4.7/istream" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 55 "/usr/include/c++/4.7/istream" 3 template<typename _CharT, typename _Traits> class basic_istream : virtual public basic_ios<_CharT, _Traits> { public: typedef _CharT char_type; typedef typename _Traits::int_type int_type; typedef typename _Traits::pos_type pos_type; typedef typename _Traits::off_type off_type; typedef _Traits traits_type; typedef basic_streambuf<_CharT, _Traits> __streambuf_type; typedef basic_ios<_CharT, _Traits> __ios_type; typedef basic_istream<_CharT, _Traits> __istream_type; typedef num_get<_CharT, istreambuf_iterator<_CharT, _Traits> > __num_get_type; typedef ctype<_CharT> __ctype_type; protected: streamsize _M_gcount; public: explicit basic_istream(__streambuf_type* __sb) : _M_gcount(streamsize(0)) { this->init(__sb); } virtual ~basic_istream() { _M_gcount = streamsize(0); } class sentry; friend class sentry; # 117 "/usr/include/c++/4.7/istream" 3 __istream_type& operator>>(__istream_type& (*__pf)(__istream_type&)) { return __pf(*this); } __istream_type& operator>>(__ios_type& (*__pf)(__ios_type&)) { __pf(*this); return *this; } __istream_type& operator>>(ios_base& (*__pf)(ios_base&)) { __pf(*this); return *this; } # 165 "/usr/include/c++/4.7/istream" 3 __istream_type& operator>>(bool& __n) { return _M_extract(__n); } __istream_type& operator>>(short& __n); __istream_type& operator>>(unsigned short& __n) { return _M_extract(__n); } __istream_type& operator>>(int& __n); __istream_type& operator>>(unsigned int& __n) { return _M_extract(__n); } __istream_type& operator>>(long& __n) { return _M_extract(__n); } __istream_type& operator>>(unsigned long& __n) { return _M_extract(__n); } __istream_type& operator>>(long long& __n) { return _M_extract(__n); } __istream_type& operator>>(unsigned long long& __n) { return _M_extract(__n); } # 211 "/usr/include/c++/4.7/istream" 3 __istream_type& operator>>(float& __f) { return _M_extract(__f); } __istream_type& operator>>(double& __f) { return _M_extract(__f); } __istream_type& operator>>(long double& __f) { return _M_extract(__f); } # 232 "/usr/include/c++/4.7/istream" 3 __istream_type& operator>>(void*& __p) { return _M_extract(__p); } # 256 "/usr/include/c++/4.7/istream" 3 __istream_type& operator>>(__streambuf_type* __sb); # 266 "/usr/include/c++/4.7/istream" 3 streamsize gcount() const { return _M_gcount; } # 299 "/usr/include/c++/4.7/istream" 3 int_type get(); # 313 "/usr/include/c++/4.7/istream" 3 __istream_type& get(char_type& __c); # 340 "/usr/include/c++/4.7/istream" 3 __istream_type& get(char_type* __s, streamsize __n, char_type __delim); # 351 "/usr/include/c++/4.7/istream" 3 __istream_type& get(char_type* __s, streamsize __n) { return this->get(__s, __n, this->widen('\n')); } # 374 "/usr/include/c++/4.7/istream" 3 __istream_type& get(__streambuf_type& __sb, char_type __delim); # 384 "/usr/include/c++/4.7/istream" 3 __istream_type& get(__streambuf_type& __sb) { return this->get(__sb, this->widen('\n')); } # 413 "/usr/include/c++/4.7/istream" 3 __istream_type& getline(char_type* __s, streamsize __n, char_type __delim); # 424 "/usr/include/c++/4.7/istream" 3 __istream_type& getline(char_type* __s, streamsize __n) { return this->getline(__s, __n, this->widen('\n')); } # 448 "/usr/include/c++/4.7/istream" 3 __istream_type& ignore(streamsize __n, int_type __delim); __istream_type& ignore(streamsize __n); __istream_type& ignore(); # 465 "/usr/include/c++/4.7/istream" 3 int_type peek(); # 483 "/usr/include/c++/4.7/istream" 3 __istream_type& read(char_type* __s, streamsize __n); # 502 "/usr/include/c++/4.7/istream" 3 streamsize readsome(char_type* __s, streamsize __n); # 519 "/usr/include/c++/4.7/istream" 3 __istream_type& putback(char_type __c); # 535 "/usr/include/c++/4.7/istream" 3 __istream_type& unget(); # 553 "/usr/include/c++/4.7/istream" 3 int sync(); # 568 "/usr/include/c++/4.7/istream" 3 pos_type tellg(); # 583 "/usr/include/c++/4.7/istream" 3 __istream_type& seekg(pos_type); # 599 "/usr/include/c++/4.7/istream" 3 __istream_type& seekg(off_type, ios_base::seekdir); protected: basic_istream() : _M_gcount(streamsize(0)) { this->init(0); } template<typename _ValueT> __istream_type& _M_extract(_ValueT& __v); }; template<> basic_istream<char>& basic_istream<char>:: getline(char_type* __s, streamsize __n, char_type __delim); template<> basic_istream<char>& basic_istream<char>:: ignore(streamsize __n); template<> basic_istream<char>& basic_istream<char>:: ignore(streamsize __n, int_type __delim); template<> basic_istream<wchar_t>& basic_istream<wchar_t>:: getline(char_type* __s, streamsize __n, char_type __delim); template<> basic_istream<wchar_t>& basic_istream<wchar_t>:: ignore(streamsize __n); template<> basic_istream<wchar_t>& basic_istream<wchar_t>:: ignore(streamsize __n, int_type __delim); # 654 "/usr/include/c++/4.7/istream" 3 template<typename _CharT, typename _Traits> class basic_istream<_CharT, _Traits>::sentry { bool _M_ok; public: typedef _Traits traits_type; typedef basic_streambuf<_CharT, _Traits> __streambuf_type; typedef basic_istream<_CharT, _Traits> __istream_type; typedef typename __istream_type::__ctype_type __ctype_type; typedef typename _Traits::int_type __int_type; # 690 "/usr/include/c++/4.7/istream" 3 explicit sentry(basic_istream<_CharT, _Traits>& __is, bool __noskipws = false); # 703 "/usr/include/c++/4.7/istream" 3 operator bool() const { return _M_ok; } }; # 719 "/usr/include/c++/4.7/istream" 3 template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c); template<class _Traits> inline basic_istream<char, _Traits>& operator>>(basic_istream<char, _Traits>& __in, unsigned char& __c) { return (__in >> reinterpret_cast<char&>(__c)); } template<class _Traits> inline basic_istream<char, _Traits>& operator>>(basic_istream<char, _Traits>& __in, signed char& __c) { return (__in >> reinterpret_cast<char&>(__c)); } # 761 "/usr/include/c++/4.7/istream" 3 template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s); template<> basic_istream<char>& operator>>(basic_istream<char>& __in, char* __s); template<class _Traits> inline basic_istream<char, _Traits>& operator>>(basic_istream<char, _Traits>& __in, unsigned char* __s) { return (__in >> reinterpret_cast<char*>(__s)); } template<class _Traits> inline basic_istream<char, _Traits>& operator>>(basic_istream<char, _Traits>& __in, signed char* __s) { return (__in >> reinterpret_cast<char*>(__s)); } # 788 "/usr/include/c++/4.7/istream" 3 template<typename _CharT, typename _Traits> class basic_iostream : public basic_istream<_CharT, _Traits>, public basic_ostream<_CharT, _Traits> { public: typedef _CharT char_type; typedef typename _Traits::int_type int_type; typedef typename _Traits::pos_type pos_type; typedef typename _Traits::off_type off_type; typedef _Traits traits_type; typedef basic_istream<_CharT, _Traits> __istream_type; typedef basic_ostream<_CharT, _Traits> __ostream_type; explicit basic_iostream(basic_streambuf<_CharT, _Traits>* __sb) : __istream_type(__sb), __ostream_type(__sb) { } virtual ~basic_iostream() { } protected: basic_iostream() : __istream_type(), __ostream_type() { } }; # 848 "/usr/include/c++/4.7/istream" 3 template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& ws(basic_istream<_CharT, _Traits>& __is); # 870 "/usr/include/c++/4.7/istream" 3 } # 1 "/usr/include/c++/4.7/bits/istream.tcc" 1 3 # 39 "/usr/include/c++/4.7/bits/istream.tcc" 3 # 40 "/usr/include/c++/4.7/bits/istream.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>::sentry:: sentry(basic_istream<_CharT, _Traits>& __in, bool __noskip) : _M_ok(false) { ios_base::iostate __err = ios_base::goodbit; if (__in.good()) { if (__in.tie()) __in.tie()->flush(); if (!__noskip && bool(__in.flags() & ios_base::skipws)) { const __int_type __eof = traits_type::eof(); __streambuf_type* __sb = __in.rdbuf(); __int_type __c = __sb->sgetc(); const __ctype_type& __ct = __check_facet(__in._M_ctype); while (!traits_type::eq_int_type(__c, __eof) && __ct.is(ctype_base::space, traits_type::to_char_type(__c))) __c = __sb->snextc(); if (traits_type::eq_int_type(__c, __eof)) __err |= ios_base::eofbit; } } if (__in.good() && __err == ios_base::goodbit) _M_ok = true; else { __err |= ios_base::failbit; __in.setstate(__err); } } template<typename _CharT, typename _Traits> template<typename _ValueT> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: _M_extract(_ValueT& __v) { sentry __cerb(*this, false); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const __num_get_type& __ng = __check_facet(this->_M_num_get); __ng.get(*this, 0, *this, __err, __v); } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: operator>>(short& __n) { sentry __cerb(*this, false); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { long __l; const __num_get_type& __ng = __check_facet(this->_M_num_get); __ng.get(*this, 0, *this, __err, __l); if (__l < __gnu_cxx::__numeric_traits<short>::__min) { __err |= ios_base::failbit; __n = __gnu_cxx::__numeric_traits<short>::__min; } else if (__l > __gnu_cxx::__numeric_traits<short>::__max) { __err |= ios_base::failbit; __n = __gnu_cxx::__numeric_traits<short>::__max; } else __n = short(__l); } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: operator>>(int& __n) { sentry __cerb(*this, false); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { long __l; const __num_get_type& __ng = __check_facet(this->_M_num_get); __ng.get(*this, 0, *this, __err, __l); if (__l < __gnu_cxx::__numeric_traits<int>::__min) { __err |= ios_base::failbit; __n = __gnu_cxx::__numeric_traits<int>::__min; } else if (__l > __gnu_cxx::__numeric_traits<int>::__max) { __err |= ios_base::failbit; __n = __gnu_cxx::__numeric_traits<int>::__max; } else __n = int(__l); } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: operator>>(__streambuf_type* __sbout) { ios_base::iostate __err = ios_base::goodbit; sentry __cerb(*this, false); if (__cerb && __sbout) { try { bool __ineof; if (!__copy_streambufs_eof(this->rdbuf(), __sbout, __ineof)) __err |= ios_base::failbit; if (__ineof) __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::failbit); throw; } catch(...) { this->_M_setstate(ios_base::failbit); } } else if (!__sbout) __err |= ios_base::failbit; if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> typename basic_istream<_CharT, _Traits>::int_type basic_istream<_CharT, _Traits>:: get(void) { const int_type __eof = traits_type::eof(); int_type __c = __eof; _M_gcount = 0; ios_base::iostate __err = ios_base::goodbit; sentry __cerb(*this, true); if (__cerb) { try { __c = this->rdbuf()->sbumpc(); if (!traits_type::eq_int_type(__c, __eof)) _M_gcount = 1; else __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } } if (!_M_gcount) __err |= ios_base::failbit; if (__err) this->setstate(__err); return __c; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: get(char_type& __c) { _M_gcount = 0; ios_base::iostate __err = ios_base::goodbit; sentry __cerb(*this, true); if (__cerb) { try { const int_type __cb = this->rdbuf()->sbumpc(); if (!traits_type::eq_int_type(__cb, traits_type::eof())) { _M_gcount = 1; __c = traits_type::to_char_type(__cb); } else __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } } if (!_M_gcount) __err |= ios_base::failbit; if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: get(char_type* __s, streamsize __n, char_type __delim) { _M_gcount = 0; ios_base::iostate __err = ios_base::goodbit; sentry __cerb(*this, true); if (__cerb) { try { const int_type __idelim = traits_type::to_int_type(__delim); const int_type __eof = traits_type::eof(); __streambuf_type* __sb = this->rdbuf(); int_type __c = __sb->sgetc(); while (_M_gcount + 1 < __n && !traits_type::eq_int_type(__c, __eof) && !traits_type::eq_int_type(__c, __idelim)) { *__s++ = traits_type::to_char_type(__c); ++_M_gcount; __c = __sb->snextc(); } if (traits_type::eq_int_type(__c, __eof)) __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } } if (__n > 0) *__s = char_type(); if (!_M_gcount) __err |= ios_base::failbit; if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: get(__streambuf_type& __sb, char_type __delim) { _M_gcount = 0; ios_base::iostate __err = ios_base::goodbit; sentry __cerb(*this, true); if (__cerb) { try { const int_type __idelim = traits_type::to_int_type(__delim); const int_type __eof = traits_type::eof(); __streambuf_type* __this_sb = this->rdbuf(); int_type __c = __this_sb->sgetc(); char_type __c2 = traits_type::to_char_type(__c); while (!traits_type::eq_int_type(__c, __eof) && !traits_type::eq_int_type(__c, __idelim) && !traits_type::eq_int_type(__sb.sputc(__c2), __eof)) { ++_M_gcount; __c = __this_sb->snextc(); __c2 = traits_type::to_char_type(__c); } if (traits_type::eq_int_type(__c, __eof)) __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } } if (!_M_gcount) __err |= ios_base::failbit; if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: getline(char_type* __s, streamsize __n, char_type __delim) { _M_gcount = 0; ios_base::iostate __err = ios_base::goodbit; sentry __cerb(*this, true); if (__cerb) { try { const int_type __idelim = traits_type::to_int_type(__delim); const int_type __eof = traits_type::eof(); __streambuf_type* __sb = this->rdbuf(); int_type __c = __sb->sgetc(); while (_M_gcount + 1 < __n && !traits_type::eq_int_type(__c, __eof) && !traits_type::eq_int_type(__c, __idelim)) { *__s++ = traits_type::to_char_type(__c); __c = __sb->snextc(); ++_M_gcount; } if (traits_type::eq_int_type(__c, __eof)) __err |= ios_base::eofbit; else { if (traits_type::eq_int_type(__c, __idelim)) { __sb->sbumpc(); ++_M_gcount; } else __err |= ios_base::failbit; } } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } } if (__n > 0) *__s = char_type(); if (!_M_gcount) __err |= ios_base::failbit; if (__err) this->setstate(__err); return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: ignore(void) { _M_gcount = 0; sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const int_type __eof = traits_type::eof(); __streambuf_type* __sb = this->rdbuf(); if (traits_type::eq_int_type(__sb->sbumpc(), __eof)) __err |= ios_base::eofbit; else _M_gcount = 1; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: ignore(streamsize __n) { _M_gcount = 0; sentry __cerb(*this, true); if (__cerb && __n > 0) { ios_base::iostate __err = ios_base::goodbit; try { const int_type __eof = traits_type::eof(); __streambuf_type* __sb = this->rdbuf(); int_type __c = __sb->sgetc(); # 515 "/usr/include/c++/4.7/bits/istream.tcc" 3 bool __large_ignore = false; while (true) { while (_M_gcount < __n && !traits_type::eq_int_type(__c, __eof)) { ++_M_gcount; __c = __sb->snextc(); } if (__n == __gnu_cxx::__numeric_traits<streamsize>::__max && !traits_type::eq_int_type(__c, __eof)) { _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__min; __large_ignore = true; } else break; } if (__large_ignore) _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__max; if (traits_type::eq_int_type(__c, __eof)) __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: ignore(streamsize __n, int_type __delim) { _M_gcount = 0; sentry __cerb(*this, true); if (__cerb && __n > 0) { ios_base::iostate __err = ios_base::goodbit; try { const int_type __eof = traits_type::eof(); __streambuf_type* __sb = this->rdbuf(); int_type __c = __sb->sgetc(); bool __large_ignore = false; while (true) { while (_M_gcount < __n && !traits_type::eq_int_type(__c, __eof) && !traits_type::eq_int_type(__c, __delim)) { ++_M_gcount; __c = __sb->snextc(); } if (__n == __gnu_cxx::__numeric_traits<streamsize>::__max && !traits_type::eq_int_type(__c, __eof) && !traits_type::eq_int_type(__c, __delim)) { _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__min; __large_ignore = true; } else break; } if (__large_ignore) _M_gcount = __gnu_cxx::__numeric_traits<streamsize>::__max; if (traits_type::eq_int_type(__c, __eof)) __err |= ios_base::eofbit; else if (traits_type::eq_int_type(__c, __delim)) { if (_M_gcount < __gnu_cxx::__numeric_traits<streamsize>::__max) ++_M_gcount; __sb->sbumpc(); } } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> typename basic_istream<_CharT, _Traits>::int_type basic_istream<_CharT, _Traits>:: peek(void) { int_type __c = traits_type::eof(); _M_gcount = 0; sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { __c = this->rdbuf()->sgetc(); if (traits_type::eq_int_type(__c, traits_type::eof())) __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return __c; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: read(char_type* __s, streamsize __n) { _M_gcount = 0; sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { _M_gcount = this->rdbuf()->sgetn(__s, __n); if (_M_gcount != __n) __err |= (ios_base::eofbit | ios_base::failbit); } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> streamsize basic_istream<_CharT, _Traits>:: readsome(char_type* __s, streamsize __n) { _M_gcount = 0; sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const streamsize __num = this->rdbuf()->in_avail(); if (__num > 0) _M_gcount = this->rdbuf()->sgetn(__s, std::min(__num, __n)); else if (__num == -1) __err |= ios_base::eofbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return _M_gcount; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: putback(char_type __c) { _M_gcount = 0; this->clear(this->rdstate() & ~ios_base::eofbit); sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const int_type __eof = traits_type::eof(); __streambuf_type* __sb = this->rdbuf(); if (!__sb || traits_type::eq_int_type(__sb->sputbackc(__c), __eof)) __err |= ios_base::badbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: unget(void) { _M_gcount = 0; this->clear(this->rdstate() & ~ios_base::eofbit); sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const int_type __eof = traits_type::eof(); __streambuf_type* __sb = this->rdbuf(); if (!__sb || traits_type::eq_int_type(__sb->sungetc(), __eof)) __err |= ios_base::badbit; } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> int basic_istream<_CharT, _Traits>:: sync(void) { int __ret = -1; sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { __streambuf_type* __sb = this->rdbuf(); if (__sb) { if (__sb->pubsync() == -1) __err |= ios_base::badbit; else __ret = 0; } } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return __ret; } template<typename _CharT, typename _Traits> typename basic_istream<_CharT, _Traits>::pos_type basic_istream<_CharT, _Traits>:: tellg(void) { pos_type __ret = pos_type(-1); sentry __cerb(*this, true); if (__cerb) { try { if (!this->fail()) __ret = this->rdbuf()->pubseekoff(0, ios_base::cur, ios_base::in); } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } } return __ret; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: seekg(pos_type __pos) { this->clear(this->rdstate() & ~ios_base::eofbit); sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { if (!this->fail()) { const pos_type __p = this->rdbuf()->pubseekpos(__pos, ios_base::in); if (__p == pos_type(off_type(-1))) __err |= ios_base::failbit; } } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>:: seekg(off_type __off, ios_base::seekdir __dir) { this->clear(this->rdstate() & ~ios_base::eofbit); sentry __cerb(*this, true); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { if (!this->fail()) { const pos_type __p = this->rdbuf()->pubseekoff(__off, __dir, ios_base::in); if (__p == pos_type(off_type(-1))) __err |= ios_base::failbit; } } catch(__cxxabiv1::__forced_unwind&) { this->_M_setstate(ios_base::badbit); throw; } catch(...) { this->_M_setstate(ios_base::badbit); } if (__err) this->setstate(__err); } return *this; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& operator>>(basic_istream<_CharT, _Traits>& __in, _CharT& __c) { typedef basic_istream<_CharT, _Traits> __istream_type; typedef typename __istream_type::int_type __int_type; typename __istream_type::sentry __cerb(__in, false); if (__cerb) { ios_base::iostate __err = ios_base::goodbit; try { const __int_type __cb = __in.rdbuf()->sbumpc(); if (!_Traits::eq_int_type(__cb, _Traits::eof())) __c = _Traits::to_char_type(__cb); else __err |= (ios_base::eofbit | ios_base::failbit); } catch(__cxxabiv1::__forced_unwind&) { __in._M_setstate(ios_base::badbit); throw; } catch(...) { __in._M_setstate(ios_base::badbit); } if (__err) __in.setstate(__err); } return __in; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& operator>>(basic_istream<_CharT, _Traits>& __in, _CharT* __s) { typedef basic_istream<_CharT, _Traits> __istream_type; typedef basic_streambuf<_CharT, _Traits> __streambuf_type; typedef typename _Traits::int_type int_type; typedef _CharT char_type; typedef ctype<_CharT> __ctype_type; streamsize __extracted = 0; ios_base::iostate __err = ios_base::goodbit; typename __istream_type::sentry __cerb(__in, false); if (__cerb) { try { streamsize __num = __in.width(); if (__num <= 0) __num = __gnu_cxx::__numeric_traits<streamsize>::__max; const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); const int_type __eof = _Traits::eof(); __streambuf_type* __sb = __in.rdbuf(); int_type __c = __sb->sgetc(); while (__extracted < __num - 1 && !_Traits::eq_int_type(__c, __eof) && !__ct.is(ctype_base::space, _Traits::to_char_type(__c))) { *__s++ = _Traits::to_char_type(__c); ++__extracted; __c = __sb->snextc(); } if (_Traits::eq_int_type(__c, __eof)) __err |= ios_base::eofbit; *__s = char_type(); __in.width(0); } catch(__cxxabiv1::__forced_unwind&) { __in._M_setstate(ios_base::badbit); throw; } catch(...) { __in._M_setstate(ios_base::badbit); } } if (!__extracted) __err |= ios_base::failbit; if (__err) __in.setstate(__err); return __in; } template<typename _CharT, typename _Traits> basic_istream<_CharT, _Traits>& ws(basic_istream<_CharT, _Traits>& __in) { typedef basic_istream<_CharT, _Traits> __istream_type; typedef basic_streambuf<_CharT, _Traits> __streambuf_type; typedef typename __istream_type::int_type __int_type; typedef ctype<_CharT> __ctype_type; const __ctype_type& __ct = use_facet<__ctype_type>(__in.getloc()); const __int_type __eof = _Traits::eof(); __streambuf_type* __sb = __in.rdbuf(); __int_type __c = __sb->sgetc(); while (!_Traits::eq_int_type(__c, __eof) && __ct.is(ctype_base::space, _Traits::to_char_type(__c))) __c = __sb->snextc(); if (_Traits::eq_int_type(__c, __eof)) __in.setstate(ios_base::eofbit); return __in; } extern template class basic_istream<char>; extern template istream& ws(istream&); extern template istream& operator>>(istream&, char&); extern template istream& operator>>(istream&, char*); extern template istream& operator>>(istream&, unsigned char&); extern template istream& operator>>(istream&, signed char&); extern template istream& operator>>(istream&, unsigned char*); extern template istream& operator>>(istream&, signed char*); extern template istream& istream::_M_extract(unsigned short&); extern template istream& istream::_M_extract(unsigned int&); extern template istream& istream::_M_extract(long&); extern template istream& istream::_M_extract(unsigned long&); extern template istream& istream::_M_extract(bool&); extern template istream& istream::_M_extract(long long&); extern template istream& istream::_M_extract(unsigned long long&); extern template istream& istream::_M_extract(float&); extern template istream& istream::_M_extract(double&); extern template istream& istream::_M_extract(long double&); extern template istream& istream::_M_extract(void*&); extern template class basic_iostream<char>; extern template class basic_istream<wchar_t>; extern template wistream& ws(wistream&); extern template wistream& operator>>(wistream&, wchar_t&); extern template wistream& operator>>(wistream&, wchar_t*); extern template wistream& wistream::_M_extract(unsigned short&); extern template wistream& wistream::_M_extract(unsigned int&); extern template wistream& wistream::_M_extract(long&); extern template wistream& wistream::_M_extract(unsigned long&); extern template wistream& wistream::_M_extract(bool&); extern template wistream& wistream::_M_extract(long long&); extern template wistream& wistream::_M_extract(unsigned long long&); extern template wistream& wistream::_M_extract(float&); extern template wistream& wistream::_M_extract(double&); extern template wistream& wistream::_M_extract(long double&); extern template wistream& wistream::_M_extract(void*&); extern template class basic_iostream<wchar_t>; } # 874 "/usr/include/c++/4.7/istream" 2 3 # 40 "/usr/include/c++/4.7/sstream" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 59 "/usr/include/c++/4.7/sstream" 3 template<typename _CharT, typename _Traits, typename _Alloc> class basic_stringbuf : public basic_streambuf<_CharT, _Traits> { public: typedef _CharT char_type; typedef _Traits traits_type; typedef _Alloc allocator_type; typedef typename traits_type::int_type int_type; typedef typename traits_type::pos_type pos_type; typedef typename traits_type::off_type off_type; typedef basic_streambuf<char_type, traits_type> __streambuf_type; typedef basic_string<char_type, _Traits, _Alloc> __string_type; typedef typename __string_type::size_type __size_type; protected: ios_base::openmode _M_mode; __string_type _M_string; public: # 93 "/usr/include/c++/4.7/sstream" 3 explicit basic_stringbuf(ios_base::openmode __mode = ios_base::in | ios_base::out) : __streambuf_type(), _M_mode(__mode), _M_string() { } # 106 "/usr/include/c++/4.7/sstream" 3 explicit basic_stringbuf(const __string_type& __str, ios_base::openmode __mode = ios_base::in | ios_base::out) : __streambuf_type(), _M_mode(), _M_string(__str.data(), __str.size()) { _M_stringbuf_init(__mode); } # 121 "/usr/include/c++/4.7/sstream" 3 __string_type str() const { __string_type __ret; if (this->pptr()) { if (this->pptr() > this->egptr()) __ret = __string_type(this->pbase(), this->pptr()); else __ret = __string_type(this->pbase(), this->egptr()); } else __ret = _M_string; return __ret; } # 145 "/usr/include/c++/4.7/sstream" 3 void str(const __string_type& __s) { _M_string.assign(__s.data(), __s.size()); _M_stringbuf_init(_M_mode); } protected: void _M_stringbuf_init(ios_base::openmode __mode) { _M_mode = __mode; __size_type __len = 0; if (_M_mode & (ios_base::ate | ios_base::app)) __len = _M_string.size(); _M_sync(const_cast<char_type*>(_M_string.data()), 0, __len); } virtual streamsize showmanyc() { streamsize __ret = -1; if (_M_mode & ios_base::in) { _M_update_egptr(); __ret = this->egptr() - this->gptr(); } return __ret; } virtual int_type underflow(); virtual int_type pbackfail(int_type __c = traits_type::eof()); virtual int_type overflow(int_type __c = traits_type::eof()); # 197 "/usr/include/c++/4.7/sstream" 3 virtual __streambuf_type* setbuf(char_type* __s, streamsize __n) { if (__s && __n >= 0) { _M_string.clear(); _M_sync(__s, __n, 0); } return this; } virtual pos_type seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode = ios_base::in | ios_base::out); virtual pos_type seekpos(pos_type __sp, ios_base::openmode __mode = ios_base::in | ios_base::out); void _M_sync(char_type* __base, __size_type __i, __size_type __o); void _M_update_egptr() { const bool __testin = _M_mode & ios_base::in; if (this->pptr() && this->pptr() > this->egptr()) { if (__testin) this->setg(this->eback(), this->gptr(), this->pptr()); else this->setg(this->pptr(), this->pptr(), this->pptr()); } } void _M_pbump(char_type* __pbeg, char_type* __pend, off_type __off); }; # 262 "/usr/include/c++/4.7/sstream" 3 template<typename _CharT, typename _Traits, typename _Alloc> class basic_istringstream : public basic_istream<_CharT, _Traits> { public: typedef _CharT char_type; typedef _Traits traits_type; typedef _Alloc allocator_type; typedef typename traits_type::int_type int_type; typedef typename traits_type::pos_type pos_type; typedef typename traits_type::off_type off_type; typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; typedef basic_istream<char_type, traits_type> __istream_type; private: __stringbuf_type _M_stringbuf; public: # 298 "/usr/include/c++/4.7/sstream" 3 explicit basic_istringstream(ios_base::openmode __mode = ios_base::in) : __istream_type(), _M_stringbuf(__mode | ios_base::in) { this->init(&_M_stringbuf); } # 316 "/usr/include/c++/4.7/sstream" 3 explicit basic_istringstream(const __string_type& __str, ios_base::openmode __mode = ios_base::in) : __istream_type(), _M_stringbuf(__str, __mode | ios_base::in) { this->init(&_M_stringbuf); } ~basic_istringstream() { } # 338 "/usr/include/c++/4.7/sstream" 3 __stringbuf_type* rdbuf() const { return const_cast<__stringbuf_type*>(&_M_stringbuf); } __string_type str() const { return _M_stringbuf.str(); } void str(const __string_type& __s) { _M_stringbuf.str(__s); } }; # 372 "/usr/include/c++/4.7/sstream" 3 template <typename _CharT, typename _Traits, typename _Alloc> class basic_ostringstream : public basic_ostream<_CharT, _Traits> { public: typedef _CharT char_type; typedef _Traits traits_type; typedef _Alloc allocator_type; typedef typename traits_type::int_type int_type; typedef typename traits_type::pos_type pos_type; typedef typename traits_type::off_type off_type; typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; typedef basic_ostream<char_type, traits_type> __ostream_type; private: __stringbuf_type _M_stringbuf; public: # 408 "/usr/include/c++/4.7/sstream" 3 explicit basic_ostringstream(ios_base::openmode __mode = ios_base::out) : __ostream_type(), _M_stringbuf(__mode | ios_base::out) { this->init(&_M_stringbuf); } # 426 "/usr/include/c++/4.7/sstream" 3 explicit basic_ostringstream(const __string_type& __str, ios_base::openmode __mode = ios_base::out) : __ostream_type(), _M_stringbuf(__str, __mode | ios_base::out) { this->init(&_M_stringbuf); } ~basic_ostringstream() { } # 448 "/usr/include/c++/4.7/sstream" 3 __stringbuf_type* rdbuf() const { return const_cast<__stringbuf_type*>(&_M_stringbuf); } __string_type str() const { return _M_stringbuf.str(); } void str(const __string_type& __s) { _M_stringbuf.str(__s); } }; # 482 "/usr/include/c++/4.7/sstream" 3 template <typename _CharT, typename _Traits, typename _Alloc> class basic_stringstream : public basic_iostream<_CharT, _Traits> { public: typedef _CharT char_type; typedef _Traits traits_type; typedef _Alloc allocator_type; typedef typename traits_type::int_type int_type; typedef typename traits_type::pos_type pos_type; typedef typename traits_type::off_type off_type; typedef basic_string<_CharT, _Traits, _Alloc> __string_type; typedef basic_stringbuf<_CharT, _Traits, _Alloc> __stringbuf_type; typedef basic_iostream<char_type, traits_type> __iostream_type; private: __stringbuf_type _M_stringbuf; public: # 517 "/usr/include/c++/4.7/sstream" 3 explicit basic_stringstream(ios_base::openmode __m = ios_base::out | ios_base::in) : __iostream_type(), _M_stringbuf(__m) { this->init(&_M_stringbuf); } # 533 "/usr/include/c++/4.7/sstream" 3 explicit basic_stringstream(const __string_type& __str, ios_base::openmode __m = ios_base::out | ios_base::in) : __iostream_type(), _M_stringbuf(__str, __m) { this->init(&_M_stringbuf); } ~basic_stringstream() { } # 555 "/usr/include/c++/4.7/sstream" 3 __stringbuf_type* rdbuf() const { return const_cast<__stringbuf_type*>(&_M_stringbuf); } __string_type str() const { return _M_stringbuf.str(); } void str(const __string_type& __s) { _M_stringbuf.str(__s); } }; } # 1 "/usr/include/c++/4.7/bits/sstream.tcc" 1 3 # 39 "/usr/include/c++/4.7/bits/sstream.tcc" 3 # 40 "/usr/include/c++/4.7/bits/sstream.tcc" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template <class _CharT, class _Traits, class _Alloc> typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type basic_stringbuf<_CharT, _Traits, _Alloc>:: pbackfail(int_type __c) { int_type __ret = traits_type::eof(); if (this->eback() < this->gptr()) { const bool __testeof = traits_type::eq_int_type(__c, __ret); if (!__testeof) { const bool __testeq = traits_type::eq(traits_type:: to_char_type(__c), this->gptr()[-1]); const bool __testout = this->_M_mode & ios_base::out; if (__testeq || __testout) { this->gbump(-1); if (!__testeq) *this->gptr() = traits_type::to_char_type(__c); __ret = __c; } } else { this->gbump(-1); __ret = traits_type::not_eof(__c); } } return __ret; } template <class _CharT, class _Traits, class _Alloc> typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type basic_stringbuf<_CharT, _Traits, _Alloc>:: overflow(int_type __c) { const bool __testout = this->_M_mode & ios_base::out; if (__builtin_expect(!__testout, false)) return traits_type::eof(); const bool __testeof = traits_type::eq_int_type(__c, traits_type::eof()); if (__builtin_expect(__testeof, false)) return traits_type::not_eof(__c); const __size_type __capacity = _M_string.capacity(); const __size_type __max_size = _M_string.max_size(); const bool __testput = this->pptr() < this->epptr(); if (__builtin_expect(!__testput && __capacity == __max_size, false)) return traits_type::eof(); const char_type __conv = traits_type::to_char_type(__c); if (!__testput) { # 112 "/usr/include/c++/4.7/bits/sstream.tcc" 3 const __size_type __opt_len = std::max(__size_type(2 * __capacity), __size_type(512)); const __size_type __len = std::min(__opt_len, __max_size); __string_type __tmp; __tmp.reserve(__len); if (this->pbase()) __tmp.assign(this->pbase(), this->epptr() - this->pbase()); __tmp.push_back(__conv); _M_string.swap(__tmp); _M_sync(const_cast<char_type*>(_M_string.data()), this->gptr() - this->eback(), this->pptr() - this->pbase()); } else *this->pptr() = __conv; this->pbump(1); return __c; } template <class _CharT, class _Traits, class _Alloc> typename basic_stringbuf<_CharT, _Traits, _Alloc>::int_type basic_stringbuf<_CharT, _Traits, _Alloc>:: underflow() { int_type __ret = traits_type::eof(); const bool __testin = this->_M_mode & ios_base::in; if (__testin) { _M_update_egptr(); if (this->gptr() < this->egptr()) __ret = traits_type::to_int_type(*this->gptr()); } return __ret; } template <class _CharT, class _Traits, class _Alloc> typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type basic_stringbuf<_CharT, _Traits, _Alloc>:: seekoff(off_type __off, ios_base::seekdir __way, ios_base::openmode __mode) { pos_type __ret = pos_type(off_type(-1)); bool __testin = (ios_base::in & this->_M_mode & __mode) != 0; bool __testout = (ios_base::out & this->_M_mode & __mode) != 0; const bool __testboth = __testin && __testout && __way != ios_base::cur; __testin &= !(__mode & ios_base::out); __testout &= !(__mode & ios_base::in); const char_type* __beg = __testin ? this->eback() : this->pbase(); if ((__beg || !__off) && (__testin || __testout || __testboth)) { _M_update_egptr(); off_type __newoffi = __off; off_type __newoffo = __newoffi; if (__way == ios_base::cur) { __newoffi += this->gptr() - __beg; __newoffo += this->pptr() - __beg; } else if (__way == ios_base::end) __newoffo = __newoffi += this->egptr() - __beg; if ((__testin || __testboth) && __newoffi >= 0 && this->egptr() - __beg >= __newoffi) { this->setg(this->eback(), this->eback() + __newoffi, this->egptr()); __ret = pos_type(__newoffi); } if ((__testout || __testboth) && __newoffo >= 0 && this->egptr() - __beg >= __newoffo) { _M_pbump(this->pbase(), this->epptr(), __newoffo); __ret = pos_type(__newoffo); } } return __ret; } template <class _CharT, class _Traits, class _Alloc> typename basic_stringbuf<_CharT, _Traits, _Alloc>::pos_type basic_stringbuf<_CharT, _Traits, _Alloc>:: seekpos(pos_type __sp, ios_base::openmode __mode) { pos_type __ret = pos_type(off_type(-1)); const bool __testin = (ios_base::in & this->_M_mode & __mode) != 0; const bool __testout = (ios_base::out & this->_M_mode & __mode) != 0; const char_type* __beg = __testin ? this->eback() : this->pbase(); if ((__beg || !off_type(__sp)) && (__testin || __testout)) { _M_update_egptr(); const off_type __pos(__sp); const bool __testpos = (0 <= __pos && __pos <= this->egptr() - __beg); if (__testpos) { if (__testin) this->setg(this->eback(), this->eback() + __pos, this->egptr()); if (__testout) _M_pbump(this->pbase(), this->epptr(), __pos); __ret = __sp; } } return __ret; } template <class _CharT, class _Traits, class _Alloc> void basic_stringbuf<_CharT, _Traits, _Alloc>:: _M_sync(char_type* __base, __size_type __i, __size_type __o) { const bool __testin = _M_mode & ios_base::in; const bool __testout = _M_mode & ios_base::out; char_type* __endg = __base + _M_string.size(); char_type* __endp = __base + _M_string.capacity(); if (__base != _M_string.data()) { __endg += __i; __i = 0; __endp = __endg; } if (__testin) this->setg(__base, __base + __i, __endg); if (__testout) { _M_pbump(__base, __endp, __o); if (!__testin) this->setg(__endg, __endg, __endg); } } template <class _CharT, class _Traits, class _Alloc> void basic_stringbuf<_CharT, _Traits, _Alloc>:: _M_pbump(char_type* __pbeg, char_type* __pend, off_type __off) { this->setp(__pbeg, __pend); while (__off > __gnu_cxx::__numeric_traits<int>::__max) { this->pbump(__gnu_cxx::__numeric_traits<int>::__max); __off -= __gnu_cxx::__numeric_traits<int>::__max; } this->pbump(__off); } extern template class basic_stringbuf<char>; extern template class basic_istringstream<char>; extern template class basic_ostringstream<char>; extern template class basic_stringstream<char>; extern template class basic_stringbuf<wchar_t>; extern template class basic_istringstream<wchar_t>; extern template class basic_ostringstream<wchar_t>; extern template class basic_stringstream<wchar_t>; } # 582 "/usr/include/c++/4.7/sstream" 2 3 # 48 "/usr/include/c++/4.7/complex" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 62 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> class complex; template<> class complex<float>; template<> class complex<double>; template<> class complex<long double>; template<typename _Tp> _Tp abs(const complex<_Tp>&); template<typename _Tp> _Tp arg(const complex<_Tp>&); template<typename _Tp> _Tp norm(const complex<_Tp>&); template<typename _Tp> complex<_Tp> conj(const complex<_Tp>&); template<typename _Tp> complex<_Tp> polar(const _Tp&, const _Tp& = 0); template<typename _Tp> complex<_Tp> cos(const complex<_Tp>&); template<typename _Tp> complex<_Tp> cosh(const complex<_Tp>&); template<typename _Tp> complex<_Tp> exp(const complex<_Tp>&); template<typename _Tp> complex<_Tp> log(const complex<_Tp>&); template<typename _Tp> complex<_Tp> log10(const complex<_Tp>&); template<typename _Tp> complex<_Tp> pow(const complex<_Tp>&, int); template<typename _Tp> complex<_Tp> pow(const complex<_Tp>&, const _Tp&); template<typename _Tp> complex<_Tp> pow(const complex<_Tp>&, const complex<_Tp>&); template<typename _Tp> complex<_Tp> pow(const _Tp&, const complex<_Tp>&); template<typename _Tp> complex<_Tp> sin(const complex<_Tp>&); template<typename _Tp> complex<_Tp> sinh(const complex<_Tp>&); template<typename _Tp> complex<_Tp> sqrt(const complex<_Tp>&); template<typename _Tp> complex<_Tp> tan(const complex<_Tp>&); template<typename _Tp> complex<_Tp> tanh(const complex<_Tp>&); # 123 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> struct complex { typedef _Tp value_type; complex(const _Tp& __r = _Tp(), const _Tp& __i = _Tp()) : _M_real(__r), _M_imag(__i) { } template<typename _Up> complex(const complex<_Up>& __z) : _M_real(__z.real()), _M_imag(__z.imag()) { } # 151 "/usr/include/c++/4.7/complex" 3 _Tp& real() { return _M_real; } const _Tp& real() const { return _M_real; } _Tp& imag() { return _M_imag; } const _Tp& imag() const { return _M_imag; } void real(_Tp __val) { _M_real = __val; } void imag(_Tp __val) { _M_imag = __val; } complex<_Tp>& operator=(const _Tp&); complex<_Tp>& operator+=(const _Tp& __t) { _M_real += __t; return *this; } complex<_Tp>& operator-=(const _Tp& __t) { _M_real -= __t; return *this; } complex<_Tp>& operator*=(const _Tp&); complex<_Tp>& operator/=(const _Tp&); template<typename _Up> complex<_Tp>& operator=(const complex<_Up>&); template<typename _Up> complex<_Tp>& operator+=(const complex<_Up>&); template<typename _Up> complex<_Tp>& operator-=(const complex<_Up>&); template<typename _Up> complex<_Tp>& operator*=(const complex<_Up>&); template<typename _Up> complex<_Tp>& operator/=(const complex<_Up>&); const complex __rep() const { return *this; } private: _Tp _M_real; _Tp _M_imag; }; template<typename _Tp> complex<_Tp>& complex<_Tp>::operator=(const _Tp& __t) { _M_real = __t; _M_imag = _Tp(); return *this; } template<typename _Tp> complex<_Tp>& complex<_Tp>::operator*=(const _Tp& __t) { _M_real *= __t; _M_imag *= __t; return *this; } template<typename _Tp> complex<_Tp>& complex<_Tp>::operator/=(const _Tp& __t) { _M_real /= __t; _M_imag /= __t; return *this; } template<typename _Tp> template<typename _Up> complex<_Tp>& complex<_Tp>::operator=(const complex<_Up>& __z) { _M_real = __z.real(); _M_imag = __z.imag(); return *this; } template<typename _Tp> template<typename _Up> complex<_Tp>& complex<_Tp>::operator+=(const complex<_Up>& __z) { _M_real += __z.real(); _M_imag += __z.imag(); return *this; } template<typename _Tp> template<typename _Up> complex<_Tp>& complex<_Tp>::operator-=(const complex<_Up>& __z) { _M_real -= __z.real(); _M_imag -= __z.imag(); return *this; } template<typename _Tp> template<typename _Up> complex<_Tp>& complex<_Tp>::operator*=(const complex<_Up>& __z) { const _Tp __r = _M_real * __z.real() - _M_imag * __z.imag(); _M_imag = _M_real * __z.imag() + _M_imag * __z.real(); _M_real = __r; return *this; } template<typename _Tp> template<typename _Up> complex<_Tp>& complex<_Tp>::operator/=(const complex<_Up>& __z) { const _Tp __r = _M_real * __z.real() + _M_imag * __z.imag(); const _Tp __n = std::norm(__z); _M_imag = (_M_imag * __z.real() - _M_real * __z.imag()) / __n; _M_real = __r / __n; return *this; } template<typename _Tp> inline complex<_Tp> operator+(const complex<_Tp>& __x, const complex<_Tp>& __y) { complex<_Tp> __r = __x; __r += __y; return __r; } template<typename _Tp> inline complex<_Tp> operator+(const complex<_Tp>& __x, const _Tp& __y) { complex<_Tp> __r = __x; __r += __y; return __r; } template<typename _Tp> inline complex<_Tp> operator+(const _Tp& __x, const complex<_Tp>& __y) { complex<_Tp> __r = __y; __r += __x; return __r; } template<typename _Tp> inline complex<_Tp> operator-(const complex<_Tp>& __x, const complex<_Tp>& __y) { complex<_Tp> __r = __x; __r -= __y; return __r; } template<typename _Tp> inline complex<_Tp> operator-(const complex<_Tp>& __x, const _Tp& __y) { complex<_Tp> __r = __x; __r -= __y; return __r; } template<typename _Tp> inline complex<_Tp> operator-(const _Tp& __x, const complex<_Tp>& __y) { complex<_Tp> __r(__x, -__y.imag()); __r -= __y.real(); return __r; } template<typename _Tp> inline complex<_Tp> operator*(const complex<_Tp>& __x, const complex<_Tp>& __y) { complex<_Tp> __r = __x; __r *= __y; return __r; } template<typename _Tp> inline complex<_Tp> operator*(const complex<_Tp>& __x, const _Tp& __y) { complex<_Tp> __r = __x; __r *= __y; return __r; } template<typename _Tp> inline complex<_Tp> operator*(const _Tp& __x, const complex<_Tp>& __y) { complex<_Tp> __r = __y; __r *= __x; return __r; } template<typename _Tp> inline complex<_Tp> operator/(const complex<_Tp>& __x, const complex<_Tp>& __y) { complex<_Tp> __r = __x; __r /= __y; return __r; } template<typename _Tp> inline complex<_Tp> operator/(const complex<_Tp>& __x, const _Tp& __y) { complex<_Tp> __r = __x; __r /= __y; return __r; } template<typename _Tp> inline complex<_Tp> operator/(const _Tp& __x, const complex<_Tp>& __y) { complex<_Tp> __r = __x; __r /= __y; return __r; } template<typename _Tp> inline complex<_Tp> operator+(const complex<_Tp>& __x) { return __x; } template<typename _Tp> inline complex<_Tp> operator-(const complex<_Tp>& __x) { return complex<_Tp>(-__x.real(), -__x.imag()); } template<typename _Tp> inline bool operator==(const complex<_Tp>& __x, const complex<_Tp>& __y) { return __x.real() == __y.real() && __x.imag() == __y.imag(); } template<typename _Tp> inline bool operator==(const complex<_Tp>& __x, const _Tp& __y) { return __x.real() == __y && __x.imag() == _Tp(); } template<typename _Tp> inline bool operator==(const _Tp& __x, const complex<_Tp>& __y) { return __x == __y.real() && _Tp() == __y.imag(); } template<typename _Tp> inline bool operator!=(const complex<_Tp>& __x, const complex<_Tp>& __y) { return __x.real() != __y.real() || __x.imag() != __y.imag(); } template<typename _Tp> inline bool operator!=(const complex<_Tp>& __x, const _Tp& __y) { return __x.real() != __y || __x.imag() != _Tp(); } template<typename _Tp> inline bool operator!=(const _Tp& __x, const complex<_Tp>& __y) { return __x != __y.real() || _Tp() != __y.imag(); } template<typename _Tp, typename _CharT, class _Traits> basic_istream<_CharT, _Traits>& operator>>(basic_istream<_CharT, _Traits>& __is, complex<_Tp>& __x) { _Tp __re_x, __im_x; _CharT __ch; __is >> __ch; if (__ch == '(') { __is >> __re_x >> __ch; if (__ch == ',') { __is >> __im_x >> __ch; if (__ch == ')') __x = complex<_Tp>(__re_x, __im_x); else __is.setstate(ios_base::failbit); } else if (__ch == ')') __x = __re_x; else __is.setstate(ios_base::failbit); } else { __is.putback(__ch); __is >> __re_x; __x = __re_x; } return __is; } template<typename _Tp, typename _CharT, class _Traits> basic_ostream<_CharT, _Traits>& operator<<(basic_ostream<_CharT, _Traits>& __os, const complex<_Tp>& __x) { basic_ostringstream<_CharT, _Traits> __s; __s.flags(__os.flags()); __s.imbue(__os.getloc()); __s.precision(__os.precision()); __s << '(' << __x.real() << ',' << __x.imag() << ')'; return __os << __s.str(); } # 543 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> inline _Tp& real(complex<_Tp>& __z) { return __z.real(); } template<typename _Tp> inline const _Tp& real(const complex<_Tp>& __z) { return __z.real(); } template<typename _Tp> inline _Tp& imag(complex<_Tp>& __z) { return __z.imag(); } template<typename _Tp> inline const _Tp& imag(const complex<_Tp>& __z) { return __z.imag(); } template<typename _Tp> inline _Tp __complex_abs(const complex<_Tp>& __z) { _Tp __x = __z.real(); _Tp __y = __z.imag(); const _Tp __s = std::max(abs(__x), abs(__y)); if (__s == _Tp()) return __s; __x /= __s; __y /= __s; return __s * sqrt(__x * __x + __y * __y); } inline float __complex_abs(__complex__ float __z) { return __builtin_cabsf(__z); } inline double __complex_abs(__complex__ double __z) { return __builtin_cabs(__z); } inline long double __complex_abs(const __complex__ long double& __z) { return __builtin_cabsl(__z); } template<typename _Tp> inline _Tp abs(const complex<_Tp>& __z) { return __complex_abs(__z.__rep()); } # 601 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> inline _Tp __complex_arg(const complex<_Tp>& __z) { return atan2(__z.imag(), __z.real()); } inline float __complex_arg(__complex__ float __z) { return __builtin_cargf(__z); } inline double __complex_arg(__complex__ double __z) { return __builtin_carg(__z); } inline long double __complex_arg(const __complex__ long double& __z) { return __builtin_cargl(__z); } template<typename _Tp> inline _Tp arg(const complex<_Tp>& __z) { return __complex_arg(__z.__rep()); } # 631 "/usr/include/c++/4.7/complex" 3 template<bool> struct _Norm_helper { template<typename _Tp> static inline _Tp _S_do_it(const complex<_Tp>& __z) { const _Tp __x = __z.real(); const _Tp __y = __z.imag(); return __x * __x + __y * __y; } }; template<> struct _Norm_helper<true> { template<typename _Tp> static inline _Tp _S_do_it(const complex<_Tp>& __z) { _Tp __res = std::abs(__z); return __res * __res; } }; template<typename _Tp> inline _Tp norm(const complex<_Tp>& __z) { return _Norm_helper<__is_floating<_Tp>::__value && !0>::_S_do_it(__z); } template<typename _Tp> inline complex<_Tp> polar(const _Tp& __rho, const _Tp& __theta) { return complex<_Tp>(__rho * cos(__theta), __rho * sin(__theta)); } template<typename _Tp> inline complex<_Tp> conj(const complex<_Tp>& __z) { return complex<_Tp>(__z.real(), -__z.imag()); } template<typename _Tp> inline complex<_Tp> __complex_cos(const complex<_Tp>& __z) { const _Tp __x = __z.real(); const _Tp __y = __z.imag(); return complex<_Tp>(cos(__x) * cosh(__y), -sin(__x) * sinh(__y)); } inline __complex__ float __complex_cos(__complex__ float __z) { return __builtin_ccosf(__z); } inline __complex__ double __complex_cos(__complex__ double __z) { return __builtin_ccos(__z); } inline __complex__ long double __complex_cos(const __complex__ long double& __z) { return __builtin_ccosl(__z); } template<typename _Tp> inline complex<_Tp> cos(const complex<_Tp>& __z) { return __complex_cos(__z.__rep()); } template<typename _Tp> inline complex<_Tp> __complex_cosh(const complex<_Tp>& __z) { const _Tp __x = __z.real(); const _Tp __y = __z.imag(); return complex<_Tp>(cosh(__x) * cos(__y), sinh(__x) * sin(__y)); } inline __complex__ float __complex_cosh(__complex__ float __z) { return __builtin_ccoshf(__z); } inline __complex__ double __complex_cosh(__complex__ double __z) { return __builtin_ccosh(__z); } inline __complex__ long double __complex_cosh(const __complex__ long double& __z) { return __builtin_ccoshl(__z); } template<typename _Tp> inline complex<_Tp> cosh(const complex<_Tp>& __z) { return __complex_cosh(__z.__rep()); } template<typename _Tp> inline complex<_Tp> __complex_exp(const complex<_Tp>& __z) { return std::polar(exp(__z.real()), __z.imag()); } inline __complex__ float __complex_exp(__complex__ float __z) { return __builtin_cexpf(__z); } inline __complex__ double __complex_exp(__complex__ double __z) { return __builtin_cexp(__z); } inline __complex__ long double __complex_exp(const __complex__ long double& __z) { return __builtin_cexpl(__z); } template<typename _Tp> inline complex<_Tp> exp(const complex<_Tp>& __z) { return __complex_exp(__z.__rep()); } # 762 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> inline complex<_Tp> __complex_log(const complex<_Tp>& __z) { return complex<_Tp>(log(std::abs(__z)), std::arg(__z)); } inline __complex__ float __complex_log(__complex__ float __z) { return __builtin_clogf(__z); } inline __complex__ double __complex_log(__complex__ double __z) { return __builtin_clog(__z); } inline __complex__ long double __complex_log(const __complex__ long double& __z) { return __builtin_clogl(__z); } template<typename _Tp> inline complex<_Tp> log(const complex<_Tp>& __z) { return __complex_log(__z.__rep()); } template<typename _Tp> inline complex<_Tp> log10(const complex<_Tp>& __z) { return std::log(__z) / log(_Tp(10.0)); } template<typename _Tp> inline complex<_Tp> __complex_sin(const complex<_Tp>& __z) { const _Tp __x = __z.real(); const _Tp __y = __z.imag(); return complex<_Tp>(sin(__x) * cosh(__y), cos(__x) * sinh(__y)); } inline __complex__ float __complex_sin(__complex__ float __z) { return __builtin_csinf(__z); } inline __complex__ double __complex_sin(__complex__ double __z) { return __builtin_csin(__z); } inline __complex__ long double __complex_sin(const __complex__ long double& __z) { return __builtin_csinl(__z); } template<typename _Tp> inline complex<_Tp> sin(const complex<_Tp>& __z) { return __complex_sin(__z.__rep()); } template<typename _Tp> inline complex<_Tp> __complex_sinh(const complex<_Tp>& __z) { const _Tp __x = __z.real(); const _Tp __y = __z.imag(); return complex<_Tp>(sinh(__x) * cos(__y), cosh(__x) * sin(__y)); } inline __complex__ float __complex_sinh(__complex__ float __z) { return __builtin_csinhf(__z); } inline __complex__ double __complex_sinh(__complex__ double __z) { return __builtin_csinh(__z); } inline __complex__ long double __complex_sinh(const __complex__ long double& __z) { return __builtin_csinhl(__z); } template<typename _Tp> inline complex<_Tp> sinh(const complex<_Tp>& __z) { return __complex_sinh(__z.__rep()); } # 854 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> complex<_Tp> __complex_sqrt(const complex<_Tp>& __z) { _Tp __x = __z.real(); _Tp __y = __z.imag(); if (__x == _Tp()) { _Tp __t = sqrt(abs(__y) / 2); return complex<_Tp>(__t, __y < _Tp() ? -__t : __t); } else { _Tp __t = sqrt(2 * (std::abs(__z) + abs(__x))); _Tp __u = __t / 2; return __x > _Tp() ? complex<_Tp>(__u, __y / __t) : complex<_Tp>(abs(__y) / __t, __y < _Tp() ? -__u : __u); } } inline __complex__ float __complex_sqrt(__complex__ float __z) { return __builtin_csqrtf(__z); } inline __complex__ double __complex_sqrt(__complex__ double __z) { return __builtin_csqrt(__z); } inline __complex__ long double __complex_sqrt(const __complex__ long double& __z) { return __builtin_csqrtl(__z); } template<typename _Tp> inline complex<_Tp> sqrt(const complex<_Tp>& __z) { return __complex_sqrt(__z.__rep()); } # 898 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> inline complex<_Tp> __complex_tan(const complex<_Tp>& __z) { return std::sin(__z) / std::cos(__z); } inline __complex__ float __complex_tan(__complex__ float __z) { return __builtin_ctanf(__z); } inline __complex__ double __complex_tan(__complex__ double __z) { return __builtin_ctan(__z); } inline __complex__ long double __complex_tan(const __complex__ long double& __z) { return __builtin_ctanl(__z); } template<typename _Tp> inline complex<_Tp> tan(const complex<_Tp>& __z) { return __complex_tan(__z.__rep()); } # 926 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> inline complex<_Tp> __complex_tanh(const complex<_Tp>& __z) { return std::sinh(__z) / std::cosh(__z); } inline __complex__ float __complex_tanh(__complex__ float __z) { return __builtin_ctanhf(__z); } inline __complex__ double __complex_tanh(__complex__ double __z) { return __builtin_ctanh(__z); } inline __complex__ long double __complex_tanh(const __complex__ long double& __z) { return __builtin_ctanhl(__z); } template<typename _Tp> inline complex<_Tp> tanh(const complex<_Tp>& __z) { return __complex_tanh(__z.__rep()); } # 956 "/usr/include/c++/4.7/complex" 3 template<typename _Tp> complex<_Tp> __complex_pow_unsigned(complex<_Tp> __x, unsigned __n) { complex<_Tp> __y = __n % 2 ? __x : complex<_Tp>(1); while (__n >>= 1) { __x *= __x; if (__n % 2) __y *= __x; } return __y; } template<typename _Tp> inline complex<_Tp> pow(const complex<_Tp>& __z, int __n) { return __n < 0 ? complex<_Tp>(1) / std::__complex_pow_unsigned(__z, -__n) : std::__complex_pow_unsigned(__z, __n); } template<typename _Tp> complex<_Tp> pow(const complex<_Tp>& __x, const _Tp& __y) { if (__x.imag() == _Tp() && __x.real() > _Tp()) return pow(__x.real(), __y); complex<_Tp> __t = std::log(__x); return std::polar(exp(__y * __t.real()), __y * __t.imag()); } template<typename _Tp> inline complex<_Tp> __complex_pow(const complex<_Tp>& __x, const complex<_Tp>& __y) { return __x == _Tp() ? _Tp() : std::exp(__y * std::log(__x)); } inline __complex__ float __complex_pow(__complex__ float __x, __complex__ float __y) { return __builtin_cpowf(__x, __y); } inline __complex__ double __complex_pow(__complex__ double __x, __complex__ double __y) { return __builtin_cpow(__x, __y); } inline __complex__ long double __complex_pow(const __complex__ long double& __x, const __complex__ long double& __y) { return __builtin_cpowl(__x, __y); } template<typename _Tp> inline complex<_Tp> pow(const complex<_Tp>& __x, const complex<_Tp>& __y) { return __complex_pow(__x.__rep(), __y.__rep()); } template<typename _Tp> inline complex<_Tp> pow(const _Tp& __x, const complex<_Tp>& __y) { return __x > _Tp() ? std::polar(pow(__x, __y.real()), __y.imag() * log(__x)) : std::pow(complex<_Tp>(__x), __y); } template<> struct complex<float> { typedef float value_type; typedef __complex__ float _ComplexT; complex(_ComplexT __z) : _M_value(__z) { } complex(float __r = 0.0f, float __i = 0.0f) { __real__ _M_value = __r; __imag__ _M_value = __i; } explicit complex(const complex<double>&); explicit complex(const complex<long double>&); # 1070 "/usr/include/c++/4.7/complex" 3 float& real() { return __real__ _M_value; } const float& real() const { return __real__ _M_value; } float& imag() { return __imag__ _M_value; } const float& imag() const { return __imag__ _M_value; } void real(float __val) { __real__ _M_value = __val; } void imag(float __val) { __imag__ _M_value = __val; } complex& operator=(float __f) { _M_value = __f; return *this; } complex& operator+=(float __f) { _M_value += __f; return *this; } complex& operator-=(float __f) { _M_value -= __f; return *this; } complex& operator*=(float __f) { _M_value *= __f; return *this; } complex& operator/=(float __f) { _M_value /= __f; return *this; } template<typename _Tp> complex& operator=(const complex<_Tp>& __z) { __real__ _M_value = __z.real(); __imag__ _M_value = __z.imag(); return *this; } template<typename _Tp> complex& operator+=(const complex<_Tp>& __z) { __real__ _M_value += __z.real(); __imag__ _M_value += __z.imag(); return *this; } template<class _Tp> complex& operator-=(const complex<_Tp>& __z) { __real__ _M_value -= __z.real(); __imag__ _M_value -= __z.imag(); return *this; } template<class _Tp> complex& operator*=(const complex<_Tp>& __z) { _ComplexT __t; __real__ __t = __z.real(); __imag__ __t = __z.imag(); _M_value *= __t; return *this; } template<class _Tp> complex& operator/=(const complex<_Tp>& __z) { _ComplexT __t; __real__ __t = __z.real(); __imag__ __t = __z.imag(); _M_value /= __t; return *this; } const _ComplexT __rep() const { return _M_value; } private: _ComplexT _M_value; }; template<> struct complex<double> { typedef double value_type; typedef __complex__ double _ComplexT; complex(_ComplexT __z) : _M_value(__z) { } complex(double __r = 0.0, double __i = 0.0) { __real__ _M_value = __r; __imag__ _M_value = __i; } complex(const complex<float>& __z) : _M_value(__z.__rep()) { } explicit complex(const complex<long double>&); # 1219 "/usr/include/c++/4.7/complex" 3 double& real() { return __real__ _M_value; } const double& real() const { return __real__ _M_value; } double& imag() { return __imag__ _M_value; } const double& imag() const { return __imag__ _M_value; } void real(double __val) { __real__ _M_value = __val; } void imag(double __val) { __imag__ _M_value = __val; } complex& operator=(double __d) { _M_value = __d; return *this; } complex& operator+=(double __d) { _M_value += __d; return *this; } complex& operator-=(double __d) { _M_value -= __d; return *this; } complex& operator*=(double __d) { _M_value *= __d; return *this; } complex& operator/=(double __d) { _M_value /= __d; return *this; } template<typename _Tp> complex& operator=(const complex<_Tp>& __z) { __real__ _M_value = __z.real(); __imag__ _M_value = __z.imag(); return *this; } template<typename _Tp> complex& operator+=(const complex<_Tp>& __z) { __real__ _M_value += __z.real(); __imag__ _M_value += __z.imag(); return *this; } template<typename _Tp> complex& operator-=(const complex<_Tp>& __z) { __real__ _M_value -= __z.real(); __imag__ _M_value -= __z.imag(); return *this; } template<typename _Tp> complex& operator*=(const complex<_Tp>& __z) { _ComplexT __t; __real__ __t = __z.real(); __imag__ __t = __z.imag(); _M_value *= __t; return *this; } template<typename _Tp> complex& operator/=(const complex<_Tp>& __z) { _ComplexT __t; __real__ __t = __z.real(); __imag__ __t = __z.imag(); _M_value /= __t; return *this; } const _ComplexT __rep() const { return _M_value; } private: _ComplexT _M_value; }; template<> struct complex<long double> { typedef long double value_type; typedef __complex__ long double _ComplexT; complex(_ComplexT __z) : _M_value(__z) { } complex(long double __r = 0.0L, long double __i = 0.0L) { __real__ _M_value = __r; __imag__ _M_value = __i; } complex(const complex<float>& __z) : _M_value(__z.__rep()) { } complex(const complex<double>& __z) : _M_value(__z.__rep()) { } # 1369 "/usr/include/c++/4.7/complex" 3 long double& real() { return __real__ _M_value; } const long double& real() const { return __real__ _M_value; } long double& imag() { return __imag__ _M_value; } const long double& imag() const { return __imag__ _M_value; } void real(long double __val) { __real__ _M_value = __val; } void imag(long double __val) { __imag__ _M_value = __val; } complex& operator=(long double __r) { _M_value = __r; return *this; } complex& operator+=(long double __r) { _M_value += __r; return *this; } complex& operator-=(long double __r) { _M_value -= __r; return *this; } complex& operator*=(long double __r) { _M_value *= __r; return *this; } complex& operator/=(long double __r) { _M_value /= __r; return *this; } template<typename _Tp> complex& operator=(const complex<_Tp>& __z) { __real__ _M_value = __z.real(); __imag__ _M_value = __z.imag(); return *this; } template<typename _Tp> complex& operator+=(const complex<_Tp>& __z) { __real__ _M_value += __z.real(); __imag__ _M_value += __z.imag(); return *this; } template<typename _Tp> complex& operator-=(const complex<_Tp>& __z) { __real__ _M_value -= __z.real(); __imag__ _M_value -= __z.imag(); return *this; } template<typename _Tp> complex& operator*=(const complex<_Tp>& __z) { _ComplexT __t; __real__ __t = __z.real(); __imag__ __t = __z.imag(); _M_value *= __t; return *this; } template<typename _Tp> complex& operator/=(const complex<_Tp>& __z) { _ComplexT __t; __real__ __t = __z.real(); __imag__ __t = __z.imag(); _M_value /= __t; return *this; } const _ComplexT __rep() const { return _M_value; } private: _ComplexT _M_value; }; inline complex<float>::complex(const complex<double>& __z) : _M_value(__z.__rep()) { } inline complex<float>::complex(const complex<long double>& __z) : _M_value(__z.__rep()) { } inline complex<double>::complex(const complex<long double>& __z) : _M_value(__z.__rep()) { } extern template istream& operator>>(istream&, complex<float>&); extern template ostream& operator<<(ostream&, const complex<float>&); extern template istream& operator>>(istream&, complex<double>&); extern template ostream& operator<<(ostream&, const complex<double>&); extern template istream& operator>>(istream&, complex<long double>&); extern template ostream& operator<<(ostream&, const complex<long double>&); extern template wistream& operator>>(wistream&, complex<float>&); extern template wostream& operator<<(wostream&, const complex<float>&); extern template wistream& operator>>(wistream&, complex<double>&); extern template wostream& operator<<(wostream&, const complex<double>&); extern template wistream& operator>>(wistream&, complex<long double>&); extern template wostream& operator<<(wostream&, const complex<long double>&); } namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { template<typename _Tp, typename _Up> struct __promote_2<std::complex<_Tp>, _Up> { public: typedef std::complex<typename __promote_2<_Tp, _Up>::__type> __type; }; template<typename _Tp, typename _Up> struct __promote_2<_Tp, std::complex<_Up> > { public: typedef std::complex<typename __promote_2<_Tp, _Up>::__type> __type; }; template<typename _Tp, typename _Up> struct __promote_2<std::complex<_Tp>, std::complex<_Up> > { public: typedef std::complex<typename __promote_2<_Tp, _Up>::__type> __type; }; } # 97 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/MKL_support.h" 1 # 116 "eigen-3.3.7/Eigen/src/Core/util/MKL_support.h" namespace Eigen { typedef std::complex<double> dcomplex; typedef std::complex<float> scomplex; typedef int BlasIndex; } # 101 "eigen-3.3.7/Eigen/Core" 2 # 275 "eigen-3.3.7/Eigen/Core" # 1 "/usr/include/c++/4.7/cerrno" 1 3 # 41 "/usr/include/c++/4.7/cerrno" 3 # 42 "/usr/include/c++/4.7/cerrno" 3 # 1 "/usr/include/errno.h" 1 3 4 # 32 "/usr/include/errno.h" 3 4 extern "C" { # 1 "/usr/include/i386-linux-gnu/bits/errno.h" 1 3 4 # 25 "/usr/include/i386-linux-gnu/bits/errno.h" 3 4 # 1 "/usr/include/linux/errno.h" 1 3 4 # 1 "/usr/include/i386-linux-gnu/asm/errno.h" 1 3 4 # 1 "/usr/include/asm-generic/errno.h" 1 3 4 # 1 "/usr/include/asm-generic/errno-base.h" 1 3 4 # 5 "/usr/include/asm-generic/errno.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/asm/errno.h" 2 3 4 # 5 "/usr/include/linux/errno.h" 2 3 4 # 26 "/usr/include/i386-linux-gnu/bits/errno.h" 2 3 4 # 47 "/usr/include/i386-linux-gnu/bits/errno.h" 3 4 extern int *__errno_location (void) throw () __attribute__ ((__const__)); # 37 "/usr/include/errno.h" 2 3 4 # 55 "/usr/include/errno.h" 3 4 extern char *program_invocation_name, *program_invocation_short_name; } # 69 "/usr/include/errno.h" 3 4 typedef int error_t; # 44 "/usr/include/c++/4.7/cerrno" 2 3 # 276 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/cstddef" 1 3 # 41 "/usr/include/c++/4.7/cstddef" 3 # 42 "/usr/include/c++/4.7/cstddef" 3 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 150 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 3 4 typedef int ptrdiff_t; # 44 "/usr/include/c++/4.7/cstddef" 2 3 # 278 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/cstdlib" 1 3 # 41 "/usr/include/c++/4.7/cstdlib" 3 # 42 "/usr/include/c++/4.7/cstdlib" 3 # 66 "/usr/include/c++/4.7/cstdlib" 3 # 1 "/usr/include/stdlib.h" 1 3 4 # 33 "/usr/include/stdlib.h" 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 34 "/usr/include/stdlib.h" 2 3 4 extern "C" { # 1 "/usr/include/i386-linux-gnu/bits/waitflags.h" 1 3 4 # 43 "/usr/include/stdlib.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/waitstatus.h" 1 3 4 # 67 "/usr/include/i386-linux-gnu/bits/waitstatus.h" 3 4 union wait { int w_status; struct { unsigned int __w_termsig:7; unsigned int __w_coredump:1; unsigned int __w_retcode:8; unsigned int:16; } __wait_terminated; struct { unsigned int __w_stopval:8; unsigned int __w_stopsig:8; unsigned int:16; } __wait_stopped; }; # 44 "/usr/include/stdlib.h" 2 3 4 # 96 "/usr/include/stdlib.h" 3 4 typedef struct { int quot; int rem; } div_t; typedef struct { long int quot; long int rem; } ldiv_t; __extension__ typedef struct { long long int quot; long long int rem; } lldiv_t; # 140 "/usr/include/stdlib.h" 3 4 extern size_t __ctype_get_mb_cur_max (void) throw () ; extern double atof (__const char *__nptr) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; extern int atoi (__const char *__nptr) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; extern long int atol (__const char *__nptr) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; __extension__ extern long long int atoll (__const char *__nptr) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; extern double strtod (__const char *__restrict __nptr, char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ; extern float strtof (__const char *__restrict __nptr, char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ; extern long double strtold (__const char *__restrict __nptr, char **__restrict __endptr) throw () __attribute__ ((__nonnull__ (1))) ; extern long int strtol (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw () __attribute__ ((__nonnull__ (1))) ; extern unsigned long int strtoul (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw () __attribute__ ((__nonnull__ (1))) ; __extension__ extern long long int strtoq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw () __attribute__ ((__nonnull__ (1))) ; __extension__ extern unsigned long long int strtouq (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw () __attribute__ ((__nonnull__ (1))) ; __extension__ extern long long int strtoll (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw () __attribute__ ((__nonnull__ (1))) ; __extension__ extern unsigned long long int strtoull (__const char *__restrict __nptr, char **__restrict __endptr, int __base) throw () __attribute__ ((__nonnull__ (1))) ; # 240 "/usr/include/stdlib.h" 3 4 extern long int strtol_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ; extern unsigned long int strtoul_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ; __extension__ extern long long int strtoll_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ; __extension__ extern unsigned long long int strtoull_l (__const char *__restrict __nptr, char **__restrict __endptr, int __base, __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 4))) ; extern double strtod_l (__const char *__restrict __nptr, char **__restrict __endptr, __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 3))) ; extern float strtof_l (__const char *__restrict __nptr, char **__restrict __endptr, __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 3))) ; extern long double strtold_l (__const char *__restrict __nptr, char **__restrict __endptr, __locale_t __loc) throw () __attribute__ ((__nonnull__ (1, 3))) ; # 311 "/usr/include/stdlib.h" 3 4 extern char *l64a (long int __n) throw () ; extern long int a64l (__const char *__s) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))) ; # 1 "/usr/include/i386-linux-gnu/sys/types.h" 1 3 4 # 28 "/usr/include/i386-linux-gnu/sys/types.h" 3 4 extern "C" { typedef __u_char u_char; typedef __u_short u_short; typedef __u_int u_int; typedef __u_long u_long; typedef __quad_t quad_t; typedef __u_quad_t u_quad_t; typedef __fsid_t fsid_t; typedef __loff_t loff_t; typedef __ino_t ino_t; typedef __ino64_t ino64_t; typedef __dev_t dev_t; typedef __gid_t gid_t; typedef __mode_t mode_t; typedef __nlink_t nlink_t; typedef __uid_t uid_t; typedef __off_t off_t; typedef __off64_t off64_t; # 105 "/usr/include/i386-linux-gnu/sys/types.h" 3 4 typedef __id_t id_t; typedef __ssize_t ssize_t; typedef __daddr_t daddr_t; typedef __caddr_t caddr_t; typedef __key_t key_t; # 137 "/usr/include/i386-linux-gnu/sys/types.h" 3 4 typedef __useconds_t useconds_t; typedef __suseconds_t suseconds_t; # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 148 "/usr/include/i386-linux-gnu/sys/types.h" 2 3 4 typedef unsigned long int ulong; typedef unsigned short int ushort; typedef unsigned int uint; # 195 "/usr/include/i386-linux-gnu/sys/types.h" 3 4 typedef int int8_t __attribute__ ((__mode__ (__QI__))); typedef int int16_t __attribute__ ((__mode__ (__HI__))); typedef int int32_t __attribute__ ((__mode__ (__SI__))); typedef int int64_t __attribute__ ((__mode__ (__DI__))); typedef unsigned int u_int8_t __attribute__ ((__mode__ (__QI__))); typedef unsigned int u_int16_t __attribute__ ((__mode__ (__HI__))); typedef unsigned int u_int32_t __attribute__ ((__mode__ (__SI__))); typedef unsigned int u_int64_t __attribute__ ((__mode__ (__DI__))); typedef int register_t __attribute__ ((__mode__ (__word__))); # 220 "/usr/include/i386-linux-gnu/sys/types.h" 3 4 # 1 "/usr/include/i386-linux-gnu/sys/select.h" 1 3 4 # 31 "/usr/include/i386-linux-gnu/sys/select.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/select.h" 1 3 4 # 32 "/usr/include/i386-linux-gnu/sys/select.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/sigset.h" 1 3 4 # 24 "/usr/include/i386-linux-gnu/bits/sigset.h" 3 4 typedef int __sig_atomic_t; typedef struct { unsigned long int __val[(1024 / (8 * sizeof (unsigned long int)))]; } __sigset_t; # 35 "/usr/include/i386-linux-gnu/sys/select.h" 2 3 4 typedef __sigset_t sigset_t; # 1 "/usr/include/i386-linux-gnu/bits/time.h" 1 3 4 # 47 "/usr/include/i386-linux-gnu/sys/select.h" 2 3 4 # 55 "/usr/include/i386-linux-gnu/sys/select.h" 3 4 typedef long int __fd_mask; # 65 "/usr/include/i386-linux-gnu/sys/select.h" 3 4 typedef struct { __fd_mask fds_bits[1024 / (8 * (int) sizeof (__fd_mask))]; } fd_set; typedef __fd_mask fd_mask; # 97 "/usr/include/i386-linux-gnu/sys/select.h" 3 4 extern "C" { # 107 "/usr/include/i386-linux-gnu/sys/select.h" 3 4 extern int select (int __nfds, fd_set *__restrict __readfds, fd_set *__restrict __writefds, fd_set *__restrict __exceptfds, struct timeval *__restrict __timeout); # 119 "/usr/include/i386-linux-gnu/sys/select.h" 3 4 extern int pselect (int __nfds, fd_set *__restrict __readfds, fd_set *__restrict __writefds, fd_set *__restrict __exceptfds, const struct timespec *__restrict __timeout, const __sigset_t *__restrict __sigmask); # 132 "/usr/include/i386-linux-gnu/sys/select.h" 3 4 } # 221 "/usr/include/i386-linux-gnu/sys/types.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/sys/sysmacros.h" 1 3 4 # 30 "/usr/include/i386-linux-gnu/sys/sysmacros.h" 3 4 extern "C" { __extension__ extern unsigned int gnu_dev_major (unsigned long long int __dev) throw () __attribute__ ((__const__)); __extension__ extern unsigned int gnu_dev_minor (unsigned long long int __dev) throw () __attribute__ ((__const__)); __extension__ extern unsigned long long int gnu_dev_makedev (unsigned int __major, unsigned int __minor) throw () __attribute__ ((__const__)); # 64 "/usr/include/i386-linux-gnu/sys/sysmacros.h" 3 4 } # 224 "/usr/include/i386-linux-gnu/sys/types.h" 2 3 4 typedef __blksize_t blksize_t; typedef __blkcnt_t blkcnt_t; typedef __fsblkcnt_t fsblkcnt_t; typedef __fsfilcnt_t fsfilcnt_t; # 263 "/usr/include/i386-linux-gnu/sys/types.h" 3 4 typedef __blkcnt64_t blkcnt64_t; typedef __fsblkcnt64_t fsblkcnt64_t; typedef __fsfilcnt64_t fsfilcnt64_t; # 274 "/usr/include/i386-linux-gnu/sys/types.h" 3 4 } # 321 "/usr/include/stdlib.h" 2 3 4 extern long int random (void) throw (); extern void srandom (unsigned int __seed) throw (); extern char *initstate (unsigned int __seed, char *__statebuf, size_t __statelen) throw () __attribute__ ((__nonnull__ (2))); extern char *setstate (char *__statebuf) throw () __attribute__ ((__nonnull__ (1))); struct random_data { int32_t *fptr; int32_t *rptr; int32_t *state; int rand_type; int rand_deg; int rand_sep; int32_t *end_ptr; }; extern int random_r (struct random_data *__restrict __buf, int32_t *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); extern int srandom_r (unsigned int __seed, struct random_data *__buf) throw () __attribute__ ((__nonnull__ (2))); extern int initstate_r (unsigned int __seed, char *__restrict __statebuf, size_t __statelen, struct random_data *__restrict __buf) throw () __attribute__ ((__nonnull__ (2, 4))); extern int setstate_r (char *__restrict __statebuf, struct random_data *__restrict __buf) throw () __attribute__ ((__nonnull__ (1, 2))); extern int rand (void) throw (); extern void srand (unsigned int __seed) throw (); extern int rand_r (unsigned int *__seed) throw (); extern double drand48 (void) throw (); extern double erand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1))); extern long int lrand48 (void) throw (); extern long int nrand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1))); extern long int mrand48 (void) throw (); extern long int jrand48 (unsigned short int __xsubi[3]) throw () __attribute__ ((__nonnull__ (1))); extern void srand48 (long int __seedval) throw (); extern unsigned short int *seed48 (unsigned short int __seed16v[3]) throw () __attribute__ ((__nonnull__ (1))); extern void lcong48 (unsigned short int __param[7]) throw () __attribute__ ((__nonnull__ (1))); struct drand48_data { unsigned short int __x[3]; unsigned short int __old_x[3]; unsigned short int __c; unsigned short int __init; unsigned long long int __a; }; extern int drand48_r (struct drand48_data *__restrict __buffer, double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); extern int erand48_r (unsigned short int __xsubi[3], struct drand48_data *__restrict __buffer, double *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); extern int lrand48_r (struct drand48_data *__restrict __buffer, long int *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); extern int nrand48_r (unsigned short int __xsubi[3], struct drand48_data *__restrict __buffer, long int *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); extern int mrand48_r (struct drand48_data *__restrict __buffer, long int *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); extern int jrand48_r (unsigned short int __xsubi[3], struct drand48_data *__restrict __buffer, long int *__restrict __result) throw () __attribute__ ((__nonnull__ (1, 2))); extern int srand48_r (long int __seedval, struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (2))); extern int seed48_r (unsigned short int __seed16v[3], struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (1, 2))); extern int lcong48_r (unsigned short int __param[7], struct drand48_data *__buffer) throw () __attribute__ ((__nonnull__ (1, 2))); extern void *malloc (size_t __size) throw () __attribute__ ((__malloc__)) ; extern void *calloc (size_t __nmemb, size_t __size) throw () __attribute__ ((__malloc__)) ; extern void *realloc (void *__ptr, size_t __size) throw () __attribute__ ((__warn_unused_result__)); extern void free (void *__ptr) throw (); extern void cfree (void *__ptr) throw (); # 1 "/usr/include/alloca.h" 1 3 4 # 25 "/usr/include/alloca.h" 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 26 "/usr/include/alloca.h" 2 3 4 extern "C" { extern void *alloca (size_t __size) throw (); } # 498 "/usr/include/stdlib.h" 2 3 4 extern void *valloc (size_t __size) throw () __attribute__ ((__malloc__)) ; extern int posix_memalign (void **__memptr, size_t __alignment, size_t __size) throw () __attribute__ ((__nonnull__ (1))) ; extern void abort (void) throw () __attribute__ ((__noreturn__)); extern int atexit (void (*__func) (void)) throw () __attribute__ ((__nonnull__ (1))); extern "C++" int at_quick_exit (void (*__func) (void)) throw () __asm ("at_quick_exit") __attribute__ ((__nonnull__ (1))); extern int on_exit (void (*__func) (int __status, void *__arg), void *__arg) throw () __attribute__ ((__nonnull__ (1))); extern void exit (int __status) throw () __attribute__ ((__noreturn__)); extern void quick_exit (int __status) throw () __attribute__ ((__noreturn__)); extern void _Exit (int __status) throw () __attribute__ ((__noreturn__)); extern char *getenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))) ; extern char *__secure_getenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))) ; extern int putenv (char *__string) throw () __attribute__ ((__nonnull__ (1))); extern int setenv (__const char *__name, __const char *__value, int __replace) throw () __attribute__ ((__nonnull__ (2))); extern int unsetenv (__const char *__name) throw () __attribute__ ((__nonnull__ (1))); extern int clearenv (void) throw (); # 606 "/usr/include/stdlib.h" 3 4 extern char *mktemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ; # 620 "/usr/include/stdlib.h" 3 4 extern int mkstemp (char *__template) __attribute__ ((__nonnull__ (1))) ; # 630 "/usr/include/stdlib.h" 3 4 extern int mkstemp64 (char *__template) __attribute__ ((__nonnull__ (1))) ; # 642 "/usr/include/stdlib.h" 3 4 extern int mkstemps (char *__template, int __suffixlen) __attribute__ ((__nonnull__ (1))) ; # 652 "/usr/include/stdlib.h" 3 4 extern int mkstemps64 (char *__template, int __suffixlen) __attribute__ ((__nonnull__ (1))) ; # 663 "/usr/include/stdlib.h" 3 4 extern char *mkdtemp (char *__template) throw () __attribute__ ((__nonnull__ (1))) ; # 674 "/usr/include/stdlib.h" 3 4 extern int mkostemp (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ; # 684 "/usr/include/stdlib.h" 3 4 extern int mkostemp64 (char *__template, int __flags) __attribute__ ((__nonnull__ (1))) ; # 694 "/usr/include/stdlib.h" 3 4 extern int mkostemps (char *__template, int __suffixlen, int __flags) __attribute__ ((__nonnull__ (1))) ; # 706 "/usr/include/stdlib.h" 3 4 extern int mkostemps64 (char *__template, int __suffixlen, int __flags) __attribute__ ((__nonnull__ (1))) ; extern int system (__const char *__command) ; extern char *canonicalize_file_name (__const char *__name) throw () __attribute__ ((__nonnull__ (1))) ; # 734 "/usr/include/stdlib.h" 3 4 extern char *realpath (__const char *__restrict __name, char *__restrict __resolved) throw () ; typedef int (*__compar_fn_t) (__const void *, __const void *); typedef __compar_fn_t comparison_fn_t; typedef int (*__compar_d_fn_t) (__const void *, __const void *, void *); extern void *bsearch (__const void *__key, __const void *__base, size_t __nmemb, size_t __size, __compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 2, 5))) ; extern void qsort (void *__base, size_t __nmemb, size_t __size, __compar_fn_t __compar) __attribute__ ((__nonnull__ (1, 4))); extern void qsort_r (void *__base, size_t __nmemb, size_t __size, __compar_d_fn_t __compar, void *__arg) __attribute__ ((__nonnull__ (1, 4))); extern int abs (int __x) throw () __attribute__ ((__const__)) ; extern long int labs (long int __x) throw () __attribute__ ((__const__)) ; __extension__ extern long long int llabs (long long int __x) throw () __attribute__ ((__const__)) ; extern div_t div (int __numer, int __denom) throw () __attribute__ ((__const__)) ; extern ldiv_t ldiv (long int __numer, long int __denom) throw () __attribute__ ((__const__)) ; __extension__ extern lldiv_t lldiv (long long int __numer, long long int __denom) throw () __attribute__ ((__const__)) ; # 808 "/usr/include/stdlib.h" 3 4 extern char *ecvt (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ; extern char *fcvt (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ; extern char *gcvt (double __value, int __ndigit, char *__buf) throw () __attribute__ ((__nonnull__ (3))) ; extern char *qecvt (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ; extern char *qfcvt (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign) throw () __attribute__ ((__nonnull__ (3, 4))) ; extern char *qgcvt (long double __value, int __ndigit, char *__buf) throw () __attribute__ ((__nonnull__ (3))) ; extern int ecvt_r (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5))); extern int fcvt_r (double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5))); extern int qecvt_r (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5))); extern int qfcvt_r (long double __value, int __ndigit, int *__restrict __decpt, int *__restrict __sign, char *__restrict __buf, size_t __len) throw () __attribute__ ((__nonnull__ (3, 4, 5))); extern int mblen (__const char *__s, size_t __n) throw () ; extern int mbtowc (wchar_t *__restrict __pwc, __const char *__restrict __s, size_t __n) throw () ; extern int wctomb (char *__s, wchar_t __wchar) throw () ; extern size_t mbstowcs (wchar_t *__restrict __pwcs, __const char *__restrict __s, size_t __n) throw (); extern size_t wcstombs (char *__restrict __s, __const wchar_t *__restrict __pwcs, size_t __n) throw (); extern int rpmatch (__const char *__response) throw () __attribute__ ((__nonnull__ (1))) ; # 896 "/usr/include/stdlib.h" 3 4 extern int getsubopt (char **__restrict __optionp, char *__const *__restrict __tokens, char **__restrict __valuep) throw () __attribute__ ((__nonnull__ (1, 2, 3))) ; extern void setkey (__const char *__key) throw () __attribute__ ((__nonnull__ (1))); extern int posix_openpt (int __oflag) ; extern int grantpt (int __fd) throw (); extern int unlockpt (int __fd) throw (); extern char *ptsname (int __fd) throw () ; extern int ptsname_r (int __fd, char *__buf, size_t __buflen) throw () __attribute__ ((__nonnull__ (2))); extern int getpt (void); extern int getloadavg (double __loadavg[], int __nelem) throw () __attribute__ ((__nonnull__ (1))); # 964 "/usr/include/stdlib.h" 3 4 } # 67 "/usr/include/c++/4.7/cstdlib" 2 3 # 98 "/usr/include/c++/4.7/cstdlib" 3 namespace std __attribute__ ((__visibility__ ("default"))) { using ::div_t; using ::ldiv_t; using ::abort; using ::abs; using ::atexit; using ::atof; using ::atoi; using ::atol; using ::bsearch; using ::calloc; using ::div; using ::exit; using ::free; using ::getenv; using ::labs; using ::ldiv; using ::malloc; using ::mblen; using ::mbstowcs; using ::mbtowc; using ::qsort; using ::rand; using ::realloc; using ::srand; using ::strtod; using ::strtol; using ::strtoul; using ::system; using ::wcstombs; using ::wctomb; inline long abs(long __i) { return labs(__i); } inline ldiv_t div(long __i, long __j) { return ldiv(__i, __j); } } # 160 "/usr/include/c++/4.7/cstdlib" 3 namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { using ::lldiv_t; using ::_Exit; inline long long abs(long long __x) { return __x >= 0 ? __x : -__x; } using ::llabs; inline lldiv_t div(long long __n, long long __d) { lldiv_t __q; __q.quot = __n / __d; __q.rem = __n % __d; return __q; } using ::lldiv; # 195 "/usr/include/c++/4.7/cstdlib" 3 using ::atoll; using ::strtoll; using ::strtoull; using ::strtof; using ::strtold; } namespace std { using ::__gnu_cxx::lldiv_t; using ::__gnu_cxx::_Exit; using ::__gnu_cxx::abs; using ::__gnu_cxx::llabs; using ::__gnu_cxx::div; using ::__gnu_cxx::lldiv; using ::__gnu_cxx::atoll; using ::__gnu_cxx::strtof; using ::__gnu_cxx::strtoll; using ::__gnu_cxx::strtoull; using ::__gnu_cxx::strtold; } # 279 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/cmath" 1 3 # 41 "/usr/include/c++/4.7/cmath" 3 # 42 "/usr/include/c++/4.7/cmath" 3 # 280 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/cassert" 1 3 # 43 "/usr/include/c++/4.7/cassert" 3 # 44 "/usr/include/c++/4.7/cassert" 3 # 1 "/usr/include/assert.h" 1 3 4 # 68 "/usr/include/assert.h" 3 4 extern "C" { extern void __assert_fail (__const char *__assertion, __const char *__file, unsigned int __line, __const char *__function) throw () __attribute__ ((__noreturn__)); extern void __assert_perror_fail (int __errnum, __const char *__file, unsigned int __line, __const char *__function) throw () __attribute__ ((__noreturn__)); extern void __assert (const char *__assertion, const char *__file, int __line) throw () __attribute__ ((__noreturn__)); } # 45 "/usr/include/c++/4.7/cassert" 2 3 # 281 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/functional" 1 3 # 47 "/usr/include/c++/4.7/functional" 3 # 48 "/usr/include/c++/4.7/functional" 3 # 282 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/cstring" 1 3 # 41 "/usr/include/c++/4.7/cstring" 3 # 42 "/usr/include/c++/4.7/cstring" 3 # 1 "/usr/include/string.h" 1 3 4 # 29 "/usr/include/string.h" 3 4 extern "C" { # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include/stddef.h" 1 3 4 # 35 "/usr/include/string.h" 2 3 4 extern void *memcpy (void *__restrict __dest, __const void *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern void *memmove (void *__dest, __const void *__src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern void *memccpy (void *__restrict __dest, __const void *__restrict __src, int __c, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern void *memset (void *__s, int __c, size_t __n) throw () __attribute__ ((__nonnull__ (1))); extern int memcmp (__const void *__s1, __const void *__s2, size_t __n) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern "C++" { extern void *memchr (void *__s, int __c, size_t __n) throw () __asm ("memchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern __const void *memchr (__const void *__s, int __c, size_t __n) throw () __asm ("memchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); # 93 "/usr/include/string.h" 3 4 } extern "C++" void *rawmemchr (void *__s, int __c) throw () __asm ("rawmemchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern "C++" __const void *rawmemchr (__const void *__s, int __c) throw () __asm ("rawmemchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern "C++" void *memrchr (void *__s, int __c, size_t __n) throw () __asm ("memrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern "C++" __const void *memrchr (__const void *__s, int __c, size_t __n) throw () __asm ("memrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern char *strcpy (char *__restrict __dest, __const char *__restrict __src) throw () __attribute__ ((__nonnull__ (1, 2))); extern char *strncpy (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern char *strcat (char *__restrict __dest, __const char *__restrict __src) throw () __attribute__ ((__nonnull__ (1, 2))); extern char *strncat (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern int strcmp (__const char *__s1, __const char *__s2) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern int strncmp (__const char *__s1, __const char *__s2, size_t __n) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern int strcoll (__const char *__s1, __const char *__s2) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern size_t strxfrm (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (2))); # 165 "/usr/include/string.h" 3 4 extern int strcoll_l (__const char *__s1, __const char *__s2, __locale_t __l) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3))); extern size_t strxfrm_l (char *__dest, __const char *__src, size_t __n, __locale_t __l) throw () __attribute__ ((__nonnull__ (2, 4))); extern char *strdup (__const char *__s) throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1))); extern char *strndup (__const char *__string, size_t __n) throw () __attribute__ ((__malloc__)) __attribute__ ((__nonnull__ (1))); # 210 "/usr/include/string.h" 3 4 extern "C++" { extern char *strchr (char *__s, int __c) throw () __asm ("strchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern __const char *strchr (__const char *__s, int __c) throw () __asm ("strchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); # 233 "/usr/include/string.h" 3 4 } extern "C++" { extern char *strrchr (char *__s, int __c) throw () __asm ("strrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern __const char *strrchr (__const char *__s, int __c) throw () __asm ("strrchr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); # 260 "/usr/include/string.h" 3 4 } extern "C++" char *strchrnul (char *__s, int __c) throw () __asm ("strchrnul") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern "C++" __const char *strchrnul (__const char *__s, int __c) throw () __asm ("strchrnul") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern size_t strcspn (__const char *__s, __const char *__reject) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern size_t strspn (__const char *__s, __const char *__accept) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern "C++" { extern char *strpbrk (char *__s, __const char *__accept) throw () __asm ("strpbrk") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern __const char *strpbrk (__const char *__s, __const char *__accept) throw () __asm ("strpbrk") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); # 312 "/usr/include/string.h" 3 4 } extern "C++" { extern char *strstr (char *__haystack, __const char *__needle) throw () __asm ("strstr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern __const char *strstr (__const char *__haystack, __const char *__needle) throw () __asm ("strstr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); # 340 "/usr/include/string.h" 3 4 } extern char *strtok (char *__restrict __s, __const char *__restrict __delim) throw () __attribute__ ((__nonnull__ (2))); extern char *__strtok_r (char *__restrict __s, __const char *__restrict __delim, char **__restrict __save_ptr) throw () __attribute__ ((__nonnull__ (2, 3))); extern char *strtok_r (char *__restrict __s, __const char *__restrict __delim, char **__restrict __save_ptr) throw () __attribute__ ((__nonnull__ (2, 3))); extern "C++" char *strcasestr (char *__haystack, __const char *__needle) throw () __asm ("strcasestr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern "C++" __const char *strcasestr (__const char *__haystack, __const char *__needle) throw () __asm ("strcasestr") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); # 382 "/usr/include/string.h" 3 4 extern void *memmem (__const void *__haystack, size_t __haystacklen, __const void *__needle, size_t __needlelen) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 3))); extern void *__mempcpy (void *__restrict __dest, __const void *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern void *mempcpy (void *__restrict __dest, __const void *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern size_t strlen (__const char *__s) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern size_t strnlen (__const char *__string, size_t __maxlen) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern char *strerror (int __errnum) throw (); # 438 "/usr/include/string.h" 3 4 extern char *strerror_r (int __errnum, char *__buf, size_t __buflen) throw () __attribute__ ((__nonnull__ (2))); extern char *strerror_l (int __errnum, __locale_t __l) throw (); extern void __bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1))); extern void bcopy (__const void *__src, void *__dest, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern void bzero (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1))); extern int bcmp (__const void *__s1, __const void *__s2, size_t __n) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern "C++" { extern char *index (char *__s, int __c) throw () __asm ("index") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern __const char *index (__const char *__s, int __c) throw () __asm ("index") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); # 487 "/usr/include/string.h" 3 4 } extern "C++" { extern char *rindex (char *__s, int __c) throw () __asm ("rindex") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); extern __const char *rindex (__const char *__s, int __c) throw () __asm ("rindex") __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1))); # 515 "/usr/include/string.h" 3 4 } extern int ffs (int __i) throw () __attribute__ ((__const__)); extern int ffsl (long int __l) throw () __attribute__ ((__const__)); __extension__ extern int ffsll (long long int __ll) throw () __attribute__ ((__const__)); extern int strcasecmp (__const char *__s1, __const char *__s2) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern int strncasecmp (__const char *__s1, __const char *__s2, size_t __n) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern int strcasecmp_l (__const char *__s1, __const char *__s2, __locale_t __loc) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 3))); extern int strncasecmp_l (__const char *__s1, __const char *__s2, size_t __n, __locale_t __loc) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2, 4))); extern char *strsep (char **__restrict __stringp, __const char *__restrict __delim) throw () __attribute__ ((__nonnull__ (1, 2))); extern char *strsignal (int __sig) throw (); extern char *__stpcpy (char *__restrict __dest, __const char *__restrict __src) throw () __attribute__ ((__nonnull__ (1, 2))); extern char *stpcpy (char *__restrict __dest, __const char *__restrict __src) throw () __attribute__ ((__nonnull__ (1, 2))); extern char *__stpncpy (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern char *stpncpy (char *__restrict __dest, __const char *__restrict __src, size_t __n) throw () __attribute__ ((__nonnull__ (1, 2))); extern int strverscmp (__const char *__s1, __const char *__s2) throw () __attribute__ ((__pure__)) __attribute__ ((__nonnull__ (1, 2))); extern char *strfry (char *__string) throw () __attribute__ ((__nonnull__ (1))); extern void *memfrob (void *__s, size_t __n) throw () __attribute__ ((__nonnull__ (1))); extern "C++" char *basename (char *__filename) throw () __asm ("basename") __attribute__ ((__nonnull__ (1))); extern "C++" __const char *basename (__const char *__filename) throw () __asm ("basename") __attribute__ ((__nonnull__ (1))); # 646 "/usr/include/string.h" 3 4 } # 45 "/usr/include/c++/4.7/cstring" 2 3 # 73 "/usr/include/c++/4.7/cstring" 3 namespace std __attribute__ ((__visibility__ ("default"))) { using ::memchr; using ::memcmp; using ::memcpy; using ::memmove; using ::memset; using ::strcat; using ::strcmp; using ::strcoll; using ::strcpy; using ::strcspn; using ::strerror; using ::strlen; using ::strncat; using ::strncmp; using ::strncpy; using ::strspn; using ::strtok; using ::strxfrm; using ::strchr; using ::strpbrk; using ::strrchr; using ::strstr; # 122 "/usr/include/c++/4.7/cstring" 3 } # 284 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/limits" 1 3 # 41 "/usr/include/c++/4.7/limits" 3 # 42 "/usr/include/c++/4.7/limits" 3 # 148 "/usr/include/c++/4.7/limits" 3 namespace std __attribute__ ((__visibility__ ("default"))) { enum float_round_style { round_indeterminate = -1, round_toward_zero = 0, round_to_nearest = 1, round_toward_infinity = 2, round_toward_neg_infinity = 3 }; enum float_denorm_style { denorm_indeterminate = -1, denorm_absent = 0, denorm_present = 1 }; # 192 "/usr/include/c++/4.7/limits" 3 struct __numeric_limits_base { static const bool is_specialized = false; static const int digits = 0; static const int digits10 = 0; # 213 "/usr/include/c++/4.7/limits" 3 static const bool is_signed = false; static const bool is_integer = false; static const bool is_exact = false; static const int radix = 0; static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static const bool is_iec559 = false; static const bool is_bounded = false; static const bool is_modulo = false; static const bool traps = false; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; # 303 "/usr/include/c++/4.7/limits" 3 template<typename _Tp> struct numeric_limits : public __numeric_limits_base { static _Tp min() throw() { return static_cast<_Tp>(0); } static _Tp max() throw() { return static_cast<_Tp>(0); } # 324 "/usr/include/c++/4.7/limits" 3 static _Tp epsilon() throw() { return static_cast<_Tp>(0); } static _Tp round_error() throw() { return static_cast<_Tp>(0); } static _Tp infinity() throw() { return static_cast<_Tp>(0); } static _Tp quiet_NaN() throw() { return static_cast<_Tp>(0); } static _Tp signaling_NaN() throw() { return static_cast<_Tp>(0); } static _Tp denorm_min() throw() { return static_cast<_Tp>(0); } }; # 370 "/usr/include/c++/4.7/limits" 3 template<> struct numeric_limits<bool> { static const bool is_specialized = true; static bool min() throw() { return false; } static bool max() throw() { return true; } static const int digits = 1; static const int digits10 = 0; static const bool is_signed = false; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static bool epsilon() throw() { return false; } static bool round_error() throw() { return false; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static bool infinity() throw() { return false; } static bool quiet_NaN() throw() { return false; } static bool signaling_NaN() throw() { return false; } static bool denorm_min() throw() { return false; } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = false; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<char> { static const bool is_specialized = true; static char min() throw() { return (((char)(-1) < 0) ? -(((char)(-1) < 0) ? (((((char)1 << ((sizeof(char) * 8 - ((char)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char)0) - 1 : (char)0); } static char max() throw() { return (((char)(-1) < 0) ? (((((char)1 << ((sizeof(char) * 8 - ((char)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(char)0); } static const int digits = (sizeof(char) * 8 - ((char)(-1) < 0)); static const int digits10 = ((sizeof(char) * 8 - ((char)(-1) < 0)) * 643L / 2136); static const bool is_signed = ((char)(-1) < 0); static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static char epsilon() throw() { return 0; } static char round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static char infinity() throw() { return char(); } static char quiet_NaN() throw() { return char(); } static char signaling_NaN() throw() { return char(); } static char denorm_min() throw() { return static_cast<char>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<signed char> { static const bool is_specialized = true; static signed char min() throw() { return -127 - 1; } static signed char max() throw() { return 127; } static const int digits = (sizeof(signed char) * 8 - ((signed char)(-1) < 0)); static const int digits10 = ((sizeof(signed char) * 8 - ((signed char)(-1) < 0)) * 643L / 2136); static const bool is_signed = true; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static signed char epsilon() throw() { return 0; } static signed char round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static signed char infinity() throw() { return static_cast<signed char>(0); } static signed char quiet_NaN() throw() { return static_cast<signed char>(0); } static signed char signaling_NaN() throw() { return static_cast<signed char>(0); } static signed char denorm_min() throw() { return static_cast<signed char>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<unsigned char> { static const bool is_specialized = true; static unsigned char min() throw() { return 0; } static unsigned char max() throw() { return 127 * 2U + 1; } static const int digits = (sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0)); static const int digits10 = ((sizeof(unsigned char) * 8 - ((unsigned char)(-1) < 0)) * 643L / 2136); static const bool is_signed = false; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static unsigned char epsilon() throw() { return 0; } static unsigned char round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static unsigned char infinity() throw() { return static_cast<unsigned char>(0); } static unsigned char quiet_NaN() throw() { return static_cast<unsigned char>(0); } static unsigned char signaling_NaN() throw() { return static_cast<unsigned char>(0); } static unsigned char denorm_min() throw() { return static_cast<unsigned char>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<wchar_t> { static const bool is_specialized = true; static wchar_t min() throw() { return (((wchar_t)(-1) < 0) ? -(((wchar_t)(-1) < 0) ? (((((wchar_t)1 << ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(wchar_t)0) - 1 : (wchar_t)0); } static wchar_t max() throw() { return (((wchar_t)(-1) < 0) ? (((((wchar_t)1 << ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) - 1)) - 1) << 1) + 1) : ~(wchar_t)0); } static const int digits = (sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)); static const int digits10 = ((sizeof(wchar_t) * 8 - ((wchar_t)(-1) < 0)) * 643L / 2136); static const bool is_signed = ((wchar_t)(-1) < 0); static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static wchar_t epsilon() throw() { return 0; } static wchar_t round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static wchar_t infinity() throw() { return wchar_t(); } static wchar_t quiet_NaN() throw() { return wchar_t(); } static wchar_t signaling_NaN() throw() { return wchar_t(); } static wchar_t denorm_min() throw() { return wchar_t(); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; # 841 "/usr/include/c++/4.7/limits" 3 template<> struct numeric_limits<short> { static const bool is_specialized = true; static short min() throw() { return -32767 - 1; } static short max() throw() { return 32767; } static const int digits = (sizeof(short) * 8 - ((short)(-1) < 0)); static const int digits10 = ((sizeof(short) * 8 - ((short)(-1) < 0)) * 643L / 2136); static const bool is_signed = true; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static short epsilon() throw() { return 0; } static short round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static short infinity() throw() { return short(); } static short quiet_NaN() throw() { return short(); } static short signaling_NaN() throw() { return short(); } static short denorm_min() throw() { return short(); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<unsigned short> { static const bool is_specialized = true; static unsigned short min() throw() { return 0; } static unsigned short max() throw() { return 32767 * 2U + 1; } static const int digits = (sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0)); static const int digits10 = ((sizeof(unsigned short) * 8 - ((unsigned short)(-1) < 0)) * 643L / 2136); static const bool is_signed = false; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static unsigned short epsilon() throw() { return 0; } static unsigned short round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static unsigned short infinity() throw() { return static_cast<unsigned short>(0); } static unsigned short quiet_NaN() throw() { return static_cast<unsigned short>(0); } static unsigned short signaling_NaN() throw() { return static_cast<unsigned short>(0); } static unsigned short denorm_min() throw() { return static_cast<unsigned short>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<int> { static const bool is_specialized = true; static int min() throw() { return -2147483647 - 1; } static int max() throw() { return 2147483647; } static const int digits = (sizeof(int) * 8 - ((int)(-1) < 0)); static const int digits10 = ((sizeof(int) * 8 - ((int)(-1) < 0)) * 643L / 2136); static const bool is_signed = true; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static int epsilon() throw() { return 0; } static int round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static int infinity() throw() { return static_cast<int>(0); } static int quiet_NaN() throw() { return static_cast<int>(0); } static int signaling_NaN() throw() { return static_cast<int>(0); } static int denorm_min() throw() { return static_cast<int>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<unsigned int> { static const bool is_specialized = true; static unsigned int min() throw() { return 0; } static unsigned int max() throw() { return 2147483647 * 2U + 1; } static const int digits = (sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0)); static const int digits10 = ((sizeof(unsigned int) * 8 - ((unsigned int)(-1) < 0)) * 643L / 2136); static const bool is_signed = false; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static unsigned int epsilon() throw() { return 0; } static unsigned int round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static unsigned int infinity() throw() { return static_cast<unsigned int>(0); } static unsigned int quiet_NaN() throw() { return static_cast<unsigned int>(0); } static unsigned int signaling_NaN() throw() { return static_cast<unsigned int>(0); } static unsigned int denorm_min() throw() { return static_cast<unsigned int>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<long> { static const bool is_specialized = true; static long min() throw() { return -2147483647L - 1; } static long max() throw() { return 2147483647L; } static const int digits = (sizeof(long) * 8 - ((long)(-1) < 0)); static const int digits10 = ((sizeof(long) * 8 - ((long)(-1) < 0)) * 643L / 2136); static const bool is_signed = true; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static long epsilon() throw() { return 0; } static long round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static long infinity() throw() { return static_cast<long>(0); } static long quiet_NaN() throw() { return static_cast<long>(0); } static long signaling_NaN() throw() { return static_cast<long>(0); } static long denorm_min() throw() { return static_cast<long>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<unsigned long> { static const bool is_specialized = true; static unsigned long min() throw() { return 0; } static unsigned long max() throw() { return 2147483647L * 2UL + 1; } static const int digits = (sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0)); static const int digits10 = ((sizeof(unsigned long) * 8 - ((unsigned long)(-1) < 0)) * 643L / 2136); static const bool is_signed = false; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static unsigned long epsilon() throw() { return 0; } static unsigned long round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static unsigned long infinity() throw() { return static_cast<unsigned long>(0); } static unsigned long quiet_NaN() throw() { return static_cast<unsigned long>(0); } static unsigned long signaling_NaN() throw() { return static_cast<unsigned long>(0); } static unsigned long denorm_min() throw() { return static_cast<unsigned long>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<long long> { static const bool is_specialized = true; static long long min() throw() { return -9223372036854775807LL - 1; } static long long max() throw() { return 9223372036854775807LL; } static const int digits = (sizeof(long long) * 8 - ((long long)(-1) < 0)); static const int digits10 = ((sizeof(long long) * 8 - ((long long)(-1) < 0)) * 643L / 2136); static const bool is_signed = true; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static long long epsilon() throw() { return 0; } static long long round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static long long infinity() throw() { return static_cast<long long>(0); } static long long quiet_NaN() throw() { return static_cast<long long>(0); } static long long signaling_NaN() throw() { return static_cast<long long>(0); } static long long denorm_min() throw() { return static_cast<long long>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; template<> struct numeric_limits<unsigned long long> { static const bool is_specialized = true; static unsigned long long min() throw() { return 0; } static unsigned long long max() throw() { return 9223372036854775807LL * 2ULL + 1; } static const int digits = (sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0)); static const int digits10 = ((sizeof(unsigned long long) * 8 - ((unsigned long long)(-1) < 0)) * 643L / 2136); static const bool is_signed = false; static const bool is_integer = true; static const bool is_exact = true; static const int radix = 2; static unsigned long long epsilon() throw() { return 0; } static unsigned long long round_error() throw() { return 0; } static const int min_exponent = 0; static const int min_exponent10 = 0; static const int max_exponent = 0; static const int max_exponent10 = 0; static const bool has_infinity = false; static const bool has_quiet_NaN = false; static const bool has_signaling_NaN = false; static const float_denorm_style has_denorm = denorm_absent; static const bool has_denorm_loss = false; static unsigned long long infinity() throw() { return static_cast<unsigned long long>(0); } static unsigned long long quiet_NaN() throw() { return static_cast<unsigned long long>(0); } static unsigned long long signaling_NaN() throw() { return static_cast<unsigned long long>(0); } static unsigned long long denorm_min() throw() { return static_cast<unsigned long long>(0); } static const bool is_iec559 = false; static const bool is_bounded = true; static const bool is_modulo = true; static const bool traps = true; static const bool tinyness_before = false; static const float_round_style round_style = round_toward_zero; }; # 1552 "/usr/include/c++/4.7/limits" 3 template<> struct numeric_limits<float> { static const bool is_specialized = true; static float min() throw() { return 1.17549435082228750797e-38F; } static float max() throw() { return 3.40282346638528859812e+38F; } static const int digits = 24; static const int digits10 = 6; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; static const int radix = 2; static float epsilon() throw() { return 1.19209289550781250000e-7F; } static float round_error() throw() { return 0.5F; } static const int min_exponent = (-125); static const int min_exponent10 = (-37); static const int max_exponent = 128; static const int max_exponent10 = 38; static const bool has_infinity = 1; static const bool has_quiet_NaN = 1; static const bool has_signaling_NaN = has_quiet_NaN; static const float_denorm_style has_denorm = bool(1) ? denorm_present : denorm_absent; static const bool has_denorm_loss = false; static float infinity() throw() { return __builtin_huge_valf(); } static float quiet_NaN() throw() { return __builtin_nanf(""); } static float signaling_NaN() throw() { return __builtin_nansf(""); } static float denorm_min() throw() { return 1.40129846432481707092e-45F; } static const bool is_iec559 = has_infinity && has_quiet_NaN && has_denorm == denorm_present; static const bool is_bounded = true; static const bool is_modulo = false; static const bool traps = false; static const bool tinyness_before = false; static const float_round_style round_style = round_to_nearest; }; template<> struct numeric_limits<double> { static const bool is_specialized = true; static double min() throw() { return double(2.22507385850720138309e-308L); } static double max() throw() { return double(1.79769313486231570815e+308L); } static const int digits = 53; static const int digits10 = 15; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; static const int radix = 2; static double epsilon() throw() { return double(2.22044604925031308085e-16L); } static double round_error() throw() { return 0.5; } static const int min_exponent = (-1021); static const int min_exponent10 = (-307); static const int max_exponent = 1024; static const int max_exponent10 = 308; static const bool has_infinity = 1; static const bool has_quiet_NaN = 1; static const bool has_signaling_NaN = has_quiet_NaN; static const float_denorm_style has_denorm = bool(1) ? denorm_present : denorm_absent; static const bool has_denorm_loss = false; static double infinity() throw() { return __builtin_huge_val(); } static double quiet_NaN() throw() { return __builtin_nan(""); } static double signaling_NaN() throw() { return __builtin_nans(""); } static double denorm_min() throw() { return double(4.94065645841246544177e-324L); } static const bool is_iec559 = has_infinity && has_quiet_NaN && has_denorm == denorm_present; static const bool is_bounded = true; static const bool is_modulo = false; static const bool traps = false; static const bool tinyness_before = false; static const float_round_style round_style = round_to_nearest; }; template<> struct numeric_limits<long double> { static const bool is_specialized = true; static long double min() throw() { return 3.36210314311209350626e-4932L; } static long double max() throw() { return 1.18973149535723176502e+4932L; } static const int digits = 64; static const int digits10 = 18; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; static const int radix = 2; static long double epsilon() throw() { return 1.08420217248550443401e-19L; } static long double round_error() throw() { return 0.5L; } static const int min_exponent = (-16381); static const int min_exponent10 = (-4931); static const int max_exponent = 16384; static const int max_exponent10 = 4932; static const bool has_infinity = 1; static const bool has_quiet_NaN = 1; static const bool has_signaling_NaN = has_quiet_NaN; static const float_denorm_style has_denorm = bool(1) ? denorm_present : denorm_absent; static const bool has_denorm_loss = false; static long double infinity() throw() { return __builtin_huge_vall(); } static long double quiet_NaN() throw() { return __builtin_nanl(""); } static long double signaling_NaN() throw() { return __builtin_nansl(""); } static long double denorm_min() throw() { return 3.64519953188247460253e-4951L; } static const bool is_iec559 = has_infinity && has_quiet_NaN && has_denorm == denorm_present; static const bool is_bounded = true; static const bool is_modulo = false; static const bool traps = false; static const bool tinyness_before = false; static const float_round_style round_style = round_to_nearest; }; } # 286 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/climits" 1 3 # 41 "/usr/include/c++/4.7/climits" 3 # 42 "/usr/include/c++/4.7/climits" 3 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/limits.h" 1 3 4 # 34 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/limits.h" 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/syslimits.h" 1 3 4 # 1 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/limits.h" 1 3 4 # 169 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/limits.h" 3 4 # 1 "/usr/include/limits.h" 1 3 4 # 145 "/usr/include/limits.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/posix1_lim.h" 1 3 4 # 157 "/usr/include/i386-linux-gnu/bits/posix1_lim.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/local_lim.h" 1 3 4 # 39 "/usr/include/i386-linux-gnu/bits/local_lim.h" 3 4 # 1 "/usr/include/linux/limits.h" 1 3 4 # 40 "/usr/include/i386-linux-gnu/bits/local_lim.h" 2 3 4 # 158 "/usr/include/i386-linux-gnu/bits/posix1_lim.h" 2 3 4 # 146 "/usr/include/limits.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/posix2_lim.h" 1 3 4 # 150 "/usr/include/limits.h" 2 3 4 # 1 "/usr/include/i386-linux-gnu/bits/xopen_lim.h" 1 3 4 # 34 "/usr/include/i386-linux-gnu/bits/xopen_lim.h" 3 4 # 1 "/usr/include/i386-linux-gnu/bits/stdio_lim.h" 1 3 4 # 35 "/usr/include/i386-linux-gnu/bits/xopen_lim.h" 2 3 4 # 154 "/usr/include/limits.h" 2 3 4 # 170 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/limits.h" 2 3 4 # 8 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/syslimits.h" 2 3 4 # 35 "/usr/lib/gcc/i686-linux-gnu/4.7/include-fixed/limits.h" 2 3 4 # 44 "/usr/include/c++/4.7/climits" 2 3 # 287 "eigen-3.3.7/Eigen/Core" 2 # 1 "/usr/include/c++/4.7/algorithm" 1 3 # 59 "/usr/include/c++/4.7/algorithm" 3 # 60 "/usr/include/c++/4.7/algorithm" 3 # 1 "/usr/include/c++/4.7/utility" 1 3 # 60 "/usr/include/c++/4.7/utility" 3 # 61 "/usr/include/c++/4.7/utility" 3 # 71 "/usr/include/c++/4.7/utility" 3 # 1 "/usr/include/c++/4.7/bits/stl_relops.h" 1 3 # 68 "/usr/include/c++/4.7/bits/stl_relops.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { namespace rel_ops { # 86 "/usr/include/c++/4.7/bits/stl_relops.h" 3 template <class _Tp> inline bool operator!=(const _Tp& __x, const _Tp& __y) { return !(__x == __y); } # 99 "/usr/include/c++/4.7/bits/stl_relops.h" 3 template <class _Tp> inline bool operator>(const _Tp& __x, const _Tp& __y) { return __y < __x; } # 112 "/usr/include/c++/4.7/bits/stl_relops.h" 3 template <class _Tp> inline bool operator<=(const _Tp& __x, const _Tp& __y) { return !(__y < __x); } # 125 "/usr/include/c++/4.7/bits/stl_relops.h" 3 template <class _Tp> inline bool operator>=(const _Tp& __x, const _Tp& __y) { return !(__x < __y); } } } # 72 "/usr/include/c++/4.7/utility" 2 3 # 62 "/usr/include/c++/4.7/algorithm" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_algo.h" 1 3 # 61 "/usr/include/c++/4.7/bits/stl_algo.h" 3 # 1 "/usr/include/c++/4.7/cstdlib" 1 3 # 41 "/usr/include/c++/4.7/cstdlib" 3 # 42 "/usr/include/c++/4.7/cstdlib" 3 # 62 "/usr/include/c++/4.7/bits/stl_algo.h" 2 3 # 1 "/usr/include/c++/4.7/bits/algorithmfwd.h" 1 3 # 33 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 # 34 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 # 42 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 203 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _FIter, typename _Tp> bool binary_search(_FIter, _FIter, const _Tp&); template<typename _FIter, typename _Tp, typename _Compare> bool binary_search(_FIter, _FIter, const _Tp&, _Compare); template<typename _IIter, typename _OIter> _OIter copy(_IIter, _IIter, _OIter); template<typename _BIter1, typename _BIter2> _BIter2 copy_backward(_BIter1, _BIter1, _BIter2); # 232 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _FIter, typename _Tp> pair<_FIter, _FIter> equal_range(_FIter, _FIter, const _Tp&); template<typename _FIter, typename _Tp, typename _Compare> pair<_FIter, _FIter> equal_range(_FIter, _FIter, const _Tp&, _Compare); template<typename _FIter, typename _Tp> void fill(_FIter, _FIter, const _Tp&); template<typename _OIter, typename _Size, typename _Tp> _OIter fill_n(_OIter, _Size, const _Tp&); template<typename _FIter1, typename _FIter2> _FIter1 find_end(_FIter1, _FIter1, _FIter2, _FIter2); template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> _FIter1 find_end(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); # 271 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _IIter1, typename _IIter2> bool includes(_IIter1, _IIter1, _IIter2, _IIter2); template<typename _IIter1, typename _IIter2, typename _Compare> bool includes(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); template<typename _BIter> void inplace_merge(_BIter, _BIter, _BIter); template<typename _BIter, typename _Compare> void inplace_merge(_BIter, _BIter, _BIter, _Compare); # 334 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _FIter1, typename _FIter2> void iter_swap(_FIter1, _FIter2); template<typename _FIter, typename _Tp> _FIter lower_bound(_FIter, _FIter, const _Tp&); template<typename _FIter, typename _Tp, typename _Compare> _FIter lower_bound(_FIter, _FIter, const _Tp&, _Compare); template<typename _RAIter> void make_heap(_RAIter, _RAIter); template<typename _RAIter, typename _Compare> void make_heap(_RAIter, _RAIter, _Compare); template<typename _Tp> const _Tp& max(const _Tp&, const _Tp&); template<typename _Tp, typename _Compare> const _Tp& max(const _Tp&, const _Tp&, _Compare); template<typename _Tp> const _Tp& min(const _Tp&, const _Tp&); template<typename _Tp, typename _Compare> const _Tp& min(const _Tp&, const _Tp&, _Compare); # 419 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _BIter> bool next_permutation(_BIter, _BIter); template<typename _BIter, typename _Compare> bool next_permutation(_BIter, _BIter, _Compare); # 436 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _IIter, typename _RAIter> _RAIter partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter); template<typename _IIter, typename _RAIter, typename _Compare> _RAIter partial_sort_copy(_IIter, _IIter, _RAIter, _RAIter, _Compare); # 457 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _RAIter> void pop_heap(_RAIter, _RAIter); template<typename _RAIter, typename _Compare> void pop_heap(_RAIter, _RAIter, _Compare); template<typename _BIter> bool prev_permutation(_BIter, _BIter); template<typename _BIter, typename _Compare> bool prev_permutation(_BIter, _BIter, _Compare); template<typename _RAIter> void push_heap(_RAIter, _RAIter); template<typename _RAIter, typename _Compare> void push_heap(_RAIter, _RAIter, _Compare); template<typename _FIter, typename _Tp> _FIter remove(_FIter, _FIter, const _Tp&); template<typename _FIter, typename _Predicate> _FIter remove_if(_FIter, _FIter, _Predicate); template<typename _IIter, typename _OIter, typename _Tp> _OIter remove_copy(_IIter, _IIter, _OIter, const _Tp&); template<typename _IIter, typename _OIter, typename _Predicate> _OIter remove_copy_if(_IIter, _IIter, _OIter, _Predicate); template<typename _IIter, typename _OIter, typename _Tp> _OIter replace_copy(_IIter, _IIter, _OIter, const _Tp&, const _Tp&); template<typename _Iter, typename _OIter, typename _Predicate, typename _Tp> _OIter replace_copy_if(_Iter, _Iter, _OIter, _Predicate, const _Tp&); template<typename _BIter> void reverse(_BIter, _BIter); template<typename _BIter, typename _OIter> _OIter reverse_copy(_BIter, _BIter, _OIter); template<typename _FIter> void rotate(_FIter, _FIter, _FIter); template<typename _FIter, typename _OIter> _OIter rotate_copy(_FIter, _FIter, _FIter, _OIter); # 540 "/usr/include/c++/4.7/bits/algorithmfwd.h" 3 template<typename _RAIter> void sort_heap(_RAIter, _RAIter); template<typename _RAIter, typename _Compare> void sort_heap(_RAIter, _RAIter, _Compare); template<typename _BIter, typename _Predicate> _BIter stable_partition(_BIter, _BIter, _Predicate); template<typename _Tp> void swap(_Tp&, _Tp&) ; template<typename _Tp, size_t _Nm> void swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) ; template<typename _FIter1, typename _FIter2> _FIter2 swap_ranges(_FIter1, _FIter1, _FIter2); template<typename _FIter> _FIter unique(_FIter, _FIter); template<typename _FIter, typename _BinaryPredicate> _FIter unique(_FIter, _FIter, _BinaryPredicate); template<typename _FIter, typename _Tp> _FIter upper_bound(_FIter, _FIter, const _Tp&); template<typename _FIter, typename _Tp, typename _Compare> _FIter upper_bound(_FIter, _FIter, const _Tp&, _Compare); template<typename _FIter> _FIter adjacent_find(_FIter, _FIter); template<typename _FIter, typename _BinaryPredicate> _FIter adjacent_find(_FIter, _FIter, _BinaryPredicate); template<typename _IIter, typename _Tp> typename iterator_traits<_IIter>::difference_type count(_IIter, _IIter, const _Tp&); template<typename _IIter, typename _Predicate> typename iterator_traits<_IIter>::difference_type count_if(_IIter, _IIter, _Predicate); template<typename _IIter1, typename _IIter2> bool equal(_IIter1, _IIter1, _IIter2); template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> bool equal(_IIter1, _IIter1, _IIter2, _BinaryPredicate); template<typename _IIter, typename _Tp> _IIter find(_IIter, _IIter, const _Tp&); template<typename _FIter1, typename _FIter2> _FIter1 find_first_of(_FIter1, _FIter1, _FIter2, _FIter2); template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> _FIter1 find_first_of(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); template<typename _IIter, typename _Predicate> _IIter find_if(_IIter, _IIter, _Predicate); template<typename _IIter, typename _Funct> _Funct for_each(_IIter, _IIter, _Funct); template<typename _FIter, typename _Generator> void generate(_FIter, _FIter, _Generator); template<typename _OIter, typename _Size, typename _Generator> _OIter generate_n(_OIter, _Size, _Generator); template<typename _IIter1, typename _IIter2> bool lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2); template<typename _IIter1, typename _IIter2, typename _Compare> bool lexicographical_compare(_IIter1, _IIter1, _IIter2, _IIter2, _Compare); template<typename _FIter> _FIter max_element(_FIter, _FIter); template<typename _FIter, typename _Compare> _FIter max_element(_FIter, _FIter, _Compare); template<typename _IIter1, typename _IIter2, typename _OIter> _OIter merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); template<typename _IIter1, typename _IIter2, typename _OIter, typename _Compare> _OIter merge(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); template<typename _FIter> _FIter min_element(_FIter, _FIter); template<typename _FIter, typename _Compare> _FIter min_element(_FIter, _FIter, _Compare); template<typename _IIter1, typename _IIter2> pair<_IIter1, _IIter2> mismatch(_IIter1, _IIter1, _IIter2); template<typename _IIter1, typename _IIter2, typename _BinaryPredicate> pair<_IIter1, _IIter2> mismatch(_IIter1, _IIter1, _IIter2, _BinaryPredicate); template<typename _RAIter> void nth_element(_RAIter, _RAIter, _RAIter); template<typename _RAIter, typename _Compare> void nth_element(_RAIter, _RAIter, _RAIter, _Compare); template<typename _RAIter> void partial_sort(_RAIter, _RAIter, _RAIter); template<typename _RAIter, typename _Compare> void partial_sort(_RAIter, _RAIter, _RAIter, _Compare); template<typename _BIter, typename _Predicate> _BIter partition(_BIter, _BIter, _Predicate); template<typename _RAIter> void random_shuffle(_RAIter, _RAIter); template<typename _RAIter, typename _Generator> void random_shuffle(_RAIter, _RAIter, _Generator&); template<typename _FIter, typename _Tp> void replace(_FIter, _FIter, const _Tp&, const _Tp&); template<typename _FIter, typename _Predicate, typename _Tp> void replace_if(_FIter, _FIter, _Predicate, const _Tp&); template<typename _FIter1, typename _FIter2> _FIter1 search(_FIter1, _FIter1, _FIter2, _FIter2); template<typename _FIter1, typename _FIter2, typename _BinaryPredicate> _FIter1 search(_FIter1, _FIter1, _FIter2, _FIter2, _BinaryPredicate); template<typename _FIter, typename _Size, typename _Tp> _FIter search_n(_FIter, _FIter, _Size, const _Tp&); template<typename _FIter, typename _Size, typename _Tp, typename _BinaryPredicate> _FIter search_n(_FIter, _FIter, _Size, const _Tp&, _BinaryPredicate); template<typename _IIter1, typename _IIter2, typename _OIter> _OIter set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); template<typename _IIter1, typename _IIter2, typename _OIter, typename _Compare> _OIter set_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); template<typename _IIter1, typename _IIter2, typename _OIter> _OIter set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); template<typename _IIter1, typename _IIter2, typename _OIter, typename _Compare> _OIter set_intersection(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); template<typename _IIter1, typename _IIter2, typename _OIter> _OIter set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); template<typename _IIter1, typename _IIter2, typename _OIter, typename _Compare> _OIter set_symmetric_difference(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); template<typename _IIter1, typename _IIter2, typename _OIter> _OIter set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter); template<typename _IIter1, typename _IIter2, typename _OIter, typename _Compare> _OIter set_union(_IIter1, _IIter1, _IIter2, _IIter2, _OIter, _Compare); template<typename _RAIter> void sort(_RAIter, _RAIter); template<typename _RAIter, typename _Compare> void sort(_RAIter, _RAIter, _Compare); template<typename _RAIter> void stable_sort(_RAIter, _RAIter); template<typename _RAIter, typename _Compare> void stable_sort(_RAIter, _RAIter, _Compare); template<typename _IIter, typename _OIter, typename _UnaryOperation> _OIter transform(_IIter, _IIter, _OIter, _UnaryOperation); template<typename _IIter1, typename _IIter2, typename _OIter, typename _BinaryOperation> _OIter transform(_IIter1, _IIter1, _IIter2, _OIter, _BinaryOperation); template<typename _IIter, typename _OIter> _OIter unique_copy(_IIter, _IIter, _OIter); template<typename _IIter, typename _OIter, typename _BinaryPredicate> _OIter unique_copy(_IIter, _IIter, _OIter, _BinaryPredicate); } # 63 "/usr/include/c++/4.7/bits/stl_algo.h" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_heap.h" 1 3 # 62 "/usr/include/c++/4.7/bits/stl_heap.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _RandomAccessIterator, typename _Distance> _Distance __is_heap_until(_RandomAccessIterator __first, _Distance __n) { _Distance __parent = 0; for (_Distance __child = 1; __child < __n; ++__child) { if (__first[__parent] < __first[__child]) return __child; if ((__child & 1) == 0) ++__parent; } return __n; } template<typename _RandomAccessIterator, typename _Distance, typename _Compare> _Distance __is_heap_until(_RandomAccessIterator __first, _Distance __n, _Compare __comp) { _Distance __parent = 0; for (_Distance __child = 1; __child < __n; ++__child) { if (__comp(__first[__parent], __first[__child])) return __child; if ((__child & 1) == 0) ++__parent; } return __n; } template<typename _RandomAccessIterator, typename _Distance> inline bool __is_heap(_RandomAccessIterator __first, _Distance __n) { return std::__is_heap_until(__first, __n) == __n; } template<typename _RandomAccessIterator, typename _Compare, typename _Distance> inline bool __is_heap(_RandomAccessIterator __first, _Compare __comp, _Distance __n) { return std::__is_heap_until(__first, __n, __comp) == __n; } template<typename _RandomAccessIterator> inline bool __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { return std::__is_heap(__first, std::distance(__first, __last)); } template<typename _RandomAccessIterator, typename _Compare> inline bool __is_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { return std::__is_heap(__first, __comp, std::distance(__first, __last)); } template<typename _RandomAccessIterator, typename _Distance, typename _Tp> void __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value) { _Distance __parent = (__holeIndex - 1) / 2; while (__holeIndex > __topIndex && *(__first + __parent) < __value) { *(__first + __holeIndex) = (*(__first + __parent)); __holeIndex = __parent; __parent = (__holeIndex - 1) / 2; } *(__first + __holeIndex) = (__value); } # 155 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator> inline void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; ; _ValueType __value = (*(__last - 1)); std::__push_heap(__first, _DistanceType((__last - __first) - 1), _DistanceType(0), (__value)); } template<typename _RandomAccessIterator, typename _Distance, typename _Tp, typename _Compare> void __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __topIndex, _Tp __value, _Compare __comp) { _Distance __parent = (__holeIndex - 1) / 2; while (__holeIndex > __topIndex && __comp(*(__first + __parent), __value)) { *(__first + __holeIndex) = (*(__first + __parent)); __holeIndex = __parent; __parent = (__holeIndex - 1) / 2; } *(__first + __holeIndex) = (__value); } # 205 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator, typename _Compare> inline void push_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; ; _ValueType __value = (*(__last - 1)); std::__push_heap(__first, _DistanceType((__last - __first) - 1), _DistanceType(0), (__value), __comp); } template<typename _RandomAccessIterator, typename _Distance, typename _Tp> void __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) { const _Distance __topIndex = __holeIndex; _Distance __secondChild = __holeIndex; while (__secondChild < (__len - 1) / 2) { __secondChild = 2 * (__secondChild + 1); if (*(__first + __secondChild) < *(__first + (__secondChild - 1))) __secondChild--; *(__first + __holeIndex) = (*(__first + __secondChild)); __holeIndex = __secondChild; } if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) { __secondChild = 2 * (__secondChild + 1); *(__first + __holeIndex) = (*(__first + (__secondChild - 1))) ; __holeIndex = __secondChild - 1; } std::__push_heap(__first, __holeIndex, __topIndex, (__value)); } template<typename _RandomAccessIterator> inline void __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; _ValueType __value = (*__result); *__result = (*__first); std::__adjust_heap(__first, _DistanceType(0), _DistanceType(__last - __first), (__value)); } # 280 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator> inline void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; ; ; ; --__last; std::__pop_heap(__first, __last, __last); } template<typename _RandomAccessIterator, typename _Distance, typename _Tp, typename _Compare> void __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) { const _Distance __topIndex = __holeIndex; _Distance __secondChild = __holeIndex; while (__secondChild < (__len - 1) / 2) { __secondChild = 2 * (__secondChild + 1); if (__comp(*(__first + __secondChild), *(__first + (__secondChild - 1)))) __secondChild--; *(__first + __holeIndex) = (*(__first + __secondChild)); __holeIndex = __secondChild; } if ((__len & 1) == 0 && __secondChild == (__len - 2) / 2) { __secondChild = 2 * (__secondChild + 1); *(__first + __holeIndex) = (*(__first + (__secondChild - 1))) ; __holeIndex = __secondChild - 1; } std::__push_heap(__first, __holeIndex, __topIndex, (__value), __comp); } template<typename _RandomAccessIterator, typename _Compare> inline void __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomAccessIterator __result, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; _ValueType __value = (*__result); *__result = (*__first); std::__adjust_heap(__first, _DistanceType(0), _DistanceType(__last - __first), (__value), __comp); } # 355 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator, typename _Compare> inline void pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { ; ; ; --__last; std::__pop_heap(__first, __last, __last, __comp); } # 379 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator> void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; if (__last - __first < 2) return; const _DistanceType __len = __last - __first; _DistanceType __parent = (__len - 2) / 2; while (true) { _ValueType __value = (*(__first + __parent)); std::__adjust_heap(__first, __parent, __len, (__value)); if (__parent == 0) return; __parent--; } } # 419 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator, typename _Compare> void make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; if (__last - __first < 2) return; const _DistanceType __len = __last - __first; _DistanceType __parent = (__len - 2) / 2; while (true) { _ValueType __value = (*(__first + __parent)); std::__adjust_heap(__first, __parent, __len, (__value), __comp); if (__parent == 0) return; __parent--; } } # 458 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator> void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) { ; ; while (__last - __first > 1) { --__last; std::__pop_heap(__first, __last, __last); } } # 487 "/usr/include/c++/4.7/bits/stl_heap.h" 3 template<typename _RandomAccessIterator, typename _Compare> void sort_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { ; ; while (__last - __first > 1) { --__last; std::__pop_heap(__first, __last, __last, __comp); } } # 584 "/usr/include/c++/4.7/bits/stl_heap.h" 3 } # 64 "/usr/include/c++/4.7/bits/stl_algo.h" 2 3 # 1 "/usr/include/c++/4.7/bits/stl_tempbuf.h" 1 3 # 62 "/usr/include/c++/4.7/bits/stl_tempbuf.h" 3 # 1 "/usr/include/c++/4.7/bits/stl_construct.h" 1 3 # 63 "/usr/include/c++/4.7/bits/stl_construct.h" 3 # 1 "/usr/include/c++/4.7/ext/alloc_traits.h" 1 3 # 32 "/usr/include/c++/4.7/ext/alloc_traits.h" 3 # 33 "/usr/include/c++/4.7/ext/alloc_traits.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename> struct allocator; } namespace __gnu_cxx __attribute__ ((__visibility__ ("default"))) { # 108 "/usr/include/c++/4.7/ext/alloc_traits.h" 3 template<typename _Alloc> struct __alloc_traits { typedef _Alloc allocator_type; # 186 "/usr/include/c++/4.7/ext/alloc_traits.h" 3 typedef typename _Alloc::pointer pointer; typedef typename _Alloc::const_pointer const_pointer; typedef typename _Alloc::value_type value_type; typedef typename _Alloc::reference reference; typedef typename _Alloc::const_reference const_reference; typedef typename _Alloc::size_type size_type; static pointer allocate(_Alloc& __a, size_type __n) { return __a.allocate(__n); } static void deallocate(_Alloc& __a, pointer __p, size_type __n) { __a.deallocate(__p, __n); } template<typename _Tp> static void construct(_Alloc& __a, pointer __p, const _Tp& __arg) { __a.construct(__p, __arg); } static void destroy(_Alloc& __a, pointer __p) { __a.destroy(__p); } static size_type max_size(const _Alloc& __a) { return __a.max_size(); } static const _Alloc& _S_select_on_copy(const _Alloc& __a) { return __a; } static void _S_on_swap(_Alloc& __a, _Alloc& __b) { std::__alloc_swap<_Alloc>::_S_do_it(__a, __b); } template<typename _Tp> struct rebind { typedef typename _Alloc::template rebind<_Tp>::other other; }; }; } # 64 "/usr/include/c++/4.7/bits/stl_construct.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 79 "/usr/include/c++/4.7/bits/stl_construct.h" 3 template<typename _T1, typename _T2> inline void _Construct(_T1* __p, const _T2& __value) { ::new(static_cast<void*>(__p)) _T1(__value); } template<typename _Tp> inline void _Destroy(_Tp* __pointer) { __pointer->~_Tp(); } template<bool> struct _Destroy_aux { template<typename _ForwardIterator> static void __destroy(_ForwardIterator __first, _ForwardIterator __last) { for (; __first != __last; ++__first) std::_Destroy(std::__addressof(*__first)); } }; template<> struct _Destroy_aux<true> { template<typename _ForwardIterator> static void __destroy(_ForwardIterator, _ForwardIterator) { } }; template<typename _ForwardIterator> inline void _Destroy(_ForwardIterator __first, _ForwardIterator __last) { typedef typename iterator_traits<_ForwardIterator>::value_type _Value_type; std::_Destroy_aux<__has_trivial_destructor(_Value_type)>:: __destroy(__first, __last); } template <typename _Tp> class allocator; template<typename _ForwardIterator, typename _Allocator> void _Destroy(_ForwardIterator __first, _ForwardIterator __last, _Allocator& __alloc) { typedef __gnu_cxx::__alloc_traits<_Allocator> __traits; for (; __first != __last; ++__first) __traits::destroy(__alloc, std::__addressof(*__first)); } template<typename _ForwardIterator, typename _Tp> inline void _Destroy(_ForwardIterator __first, _ForwardIterator __last, allocator<_Tp>&) { _Destroy(__first, __last); } } # 63 "/usr/include/c++/4.7/bits/stl_tempbuf.h" 2 3 namespace std __attribute__ ((__visibility__ ("default"))) { # 85 "/usr/include/c++/4.7/bits/stl_tempbuf.h" 3 template<typename _Tp> pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len) { const ptrdiff_t __max = __gnu_cxx::__numeric_traits<ptrdiff_t>::__max / sizeof(_Tp); if (__len > __max) __len = __max; while (__len > 0) { _Tp* __tmp = static_cast<_Tp*>(::operator new(__len * sizeof(_Tp), std::nothrow)); if (__tmp != 0) return std::pair<_Tp*, ptrdiff_t>(__tmp, __len); __len /= 2; } return std::pair<_Tp*, ptrdiff_t>(static_cast<_Tp*>(0), 0); } # 112 "/usr/include/c++/4.7/bits/stl_tempbuf.h" 3 template<typename _Tp> inline void return_temporary_buffer(_Tp* __p) { ::operator delete(__p, std::nothrow); } template<typename _ForwardIterator, typename _Tp> class _Temporary_buffer { public: typedef _Tp value_type; typedef value_type* pointer; typedef pointer iterator; typedef ptrdiff_t size_type; protected: size_type _M_original_len; size_type _M_len; pointer _M_buffer; public: size_type size() const { return _M_len; } size_type requested_size() const { return _M_original_len; } iterator begin() { return _M_buffer; } iterator end() { return _M_buffer + _M_len; } _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last); ~_Temporary_buffer() { std::_Destroy(_M_buffer, _M_buffer + _M_len); std::return_temporary_buffer(_M_buffer); } private: _Temporary_buffer(const _Temporary_buffer&); void operator=(const _Temporary_buffer&); }; template<bool> struct __uninitialized_construct_buf_dispatch { template<typename _ForwardIterator, typename _Tp> static void __ucr(_ForwardIterator __first, _ForwardIterator __last, _Tp& __value) { if(__first == __last) return; _ForwardIterator __cur = __first; try { std::_Construct(std::__addressof(*__first), (__value)); _ForwardIterator __prev = __cur; ++__cur; for(; __cur != __last; ++__cur, ++__prev) std::_Construct(std::__addressof(*__cur), (*__prev)); __value = (*__prev); } catch(...) { std::_Destroy(__first, __cur); throw; } } }; template<> struct __uninitialized_construct_buf_dispatch<true> { template<typename _ForwardIterator, typename _Tp> static void __ucr(_ForwardIterator, _ForwardIterator, _Tp&) { } }; # 231 "/usr/include/c++/4.7/bits/stl_tempbuf.h" 3 template<typename _ForwardIterator, typename _Tp> inline void __uninitialized_construct_buf(_ForwardIterator __first, _ForwardIterator __last, _Tp& __value) { typedef typename std::iterator_traits<_ForwardIterator>::value_type _ValueType; std::__uninitialized_construct_buf_dispatch< __has_trivial_constructor(_ValueType)>:: __ucr(__first, __last, __value); } template<typename _ForwardIterator, typename _Tp> _Temporary_buffer<_ForwardIterator, _Tp>:: _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) : _M_original_len(std::distance(__first, __last)), _M_len(0), _M_buffer(0) { try { std::pair<pointer, size_type> __p(std::get_temporary_buffer< value_type>(_M_original_len)); _M_buffer = __p.first; _M_len = __p.second; if(_M_buffer) std::__uninitialized_construct_buf(_M_buffer, _M_buffer + _M_len, *__first); } catch(...) { std::return_temporary_buffer(_M_buffer); _M_buffer = 0; _M_len = 0; throw; } } } # 65 "/usr/include/c++/4.7/bits/stl_algo.h" 2 3 # 73 "/usr/include/c++/4.7/bits/stl_algo.h" 3 namespace std __attribute__ ((__visibility__ ("default"))) { template<typename _Iterator> void __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c) { if (*__a < *__b) { if (*__b < *__c) std::iter_swap(__a, __b); else if (*__a < *__c) std::iter_swap(__a, __c); } else if (*__a < *__c) return; else if (*__b < *__c) std::iter_swap(__a, __c); else std::iter_swap(__a, __b); } template<typename _Iterator, typename _Compare> void __move_median_first(_Iterator __a, _Iterator __b, _Iterator __c, _Compare __comp) { if (__comp(*__a, *__b)) { if (__comp(*__b, *__c)) std::iter_swap(__a, __b); else if (__comp(*__a, *__c)) std::iter_swap(__a, __c); } else if (__comp(*__a, *__c)) return; else if (__comp(*__b, *__c)) std::iter_swap(__a, __c); else std::iter_swap(__a, __b); } template<typename _InputIterator, typename _Tp> inline _InputIterator __find(_InputIterator __first, _InputIterator __last, const _Tp& __val, input_iterator_tag) { while (__first != __last && !(*__first == __val)) ++__first; return __first; } template<typename _InputIterator, typename _Predicate> inline _InputIterator __find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred, input_iterator_tag) { while (__first != __last && !bool(__pred(*__first))) ++__first; return __first; } template<typename _RandomAccessIterator, typename _Tp> _RandomAccessIterator __find(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __val, random_access_iterator_tag) { typename iterator_traits<_RandomAccessIterator>::difference_type __trip_count = (__last - __first) >> 2; for (; __trip_count > 0; --__trip_count) { if (*__first == __val) return __first; ++__first; if (*__first == __val) return __first; ++__first; if (*__first == __val) return __first; ++__first; if (*__first == __val) return __first; ++__first; } switch (__last - __first) { case 3: if (*__first == __val) return __first; ++__first; case 2: if (*__first == __val) return __first; ++__first; case 1: if (*__first == __val) return __first; ++__first; case 0: default: return __last; } } template<typename _RandomAccessIterator, typename _Predicate> _RandomAccessIterator __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred, random_access_iterator_tag) { typename iterator_traits<_RandomAccessIterator>::difference_type __trip_count = (__last - __first) >> 2; for (; __trip_count > 0; --__trip_count) { if (__pred(*__first)) return __first; ++__first; if (__pred(*__first)) return __first; ++__first; if (__pred(*__first)) return __first; ++__first; if (__pred(*__first)) return __first; ++__first; } switch (__last - __first) { case 3: if (__pred(*__first)) return __first; ++__first; case 2: if (__pred(*__first)) return __first; ++__first; case 1: if (__pred(*__first)) return __first; ++__first; case 0: default: return __last; } } template<typename _InputIterator, typename _Predicate> inline _InputIterator __find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred, input_iterator_tag) { while (__first != __last && bool(__pred(*__first))) ++__first; return __first; } template<typename _RandomAccessIterator, typename _Predicate> _RandomAccessIterator __find_if_not(_RandomAccessIterator __first, _RandomAccessIterator __last, _Predicate __pred, random_access_iterator_tag) { typename iterator_traits<_RandomAccessIterator>::difference_type __trip_count = (__last - __first) >> 2; for (; __trip_count > 0; --__trip_count) { if (!bool(__pred(*__first))) return __first; ++__first; if (!bool(__pred(*__first))) return __first; ++__first; if (!bool(__pred(*__first))) return __first; ++__first; if (!bool(__pred(*__first))) return __first; ++__first; } switch (__last - __first) { case 3: if (!bool(__pred(*__first))) return __first; ++__first; case 2: if (!bool(__pred(*__first))) return __first; ++__first; case 1: if (!bool(__pred(*__first))) return __first; ++__first; case 0: default: return __last; } } template<typename _InputIterator, typename _Predicate> inline _InputIterator __find_if_not(_InputIterator __first, _InputIterator __last, _Predicate __pred) { return std::__find_if_not(__first, __last, __pred, std::__iterator_category(__first)); } template<typename _InputIterator, typename _Predicate, typename _Distance> _InputIterator __find_if_not_n(_InputIterator __first, _Distance& __len, _Predicate __pred) { for (; __len; --__len, ++__first) if (!bool(__pred(*__first))) break; return __first; } # 347 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Integer, typename _Tp> _ForwardIterator __search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, std::forward_iterator_tag) { __first = std::find(__first, __last, __val); while (__first != __last) { typename iterator_traits<_ForwardIterator>::difference_type __n = __count; _ForwardIterator __i = __first; ++__i; while (__i != __last && __n != 1 && *__i == __val) { ++__i; --__n; } if (__n == 1) return __first; if (__i == __last) return __last; __first = std::find(++__i, __last, __val); } return __last; } template<typename _RandomAccessIter, typename _Integer, typename _Tp> _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp& __val, std::random_access_iterator_tag) { typedef typename std::iterator_traits<_RandomAccessIter>::difference_type _DistanceType; _DistanceType __tailSize = __last - __first; const _DistanceType __pattSize = __count; if (__tailSize < __pattSize) return __last; const _DistanceType __skipOffset = __pattSize - 1; _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize -= __pattSize; while (1) { while (!(*__lookAhead == __val)) { if (__tailSize < __pattSize) return __last; __lookAhead += __pattSize; __tailSize -= __pattSize; } _DistanceType __remainder = __skipOffset; for (_RandomAccessIter __backTrack = __lookAhead - 1; *__backTrack == __val; --__backTrack) { if (--__remainder == 0) return (__lookAhead - __skipOffset); } if (__remainder > __tailSize) return __last; __lookAhead += __remainder; __tailSize -= __remainder; } } # 432 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Integer, typename _Tp, typename _BinaryPredicate> _ForwardIterator __search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred, std::forward_iterator_tag) { while (__first != __last && !bool(__binary_pred(*__first, __val))) ++__first; while (__first != __last) { typename iterator_traits<_ForwardIterator>::difference_type __n = __count; _ForwardIterator __i = __first; ++__i; while (__i != __last && __n != 1 && bool(__binary_pred(*__i, __val))) { ++__i; --__n; } if (__n == 1) return __first; if (__i == __last) return __last; __first = ++__i; while (__first != __last && !bool(__binary_pred(*__first, __val))) ++__first; } return __last; } template<typename _RandomAccessIter, typename _Integer, typename _Tp, typename _BinaryPredicate> _RandomAccessIter __search_n(_RandomAccessIter __first, _RandomAccessIter __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred, std::random_access_iterator_tag) { typedef typename std::iterator_traits<_RandomAccessIter>::difference_type _DistanceType; _DistanceType __tailSize = __last - __first; const _DistanceType __pattSize = __count; if (__tailSize < __pattSize) return __last; const _DistanceType __skipOffset = __pattSize - 1; _RandomAccessIter __lookAhead = __first + __skipOffset; __tailSize -= __pattSize; while (1) { while (!bool(__binary_pred(*__lookAhead, __val))) { if (__tailSize < __pattSize) return __last; __lookAhead += __pattSize; __tailSize -= __pattSize; } _DistanceType __remainder = __skipOffset; for (_RandomAccessIter __backTrack = __lookAhead - 1; __binary_pred(*__backTrack, __val); --__backTrack) { if (--__remainder == 0) return (__lookAhead - __skipOffset); } if (__remainder > __tailSize) return __last; __lookAhead += __remainder; __tailSize -= __remainder; } } template<typename _ForwardIterator1, typename _ForwardIterator2> _ForwardIterator1 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag) { if (__first2 == __last2) return __last1; else { _ForwardIterator1 __result = __last1; while (1) { _ForwardIterator1 __new_result = std::search(__first1, __last1, __first2, __last2); if (__new_result == __last1) return __result; else { __result = __new_result; __first1 = __new_result; ++__first1; } } } } template<typename _ForwardIterator1, typename _ForwardIterator2, typename _BinaryPredicate> _ForwardIterator1 __find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, forward_iterator_tag, forward_iterator_tag, _BinaryPredicate __comp) { if (__first2 == __last2) return __last1; else { _ForwardIterator1 __result = __last1; while (1) { _ForwardIterator1 __new_result = std::search(__first1, __last1, __first2, __last2, __comp); if (__new_result == __last1) return __result; else { __result = __new_result; __first1 = __new_result; ++__first1; } } } } template<typename _BidirectionalIterator1, typename _BidirectionalIterator2> _BidirectionalIterator1 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag) { typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; _RevIterator1 __rlast1(__first1); _RevIterator2 __rlast2(__first2); _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, _RevIterator2(__last2), __rlast2); if (__rresult == __rlast1) return __last1; else { _BidirectionalIterator1 __result = __rresult.base(); std::advance(__result, -std::distance(__first2, __last2)); return __result; } } template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, typename _BinaryPredicate> _BidirectionalIterator1 __find_end(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, bidirectional_iterator_tag, bidirectional_iterator_tag, _BinaryPredicate __comp) { typedef reverse_iterator<_BidirectionalIterator1> _RevIterator1; typedef reverse_iterator<_BidirectionalIterator2> _RevIterator2; _RevIterator1 __rlast1(__first1); _RevIterator2 __rlast2(__first2); _RevIterator1 __rresult = std::search(_RevIterator1(__last1), __rlast1, _RevIterator2(__last2), __rlast2, __comp); if (__rresult == __rlast1) return __last1; else { _BidirectionalIterator1 __result = __rresult.base(); std::advance(__result, -std::distance(__first2, __last2)); return __result; } } # 671 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator1, typename _ForwardIterator2> inline _ForwardIterator1 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) { ; ; return std::__find_end(__first1, __last1, __first2, __last2, std::__iterator_category(__first1), std::__iterator_category(__first2)); } # 718 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator1, typename _ForwardIterator2, typename _BinaryPredicate> inline _ForwardIterator1 find_end(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __comp) { ; ; return std::__find_end(__first1, __last1, __first2, __last2, std::__iterator_category(__first1), std::__iterator_category(__first2), __comp); } # 897 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _OutputIterator, typename _Tp> _OutputIterator remove_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __value) { ; for (; __first != __last; ++__first) if (!(*__first == __value)) { *__result = *__first; ++__result; } return __result; } # 934 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _OutputIterator, typename _Predicate> _OutputIterator remove_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred) { ; for (; __first != __last; ++__first) if (!bool(__pred(*__first))) { *__result = *__first; ++__result; } return __result; } # 1115 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp> _ForwardIterator remove(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __value) { ; __first = std::find(__first, __last, __value); if(__first == __last) return __first; _ForwardIterator __result = __first; ++__first; for(; __first != __last; ++__first) if(!(*__first == __value)) { *__result = (*__first); ++__result; } return __result; } # 1158 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Predicate> _ForwardIterator remove_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { ; __first = std::find_if(__first, __last, __pred); if(__first == __last) return __first; _ForwardIterator __result = __first; ++__first; for(; __first != __last; ++__first) if(!bool(__pred(*__first))) { *__result = (*__first); ++__result; } return __result; } # 1198 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator> _ForwardIterator unique(_ForwardIterator __first, _ForwardIterator __last) { ; __first = std::adjacent_find(__first, __last); if (__first == __last) return __last; _ForwardIterator __dest = __first; ++__first; while (++__first != __last) if (!(*__dest == *__first)) *++__dest = (*__first); return ++__dest; } # 1238 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _BinaryPredicate> _ForwardIterator unique(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) { ; __first = std::adjacent_find(__first, __last, __binary_pred); if (__first == __last) return __last; _ForwardIterator __dest = __first; ++__first; while (++__first != __last) if (!bool(__binary_pred(*__dest, *__first))) *++__dest = (*__first); return ++__dest; } template<typename _ForwardIterator, typename _OutputIterator> _OutputIterator __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, forward_iterator_tag, output_iterator_tag) { _ForwardIterator __next = __first; *__result = *__first; while (++__next != __last) if (!(*__first == *__next)) { __first = __next; *++__result = *__first; } return ++__result; } template<typename _InputIterator, typename _OutputIterator> _OutputIterator __unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, input_iterator_tag, output_iterator_tag) { typename iterator_traits<_InputIterator>::value_type __value = *__first; *__result = __value; while (++__first != __last) if (!(__value == *__first)) { __value = *__first; *++__result = __value; } return ++__result; } template<typename _InputIterator, typename _ForwardIterator> _ForwardIterator __unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, input_iterator_tag, forward_iterator_tag) { *__result = *__first; while (++__first != __last) if (!(*__result == *__first)) *++__result = *__first; return ++__result; } template<typename _ForwardIterator, typename _OutputIterator, typename _BinaryPredicate> _OutputIterator __unique_copy(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, forward_iterator_tag, output_iterator_tag) { _ForwardIterator __next = __first; *__result = *__first; while (++__next != __last) if (!bool(__binary_pred(*__first, *__next))) { __first = __next; *++__result = *__first; } return ++__result; } template<typename _InputIterator, typename _OutputIterator, typename _BinaryPredicate> _OutputIterator __unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, output_iterator_tag) { typename iterator_traits<_InputIterator>::value_type __value = *__first; *__result = __value; while (++__first != __last) if (!bool(__binary_pred(__value, *__first))) { __value = *__first; *++__result = __value; } return ++__result; } template<typename _InputIterator, typename _ForwardIterator, typename _BinaryPredicate> _ForwardIterator __unique_copy(_InputIterator __first, _InputIterator __last, _ForwardIterator __result, _BinaryPredicate __binary_pred, input_iterator_tag, forward_iterator_tag) { *__result = *__first; while (++__first != __last) if (!bool(__binary_pred(*__result, *__first))) *++__result = *__first; return ++__result; } template<typename _BidirectionalIterator> void __reverse(_BidirectionalIterator __first, _BidirectionalIterator __last, bidirectional_iterator_tag) { while (true) if (__first == __last || __first == --__last) return; else { std::iter_swap(__first, __last); ++__first; } } template<typename _RandomAccessIterator> void __reverse(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_tag) { if (__first == __last) return; --__last; while (__first < __last) { std::iter_swap(__first, __last); ++__first; --__last; } } # 1466 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator> inline void reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) { ; std::__reverse(__first, __last, std::__iterator_category(__first)); } # 1493 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator, typename _OutputIterator> _OutputIterator reverse_copy(_BidirectionalIterator __first, _BidirectionalIterator __last, _OutputIterator __result) { ; while (__first != __last) { --__last; *__result = *__last; ++__result; } return __result; } template<typename _EuclideanRingElement> _EuclideanRingElement __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) { while (__n != 0) { _EuclideanRingElement __t = __m % __n; __m = __n; __n = __t; } return __m; } template<typename _ForwardIterator> void __rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, forward_iterator_tag) { if (__first == __middle || __last == __middle) return; _ForwardIterator __first2 = __middle; do { std::iter_swap(__first, __first2); ++__first; ++__first2; if (__first == __middle) __middle = __first2; } while (__first2 != __last); __first2 = __middle; while (__first2 != __last) { std::iter_swap(__first, __first2); ++__first; ++__first2; if (__first == __middle) __middle = __first2; else if (__first2 == __last) __first2 = __middle; } } template<typename _BidirectionalIterator> void __rotate(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, bidirectional_iterator_tag) { if (__first == __middle || __last == __middle) return; std::__reverse(__first, __middle, bidirectional_iterator_tag()); std::__reverse(__middle, __last, bidirectional_iterator_tag()); while (__first != __middle && __middle != __last) { std::iter_swap(__first, --__last); ++__first; } if (__first == __middle) std::__reverse(__middle, __last, bidirectional_iterator_tag()); else std::__reverse(__first, __middle, bidirectional_iterator_tag()); } template<typename _RandomAccessIterator> void __rotate(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, random_access_iterator_tag) { if (__first == __middle || __last == __middle) return; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _Distance; typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; _Distance __n = __last - __first; _Distance __k = __middle - __first; if (__k == __n - __k) { std::swap_ranges(__first, __middle, __middle); return; } _RandomAccessIterator __p = __first; for (;;) { if (__k < __n - __k) { if (__is_pod(_ValueType) && __k == 1) { _ValueType __t = (*__p); std::copy(__p + 1, __p + __n, __p); *(__p + __n - 1) = (__t); return; } _RandomAccessIterator __q = __p + __k; for (_Distance __i = 0; __i < __n - __k; ++ __i) { std::iter_swap(__p, __q); ++__p; ++__q; } __n %= __k; if (__n == 0) return; std::swap(__n, __k); __k = __n - __k; } else { __k = __n - __k; if (__is_pod(_ValueType) && __k == 1) { _ValueType __t = (*(__p + __n - 1)); std::copy_backward(__p, __p + __n - 1, __p + __n); *__p = (__t); return; } _RandomAccessIterator __q = __p + __n; __p = __q - __k; for (_Distance __i = 0; __i < __n - __k; ++ __i) { --__p; --__q; std::iter_swap(__p, __q); } __n %= __k; if (__n == 0) return; std::swap(__n, __k); } } } # 1699 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator> inline void rotate(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last) { ; ; typedef typename iterator_traits<_ForwardIterator>::iterator_category _IterType; std::__rotate(__first, __middle, __last, _IterType()); } # 1735 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _OutputIterator> _OutputIterator rotate_copy(_ForwardIterator __first, _ForwardIterator __middle, _ForwardIterator __last, _OutputIterator __result) { ; ; return std::copy(__first, __middle, std::copy(__middle, __last, __result)); } template<typename _ForwardIterator, typename _Predicate> _ForwardIterator __partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, forward_iterator_tag) { if (__first == __last) return __first; while (__pred(*__first)) if (++__first == __last) return __first; _ForwardIterator __next = __first; while (++__next != __last) if (__pred(*__next)) { std::iter_swap(__first, __next); ++__first; } return __first; } template<typename _BidirectionalIterator, typename _Predicate> _BidirectionalIterator __partition(_BidirectionalIterator __first, _BidirectionalIterator __last, _Predicate __pred, bidirectional_iterator_tag) { while (true) { while (true) if (__first == __last) return __first; else if (__pred(*__first)) ++__first; else break; --__last; while (true) if (__first == __last) return __first; else if (!bool(__pred(*__last))) --__last; else break; std::iter_swap(__first, __last); ++__first; } } template<typename _ForwardIterator, typename _Predicate, typename _Distance> _ForwardIterator __inplace_stable_partition(_ForwardIterator __first, _Predicate __pred, _Distance __len) { if (__len == 1) return __first; _ForwardIterator __middle = __first; std::advance(__middle, __len / 2); _ForwardIterator __left_split = std::__inplace_stable_partition(__first, __pred, __len / 2); _Distance __right_len = __len - __len / 2; _ForwardIterator __right_split = std::__find_if_not_n(__middle, __right_len, __pred); if (__right_len) __right_split = std::__inplace_stable_partition(__middle, __pred, __right_len); std::rotate(__left_split, __middle, __right_split); std::advance(__left_split, std::distance(__middle, __right_split)); return __left_split; } template<typename _ForwardIterator, typename _Pointer, typename _Predicate, typename _Distance> _ForwardIterator __stable_partition_adaptive(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) { if (__len <= __buffer_size) { _ForwardIterator __result1 = __first; _Pointer __result2 = __buffer; *__result2 = (*__first); ++__result2; ++__first; for (; __first != __last; ++__first) if (__pred(*__first)) { *__result1 = (*__first); ++__result1; } else { *__result2 = (*__first); ++__result2; } std::copy(__buffer, __result2, __result1); return __result1; } else { _ForwardIterator __middle = __first; std::advance(__middle, __len / 2); _ForwardIterator __left_split = std::__stable_partition_adaptive(__first, __middle, __pred, __len / 2, __buffer, __buffer_size); _Distance __right_len = __len - __len / 2; _ForwardIterator __right_split = std::__find_if_not_n(__middle, __right_len, __pred); if (__right_len) __right_split = std::__stable_partition_adaptive(__right_split, __last, __pred, __right_len, __buffer, __buffer_size); std::rotate(__left_split, __middle, __right_split); std::advance(__left_split, std::distance(__middle, __right_split)); return __left_split; } } # 1914 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Predicate> _ForwardIterator stable_partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { ; __first = std::__find_if_not(__first, __last, __pred); if (__first == __last) return __first; else { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; typedef typename iterator_traits<_ForwardIterator>::difference_type _DistanceType; _Temporary_buffer<_ForwardIterator, _ValueType> __buf(__first, __last); if (__buf.size() > 0) return std::__stable_partition_adaptive(__first, __last, __pred, _DistanceType(__buf.requested_size()), __buf.begin(), _DistanceType(__buf.size())); else return std::__inplace_stable_partition(__first, __pred, _DistanceType(__buf.requested_size())); } } template<typename _RandomAccessIterator> void __heap_select(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) { std::make_heap(__first, __middle); for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) if (*__i < *__first) std::__pop_heap(__first, __middle, __i); } template<typename _RandomAccessIterator, typename _Compare> void __heap_select(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) { std::make_heap(__first, __middle, __comp); for (_RandomAccessIterator __i = __middle; __i < __last; ++__i) if (__comp(*__i, *__first)) std::__pop_heap(__first, __middle, __i, __comp); } # 1998 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _RandomAccessIterator> _RandomAccessIterator partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last) { typedef typename iterator_traits<_InputIterator>::value_type _InputValueType; typedef typename iterator_traits<_RandomAccessIterator>::value_type _OutputValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; ; if (__result_first == __result_last) return __result_last; _RandomAccessIterator __result_real_last = __result_first; while(__first != __last && __result_real_last != __result_last) { *__result_real_last = *__first; ++__result_real_last; ++__first; } std::make_heap(__result_first, __result_real_last); while (__first != __last) { if (*__first < *__result_first) std::__adjust_heap(__result_first, _DistanceType(0), _DistanceType(__result_real_last - __result_first), _InputValueType(*__first)); ++__first; } std::sort_heap(__result_first, __result_real_last); return __result_real_last; } # 2064 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _RandomAccessIterator, typename _Compare> _RandomAccessIterator partial_sort_copy(_InputIterator __first, _InputIterator __last, _RandomAccessIterator __result_first, _RandomAccessIterator __result_last, _Compare __comp) { typedef typename iterator_traits<_InputIterator>::value_type _InputValueType; typedef typename iterator_traits<_RandomAccessIterator>::value_type _OutputValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; ; if (__result_first == __result_last) return __result_last; _RandomAccessIterator __result_real_last = __result_first; while(__first != __last && __result_real_last != __result_last) { *__result_real_last = *__first; ++__result_real_last; ++__first; } std::make_heap(__result_first, __result_real_last, __comp); while (__first != __last) { if (__comp(*__first, *__result_first)) std::__adjust_heap(__result_first, _DistanceType(0), _DistanceType(__result_real_last - __result_first), _InputValueType(*__first), __comp); ++__first; } std::sort_heap(__result_first, __result_real_last, __comp); return __result_real_last; } template<typename _RandomAccessIterator> void __unguarded_linear_insert(_RandomAccessIterator __last) { typename iterator_traits<_RandomAccessIterator>::value_type __val = (*__last); _RandomAccessIterator __next = __last; --__next; while (__val < *__next) { *__last = (*__next); __last = __next; --__next; } *__last = (__val); } template<typename _RandomAccessIterator, typename _Compare> void __unguarded_linear_insert(_RandomAccessIterator __last, _Compare __comp) { typename iterator_traits<_RandomAccessIterator>::value_type __val = (*__last); _RandomAccessIterator __next = __last; --__next; while (__comp(__val, *__next)) { *__last = (*__next); __last = __next; --__next; } *__last = (__val); } template<typename _RandomAccessIterator> void __insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { if (__first == __last) return; for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) { if (*__i < *__first) { typename iterator_traits<_RandomAccessIterator>::value_type __val = (*__i); std::copy_backward(__first, __i, __i + 1); *__first = (__val); } else std::__unguarded_linear_insert(__i); } } template<typename _RandomAccessIterator, typename _Compare> void __insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { if (__first == __last) return; for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) { if (__comp(*__i, *__first)) { typename iterator_traits<_RandomAccessIterator>::value_type __val = (*__i); std::copy_backward(__first, __i, __i + 1); *__first = (__val); } else std::__unguarded_linear_insert(__i, __comp); } } template<typename _RandomAccessIterator> inline void __unguarded_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; for (_RandomAccessIterator __i = __first; __i != __last; ++__i) std::__unguarded_linear_insert(__i); } template<typename _RandomAccessIterator, typename _Compare> inline void __unguarded_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; for (_RandomAccessIterator __i = __first; __i != __last; ++__i) std::__unguarded_linear_insert(__i, __comp); } enum { _S_threshold = 16 }; template<typename _RandomAccessIterator> void __final_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { if (__last - __first > int(_S_threshold)) { std::__insertion_sort(__first, __first + int(_S_threshold)); std::__unguarded_insertion_sort(__first + int(_S_threshold), __last); } else std::__insertion_sort(__first, __last); } template<typename _RandomAccessIterator, typename _Compare> void __final_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { if (__last - __first > int(_S_threshold)) { std::__insertion_sort(__first, __first + int(_S_threshold), __comp); std::__unguarded_insertion_sort(__first + int(_S_threshold), __last, __comp); } else std::__insertion_sort(__first, __last, __comp); } template<typename _RandomAccessIterator, typename _Tp> _RandomAccessIterator __unguarded_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __pivot) { while (true) { while (*__first < __pivot) ++__first; --__last; while (__pivot < *__last) --__last; if (!(__first < __last)) return __first; std::iter_swap(__first, __last); ++__first; } } template<typename _RandomAccessIterator, typename _Tp, typename _Compare> _RandomAccessIterator __unguarded_partition(_RandomAccessIterator __first, _RandomAccessIterator __last, const _Tp& __pivot, _Compare __comp) { while (true) { while (__comp(*__first, __pivot)) ++__first; --__last; while (__comp(__pivot, *__last)) --__last; if (!(__first < __last)) return __first; std::iter_swap(__first, __last); ++__first; } } template<typename _RandomAccessIterator> inline _RandomAccessIterator __unguarded_partition_pivot(_RandomAccessIterator __first, _RandomAccessIterator __last) { _RandomAccessIterator __mid = __first + (__last - __first) / 2; std::__move_median_first(__first, __mid, (__last - 1)); return std::__unguarded_partition(__first + 1, __last, *__first); } template<typename _RandomAccessIterator, typename _Compare> inline _RandomAccessIterator __unguarded_partition_pivot(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { _RandomAccessIterator __mid = __first + (__last - __first) / 2; std::__move_median_first(__first, __mid, (__last - 1), __comp); return std::__unguarded_partition(__first + 1, __last, *__first, __comp); } template<typename _RandomAccessIterator, typename _Size> void __introsort_loop(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit) { while (__last - __first > int(_S_threshold)) { if (__depth_limit == 0) { std::partial_sort(__first, __last, __last); return; } --__depth_limit; _RandomAccessIterator __cut = std::__unguarded_partition_pivot(__first, __last); std::__introsort_loop(__cut, __last, __depth_limit); __last = __cut; } } template<typename _RandomAccessIterator, typename _Size, typename _Compare> void __introsort_loop(_RandomAccessIterator __first, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) { while (__last - __first > int(_S_threshold)) { if (__depth_limit == 0) { std::partial_sort(__first, __last, __last, __comp); return; } --__depth_limit; _RandomAccessIterator __cut = std::__unguarded_partition_pivot(__first, __last, __comp); std::__introsort_loop(__cut, __last, __depth_limit, __comp); __last = __cut; } } template<typename _RandomAccessIterator, typename _Size> void __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; while (__last - __first > 3) { if (__depth_limit == 0) { std::__heap_select(__first, __nth + 1, __last); std::iter_swap(__first, __nth); return; } --__depth_limit; _RandomAccessIterator __cut = std::__unguarded_partition_pivot(__first, __last); if (__cut <= __nth) __first = __cut; else __last = __cut; } std::__insertion_sort(__first, __last); } template<typename _RandomAccessIterator, typename _Size, typename _Compare> void __introselect(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Size __depth_limit, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; while (__last - __first > 3) { if (__depth_limit == 0) { std::__heap_select(__first, __nth + 1, __last, __comp); std::iter_swap(__first, __nth); return; } --__depth_limit; _RandomAccessIterator __cut = std::__unguarded_partition_pivot(__first, __last, __comp); if (__cut <= __nth) __first = __cut; else __last = __cut; } std::__insertion_sort(__first, __last, __comp); } # 2448 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp, typename _Compare> _ForwardIterator lower_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; typedef typename iterator_traits<_ForwardIterator>::difference_type _DistanceType; ; _DistanceType __len = std::distance(__first, __last); while (__len > 0) { _DistanceType __half = __len >> 1; _ForwardIterator __middle = __first; std::advance(__middle, __half); if (__comp(*__middle, __val)) { __first = __middle; ++__first; __len = __len - __half - 1; } else __len = __half; } return __first; } # 2495 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp> _ForwardIterator upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; typedef typename iterator_traits<_ForwardIterator>::difference_type _DistanceType; ; _DistanceType __len = std::distance(__first, __last); while (__len > 0) { _DistanceType __half = __len >> 1; _ForwardIterator __middle = __first; std::advance(__middle, __half); if (__val < *__middle) __len = __half; else { __first = __middle; ++__first; __len = __len - __half - 1; } } return __first; } # 2544 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp, typename _Compare> _ForwardIterator upper_bound(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; typedef typename iterator_traits<_ForwardIterator>::difference_type _DistanceType; ; _DistanceType __len = std::distance(__first, __last); while (__len > 0) { _DistanceType __half = __len >> 1; _ForwardIterator __middle = __first; std::advance(__middle, __half); if (__comp(__val, *__middle)) __len = __half; else { __first = __middle; ++__first; __len = __len - __half - 1; } } return __first; } # 2597 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp> pair<_ForwardIterator, _ForwardIterator> equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; typedef typename iterator_traits<_ForwardIterator>::difference_type _DistanceType; ; ; _DistanceType __len = std::distance(__first, __last); while (__len > 0) { _DistanceType __half = __len >> 1; _ForwardIterator __middle = __first; std::advance(__middle, __half); if (*__middle < __val) { __first = __middle; ++__first; __len = __len - __half - 1; } else if (__val < *__middle) __len = __half; else { _ForwardIterator __left = std::lower_bound(__first, __middle, __val); std::advance(__first, __len); _ForwardIterator __right = std::upper_bound(++__middle, __first, __val); return pair<_ForwardIterator, _ForwardIterator>(__left, __right); } } return pair<_ForwardIterator, _ForwardIterator>(__first, __first); } # 2659 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp, typename _Compare> pair<_ForwardIterator, _ForwardIterator> equal_range(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; typedef typename iterator_traits<_ForwardIterator>::difference_type _DistanceType; ; ; _DistanceType __len = std::distance(__first, __last); while (__len > 0) { _DistanceType __half = __len >> 1; _ForwardIterator __middle = __first; std::advance(__middle, __half); if (__comp(*__middle, __val)) { __first = __middle; ++__first; __len = __len - __half - 1; } else if (__comp(__val, *__middle)) __len = __half; else { _ForwardIterator __left = std::lower_bound(__first, __middle, __val, __comp); std::advance(__first, __len); _ForwardIterator __right = std::upper_bound(++__middle, __first, __val, __comp); return pair<_ForwardIterator, _ForwardIterator>(__left, __right); } } return pair<_ForwardIterator, _ForwardIterator>(__first, __first); } # 2720 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp> bool binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; ; ; _ForwardIterator __i = std::lower_bound(__first, __last, __val); return __i != __last && !(__val < *__i); } # 2753 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp, typename _Compare> bool binary_search(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __val, _Compare __comp) { typedef typename iterator_traits<_ForwardIterator>::value_type _ValueType; ; ; _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp); return __i != __last && !bool(__comp(__val, *__i)); } template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator> void __move_merge_adaptive(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) { while (__first1 != __last1 && __first2 != __last2) { if (*__first2 < *__first1) { *__result = (*__first2); ++__first2; } else { *__result = (*__first1); ++__first1; } ++__result; } if (__first1 != __last1) std::copy(__first1, __last1, __result); } template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare> void __move_merge_adaptive(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) { while (__first1 != __last1 && __first2 != __last2) { if (__comp(*__first2, *__first1)) { *__result = (*__first2); ++__first2; } else { *__result = (*__first1); ++__first1; } ++__result; } if (__first1 != __last1) std::copy(__first1, __last1, __result); } template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, typename _BidirectionalIterator3> void __move_merge_adaptive_backward(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result) { if (__first1 == __last1) { std::copy_backward(__first2, __last2, __result); return; } else if (__first2 == __last2) return; --__last1; --__last2; while (true) { if (*__last2 < *__last1) { *--__result = (*__last1); if (__first1 == __last1) { std::copy_backward(__first2, ++__last2, __result); return; } --__last1; } else { *--__result = (*__last2); if (__first2 == __last2) return; --__last2; } } } template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, typename _BidirectionalIterator3, typename _Compare> void __move_merge_adaptive_backward(_BidirectionalIterator1 __first1, _BidirectionalIterator1 __last1, _BidirectionalIterator2 __first2, _BidirectionalIterator2 __last2, _BidirectionalIterator3 __result, _Compare __comp) { if (__first1 == __last1) { std::copy_backward(__first2, __last2, __result); return; } else if (__first2 == __last2) return; --__last1; --__last2; while (true) { if (__comp(*__last2, *__last1)) { *--__result = (*__last1); if (__first1 == __last1) { std::copy_backward(__first2, ++__last2, __result); return; } --__last1; } else { *--__result = (*__last2); if (__first2 == __last2) return; --__last2; } } } template<typename _BidirectionalIterator1, typename _BidirectionalIterator2, typename _Distance> _BidirectionalIterator1 __rotate_adaptive(_BidirectionalIterator1 __first, _BidirectionalIterator1 __middle, _BidirectionalIterator1 __last, _Distance __len1, _Distance __len2, _BidirectionalIterator2 __buffer, _Distance __buffer_size) { _BidirectionalIterator2 __buffer_end; if (__len1 > __len2 && __len2 <= __buffer_size) { if (__len2) { __buffer_end = std::copy(__middle, __last, __buffer); std::copy_backward(__first, __middle, __last); return std::copy(__buffer, __buffer_end, __first); } else return __first; } else if (__len1 <= __buffer_size) { if (__len1) { __buffer_end = std::copy(__first, __middle, __buffer); std::copy(__middle, __last, __first); return std::copy_backward(__buffer, __buffer_end, __last); } else return __last; } else { std::rotate(__first, __middle, __last); std::advance(__first, std::distance(__middle, __last)); return __first; } } template<typename _BidirectionalIterator, typename _Distance, typename _Pointer> void __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size) { if (__len1 <= __len2 && __len1 <= __buffer_size) { _Pointer __buffer_end = std::copy(__first, __middle, __buffer); std::__move_merge_adaptive(__buffer, __buffer_end, __middle, __last, __first); } else if (__len2 <= __buffer_size) { _Pointer __buffer_end = std::copy(__middle, __last, __buffer); std::__move_merge_adaptive_backward(__first, __middle, __buffer, __buffer_end, __last); } else { _BidirectionalIterator __first_cut = __first; _BidirectionalIterator __second_cut = __middle; _Distance __len11 = 0; _Distance __len22 = 0; if (__len1 > __len2) { __len11 = __len1 / 2; std::advance(__first_cut, __len11); __second_cut = std::lower_bound(__middle, __last, *__first_cut); __len22 = std::distance(__middle, __second_cut); } else { __len22 = __len2 / 2; std::advance(__second_cut, __len22); __first_cut = std::upper_bound(__first, __middle, *__second_cut); __len11 = std::distance(__first, __first_cut); } _BidirectionalIterator __new_middle = std::__rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11, __len22, __buffer, __buffer_size); std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, __len22, __buffer, __buffer_size); std::__merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11, __len2 - __len22, __buffer, __buffer_size); } } template<typename _BidirectionalIterator, typename _Distance, typename _Pointer, typename _Compare> void __merge_adaptive(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) { if (__len1 <= __len2 && __len1 <= __buffer_size) { _Pointer __buffer_end = std::copy(__first, __middle, __buffer); std::__move_merge_adaptive(__buffer, __buffer_end, __middle, __last, __first, __comp); } else if (__len2 <= __buffer_size) { _Pointer __buffer_end = std::copy(__middle, __last, __buffer); std::__move_merge_adaptive_backward(__first, __middle, __buffer, __buffer_end, __last, __comp); } else { _BidirectionalIterator __first_cut = __first; _BidirectionalIterator __second_cut = __middle; _Distance __len11 = 0; _Distance __len22 = 0; if (__len1 > __len2) { __len11 = __len1 / 2; std::advance(__first_cut, __len11); __second_cut = std::lower_bound(__middle, __last, *__first_cut, __comp); __len22 = std::distance(__middle, __second_cut); } else { __len22 = __len2 / 2; std::advance(__second_cut, __len22); __first_cut = std::upper_bound(__first, __middle, *__second_cut, __comp); __len11 = std::distance(__first, __first_cut); } _BidirectionalIterator __new_middle = std::__rotate_adaptive(__first_cut, __middle, __second_cut, __len1 - __len11, __len22, __buffer, __buffer_size); std::__merge_adaptive(__first, __first_cut, __new_middle, __len11, __len22, __buffer, __buffer_size, __comp); std::__merge_adaptive(__new_middle, __second_cut, __last, __len1 - __len11, __len2 - __len22, __buffer, __buffer_size, __comp); } } template<typename _BidirectionalIterator, typename _Distance> void __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2) { if (__len1 == 0 || __len2 == 0) return; if (__len1 + __len2 == 2) { if (*__middle < *__first) std::iter_swap(__first, __middle); return; } _BidirectionalIterator __first_cut = __first; _BidirectionalIterator __second_cut = __middle; _Distance __len11 = 0; _Distance __len22 = 0; if (__len1 > __len2) { __len11 = __len1 / 2; std::advance(__first_cut, __len11); __second_cut = std::lower_bound(__middle, __last, *__first_cut); __len22 = std::distance(__middle, __second_cut); } else { __len22 = __len2 / 2; std::advance(__second_cut, __len22); __first_cut = std::upper_bound(__first, __middle, *__second_cut); __len11 = std::distance(__first, __first_cut); } std::rotate(__first_cut, __middle, __second_cut); _BidirectionalIterator __new_middle = __first_cut; std::advance(__new_middle, std::distance(__middle, __second_cut)); std::__merge_without_buffer(__first, __first_cut, __new_middle, __len11, __len22); std::__merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11, __len2 - __len22); } template<typename _BidirectionalIterator, typename _Distance, typename _Compare> void __merge_without_buffer(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Distance __len1, _Distance __len2, _Compare __comp) { if (__len1 == 0 || __len2 == 0) return; if (__len1 + __len2 == 2) { if (__comp(*__middle, *__first)) std::iter_swap(__first, __middle); return; } _BidirectionalIterator __first_cut = __first; _BidirectionalIterator __second_cut = __middle; _Distance __len11 = 0; _Distance __len22 = 0; if (__len1 > __len2) { __len11 = __len1 / 2; std::advance(__first_cut, __len11); __second_cut = std::lower_bound(__middle, __last, *__first_cut, __comp); __len22 = std::distance(__middle, __second_cut); } else { __len22 = __len2 / 2; std::advance(__second_cut, __len22); __first_cut = std::upper_bound(__first, __middle, *__second_cut, __comp); __len11 = std::distance(__first, __first_cut); } std::rotate(__first_cut, __middle, __second_cut); _BidirectionalIterator __new_middle = __first_cut; std::advance(__new_middle, std::distance(__middle, __second_cut)); std::__merge_without_buffer(__first, __first_cut, __new_middle, __len11, __len22, __comp); std::__merge_without_buffer(__new_middle, __second_cut, __last, __len1 - __len11, __len2 - __len22, __comp); } # 3177 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator> void inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last) { typedef typename iterator_traits<_BidirectionalIterator>::value_type _ValueType; typedef typename iterator_traits<_BidirectionalIterator>::difference_type _DistanceType; ; ; if (__first == __middle || __middle == __last) return; _DistanceType __len1 = std::distance(__first, __middle); _DistanceType __len2 = std::distance(__middle, __last); _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, __last); if (__buf.begin() == 0) std::__merge_without_buffer(__first, __middle, __last, __len1, __len2); else std::__merge_adaptive(__first, __middle, __last, __len1, __len2, __buf.begin(), _DistanceType(__buf.size())); } # 3232 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator, typename _Compare> void inplace_merge(_BidirectionalIterator __first, _BidirectionalIterator __middle, _BidirectionalIterator __last, _Compare __comp) { typedef typename iterator_traits<_BidirectionalIterator>::value_type _ValueType; typedef typename iterator_traits<_BidirectionalIterator>::difference_type _DistanceType; ; ; if (__first == __middle || __middle == __last) return; const _DistanceType __len1 = std::distance(__first, __middle); const _DistanceType __len2 = std::distance(__middle, __last); _Temporary_buffer<_BidirectionalIterator, _ValueType> __buf(__first, __last); if (__buf.begin() == 0) std::__merge_without_buffer(__first, __middle, __last, __len1, __len2, __comp); else std::__merge_adaptive(__first, __middle, __last, __len1, __len2, __buf.begin(), _DistanceType(__buf.size()), __comp); } template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator> _OutputIterator __move_merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) { while (__first1 != __last1 && __first2 != __last2) { if (*__first2 < *__first1) { *__result = (*__first2); ++__first2; } else { *__result = (*__first1); ++__first1; } ++__result; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)) ; } template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare> _OutputIterator __move_merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) { while (__first1 != __last1 && __first2 != __last2) { if (__comp(*__first2, *__first1)) { *__result = (*__first2); ++__first2; } else { *__result = (*__first1); ++__first1; } ++__result; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)) ; } template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Distance> void __merge_sort_loop(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size) { const _Distance __two_step = 2 * __step_size; while (__last - __first >= __two_step) { __result = std::__move_merge(__first, __first + __step_size, __first + __step_size, __first + __two_step, __result); __first += __two_step; } __step_size = std::min(_Distance(__last - __first), __step_size); std::__move_merge(__first, __first + __step_size, __first + __step_size, __last, __result); } template<typename _RandomAccessIterator1, typename _RandomAccessIterator2, typename _Distance, typename _Compare> void __merge_sort_loop(_RandomAccessIterator1 __first, _RandomAccessIterator1 __last, _RandomAccessIterator2 __result, _Distance __step_size, _Compare __comp) { const _Distance __two_step = 2 * __step_size; while (__last - __first >= __two_step) { __result = std::__move_merge(__first, __first + __step_size, __first + __step_size, __first + __two_step, __result, __comp); __first += __two_step; } __step_size = std::min(_Distance(__last - __first), __step_size); std::__move_merge(__first,__first + __step_size, __first + __step_size, __last, __result, __comp); } template<typename _RandomAccessIterator, typename _Distance> void __chunk_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size) { while (__last - __first >= __chunk_size) { std::__insertion_sort(__first, __first + __chunk_size); __first += __chunk_size; } std::__insertion_sort(__first, __last); } template<typename _RandomAccessIterator, typename _Distance, typename _Compare> void __chunk_insertion_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance __chunk_size, _Compare __comp) { while (__last - __first >= __chunk_size) { std::__insertion_sort(__first, __first + __chunk_size, __comp); __first += __chunk_size; } std::__insertion_sort(__first, __last, __comp); } enum { _S_chunk_size = 7 }; template<typename _RandomAccessIterator, typename _Pointer> void __merge_sort_with_buffer(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer) { typedef typename iterator_traits<_RandomAccessIterator>::difference_type _Distance; const _Distance __len = __last - __first; const _Pointer __buffer_last = __buffer + __len; _Distance __step_size = _S_chunk_size; std::__chunk_insertion_sort(__first, __last, __step_size); while (__step_size < __len) { std::__merge_sort_loop(__first, __last, __buffer, __step_size); __step_size *= 2; std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size); __step_size *= 2; } } template<typename _RandomAccessIterator, typename _Pointer, typename _Compare> void __merge_sort_with_buffer(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::difference_type _Distance; const _Distance __len = __last - __first; const _Pointer __buffer_last = __buffer + __len; _Distance __step_size = _S_chunk_size; std::__chunk_insertion_sort(__first, __last, __step_size, __comp); while (__step_size < __len) { std::__merge_sort_loop(__first, __last, __buffer, __step_size, __comp); __step_size *= 2; std::__merge_sort_loop(__buffer, __buffer_last, __first, __step_size, __comp); __step_size *= 2; } } template<typename _RandomAccessIterator, typename _Pointer, typename _Distance> void __stable_sort_adaptive(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size) { const _Distance __len = (__last - __first + 1) / 2; const _RandomAccessIterator __middle = __first + __len; if (__len > __buffer_size) { std::__stable_sort_adaptive(__first, __middle, __buffer, __buffer_size); std::__stable_sort_adaptive(__middle, __last, __buffer, __buffer_size); } else { std::__merge_sort_with_buffer(__first, __middle, __buffer); std::__merge_sort_with_buffer(__middle, __last, __buffer); } std::__merge_adaptive(__first, __middle, __last, _Distance(__middle - __first), _Distance(__last - __middle), __buffer, __buffer_size); } template<typename _RandomAccessIterator, typename _Pointer, typename _Distance, typename _Compare> void __stable_sort_adaptive(_RandomAccessIterator __first, _RandomAccessIterator __last, _Pointer __buffer, _Distance __buffer_size, _Compare __comp) { const _Distance __len = (__last - __first + 1) / 2; const _RandomAccessIterator __middle = __first + __len; if (__len > __buffer_size) { std::__stable_sort_adaptive(__first, __middle, __buffer, __buffer_size, __comp); std::__stable_sort_adaptive(__middle, __last, __buffer, __buffer_size, __comp); } else { std::__merge_sort_with_buffer(__first, __middle, __buffer, __comp); std::__merge_sort_with_buffer(__middle, __last, __buffer, __comp); } std::__merge_adaptive(__first, __middle, __last, _Distance(__middle - __first), _Distance(__last - __middle), __buffer, __buffer_size, __comp); } template<typename _RandomAccessIterator> void __inplace_stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { if (__last - __first < 15) { std::__insertion_sort(__first, __last); return; } _RandomAccessIterator __middle = __first + (__last - __first) / 2; std::__inplace_stable_sort(__first, __middle); std::__inplace_stable_sort(__middle, __last); std::__merge_without_buffer(__first, __middle, __last, __middle - __first, __last - __middle); } template<typename _RandomAccessIterator, typename _Compare> void __inplace_stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { if (__last - __first < 15) { std::__insertion_sort(__first, __last, __comp); return; } _RandomAccessIterator __middle = __first + (__last - __first) / 2; std::__inplace_stable_sort(__first, __middle, __comp); std::__inplace_stable_sort(__middle, __last, __comp); std::__merge_without_buffer(__first, __middle, __last, __middle - __first, __last - __middle, __comp); } # 3572 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2> bool includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (*__first2 < *__first1) return false; else if(*__first1 < *__first2) ++__first1; else ++__first1, ++__first2; return __first2 == __last2; } # 3622 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _Compare> bool includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _Compare __comp) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (__comp(*__first2, *__first1)) return false; else if(__comp(*__first1, *__first2)) ++__first1; else ++__first1, ++__first2; return __first2 == __last2; } # 3677 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator> bool next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) { ; if (__first == __last) return false; _BidirectionalIterator __i = __first; ++__i; if (__i == __last) return false; __i = __last; --__i; for(;;) { _BidirectionalIterator __ii = __i; --__i; if (*__i < *__ii) { _BidirectionalIterator __j = __last; while (!(*__i < *--__j)) {} std::iter_swap(__i, __j); std::reverse(__ii, __last); return true; } if (__i == __first) { std::reverse(__first, __last); return false; } } } # 3734 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator, typename _Compare> bool next_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { ; if (__first == __last) return false; _BidirectionalIterator __i = __first; ++__i; if (__i == __last) return false; __i = __last; --__i; for(;;) { _BidirectionalIterator __ii = __i; --__i; if (__comp(*__i, *__ii)) { _BidirectionalIterator __j = __last; while (!bool(__comp(*__i, *--__j))) {} std::iter_swap(__i, __j); std::reverse(__ii, __last); return true; } if (__i == __first) { std::reverse(__first, __last); return false; } } } # 3790 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator> bool prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last) { ; if (__first == __last) return false; _BidirectionalIterator __i = __first; ++__i; if (__i == __last) return false; __i = __last; --__i; for(;;) { _BidirectionalIterator __ii = __i; --__i; if (*__ii < *__i) { _BidirectionalIterator __j = __last; while (!(*--__j < *__i)) {} std::iter_swap(__i, __j); std::reverse(__ii, __last); return true; } if (__i == __first) { std::reverse(__first, __last); return false; } } } # 3847 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _BidirectionalIterator, typename _Compare> bool prev_permutation(_BidirectionalIterator __first, _BidirectionalIterator __last, _Compare __comp) { ; if (__first == __last) return false; _BidirectionalIterator __i = __first; ++__i; if (__i == __last) return false; __i = __last; --__i; for(;;) { _BidirectionalIterator __ii = __i; --__i; if (__comp(*__ii, *__i)) { _BidirectionalIterator __j = __last; while (!bool(__comp(*--__j, *__i))) {} std::iter_swap(__i, __j); std::reverse(__ii, __last); return true; } if (__i == __first) { std::reverse(__first, __last); return false; } } } # 3907 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _OutputIterator, typename _Tp> _OutputIterator replace_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, const _Tp& __old_value, const _Tp& __new_value) { ; for (; __first != __last; ++__first, ++__result) if (*__first == __old_value) *__result = __new_value; else *__result = *__first; return __result; } # 3944 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _OutputIterator, typename _Predicate, typename _Tp> _OutputIterator replace_copy_if(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _Predicate __pred, const _Tp& __new_value) { ; for (; __first != __last; ++__first, ++__result) if (__pred(*__first)) *__result = __new_value; else *__result = *__first; return __result; } # 4418 "/usr/include/c++/4.7/bits/stl_algo.h" 3 # 4434 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _Function> _Function for_each(_InputIterator __first, _InputIterator __last, _Function __f) { ; for (; __first != __last; ++__first) __f(*__first); return (__f); } # 4455 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _Tp> inline _InputIterator find(_InputIterator __first, _InputIterator __last, const _Tp& __val) { ; return std::__find(__first, __last, __val, std::__iterator_category(__first)); } # 4479 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _Predicate> inline _InputIterator find_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) { ; return std::__find_if(__first, __last, __pred, std::__iterator_category(__first)); } # 4509 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _ForwardIterator> _InputIterator find_first_of(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2) { ; ; for (; __first1 != __last1; ++__first1) for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) if (*__first1 == *__iter) return __first1; return __last1; } # 4549 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _ForwardIterator, typename _BinaryPredicate> _InputIterator find_first_of(_InputIterator __first1, _InputIterator __last1, _ForwardIterator __first2, _ForwardIterator __last2, _BinaryPredicate __comp) { ; ; for (; __first1 != __last1; ++__first1) for (_ForwardIterator __iter = __first2; __iter != __last2; ++__iter) if (__comp(*__first1, *__iter)) return __first1; return __last1; } # 4581 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator> _ForwardIterator adjacent_find(_ForwardIterator __first, _ForwardIterator __last) { ; if (__first == __last) return __last; _ForwardIterator __next = __first; while(++__next != __last) { if (*__first == *__next) return __first; __first = __next; } return __last; } # 4613 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _BinaryPredicate> _ForwardIterator adjacent_find(_ForwardIterator __first, _ForwardIterator __last, _BinaryPredicate __binary_pred) { ; if (__first == __last) return __last; _ForwardIterator __next = __first; while(++__next != __last) { if (__binary_pred(*__first, *__next)) return __first; __first = __next; } return __last; } # 4645 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _Tp> typename iterator_traits<_InputIterator>::difference_type count(_InputIterator __first, _InputIterator __last, const _Tp& __value) { ; typename iterator_traits<_InputIterator>::difference_type __n = 0; for (; __first != __last; ++__first) if (*__first == __value) ++__n; return __n; } # 4670 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _Predicate> typename iterator_traits<_InputIterator>::difference_type count_if(_InputIterator __first, _InputIterator __last, _Predicate __pred) { ; typename iterator_traits<_InputIterator>::difference_type __n = 0; for (; __first != __last; ++__first) if (__pred(*__first)) ++__n; return __n; } # 4712 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator1, typename _ForwardIterator2> _ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2) { ; ; if (__first1 == __last1 || __first2 == __last2) return __first1; _ForwardIterator2 __p1(__first2); if (++__p1 == __last2) return std::find(__first1, __last1, *__first2); _ForwardIterator2 __p; _ForwardIterator1 __current = __first1; for (;;) { __first1 = std::find(__first1, __last1, *__first2); if (__first1 == __last1) return __last1; __p = __p1; __current = __first1; if (++__current == __last1) return __last1; while (*__current == *__p) { if (++__p == __last2) return __first1; if (++__current == __last1) return __last1; } ++__first1; } return __first1; } # 4783 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator1, typename _ForwardIterator2, typename _BinaryPredicate> _ForwardIterator1 search(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterator2 __last2, _BinaryPredicate __predicate) { ; ; if (__first1 == __last1 || __first2 == __last2) return __first1; _ForwardIterator2 __p1(__first2); if (++__p1 == __last2) { while (__first1 != __last1 && !bool(__predicate(*__first1, *__first2))) ++__first1; return __first1; } _ForwardIterator2 __p; _ForwardIterator1 __current = __first1; for (;;) { while (__first1 != __last1 && !bool(__predicate(*__first1, *__first2))) ++__first1; if (__first1 == __last1) return __last1; __p = __p1; __current = __first1; if (++__current == __last1) return __last1; while (__predicate(*__current, *__p)) { if (++__p == __last2) return __first1; if (++__current == __last1) return __last1; } ++__first1; } return __first1; } # 4858 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Integer, typename _Tp> _ForwardIterator search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val) { ; if (__count <= 0) return __first; if (__count == 1) return std::find(__first, __last, __val); return std::__search_n(__first, __last, __count, __val, std::__iterator_category(__first)); } # 4895 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Integer, typename _Tp, typename _BinaryPredicate> _ForwardIterator search_n(_ForwardIterator __first, _ForwardIterator __last, _Integer __count, const _Tp& __val, _BinaryPredicate __binary_pred) { ; if (__count <= 0) return __first; if (__count == 1) { while (__first != __last && !bool(__binary_pred(*__first, __val))) ++__first; return __first; } return std::__search_n(__first, __last, __count, __val, __binary_pred, std::__iterator_category(__first)); } # 4937 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _OutputIterator, typename _UnaryOperation> _OutputIterator transform(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _UnaryOperation __unary_op) { ; for (; __first != __last; ++__first, ++__result) *__result = __unary_op(*__first); return __result; } # 4974 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _BinaryOperation> _OutputIterator transform(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _OutputIterator __result, _BinaryOperation __binary_op) { ; for (; __first1 != __last1; ++__first1, ++__first2, ++__result) *__result = __binary_op(*__first1, *__first2); return __result; } # 5007 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Tp> void replace(_ForwardIterator __first, _ForwardIterator __last, const _Tp& __old_value, const _Tp& __new_value) { ; for (; __first != __last; ++__first) if (*__first == __old_value) *__first = __new_value; } # 5039 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Predicate, typename _Tp> void replace_if(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred, const _Tp& __new_value) { ; for (; __first != __last; ++__first) if (__pred(*__first)) *__first = __new_value; } # 5071 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Generator> void generate(_ForwardIterator __first, _ForwardIterator __last, _Generator __gen) { ; for (; __first != __last; ++__first) *__first = __gen(); } # 5102 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _OutputIterator, typename _Size, typename _Generator> _OutputIterator generate_n(_OutputIterator __first, _Size __n, _Generator __gen) { for (__decltype(__n + 0) __niter = __n; __niter > 0; --__niter, ++__first) *__first = __gen(); return __first; } # 5139 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _OutputIterator> inline _OutputIterator unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result) { ; if (__first == __last) return __result; return std::__unique_copy(__first, __last, __result, std::__iterator_category(__first), std::__iterator_category(__result)); } # 5178 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator, typename _OutputIterator, typename _BinaryPredicate> inline _OutputIterator unique_copy(_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryPredicate __binary_pred) { ; if (__first == __last) return __result; return std::__unique_copy(__first, __last, __result, __binary_pred, std::__iterator_category(__first), std::__iterator_category(__result)); } # 5210 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator> inline void random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) { ; if (__first != __last) for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) std::iter_swap(__i, __first + (std::rand() % ((__i - __first) + 1))); } # 5238 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator, typename _RandomNumberGenerator> void random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last, _RandomNumberGenerator& __rand) { ; if (__first == __last) return; for (_RandomAccessIterator __i = __first + 1; __i != __last; ++__i) std::iter_swap(__i, __first + __rand((__i - __first) + 1)); } # 5274 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Predicate> inline _ForwardIterator partition(_ForwardIterator __first, _ForwardIterator __last, _Predicate __pred) { ; return std::__partition(__first, __last, __pred, std::__iterator_category(__first)); } # 5308 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator> inline void partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; ; ; std::__heap_select(__first, __middle, __last); std::sort_heap(__first, __middle); } # 5347 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator, typename _Compare> inline void partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; ; ; std::__heap_select(__first, __middle, __last, __comp); std::sort_heap(__first, __middle, __comp); } # 5384 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator> inline void nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; ; ; if (__first == __last || __nth == __last) return; std::__introselect(__first, __nth, __last, std::__lg(__last - __first) * 2); } # 5423 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator, typename _Compare> inline void nth_element(_RandomAccessIterator __first, _RandomAccessIterator __nth, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; ; ; if (__first == __last || __nth == __last) return; std::__introselect(__first, __nth, __last, std::__lg(__last - __first) * 2, __comp); } # 5461 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator> inline void sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; ; if (__first != __last) { std::__introsort_loop(__first, __last, std::__lg(__last - __first) * 2); std::__final_insertion_sort(__first, __last); } } # 5497 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator, typename _Compare> inline void sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; ; if (__first != __last) { std::__introsort_loop(__first, __last, std::__lg(__last - __first) * 2, __comp); std::__final_insertion_sort(__first, __last, __comp); } } # 5539 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator> _OutputIterator merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) { if (*__first2 < *__first1) { *__result = *__first2; ++__first2; } else { *__result = *__first1; ++__first1; } ++__result; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)); } # 5603 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare> _OutputIterator merge(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) { if (__comp(*__first2, *__first1)) { *__result = *__first2; ++__first2; } else { *__result = *__first1; ++__first1; } ++__result; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)); } # 5663 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator> inline void stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, __last); if (__buf.begin() == 0) std::__inplace_stable_sort(__first, __last); else std::__stable_sort_adaptive(__first, __last, __buf.begin(), _DistanceType(__buf.size())); } # 5705 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _RandomAccessIterator, typename _Compare> inline void stable_sort(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare __comp) { typedef typename iterator_traits<_RandomAccessIterator>::value_type _ValueType; typedef typename iterator_traits<_RandomAccessIterator>::difference_type _DistanceType; ; _Temporary_buffer<_RandomAccessIterator, _ValueType> __buf(__first, __last); if (__buf.begin() == 0) std::__inplace_stable_sort(__first, __last, __comp); else std::__stable_sort_adaptive(__first, __last, __buf.begin(), _DistanceType(__buf.size()), __comp); } # 5751 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator> _OutputIterator set_union(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) { if (*__first1 < *__first2) { *__result = *__first1; ++__first1; } else if (*__first2 < *__first1) { *__result = *__first2; ++__first2; } else { *__result = *__first1; ++__first1; ++__first2; } ++__result; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)); } # 5818 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare> _OutputIterator set_union(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) { if (__comp(*__first1, *__first2)) { *__result = *__first1; ++__first1; } else if (__comp(*__first2, *__first1)) { *__result = *__first2; ++__first2; } else { *__result = *__first1; ++__first1; ++__first2; } ++__result; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)); } # 5885 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator> _OutputIterator set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (*__first1 < *__first2) ++__first1; else if (*__first2 < *__first1) ++__first2; else { *__result = *__first1; ++__first1; ++__first2; ++__result; } return __result; } # 5942 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare> _OutputIterator set_intersection(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (__comp(*__first1, *__first2)) ++__first1; else if (__comp(*__first2, *__first1)) ++__first2; else { *__result = *__first1; ++__first1; ++__first2; ++__result; } return __result; } # 6000 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator> _OutputIterator set_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (*__first1 < *__first2) { *__result = *__first1; ++__first1; ++__result; } else if (*__first2 < *__first1) ++__first2; else { ++__first1; ++__first2; } return std::copy(__first1, __last1, __result); } # 6061 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare> _OutputIterator set_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (__comp(*__first1, *__first2)) { *__result = *__first1; ++__first1; ++__result; } else if (__comp(*__first2, *__first1)) ++__first2; else { ++__first1; ++__first2; } return std::copy(__first1, __last1, __result); } # 6119 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator> _OutputIterator set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (*__first1 < *__first2) { *__result = *__first1; ++__first1; ++__result; } else if (*__first2 < *__first1) { *__result = *__first2; ++__first2; ++__result; } else { ++__first1; ++__first2; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)); } # 6185 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _InputIterator1, typename _InputIterator2, typename _OutputIterator, typename _Compare> _OutputIterator set_symmetric_difference(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __last2, _OutputIterator __result, _Compare __comp) { typedef typename iterator_traits<_InputIterator1>::value_type _ValueType1; typedef typename iterator_traits<_InputIterator2>::value_type _ValueType2; ; ; while (__first1 != __last1 && __first2 != __last2) if (__comp(*__first1, *__first2)) { *__result = *__first1; ++__first1; ++__result; } else if (__comp(*__first2, *__first1)) { *__result = *__first2; ++__first2; ++__result; } else { ++__first1; ++__first2; } return std::copy(__first2, __last2, std::copy(__first1, __last1, __result)); } # 6242 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator> _ForwardIterator min_element(_ForwardIterator __first, _ForwardIterator __last) { ; if (__first == __last) return __first; _ForwardIterator __result = __first; while (++__first != __last) if (*__first < *__result) __result = __first; return __result; } # 6270 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Compare> _ForwardIterator min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { ; if (__first == __last) return __first; _ForwardIterator __result = __first; while (++__first != __last) if (__comp(*__first, *__result)) __result = __first; return __result; } # 6298 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator> _ForwardIterator max_element(_ForwardIterator __first, _ForwardIterator __last) { ; if (__first == __last) return __first; _ForwardIterator __result = __first; while (++__first != __last) if (*__result < *__first) __result = __first; return __result; } # 6326 "/usr/include/c++/4.7/bits/stl_algo.h" 3 template<typename _ForwardIterator, typename _Compare> _ForwardIterator max_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { ; if (__first == __last) return __first; _ForwardIterator __result = __first; while (++__first != __last) if (__comp(*__result, *__first)) __result = __first; return __result; } } # 64 "/usr/include/c++/4.7/algorithm" 2 3 # 289 "eigen-3.3.7/Eigen/Core" 2 # 306 "eigen-3.3.7/Eigen/Core" namespace Eigen { inline static const char *SimdInstructionSetsInUse(void) { # 332 "eigen-3.3.7/Eigen/Core" return "None"; } } namespace Eigen { using std::size_t; using std::ptrdiff_t; } # 363 "eigen-3.3.7/Eigen/Core" # 1 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" namespace Eigen { const int Dynamic = -1; const int DynamicIndex = 0xffffff; const int Infinity = -1; const int HugeCost = 10000; # 61 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int RowMajorBit = 0x1; const unsigned int EvalBeforeNestingBit = 0x2; __attribute__((deprecated)) const unsigned int EvalBeforeAssigningBit = 0x4; # 89 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int PacketAccessBit = 0x8; # 102 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int ActualPacketAccessBit = 0x0; # 125 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int LinearAccessBit = 0x10; # 139 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int LvalueBit = 0x20; # 150 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int DirectAccessBit = 0x40; # 162 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" __attribute__((deprecated)) const unsigned int AlignedBit = 0x80; const unsigned int NestByRefBit = 0x100; # 173 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int NoPreferredStorageOrderBit = 0x200; # 186 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" const unsigned int CompressedAccessBit = 0x400; const unsigned int HereditaryBits = RowMajorBit | EvalBeforeNestingBit; # 202 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" enum UpLoType { Lower=0x1, Upper=0x2, UnitDiag=0x4, ZeroDiag=0x8, UnitLower=UnitDiag|Lower, UnitUpper=UnitDiag|Upper, StrictlyLower=ZeroDiag|Lower, StrictlyUpper=ZeroDiag|Upper, SelfAdjoint=0x10, Symmetric=0x20 }; enum AlignmentType { Unaligned=0, Aligned8=8, Aligned16=16, Aligned32=32, Aligned64=64, Aligned128=128, AlignedMask=255, Aligned=16, AlignedMax = Aligned16 }; enum CornerType { TopLeft, TopRight, BottomLeft, BottomRight }; enum DirectionType { Vertical, Horizontal, BothDirections }; enum TraversalType { DefaultTraversal, LinearTraversal, InnerVectorizedTraversal, LinearVectorizedTraversal, SliceVectorizedTraversal, InvalidTraversal, AllAtOnceTraversal }; enum UnrollingType { NoUnrolling, InnerUnrolling, CompleteUnrolling }; enum SpecializedType { Specialized, BuiltIn }; enum StorageOptions { ColMajor = 0, RowMajor = 0x1, AutoAlign = 0, DontAlign = 0x2 }; enum SideType { OnTheLeft = 1, OnTheRight = 2 }; # 350 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" enum NoChange_t { NoChange }; enum Sequential_t { Sequential }; enum Default_t { Default }; enum AmbiVectorMode { IsDense = 0, IsSparse }; enum AccessorLevels { ReadOnlyAccessors, WriteAccessors, DirectAccessors, DirectWriteAccessors }; enum DecompositionOptions { Pivoting = 0x01, NoPivoting = 0x02, ComputeFullU = 0x04, ComputeThinU = 0x08, ComputeFullV = 0x10, ComputeThinV = 0x20, EigenvaluesOnly = 0x40, ComputeEigenvectors = 0x80, EigVecMask = EigenvaluesOnly | ComputeEigenvectors, Ax_lBx = 0x100, ABx_lx = 0x200, BAx_lx = 0x400, GenEigMask = Ax_lBx | ABx_lx | BAx_lx }; enum QRPreconditioners { NoQRPreconditioner, HouseholderQRPreconditioner, ColPivHouseholderQRPreconditioner, FullPivHouseholderQRPreconditioner }; enum ComputationInfo { Success = 0, NumericalIssue = 1, NoConvergence = 2, InvalidInput = 3 }; enum TransformTraits { Isometry = 0x1, Affine = 0x2, AffineCompact = 0x10 | Affine, Projective = 0x20 }; namespace Architecture { enum Type { Generic = 0x0, SSE = 0x1, AltiVec = 0x2, VSX = 0x3, NEON = 0x4, # 476 "eigen-3.3.7/Eigen/src/Core/util/Constants.h" Target = Generic }; } enum ProductImplType { DefaultProduct=0, LazyProduct, AliasFreeProduct, CoeffBasedProductMode, LazyCoeffBasedProductMode, OuterProduct, InnerProduct, GemvProduct, GemmProduct }; enum Action {GetAction, SetAction}; struct Dense {}; struct Sparse {}; struct SolverStorage {}; struct PermutationStorage {}; struct TranspositionsStorage {}; struct MatrixXpr {}; struct ArrayXpr {}; struct DenseShape { static std::string debugName() { return "DenseShape"; } }; struct SolverShape { static std::string debugName() { return "SolverShape"; } }; struct HomogeneousShape { static std::string debugName() { return "HomogeneousShape"; } }; struct DiagonalShape { static std::string debugName() { return "DiagonalShape"; } }; struct BandShape { static std::string debugName() { return "BandShape"; } }; struct TriangularShape { static std::string debugName() { return "TriangularShape"; } }; struct SelfAdjointShape { static std::string debugName() { return "SelfAdjointShape"; } }; struct PermutationShape { static std::string debugName() { return "PermutationShape"; } }; struct TranspositionsShape { static std::string debugName() { return "TranspositionsShape"; } }; struct SparseShape { static std::string debugName() { return "SparseShape"; } }; namespace internal { struct IndexBased {}; struct IteratorBased {}; enum ComparisonName { cmp_EQ = 0, cmp_LT = 1, cmp_LE = 2, cmp_UNORD = 3, cmp_NEQ = 4, cmp_GT = 5, cmp_GE = 6 }; } } # 364 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/Meta.h" 1 # 23 "eigen-3.3.7/Eigen/src/Core/util/Meta.h" namespace Eigen { typedef std::ptrdiff_t DenseIndex; typedef std::ptrdiff_t Index; namespace internal { # 50 "eigen-3.3.7/Eigen/src/Core/util/Meta.h" typedef std::ptrdiff_t IntPtr; typedef std::size_t UIntPtr; struct true_type { enum { value = 1 }; }; struct false_type { enum { value = 0 }; }; template<bool Condition, typename Then, typename Else> struct conditional { typedef Then type; }; template<typename Then, typename Else> struct conditional <false, Then, Else> { typedef Else type; }; template<typename T, typename U> struct is_same { enum { value = 0 }; }; template<typename T> struct is_same<T,T> { enum { value = 1 }; }; template<typename T> struct remove_reference { typedef T type; }; template<typename T> struct remove_reference<T&> { typedef T type; }; template<typename T> struct remove_pointer { typedef T type; }; template<typename T> struct remove_pointer<T*> { typedef T type; }; template<typename T> struct remove_pointer<T*const> { typedef T type; }; template <class T> struct remove_const { typedef T type; }; template <class T> struct remove_const<const T> { typedef T type; }; template <class T> struct remove_const<const T[]> { typedef T type[]; }; template <class T, unsigned int Size> struct remove_const<const T[Size]> { typedef T type[Size]; }; template<typename T> struct remove_all { typedef T type; }; template<typename T> struct remove_all<const T> { typedef typename remove_all<T>::type type; }; template<typename T> struct remove_all<T const&> { typedef typename remove_all<T>::type type; }; template<typename T> struct remove_all<T&> { typedef typename remove_all<T>::type type; }; template<typename T> struct remove_all<T const*> { typedef typename remove_all<T>::type type; }; template<typename T> struct remove_all<T*> { typedef typename remove_all<T>::type type; }; template<typename T> struct is_arithmetic { enum { value = false }; }; template<> struct is_arithmetic<float> { enum { value = true }; }; template<> struct is_arithmetic<double> { enum { value = true }; }; template<> struct is_arithmetic<long double> { enum { value = true }; }; template<> struct is_arithmetic<bool> { enum { value = true }; }; template<> struct is_arithmetic<char> { enum { value = true }; }; template<> struct is_arithmetic<signed char> { enum { value = true }; }; template<> struct is_arithmetic<unsigned char> { enum { value = true }; }; template<> struct is_arithmetic<signed short> { enum { value = true }; }; template<> struct is_arithmetic<unsigned short>{ enum { value = true }; }; template<> struct is_arithmetic<signed int> { enum { value = true }; }; template<> struct is_arithmetic<unsigned int> { enum { value = true }; }; template<> struct is_arithmetic<signed long> { enum { value = true }; }; template<> struct is_arithmetic<unsigned long> { enum { value = true }; }; template<typename T> struct is_integral { enum { value = false }; }; template<> struct is_integral<bool> { enum { value = true }; }; template<> struct is_integral<char> { enum { value = true }; }; template<> struct is_integral<signed char> { enum { value = true }; }; template<> struct is_integral<unsigned char> { enum { value = true }; }; template<> struct is_integral<signed short> { enum { value = true }; }; template<> struct is_integral<unsigned short> { enum { value = true }; }; template<> struct is_integral<signed int> { enum { value = true }; }; template<> struct is_integral<unsigned int> { enum { value = true }; }; template<> struct is_integral<signed long> { enum { value = true }; }; template<> struct is_integral<unsigned long> { enum { value = true }; }; template<typename> struct make_unsigned; template<> struct make_unsigned<char> { typedef unsigned char type; }; template<> struct make_unsigned<signed char> { typedef unsigned char type; }; template<> struct make_unsigned<unsigned char> { typedef unsigned char type; }; template<> struct make_unsigned<signed short> { typedef unsigned short type; }; template<> struct make_unsigned<unsigned short> { typedef unsigned short type; }; template<> struct make_unsigned<signed int> { typedef unsigned int type; }; template<> struct make_unsigned<unsigned int> { typedef unsigned int type; }; template<> struct make_unsigned<signed long> { typedef unsigned long type; }; template<> struct make_unsigned<unsigned long> { typedef unsigned long type; }; template <typename T> struct add_const { typedef const T type; }; template <typename T> struct add_const<T&> { typedef T& type; }; template <typename T> struct is_const { enum { value = 0 }; }; template <typename T> struct is_const<T const> { enum { value = 1 }; }; template<typename T> struct add_const_on_value_type { typedef const T type; }; template<typename T> struct add_const_on_value_type<T&> { typedef T const& type; }; template<typename T> struct add_const_on_value_type<T*> { typedef T const* type; }; template<typename T> struct add_const_on_value_type<T* const> { typedef T const* const type; }; template<typename T> struct add_const_on_value_type<T const* const> { typedef T const* const type; }; template<typename From, typename To> struct is_convertible_impl { private: struct any_conversion { template <typename T> any_conversion(const volatile T&); template <typename T> any_conversion(T&); }; struct yes {int a[1];}; struct no {int a[2];}; static yes test(const To&, int); static no test(any_conversion, ...); public: static From ms_from; enum { value = sizeof(test(ms_from, 0))==sizeof(yes) }; }; template<typename From, typename To> struct is_convertible { enum { value = is_convertible_impl<typename remove_all<From>::type, typename remove_all<To >::type>::value }; }; template<bool Condition, typename T=void> struct enable_if; template<typename T> struct enable_if<true,T> { typedef T type; }; # 294 "eigen-3.3.7/Eigen/src/Core/util/Meta.h" class noncopyable { noncopyable(const noncopyable&); const noncopyable& operator=(const noncopyable&); protected: noncopyable() {} ~noncopyable() {} }; # 316 "eigen-3.3.7/Eigen/src/Core/util/Meta.h" template<typename T> struct result_of { }; struct has_none {int a[1];}; struct has_std_result_type {int a[2];}; struct has_tr1_result {int a[3];}; template<typename Func, typename ArgType, int SizeOf=sizeof(has_none)> struct unary_result_of_select {typedef typename internal::remove_all<ArgType>::type type;}; template<typename Func, typename ArgType> struct unary_result_of_select<Func, ArgType, sizeof(has_std_result_type)> {typedef typename Func::result_type type;}; template<typename Func, typename ArgType> struct unary_result_of_select<Func, ArgType, sizeof(has_tr1_result)> {typedef typename Func::template result<Func(ArgType)>::type type;}; template<typename Func, typename ArgType> struct result_of<Func(ArgType)> { template<typename T> static has_std_result_type testFunctor(T const *, typename T::result_type const * = 0); template<typename T> static has_tr1_result testFunctor(T const *, typename T::template result<T(ArgType)>::type const * = 0); static has_none testFunctor(...); enum {FunctorType = sizeof(testFunctor(static_cast<Func*>(0)))}; typedef typename unary_result_of_select<Func, ArgType, FunctorType>::type type; }; template<typename Func, typename ArgType0, typename ArgType1, int SizeOf=sizeof(has_none)> struct binary_result_of_select {typedef typename internal::remove_all<ArgType0>::type type;}; template<typename Func, typename ArgType0, typename ArgType1> struct binary_result_of_select<Func, ArgType0, ArgType1, sizeof(has_std_result_type)> {typedef typename Func::result_type type;}; template<typename Func, typename ArgType0, typename ArgType1> struct binary_result_of_select<Func, ArgType0, ArgType1, sizeof(has_tr1_result)> {typedef typename Func::template result<Func(ArgType0,ArgType1)>::type type;}; template<typename Func, typename ArgType0, typename ArgType1> struct result_of<Func(ArgType0,ArgType1)> { template<typename T> static has_std_result_type testFunctor(T const *, typename T::result_type const * = 0); template<typename T> static has_tr1_result testFunctor(T const *, typename T::template result<T(ArgType0,ArgType1)>::type const * = 0); static has_none testFunctor(...); enum {FunctorType = sizeof(testFunctor(static_cast<Func*>(0)))}; typedef typename binary_result_of_select<Func, ArgType0, ArgType1, FunctorType>::type type; }; template<typename Func, typename ArgType0, typename ArgType1, typename ArgType2, int SizeOf=sizeof(has_none)> struct ternary_result_of_select {typedef typename internal::remove_all<ArgType0>::type type;}; template<typename Func, typename ArgType0, typename ArgType1, typename ArgType2> struct ternary_result_of_select<Func, ArgType0, ArgType1, ArgType2, sizeof(has_std_result_type)> {typedef typename Func::result_type type;}; template<typename Func, typename ArgType0, typename ArgType1, typename ArgType2> struct ternary_result_of_select<Func, ArgType0, ArgType1, ArgType2, sizeof(has_tr1_result)> {typedef typename Func::template result<Func(ArgType0,ArgType1,ArgType2)>::type type;}; template<typename Func, typename ArgType0, typename ArgType1, typename ArgType2> struct result_of<Func(ArgType0,ArgType1,ArgType2)> { template<typename T> static has_std_result_type testFunctor(T const *, typename T::result_type const * = 0); template<typename T> static has_tr1_result testFunctor(T const *, typename T::template result<T(ArgType0,ArgType1,ArgType2)>::type const * = 0); static has_none testFunctor(...); enum {FunctorType = sizeof(testFunctor(static_cast<Func*>(0)))}; typedef typename ternary_result_of_select<Func, ArgType0, ArgType1, ArgType2, FunctorType>::type type; }; struct meta_yes { char a[1]; }; struct meta_no { char a[2]; }; template <typename T> struct has_ReturnType { template <typename C> static meta_yes testFunctor(typename C::ReturnType const *); template <typename C> static meta_no testFunctor(...); enum { value = sizeof(testFunctor<T>(0)) == sizeof(meta_yes) }; }; template<typename T> const T* return_ptr(); template <typename T, typename IndexType=Index> struct has_nullary_operator { template <typename C> static meta_yes testFunctor(C const *,typename enable_if<(sizeof(return_ptr<C>()->operator()())>0)>::type * = 0); static meta_no testFunctor(...); enum { value = sizeof(testFunctor(static_cast<T*>(0))) == sizeof(meta_yes) }; }; template <typename T, typename IndexType=Index> struct has_unary_operator { template <typename C> static meta_yes testFunctor(C const *,typename enable_if<(sizeof(return_ptr<C>()->operator()(IndexType(0)))>0)>::type * = 0); static meta_no testFunctor(...); enum { value = sizeof(testFunctor(static_cast<T*>(0))) == sizeof(meta_yes) }; }; template <typename T, typename IndexType=Index> struct has_binary_operator { template <typename C> static meta_yes testFunctor(C const *,typename enable_if<(sizeof(return_ptr<C>()->operator()(IndexType(0),IndexType(0)))>0)>::type * = 0); static meta_no testFunctor(...); enum { value = sizeof(testFunctor(static_cast<T*>(0))) == sizeof(meta_yes) }; }; template<int Y, int InfX = 0, int SupX = ((Y==1) ? 1 : Y/2), bool Done = ((SupX-InfX)<=1 ? true : ((SupX*SupX <= Y) && ((SupX+1)*(SupX+1) > Y))) > class meta_sqrt { enum { MidX = (InfX+SupX)/2, TakeInf = MidX*MidX > Y ? 1 : 0, NewInf = int(TakeInf) ? InfX : int(MidX), NewSup = int(TakeInf) ? int(MidX) : SupX }; public: enum { ret = meta_sqrt<Y,NewInf,NewSup>::ret }; }; template<int Y, int InfX, int SupX> class meta_sqrt<Y, InfX, SupX, true> { public: enum { ret = (SupX*SupX <= Y) ? SupX : InfX }; }; template<int A, int B, int K=1, bool Done = ((A*K)%B)==0> struct meta_least_common_multiple { enum { ret = meta_least_common_multiple<A,B,K+1>::ret }; }; template<int A, int B, int K> struct meta_least_common_multiple<A,B,K,true> { enum { ret = A*K }; }; template<typename T, typename U> struct scalar_product_traits { enum { Defined = 0 }; }; } namespace numext { template<typename T> inline void swap(T &a, T &b) { std::swap(a,b); } using std::numeric_limits; template<typename T> T div_ceil(const T &a, const T &b) { return (a+b-1) / b; } template<typename X, typename Y> inline bool equal_strict(const X& x,const Y& y) { return x == y; } template<> inline bool equal_strict(const float& x,const float& y) { return std::equal_to<float>()(x,y); } template<> inline bool equal_strict(const double& x,const double& y) { return std::equal_to<double>()(x,y); } template<typename X, typename Y> inline bool not_equal_strict(const X& x,const Y& y) { return x != y; } template<> inline bool not_equal_strict(const float& x,const float& y) { return std::not_equal_to<float>()(x,y); } template<> inline bool not_equal_strict(const double& x,const double& y) { return std::not_equal_to<double>()(x,y); } } } # 365 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/ForwardDeclarations.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/util/ForwardDeclarations.h" namespace Eigen { namespace internal { template<typename T> struct traits; template<typename T> struct traits<const T> : traits<T> {}; template<typename Derived> struct has_direct_access { enum { ret = (traits<Derived>::Flags & DirectAccessBit) ? 1 : 0 }; }; template<typename Derived> struct accessors_level { enum { has_direct_access = (traits<Derived>::Flags & DirectAccessBit) ? 1 : 0, has_write_access = (traits<Derived>::Flags & LvalueBit) ? 1 : 0, value = has_direct_access ? (has_write_access ? DirectWriteAccessors : DirectAccessors) : (has_write_access ? WriteAccessors : ReadOnlyAccessors) }; }; template<typename T> struct evaluator_traits; template< typename T> struct evaluator; } template<typename T> struct NumTraits; template<typename Derived> struct EigenBase; template<typename Derived> class DenseBase; template<typename Derived> class PlainObjectBase; template<typename Derived, int Level = internal::accessors_level<Derived>::value > class DenseCoeffsBase; template<typename _Scalar, int _Rows, int _Cols, int _Options = AutoAlign | # 68 "eigen-3.3.7/Eigen/src/Core/util/ForwardDeclarations.h" ( (_Rows==1 && _Cols!=1) ? Eigen::RowMajor : (_Cols==1 && _Rows!=1) ? Eigen::ColMajor : Eigen::ColMajor ), int _MaxRows = _Rows, int _MaxCols = _Cols > class Matrix; template<typename Derived> class MatrixBase; template<typename Derived> class ArrayBase; template<typename ExpressionType, unsigned int Added, unsigned int Removed> class Flagged; template<typename ExpressionType, template <typename> class StorageBase > class NoAlias; template<typename ExpressionType> class NestByValue; template<typename ExpressionType> class ForceAlignedAccess; template<typename ExpressionType> class SwapWrapper; template<typename XprType, int BlockRows=Dynamic, int BlockCols=Dynamic, bool InnerPanel = false> class Block; template<typename MatrixType, int Size=Dynamic> class VectorBlock; template<typename MatrixType> class Transpose; template<typename MatrixType> class Conjugate; template<typename NullaryOp, typename MatrixType> class CwiseNullaryOp; template<typename UnaryOp, typename MatrixType> class CwiseUnaryOp; template<typename ViewOp, typename MatrixType> class CwiseUnaryView; template<typename BinaryOp, typename Lhs, typename Rhs> class CwiseBinaryOp; template<typename TernaryOp, typename Arg1, typename Arg2, typename Arg3> class CwiseTernaryOp; template<typename Decomposition, typename Rhstype> class Solve; template<typename XprType> class Inverse; template<typename Lhs, typename Rhs, int Option = DefaultProduct> class Product; template<typename Derived> class DiagonalBase; template<typename _DiagonalVectorType> class DiagonalWrapper; template<typename _Scalar, int SizeAtCompileTime, int MaxSizeAtCompileTime=SizeAtCompileTime> class DiagonalMatrix; template<typename MatrixType, typename DiagonalType, int ProductOrder> class DiagonalProduct; template<typename MatrixType, int Index = 0> class Diagonal; template<int SizeAtCompileTime, int MaxSizeAtCompileTime = SizeAtCompileTime, typename IndexType=int> class PermutationMatrix; template<int SizeAtCompileTime, int MaxSizeAtCompileTime = SizeAtCompileTime, typename IndexType=int> class Transpositions; template<typename Derived> class PermutationBase; template<typename Derived> class TranspositionsBase; template<typename _IndicesType> class PermutationWrapper; template<typename _IndicesType> class TranspositionsWrapper; template<typename Derived, int Level = internal::accessors_level<Derived>::has_write_access ? WriteAccessors : ReadOnlyAccessors > class MapBase; template<int InnerStrideAtCompileTime, int OuterStrideAtCompileTime> class Stride; template<int Value = Dynamic> class InnerStride; template<int Value = Dynamic> class OuterStride; template<typename MatrixType, int MapOptions=Unaligned, typename StrideType = Stride<0,0> > class Map; template<typename Derived> class RefBase; template<typename PlainObjectType, int Options = 0, typename StrideType = typename internal::conditional<PlainObjectType::IsVectorAtCompileTime,InnerStride<1>,OuterStride<> >::type > class Ref; template<typename Derived> class TriangularBase; template<typename MatrixType, unsigned int Mode> class TriangularView; template<typename MatrixType, unsigned int Mode> class SelfAdjointView; template<typename MatrixType> class SparseView; template<typename ExpressionType> class WithFormat; template<typename MatrixType> struct CommaInitializer; template<typename Derived> class ReturnByValue; template<typename ExpressionType> class ArrayWrapper; template<typename ExpressionType> class MatrixWrapper; template<typename Derived> class SolverBase; template<typename XprType> class InnerIterator; namespace internal { template<typename DecompositionType> struct kernel_retval_base; template<typename DecompositionType> struct kernel_retval; template<typename DecompositionType> struct image_retval_base; template<typename DecompositionType> struct image_retval; } namespace internal { template<typename _Scalar, int Rows=Dynamic, int Cols=Dynamic, int Supers=Dynamic, int Subs=Dynamic, int Options=0> class BandMatrix; } namespace internal { template<typename Lhs, typename Rhs> struct product_type; template<bool> struct EnableIf; template< typename T, int ProductTag = internal::product_type<typename T::Lhs,typename T::Rhs>::ret, typename LhsShape = typename evaluator_traits<typename T::Lhs>::Shape, typename RhsShape = typename evaluator_traits<typename T::Rhs>::Shape, typename LhsScalar = typename traits<typename T::Lhs>::Scalar, typename RhsScalar = typename traits<typename T::Rhs>::Scalar > struct product_evaluator; } template<typename Lhs, typename Rhs, int ProductType = internal::product_type<Lhs,Rhs>::value> struct ProductReturnType; template<typename Lhs, typename Rhs> struct LazyProductReturnType; namespace internal { template<typename LhsScalar, typename RhsScalar, bool ConjLhs=false, bool ConjRhs=false> struct conj_helper; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_sum_op; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_difference_op; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_conj_product_op; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_min_op; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_max_op; template<typename Scalar> struct scalar_opposite_op; template<typename Scalar> struct scalar_conjugate_op; template<typename Scalar> struct scalar_real_op; template<typename Scalar> struct scalar_imag_op; template<typename Scalar> struct scalar_abs_op; template<typename Scalar> struct scalar_abs2_op; template<typename Scalar> struct scalar_sqrt_op; template<typename Scalar> struct scalar_rsqrt_op; template<typename Scalar> struct scalar_exp_op; template<typename Scalar> struct scalar_log_op; template<typename Scalar> struct scalar_cos_op; template<typename Scalar> struct scalar_sin_op; template<typename Scalar> struct scalar_acos_op; template<typename Scalar> struct scalar_asin_op; template<typename Scalar> struct scalar_tan_op; template<typename Scalar> struct scalar_inverse_op; template<typename Scalar> struct scalar_square_op; template<typename Scalar> struct scalar_cube_op; template<typename Scalar, typename NewType> struct scalar_cast_op; template<typename Scalar> struct scalar_random_op; template<typename Scalar> struct scalar_constant_op; template<typename Scalar> struct scalar_identity_op; template<typename Scalar,bool iscpx> struct scalar_sign_op; template<typename Scalar,typename ScalarExponent> struct scalar_pow_op; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_hypot_op; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_product_op; template<typename LhsScalar,typename RhsScalar=LhsScalar> struct scalar_quotient_op; template<typename Scalar> struct scalar_lgamma_op; template<typename Scalar> struct scalar_digamma_op; template<typename Scalar> struct scalar_erf_op; template<typename Scalar> struct scalar_erfc_op; template<typename Scalar> struct scalar_igamma_op; template<typename Scalar> struct scalar_igammac_op; template<typename Scalar> struct scalar_zeta_op; template<typename Scalar> struct scalar_betainc_op; } struct IOFormat; template<typename _Scalar, int _Rows, int _Cols, int _Options = AutoAlign | # 238 "eigen-3.3.7/Eigen/src/Core/util/ForwardDeclarations.h" ( (_Rows==1 && _Cols!=1) ? Eigen::RowMajor : (_Cols==1 && _Rows!=1) ? Eigen::ColMajor : Eigen::ColMajor ), int _MaxRows = _Rows, int _MaxCols = _Cols> class Array; template<typename ConditionMatrixType, typename ThenMatrixType, typename ElseMatrixType> class Select; template<typename MatrixType, typename BinaryOp, int Direction> class PartialReduxExpr; template<typename ExpressionType, int Direction> class VectorwiseOp; template<typename MatrixType,int RowFactor,int ColFactor> class Replicate; template<typename MatrixType, int Direction = BothDirections> class Reverse; template<typename MatrixType> class FullPivLU; template<typename MatrixType> class PartialPivLU; namespace internal { template<typename MatrixType> struct inverse_impl; } template<typename MatrixType> class HouseholderQR; template<typename MatrixType> class ColPivHouseholderQR; template<typename MatrixType> class FullPivHouseholderQR; template<typename MatrixType> class CompleteOrthogonalDecomposition; template<typename MatrixType, int QRPreconditioner = ColPivHouseholderQRPreconditioner> class JacobiSVD; template<typename MatrixType> class BDCSVD; template<typename MatrixType, int UpLo = Lower> class LLT; template<typename MatrixType, int UpLo = Lower> class LDLT; template<typename VectorsType, typename CoeffsType, int Side=OnTheLeft> class HouseholderSequence; template<typename Scalar> class JacobiRotation; template<typename Derived, int _Dim> class RotationBase; template<typename Lhs, typename Rhs> class Cross; template<typename Derived> class QuaternionBase; template<typename Scalar> class Rotation2D; template<typename Scalar> class AngleAxis; template<typename Scalar,int Dim> class Translation; template<typename Scalar,int Dim> class AlignedBox; template<typename Scalar, int Options = AutoAlign> class Quaternion; template<typename Scalar,int Dim,int Mode,int _Options=AutoAlign> class Transform; template <typename _Scalar, int _AmbientDim, int Options=AutoAlign> class ParametrizedLine; template <typename _Scalar, int _AmbientDim, int Options=AutoAlign> class Hyperplane; template<typename Scalar> class UniformScaling; template<typename MatrixType,int Direction> class Homogeneous; template<typename Derived> class SparseMatrixBase; template<typename Derived> struct MatrixExponentialReturnValue; template<typename Derived> class MatrixFunctionReturnValue; template<typename Derived> class MatrixSquareRootReturnValue; template<typename Derived> class MatrixLogarithmReturnValue; template<typename Derived> class MatrixPowerReturnValue; template<typename Derived> class MatrixComplexPowerReturnValue; namespace internal { template <typename Scalar> struct stem_function { typedef std::complex<typename NumTraits<Scalar>::Real> ComplexScalar; typedef ComplexScalar type(ComplexScalar, int); }; } } # 366 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/StaticAssert.h" 1 # 37 "eigen-3.3.7/Eigen/src/Core/util/StaticAssert.h" namespace Eigen { namespace internal { template<bool condition> struct static_assertion {}; template<> struct static_assertion<true> { enum { YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX=1, YOU_MIXED_VECTORS_OF_DIFFERENT_SIZES=1, YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES=1, THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE=1, THIS_METHOD_IS_ONLY_FOR_MATRICES_OF_A_SPECIFIC_SIZE=1, THIS_METHOD_IS_ONLY_FOR_OBJECTS_OF_A_SPECIFIC_SIZE=1, OUT_OF_RANGE_ACCESS=1, YOU_MADE_A_PROGRAMMING_MISTAKE=1, EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT=1, EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE=1, YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR=1, YOU_CALLED_A_DYNAMIC_SIZE_METHOD_ON_A_FIXED_SIZE_MATRIX_OR_VECTOR=1, UNALIGNED_LOAD_AND_STORE_OPERATIONS_UNIMPLEMENTED_ON_ALTIVEC=1, THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES=1, FLOATING_POINT_ARGUMENT_PASSED__INTEGER_WAS_EXPECTED=1, NUMERIC_TYPE_MUST_BE_REAL=1, COEFFICIENT_WRITE_ACCESS_TO_SELFADJOINT_NOT_SUPPORTED=1, WRITING_TO_TRIANGULAR_PART_WITH_UNIT_DIAGONAL_IS_NOT_SUPPORTED=1, THIS_METHOD_IS_ONLY_FOR_FIXED_SIZE=1, INVALID_MATRIX_PRODUCT=1, INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS=1, INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION=1, YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY=1, THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES=1, THIS_METHOD_IS_ONLY_FOR_ROW_MAJOR_MATRICES=1, INVALID_MATRIX_TEMPLATE_PARAMETERS=1, INVALID_MATRIXBASE_TEMPLATE_PARAMETERS=1, BOTH_MATRICES_MUST_HAVE_THE_SAME_STORAGE_ORDER=1, THIS_METHOD_IS_ONLY_FOR_DIAGONAL_MATRIX=1, THE_MATRIX_OR_EXPRESSION_THAT_YOU_PASSED_DOES_NOT_HAVE_THE_EXPECTED_TYPE=1, THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_WITH_DIRECT_MEMORY_ACCESS_SUCH_AS_MAP_OR_PLAIN_MATRICES=1, YOU_ALREADY_SPECIFIED_THIS_STRIDE=1, INVALID_STORAGE_ORDER_FOR_THIS_VECTOR_EXPRESSION=1, THE_BRACKET_OPERATOR_IS_ONLY_FOR_VECTORS__USE_THE_PARENTHESIS_OPERATOR_INSTEAD=1, PACKET_ACCESS_REQUIRES_TO_HAVE_INNER_STRIDE_FIXED_TO_1=1, THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS=1, YOU_CANNOT_MIX_ARRAYS_AND_MATRICES=1, YOU_PERFORMED_AN_INVALID_TRANSFORMATION_CONVERSION=1, THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY=1, YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT=1, THIS_METHOD_IS_ONLY_FOR_1x1_EXPRESSIONS=1, THIS_METHOD_IS_ONLY_FOR_INNER_OR_LAZY_PRODUCTS=1, THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL=1, THIS_METHOD_IS_ONLY_FOR_ARRAYS_NOT_MATRICES=1, YOU_PASSED_A_ROW_VECTOR_BUT_A_COLUMN_VECTOR_WAS_EXPECTED=1, YOU_PASSED_A_COLUMN_VECTOR_BUT_A_ROW_VECTOR_WAS_EXPECTED=1, THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE=1, THE_STORAGE_ORDER_OF_BOTH_SIDES_MUST_MATCH=1, OBJECT_ALLOCATED_ON_STACK_IS_TOO_BIG=1, IMPLICIT_CONVERSION_TO_SCALAR_IS_FOR_INNER_PRODUCT_ONLY=1, STORAGE_LAYOUT_DOES_NOT_MATCH=1, EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE=1, THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS=1, MATRIX_FREE_CONJUGATE_GRADIENT_IS_COMPATIBLE_WITH_UPPER_UNION_LOWER_MODE_ONLY=1, THIS_TYPE_IS_NOT_SUPPORTED=1, STORAGE_KIND_MUST_MATCH=1, STORAGE_INDEX_MUST_MATCH=1, CHOLMOD_SUPPORTS_DOUBLE_PRECISION_ONLY=1, SELFADJOINTVIEW_ACCEPTS_UPPER_AND_LOWER_MODE_ONLY=1 }; }; } } # 367 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" 1 # 25 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" namespace Eigen { namespace internal { template<typename IndexDest, typename IndexSrc> inline IndexDest convert_index(const IndexSrc& idx) { ; return IndexDest(idx); } # 47 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" template<typename ExprScalar,typename T, bool IsSupported> struct promote_scalar_arg; template<typename S,typename T> struct promote_scalar_arg<S,T,true> { typedef T type; }; template<typename ExprScalar,typename T,typename PromotedType, bool ConvertibleToLiteral = internal::is_convertible<T,PromotedType>::value, bool IsSafe = NumTraits<T>::IsInteger || !NumTraits<PromotedType>::IsInteger> struct promote_scalar_arg_unsupported; template<typename S,typename T> struct promote_scalar_arg<S,T,false> : promote_scalar_arg_unsupported<S,T,typename NumTraits<S>::Literal> {}; template<typename S,typename T, typename PromotedType> struct promote_scalar_arg_unsupported<S,T,PromotedType,true,true> { typedef PromotedType type; }; template<typename ExprScalar,typename T, typename PromotedType> struct promote_scalar_arg_unsupported<ExprScalar,T,PromotedType,false,true> : promote_scalar_arg_unsupported<ExprScalar,T,ExprScalar> {}; template<typename S,typename T, typename PromotedType, bool ConvertibleToLiteral> struct promote_scalar_arg_unsupported<S,T,PromotedType,ConvertibleToLiteral,false> {}; template<typename S,typename T> struct promote_scalar_arg_unsupported<S,T,S,false,true> {}; class no_assignment_operator { private: no_assignment_operator& operator=(const no_assignment_operator&); }; template<typename I1, typename I2> struct promote_index_type { typedef typename conditional<(sizeof(I1)<sizeof(I2)), I2, I1>::type type; }; template<typename T, int Value> class variable_if_dynamic { public: inline variable_if_dynamic() {} inline variable_if_dynamic(const variable_if_dynamic& ) {} inline explicit variable_if_dynamic(T v) { ; ((v == T(Value)) ? static_cast<void> (0) : __assert_fail ("v == T(Value)", "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h", 110, __PRETTY_FUNCTION__)); } static inline T value() { return T(Value); } inline void setValue(T) {} }; template<typename T> class variable_if_dynamic<T, Dynamic> { T m_value; variable_if_dynamic() { ((false) ? static_cast<void> (0) : __assert_fail ("false", "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h", 118, __PRETTY_FUNCTION__)); } public: inline explicit variable_if_dynamic(T value) : m_value(value) {} inline T value() const { return m_value; } inline void setValue(T value) { m_value = value; } }; template<typename T, int Value> class variable_if_dynamicindex { public: inline variable_if_dynamicindex() {} inline variable_if_dynamicindex(const variable_if_dynamicindex& ) {} inline explicit variable_if_dynamicindex(T v) { ; ((v == T(Value)) ? static_cast<void> (0) : __assert_fail ("v == T(Value)", "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h", 131, __PRETTY_FUNCTION__)); } static inline T value() { return T(Value); } inline void setValue(T) {} }; template<typename T> class variable_if_dynamicindex<T, DynamicIndex> { T m_value; variable_if_dynamicindex() { ((false) ? static_cast<void> (0) : __assert_fail ("false", "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h", 139, __PRETTY_FUNCTION__)); } public: inline explicit variable_if_dynamicindex(T value) : m_value(value) {} T inline value() const { return m_value; } inline void setValue(T value) { m_value = value; } }; template<typename T> struct functor_traits { enum { Cost = 10, PacketAccess = false, IsRepeatable = false }; }; template<typename T> struct packet_traits; template<typename T> struct unpacket_traits { typedef T type; typedef T half; enum { size = 1, alignment = 1 }; }; template<int Size, typename PacketType, bool Stop = Size==Dynamic || (Size%unpacket_traits<PacketType>::size)==0 || is_same<PacketType,typename unpacket_traits<PacketType>::half>::value> struct find_best_packet_helper; template< int Size, typename PacketType> struct find_best_packet_helper<Size,PacketType,true> { typedef PacketType type; }; template<int Size, typename PacketType> struct find_best_packet_helper<Size,PacketType,false> { typedef typename find_best_packet_helper<Size,typename unpacket_traits<PacketType>::half>::type type; }; template<typename T, int Size> struct find_best_packet { typedef typename find_best_packet_helper<Size,typename packet_traits<T>::type>::type type; }; template<int ArrayBytes, int AlignmentBytes, bool Match = bool((ArrayBytes%AlignmentBytes)==0), bool TryHalf = bool(16<AlignmentBytes) > struct compute_default_alignment_helper { enum { value = 0 }; }; template<int ArrayBytes, int AlignmentBytes, bool TryHalf> struct compute_default_alignment_helper<ArrayBytes, AlignmentBytes, true, TryHalf> { enum { value = AlignmentBytes }; }; template<int ArrayBytes, int AlignmentBytes> struct compute_default_alignment_helper<ArrayBytes, AlignmentBytes, false, true> { enum { value = compute_default_alignment_helper<ArrayBytes, AlignmentBytes/2>::value }; }; # 222 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" template<typename T, int Size> struct compute_default_alignment { enum { value = compute_default_alignment_helper<Size*sizeof(T),16>::value }; }; template<typename T> struct compute_default_alignment<T,Dynamic> { enum { value = 16 }; }; template<typename _Scalar, int _Rows, int _Cols, int _Options = AutoAlign | ( (_Rows==1 && _Cols!=1) ? RowMajor : (_Cols==1 && _Rows!=1) ? ColMajor : Eigen::ColMajor ), int _MaxRows = _Rows, int _MaxCols = _Cols > class make_proper_matrix_type { enum { IsColVector = _Cols==1 && _Rows!=1, IsRowVector = _Rows==1 && _Cols!=1, Options = IsColVector ? (_Options | ColMajor) & ~RowMajor : IsRowVector ? (_Options | RowMajor) & ~ColMajor : _Options }; public: typedef Matrix<_Scalar, _Rows, _Cols, Options, _MaxRows, _MaxCols> type; }; template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols> class compute_matrix_flags { enum { row_major_bit = Options&RowMajor ? RowMajorBit : 0 }; public: enum { ret = DirectAccessBit | LvalueBit | NestByRefBit | row_major_bit }; }; template<int _Rows, int _Cols> struct size_at_compile_time { enum { ret = (_Rows==Dynamic || _Cols==Dynamic) ? Dynamic : _Rows * _Cols }; }; template<typename XprType> struct size_of_xpr_at_compile_time { enum { ret = size_at_compile_time<traits<XprType>::RowsAtCompileTime,traits<XprType>::ColsAtCompileTime>::ret }; }; template<typename T, typename StorageKind = typename traits<T>::StorageKind> struct plain_matrix_type; template<typename T, typename BaseClassType, int Flags> struct plain_matrix_type_dense; template<typename T> struct plain_matrix_type<T,Dense> { typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, traits<T>::Flags>::type type; }; template<typename T> struct plain_matrix_type<T,DiagonalShape> { typedef typename T::PlainObject type; }; template<typename T, int Flags> struct plain_matrix_type_dense<T,MatrixXpr,Flags> { typedef Matrix<typename traits<T>::Scalar, traits<T>::RowsAtCompileTime, traits<T>::ColsAtCompileTime, AutoAlign | (Flags&RowMajorBit ? RowMajor : ColMajor), traits<T>::MaxRowsAtCompileTime, traits<T>::MaxColsAtCompileTime > type; }; template<typename T, int Flags> struct plain_matrix_type_dense<T,ArrayXpr,Flags> { typedef Array<typename traits<T>::Scalar, traits<T>::RowsAtCompileTime, traits<T>::ColsAtCompileTime, AutoAlign | (Flags&RowMajorBit ? RowMajor : ColMajor), traits<T>::MaxRowsAtCompileTime, traits<T>::MaxColsAtCompileTime > type; }; template<typename T, typename StorageKind = typename traits<T>::StorageKind> struct eval; template<typename T> struct eval<T,Dense> { typedef typename plain_matrix_type<T>::type type; # 325 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" }; template<typename T> struct eval<T,DiagonalShape> { typedef typename plain_matrix_type<T>::type type; }; template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols> struct eval<Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>, Dense> { typedef const Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& type; }; template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols> struct eval<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>, Dense> { typedef const Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>& type; }; template<typename T, typename StorageKind = typename traits<T>::StorageKind> struct plain_object_eval; template<typename T> struct plain_object_eval<T,Dense> { typedef typename plain_matrix_type_dense<T,typename traits<T>::XprKind, evaluator<T>::Flags>::type type; }; template<typename T> struct plain_matrix_type_column_major { enum { Rows = traits<T>::RowsAtCompileTime, Cols = traits<T>::ColsAtCompileTime, MaxRows = traits<T>::MaxRowsAtCompileTime, MaxCols = traits<T>::MaxColsAtCompileTime }; typedef Matrix<typename traits<T>::Scalar, Rows, Cols, (MaxRows==1&&MaxCols!=1) ? RowMajor : ColMajor, MaxRows, MaxCols > type; }; template<typename T> struct plain_matrix_type_row_major { enum { Rows = traits<T>::RowsAtCompileTime, Cols = traits<T>::ColsAtCompileTime, MaxRows = traits<T>::MaxRowsAtCompileTime, MaxCols = traits<T>::MaxColsAtCompileTime }; typedef Matrix<typename traits<T>::Scalar, Rows, Cols, (MaxCols==1&&MaxRows!=1) ? RowMajor : ColMajor, MaxRows, MaxCols > type; }; template <typename T> struct ref_selector { typedef typename conditional< bool(traits<T>::Flags & NestByRefBit), T const&, const T >::type type; typedef typename conditional< bool(traits<T>::Flags & NestByRefBit), T &, T >::type non_const_type; }; template<typename T1, typename T2> struct transfer_constness { typedef typename conditional< bool(internal::is_const<T1>::value), typename internal::add_const_on_value_type<T2>::type, T2 >::type type; }; # 437 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" template<typename T, int n, typename PlainObject = typename plain_object_eval<T>::type> struct nested_eval { enum { ScalarReadCost = NumTraits<typename traits<T>::Scalar>::ReadCost, CoeffReadCost = evaluator<T>::CoeffReadCost, NAsInteger = n == Dynamic ? HugeCost : n, CostEval = (NAsInteger+1) * ScalarReadCost + CoeffReadCost, CostNoEval = NAsInteger * CoeffReadCost, Evaluate = (int(evaluator<T>::Flags) & EvalBeforeNestingBit) || (int(CostEval) < int(CostNoEval)) }; typedef typename conditional<Evaluate, PlainObject, typename ref_selector<T>::type>::type type; }; template<typename T> inline T* const_cast_ptr(const T* ptr) { return const_cast<T*>(ptr); } template<typename Derived, typename XprKind = typename traits<Derived>::XprKind> struct dense_xpr_base { }; template<typename Derived> struct dense_xpr_base<Derived, MatrixXpr> { typedef MatrixBase<Derived> type; }; template<typename Derived> struct dense_xpr_base<Derived, ArrayXpr> { typedef ArrayBase<Derived> type; }; template<typename Derived, typename XprKind = typename traits<Derived>::XprKind, typename StorageKind = typename traits<Derived>::StorageKind> struct generic_xpr_base; template<typename Derived, typename XprKind> struct generic_xpr_base<Derived, XprKind, Dense> { typedef typename dense_xpr_base<Derived,XprKind>::type type; }; template<typename XprType, typename CastType> struct cast_return_type { typedef typename XprType::Scalar CurrentScalarType; typedef typename remove_all<CastType>::type _CastType; typedef typename _CastType::Scalar NewScalarType; typedef typename conditional<is_same<CurrentScalarType,NewScalarType>::value, const XprType&,CastType>::type type; }; template <typename A, typename B> struct promote_storage_type; template <typename A> struct promote_storage_type<A,A> { typedef A ret; }; template <typename A> struct promote_storage_type<A, const A> { typedef A ret; }; template <typename A> struct promote_storage_type<const A, A> { typedef A ret; }; # 526 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" template <typename A, typename B, typename Functor> struct cwise_promote_storage_type; template <typename A, typename Functor> struct cwise_promote_storage_type<A,A,Functor> { typedef A ret; }; template <typename Functor> struct cwise_promote_storage_type<Dense,Dense,Functor> { typedef Dense ret; }; template <typename A, typename Functor> struct cwise_promote_storage_type<A,Dense,Functor> { typedef Dense ret; }; template <typename B, typename Functor> struct cwise_promote_storage_type<Dense,B,Functor> { typedef Dense ret; }; template <typename Functor> struct cwise_promote_storage_type<Sparse,Dense,Functor> { typedef Sparse ret; }; template <typename Functor> struct cwise_promote_storage_type<Dense,Sparse,Functor> { typedef Sparse ret; }; template <typename LhsKind, typename RhsKind, int LhsOrder, int RhsOrder> struct cwise_promote_storage_order { enum { value = LhsOrder }; }; template <typename LhsKind, int LhsOrder, int RhsOrder> struct cwise_promote_storage_order<LhsKind,Sparse,LhsOrder,RhsOrder> { enum { value = RhsOrder }; }; template <typename RhsKind, int LhsOrder, int RhsOrder> struct cwise_promote_storage_order<Sparse,RhsKind,LhsOrder,RhsOrder> { enum { value = LhsOrder }; }; template <int Order> struct cwise_promote_storage_order<Sparse,Sparse,Order,Order> { enum { value = Order }; }; # 558 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" template <typename A, typename B, int ProductTag> struct product_promote_storage_type; template <typename A, int ProductTag> struct product_promote_storage_type<A, A, ProductTag> { typedef A ret;}; template <int ProductTag> struct product_promote_storage_type<Dense, Dense, ProductTag> { typedef Dense ret;}; template <typename A, int ProductTag> struct product_promote_storage_type<A, Dense, ProductTag> { typedef Dense ret; }; template <typename B, int ProductTag> struct product_promote_storage_type<Dense, B, ProductTag> { typedef Dense ret; }; template <typename A, int ProductTag> struct product_promote_storage_type<A, DiagonalShape, ProductTag> { typedef A ret; }; template <typename B, int ProductTag> struct product_promote_storage_type<DiagonalShape, B, ProductTag> { typedef B ret; }; template <int ProductTag> struct product_promote_storage_type<Dense, DiagonalShape, ProductTag> { typedef Dense ret; }; template <int ProductTag> struct product_promote_storage_type<DiagonalShape, Dense, ProductTag> { typedef Dense ret; }; template <typename A, int ProductTag> struct product_promote_storage_type<A, PermutationStorage, ProductTag> { typedef A ret; }; template <typename B, int ProductTag> struct product_promote_storage_type<PermutationStorage, B, ProductTag> { typedef B ret; }; template <int ProductTag> struct product_promote_storage_type<Dense, PermutationStorage, ProductTag> { typedef Dense ret; }; template <int ProductTag> struct product_promote_storage_type<PermutationStorage, Dense, ProductTag> { typedef Dense ret; }; template<typename ExpressionType, typename Scalar = typename ExpressionType::Scalar> struct plain_row_type { typedef Matrix<Scalar, 1, ExpressionType::ColsAtCompileTime, ExpressionType::PlainObject::Options | RowMajor, 1, ExpressionType::MaxColsAtCompileTime> MatrixRowType; typedef Array<Scalar, 1, ExpressionType::ColsAtCompileTime, ExpressionType::PlainObject::Options | RowMajor, 1, ExpressionType::MaxColsAtCompileTime> ArrayRowType; typedef typename conditional< is_same< typename traits<ExpressionType>::XprKind, MatrixXpr >::value, MatrixRowType, ArrayRowType >::type type; }; template<typename ExpressionType, typename Scalar = typename ExpressionType::Scalar> struct plain_col_type { typedef Matrix<Scalar, ExpressionType::RowsAtCompileTime, 1, ExpressionType::PlainObject::Options & ~RowMajor, ExpressionType::MaxRowsAtCompileTime, 1> MatrixColType; typedef Array<Scalar, ExpressionType::RowsAtCompileTime, 1, ExpressionType::PlainObject::Options & ~RowMajor, ExpressionType::MaxRowsAtCompileTime, 1> ArrayColType; typedef typename conditional< is_same< typename traits<ExpressionType>::XprKind, MatrixXpr >::value, MatrixColType, ArrayColType >::type type; }; template<typename ExpressionType, typename Scalar = typename ExpressionType::Scalar> struct plain_diag_type { enum { diag_size = (((int)ExpressionType::RowsAtCompileTime == 0 || (int)ExpressionType::ColsAtCompileTime == 0) ? 0 : ((int)ExpressionType::RowsAtCompileTime == 1 || (int)ExpressionType::ColsAtCompileTime == 1) ? 1 : ((int)ExpressionType::RowsAtCompileTime == Dynamic || (int)ExpressionType::ColsAtCompileTime == Dynamic) ? Dynamic : ((int)ExpressionType::RowsAtCompileTime <= (int)ExpressionType::ColsAtCompileTime) ? (int)ExpressionType::RowsAtCompileTime : (int)ExpressionType::ColsAtCompileTime), max_diag_size = (((int)ExpressionType::MaxRowsAtCompileTime == 0 || (int)ExpressionType::MaxColsAtCompileTime == 0) ? 0 : ((int)ExpressionType::MaxRowsAtCompileTime == 1 || (int)ExpressionType::MaxColsAtCompileTime == 1) ? 1 : ((int)ExpressionType::MaxRowsAtCompileTime == Dynamic && (int)ExpressionType::MaxColsAtCompileTime == Dynamic) ? Dynamic : ((int)ExpressionType::MaxRowsAtCompileTime == Dynamic) ? (int)ExpressionType::MaxColsAtCompileTime : ((int)ExpressionType::MaxColsAtCompileTime == Dynamic) ? (int)ExpressionType::MaxRowsAtCompileTime : ((int)ExpressionType::MaxRowsAtCompileTime <= (int)ExpressionType::MaxColsAtCompileTime) ? (int)ExpressionType::MaxRowsAtCompileTime : (int)ExpressionType::MaxColsAtCompileTime) }; typedef Matrix<Scalar, diag_size, 1, ExpressionType::PlainObject::Options & ~RowMajor, max_diag_size, 1> MatrixDiagType; typedef Array<Scalar, diag_size, 1, ExpressionType::PlainObject::Options & ~RowMajor, max_diag_size, 1> ArrayDiagType; typedef typename conditional< is_same< typename traits<ExpressionType>::XprKind, MatrixXpr >::value, MatrixDiagType, ArrayDiagType >::type type; }; template<typename Expr,typename Scalar = typename Expr::Scalar> struct plain_constant_type { enum { Options = (traits<Expr>::Flags&RowMajorBit)?RowMajor:0 }; typedef Array<Scalar, traits<Expr>::RowsAtCompileTime, traits<Expr>::ColsAtCompileTime, Options, traits<Expr>::MaxRowsAtCompileTime,traits<Expr>::MaxColsAtCompileTime> array_type; typedef Matrix<Scalar, traits<Expr>::RowsAtCompileTime, traits<Expr>::ColsAtCompileTime, Options, traits<Expr>::MaxRowsAtCompileTime,traits<Expr>::MaxColsAtCompileTime> matrix_type; typedef CwiseNullaryOp<scalar_constant_op<Scalar>, const typename conditional<is_same< typename traits<Expr>::XprKind, MatrixXpr >::value, matrix_type, array_type>::type > type; }; template<typename ExpressionType> struct is_lvalue { enum { value = (!bool(is_const<ExpressionType>::value)) && bool(traits<ExpressionType>::Flags & LvalueBit) }; }; template<typename T> struct is_diagonal { enum { ret = false }; }; template<typename T> struct is_diagonal<DiagonalBase<T> > { enum { ret = true }; }; template<typename T> struct is_diagonal<DiagonalWrapper<T> > { enum { ret = true }; }; template<typename T, int S> struct is_diagonal<DiagonalMatrix<T,S> > { enum { ret = true }; }; template<typename S1, typename S2> struct glue_shapes; template<> struct glue_shapes<DenseShape,TriangularShape> { typedef TriangularShape type; }; template<typename T1, typename T2> bool is_same_dense(const T1 &mat1, const T2 &mat2, typename enable_if<has_direct_access<T1>::ret&&has_direct_access<T2>::ret, T1>::type * = 0) { return (mat1.data()==mat2.data()) && (mat1.innerStride()==mat2.innerStride()) && (mat1.outerStride()==mat2.outerStride()); } template<typename T1, typename T2> bool is_same_dense(const T1 &, const T2 &, typename enable_if<!(has_direct_access<T1>::ret&&has_direct_access<T2>::ret), T1>::type * = 0) { return false; } template<typename T,bool Vectorized=false,typename EnaleIf = void> struct scalar_div_cost { enum { value = 8*NumTraits<T>::MulCost }; }; template<typename T,bool Vectorized> struct scalar_div_cost<std::complex<T>, Vectorized> { enum { value = 2*scalar_div_cost<T>::value + 6*NumTraits<T>::MulCost + 3*NumTraits<T>::AddCost }; }; template<bool Vectorized> struct scalar_div_cost<signed long,Vectorized,typename conditional<sizeof(long)==8,void,false_type>::type> { enum { value = 24 }; }; template<bool Vectorized> struct scalar_div_cost<unsigned long,Vectorized,typename conditional<sizeof(long)==8,void,false_type>::type> { enum { value = 21 }; }; # 726 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" } # 765 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" template<typename ScalarA, typename ScalarB, typename BinaryOp=internal::scalar_product_op<ScalarA,ScalarB> > struct ScalarBinaryOpTraits : internal::scalar_product_traits<ScalarA,ScalarB> {}; template<typename T, typename BinaryOp> struct ScalarBinaryOpTraits<T,T,BinaryOp> { typedef T ReturnType; }; template <typename T, typename BinaryOp> struct ScalarBinaryOpTraits<T, typename NumTraits<typename internal::enable_if<NumTraits<T>::IsComplex,T>::type>::Real, BinaryOp> { typedef T ReturnType; }; template <typename T, typename BinaryOp> struct ScalarBinaryOpTraits<typename NumTraits<typename internal::enable_if<NumTraits<T>::IsComplex,T>::type>::Real, T, BinaryOp> { typedef T ReturnType; }; template<typename T, typename BinaryOp> struct ScalarBinaryOpTraits<T,void,BinaryOp> { typedef T ReturnType; }; template<typename T, typename BinaryOp> struct ScalarBinaryOpTraits<void,T,BinaryOp> { typedef T ReturnType; }; template<typename BinaryOp> struct ScalarBinaryOpTraits<void,void,BinaryOp> { typedef void ReturnType; }; # 819 "eigen-3.3.7/Eigen/src/Core/util/XprHelper.h" } # 368 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" 1 # 62 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" namespace Eigen { namespace internal { inline void throw_std_bad_alloc() { throw std::bad_alloc(); } # 86 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" inline void* handmade_aligned_malloc(std::size_t size) { void *original = std::malloc(size+16); if (original == 0) return 0; void *aligned = reinterpret_cast<void*>((reinterpret_cast<std::size_t>(original) & ~(std::size_t(16 -1))) + 16); *(reinterpret_cast<void**>(aligned) - 1) = original; return aligned; } inline void handmade_aligned_free(void *ptr) { if (ptr) std::free(*(reinterpret_cast<void**>(ptr) - 1)); } inline void* handmade_aligned_realloc(void* ptr, std::size_t size, std::size_t = 0) { if (ptr == 0) return handmade_aligned_malloc(size); void *original = *(reinterpret_cast<void**>(ptr) - 1); std::ptrdiff_t previous_offset = static_cast<char *>(ptr)-static_cast<char *>(original); original = std::realloc(original,size+16); if (original == 0) return 0; void *aligned = reinterpret_cast<void*>((reinterpret_cast<std::size_t>(original) & ~(std::size_t(16 -1))) + 16); void *previous_aligned = static_cast<char *>(original)+previous_offset; if(aligned!=previous_aligned) std::memmove(aligned, previous_aligned, size); *(reinterpret_cast<void**>(aligned) - 1) = original; return aligned; } # 146 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" inline void check_that_malloc_is_allowed() {} inline void* aligned_malloc(std::size_t size) { check_that_malloc_is_allowed(); void *result; result = handmade_aligned_malloc(size); if(!result && size) throw_std_bad_alloc(); return result; } inline void aligned_free(void *ptr) { handmade_aligned_free(ptr); } inline void* aligned_realloc(void *ptr, std::size_t new_size, std::size_t old_size) { Eigen::internal::ignore_unused_variable(old_size);; void *result; result = handmade_aligned_realloc(ptr,new_size,old_size); if (!result && new_size) throw_std_bad_alloc(); return result; } # 212 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" template<bool Align> inline void* conditional_aligned_malloc(std::size_t size) { return aligned_malloc(size); } template<> inline void* conditional_aligned_malloc<false>(std::size_t size) { check_that_malloc_is_allowed(); void *result = std::malloc(size); if(!result && size) throw_std_bad_alloc(); return result; } template<bool Align> inline void conditional_aligned_free(void *ptr) { aligned_free(ptr); } template<> inline void conditional_aligned_free<false>(void *ptr) { std::free(ptr); } template<bool Align> inline void* conditional_aligned_realloc(void* ptr, std::size_t new_size, std::size_t old_size) { return aligned_realloc(ptr, new_size, old_size); } template<> inline void* conditional_aligned_realloc<false>(void* ptr, std::size_t new_size, std::size_t) { return std::realloc(ptr, new_size); } # 255 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" template<typename T> inline void destruct_elements_of_array(T *ptr, std::size_t size) { if(ptr) while(size) ptr[--size].~T(); } template<typename T> inline T* construct_elements_of_array(T *ptr, std::size_t size) { std::size_t i; try { for (i = 0; i < size; ++i) ::new (ptr + i) T; return ptr; } catch (...) { destruct_elements_of_array(ptr, i); throw; } return __null; } template<typename T> __attribute__((always_inline)) inline void check_size_for_overflow(std::size_t size) { if(size > std::size_t(-1) / sizeof(T)) throw_std_bad_alloc(); } template<typename T> inline T* aligned_new(std::size_t size) { check_size_for_overflow<T>(size); T *result = reinterpret_cast<T*>(aligned_malloc(sizeof(T)*size)); try { return construct_elements_of_array(result, size); } catch (...) { aligned_free(result); throw; } return result; } template<typename T, bool Align> inline T* conditional_aligned_new(std::size_t size) { check_size_for_overflow<T>(size); T *result = reinterpret_cast<T*>(conditional_aligned_malloc<Align>(sizeof(T)*size)); try { return construct_elements_of_array(result, size); } catch (...) { conditional_aligned_free<Align>(result); throw; } return result; } template<typename T> inline void aligned_delete(T *ptr, std::size_t size) { destruct_elements_of_array<T>(ptr, size); aligned_free(ptr); } template<typename T, bool Align> inline void conditional_aligned_delete(T *ptr, std::size_t size) { destruct_elements_of_array<T>(ptr, size); conditional_aligned_free<Align>(ptr); } template<typename T, bool Align> inline T* conditional_aligned_realloc_new(T* pts, std::size_t new_size, std::size_t old_size) { check_size_for_overflow<T>(new_size); check_size_for_overflow<T>(old_size); if(new_size < old_size) destruct_elements_of_array(pts+new_size, old_size-new_size); T *result = reinterpret_cast<T*>(conditional_aligned_realloc<Align>(reinterpret_cast<void*>(pts), sizeof(T)*new_size, sizeof(T)*old_size)); if(new_size > old_size) { try { construct_elements_of_array(result+old_size, new_size-old_size); } catch (...) { conditional_aligned_free<Align>(result); throw; } } return result; } template<typename T, bool Align> inline T* conditional_aligned_new_auto(std::size_t size) { if(size==0) return 0; check_size_for_overflow<T>(size); T *result = reinterpret_cast<T*>(conditional_aligned_malloc<Align>(sizeof(T)*size)); if(NumTraits<T>::RequireInitialization) { try { construct_elements_of_array(result, size); } catch (...) { conditional_aligned_free<Align>(result); throw; } } return result; } template<typename T, bool Align> inline T* conditional_aligned_realloc_new_auto(T* pts, std::size_t new_size, std::size_t old_size) { check_size_for_overflow<T>(new_size); check_size_for_overflow<T>(old_size); if(NumTraits<T>::RequireInitialization && (new_size < old_size)) destruct_elements_of_array(pts+new_size, old_size-new_size); T *result = reinterpret_cast<T*>(conditional_aligned_realloc<Align>(reinterpret_cast<void*>(pts), sizeof(T)*new_size, sizeof(T)*old_size)); if(NumTraits<T>::RequireInitialization && (new_size > old_size)) { try { construct_elements_of_array(result+old_size, new_size-old_size); } catch (...) { conditional_aligned_free<Align>(result); throw; } } return result; } template<typename T, bool Align> inline void conditional_aligned_delete_auto(T *ptr, std::size_t size) { if(NumTraits<T>::RequireInitialization) destruct_elements_of_array<T>(ptr, size); conditional_aligned_free<Align>(ptr); } # 438 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" template<int Alignment, typename Scalar, typename Index> inline Index first_aligned(const Scalar* array, Index size) { const Index ScalarSize = sizeof(Scalar); const Index AlignmentSize = Alignment / ScalarSize; const Index AlignmentMask = AlignmentSize-1; if(AlignmentSize<=1) { return 0; } else if( (UIntPtr(array) & (sizeof(Scalar)-1)) || (Alignment%ScalarSize)!=0) { return size; } else { Index first = (AlignmentSize - (Index((UIntPtr(array)/sizeof(Scalar))) & AlignmentMask)) & AlignmentMask; return (first < size) ? first : size; } } template<typename Scalar, typename Index> inline Index first_default_aligned(const Scalar* array, Index size) { typedef typename packet_traits<Scalar>::type DefaultPacketType; return first_aligned<unpacket_traits<DefaultPacketType>::alignment>(array, size); } template<typename Index> inline Index first_multiple(Index size, Index base) { return ((size+base-1)/base)*base; } template<typename T, bool UseMemcpy> struct smart_copy_helper; template<typename T> void smart_copy(const T* start, const T* end, T* target) { smart_copy_helper<T,!NumTraits<T>::RequireInitialization>::run(start, end, target); } template<typename T> struct smart_copy_helper<T,true> { static inline void run(const T* start, const T* end, T* target) { IntPtr size = IntPtr(end)-IntPtr(start); if(size==0) return; ; std::memcpy(target, start, size); } }; template<typename T> struct smart_copy_helper<T,false> { static inline void run(const T* start, const T* end, T* target) { std::copy(start, end, target); } }; template<typename T, bool UseMemmove> struct smart_memmove_helper; template<typename T> void smart_memmove(const T* start, const T* end, T* target) { smart_memmove_helper<T,!NumTraits<T>::RequireInitialization>::run(start, end, target); } template<typename T> struct smart_memmove_helper<T,true> { static inline void run(const T* start, const T* end, T* target) { IntPtr size = IntPtr(end)-IntPtr(start); if(size==0) return; ; std::memmove(target, start, size); } }; template<typename T> struct smart_memmove_helper<T,false> { static inline void run(const T* start, const T* end, T* target) { if (UIntPtr(target) < UIntPtr(start)) { std::copy(start, end, target); } else { std::ptrdiff_t count = (std::ptrdiff_t(end)-std::ptrdiff_t(start)) / sizeof(T); std::copy_backward(start, end, target + count); } } }; # 555 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" template<typename T> class aligned_stack_memory_handler : noncopyable { public: aligned_stack_memory_handler(T* ptr, std::size_t size, bool dealloc) : m_ptr(ptr), m_size(size), m_deallocate(dealloc) { if(NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::construct_elements_of_array(m_ptr, size); } ~aligned_stack_memory_handler() { if(NumTraits<T>::RequireInitialization && m_ptr) Eigen::internal::destruct_elements_of_array<T>(m_ptr, m_size); if(m_deallocate) Eigen::internal::aligned_free(m_ptr); } protected: T* m_ptr; std::size_t m_size; bool m_deallocate; }; template<typename T> class scoped_array : noncopyable { T* m_ptr; public: explicit scoped_array(std::ptrdiff_t size) { m_ptr = new T[size]; } ~scoped_array() { delete[] m_ptr; } T& operator[](std::ptrdiff_t i) { return m_ptr[i]; } const T& operator[](std::ptrdiff_t i) const { return m_ptr[i]; } T* &ptr() { return m_ptr; } const T* ptr() const { return m_ptr; } operator const T*() const { return m_ptr; } }; template<typename T> void swap(scoped_array<T> &a,scoped_array<T> &b) { std::swap(a.ptr(),b.ptr()); } } # 720 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" template<class T> class aligned_allocator : public std::allocator<T> { public: typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; typedef T* pointer; typedef const T* const_pointer; typedef T& reference; typedef const T& const_reference; typedef T value_type; template<class U> struct rebind { typedef aligned_allocator<U> other; }; aligned_allocator() : std::allocator<T>() {} aligned_allocator(const aligned_allocator& other) : std::allocator<T>(other) {} template<class U> aligned_allocator(const aligned_allocator<U>& other) : std::allocator<T>(other) {} ~aligned_allocator() {} pointer allocate(size_type num, const void* = 0) { internal::check_size_for_overflow<T>(num); size_type size = num * sizeof(T); return static_cast<pointer>( internal::aligned_malloc(size) ); } void deallocate(pointer p, size_type ) { internal::aligned_free(p); } }; # 792 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" namespace internal { inline bool cpuid_is_vendor(int abcd[4], const int vendor[3]) { return abcd[1]==vendor[0] && abcd[3]==vendor[1] && abcd[2]==vendor[2]; } inline void queryCacheSizes_intel_direct(int& l1, int& l2, int& l3) { int abcd[4]; l1 = l2 = l3 = 0; int cache_id = 0; int cache_type = 0; do { abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; __asm__ __volatile__ ("cpuid": "=a" (abcd[0]), "=b" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "0" (0x4), "2" (cache_id) );; cache_type = (abcd[0] & 0x0F) >> 0; if(cache_type==1||cache_type==3) { int cache_level = (abcd[0] & 0xE0) >> 5; int ways = (abcd[1] & 0xFFC00000) >> 22; int partitions = (abcd[1] & 0x003FF000) >> 12; int line_size = (abcd[1] & 0x00000FFF) >> 0; int sets = (abcd[2]); int cache_size = (ways+1) * (partitions+1) * (line_size+1) * (sets+1); switch(cache_level) { case 1: l1 = cache_size; break; case 2: l2 = cache_size; break; case 3: l3 = cache_size; break; default: break; } } cache_id++; } while(cache_type>0 && cache_id<16); } inline void queryCacheSizes_intel_codes(int& l1, int& l2, int& l3) { int abcd[4]; abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; l1 = l2 = l3 = 0; __asm__ __volatile__ ("cpuid": "=a" (abcd[0]), "=b" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "0" (0x00000002), "2" (0) );; unsigned char * bytes = reinterpret_cast<unsigned char *>(abcd)+2; bool check_for_p2_core2 = false; for(int i=0; i<14; ++i) { switch(bytes[i]) { case 0x0A: l1 = 8; break; case 0x0C: l1 = 16; break; case 0x0E: l1 = 24; break; case 0x10: l1 = 16; break; case 0x15: l1 = 16; break; case 0x2C: l1 = 32; break; case 0x30: l1 = 32; break; case 0x60: l1 = 16; break; case 0x66: l1 = 8; break; case 0x67: l1 = 16; break; case 0x68: l1 = 32; break; case 0x1A: l2 = 96; break; case 0x22: l3 = 512; break; case 0x23: l3 = 1024; break; case 0x25: l3 = 2048; break; case 0x29: l3 = 4096; break; case 0x39: l2 = 128; break; case 0x3A: l2 = 192; break; case 0x3B: l2 = 128; break; case 0x3C: l2 = 256; break; case 0x3D: l2 = 384; break; case 0x3E: l2 = 512; break; case 0x40: l2 = 0; break; case 0x41: l2 = 128; break; case 0x42: l2 = 256; break; case 0x43: l2 = 512; break; case 0x44: l2 = 1024; break; case 0x45: l2 = 2048; break; case 0x46: l3 = 4096; break; case 0x47: l3 = 8192; break; case 0x48: l2 = 3072; break; case 0x49: if(l2!=0) l3 = 4096; else {check_for_p2_core2=true; l3 = l2 = 4096;} break; case 0x4A: l3 = 6144; break; case 0x4B: l3 = 8192; break; case 0x4C: l3 = 12288; break; case 0x4D: l3 = 16384; break; case 0x4E: l2 = 6144; break; case 0x78: l2 = 1024; break; case 0x79: l2 = 128; break; case 0x7A: l2 = 256; break; case 0x7B: l2 = 512; break; case 0x7C: l2 = 1024; break; case 0x7D: l2 = 2048; break; case 0x7E: l2 = 256; break; case 0x7F: l2 = 512; break; case 0x80: l2 = 512; break; case 0x81: l2 = 128; break; case 0x82: l2 = 256; break; case 0x83: l2 = 512; break; case 0x84: l2 = 1024; break; case 0x85: l2 = 2048; break; case 0x86: l2 = 512; break; case 0x87: l2 = 1024; break; case 0x88: l3 = 2048; break; case 0x89: l3 = 4096; break; case 0x8A: l3 = 8192; break; case 0x8D: l3 = 3072; break; default: break; } } if(check_for_p2_core2 && l2 == l3) l3 = 0; l1 *= 1024; l2 *= 1024; l3 *= 1024; } inline void queryCacheSizes_intel(int& l1, int& l2, int& l3, int max_std_funcs) { if(max_std_funcs>=4) queryCacheSizes_intel_direct(l1,l2,l3); else queryCacheSizes_intel_codes(l1,l2,l3); } inline void queryCacheSizes_amd(int& l1, int& l2, int& l3) { int abcd[4]; abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; __asm__ __volatile__ ("cpuid": "=a" (abcd[0]), "=b" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "0" (0x80000005), "2" (0) );; l1 = (abcd[2] >> 24) * 1024; abcd[0] = abcd[1] = abcd[2] = abcd[3] = 0; __asm__ __volatile__ ("cpuid": "=a" (abcd[0]), "=b" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "0" (0x80000006), "2" (0) );; l2 = (abcd[2] >> 16) * 1024; l3 = ((abcd[3] & 0xFFFC000) >> 18) * 512 * 1024; } inline void queryCacheSizes(int& l1, int& l2, int& l3) { int abcd[4]; const int GenuineIntel[] = {0x756e6547, 0x49656e69, 0x6c65746e}; const int AuthenticAMD[] = {0x68747541, 0x69746e65, 0x444d4163}; const int AMDisbetter_[] = {0x69444d41, 0x74656273, 0x21726574}; __asm__ __volatile__ ("cpuid": "=a" (abcd[0]), "=b" (abcd[1]), "=c" (abcd[2]), "=d" (abcd[3]) : "0" (0x0), "2" (0) );; int max_std_funcs = abcd[1]; if(cpuid_is_vendor(abcd,GenuineIntel)) queryCacheSizes_intel(l1,l2,l3,max_std_funcs); else if(cpuid_is_vendor(abcd,AuthenticAMD) || cpuid_is_vendor(abcd,AMDisbetter_)) queryCacheSizes_amd(l1,l2,l3); else queryCacheSizes_intel(l1,l2,l3,max_std_funcs); # 969 "eigen-3.3.7/Eigen/src/Core/util/Memory.h" } inline int queryL1CacheSize() { int l1(-1), l2, l3; queryCacheSizes(l1,l2,l3); return l1; } inline int queryTopLevelCacheSize() { int l1, l2(-1), l3(-1); queryCacheSizes(l1,l2,l3); return (std::max)(l2,l3); } } } # 369 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/NumTraits.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/NumTraits.h" namespace Eigen { namespace internal { template< typename T, bool use_numeric_limits = std::numeric_limits<T>::is_specialized, bool is_integer = NumTraits<T>::IsInteger> struct default_digits10_impl { static int run() { return std::numeric_limits<T>::digits10; } }; template<typename T> struct default_digits10_impl<T,false,false> { static int run() { using std::log10; using std::ceil; typedef typename NumTraits<T>::Real Real; return int(ceil(-log10(NumTraits<Real>::epsilon()))); } }; template<typename T> struct default_digits10_impl<T,false,true> { static int run() { return 0; } }; } # 88 "eigen-3.3.7/Eigen/src/Core/NumTraits.h" template<typename T> struct GenericNumTraits { enum { IsInteger = std::numeric_limits<T>::is_integer, IsSigned = std::numeric_limits<T>::is_signed, IsComplex = 0, RequireInitialization = internal::is_arithmetic<T>::value ? 0 : 1, ReadCost = 1, AddCost = 1, MulCost = 1 }; typedef T Real; typedef typename internal::conditional< IsInteger, typename internal::conditional<sizeof(T)<=2, float, double>::type, T >::type NonInteger; typedef T Nested; typedef T Literal; static inline Real epsilon() { return numext::numeric_limits<T>::epsilon(); } static inline int digits10() { return internal::default_digits10_impl<T>::run(); } static inline Real dummy_precision() { return Real(0); } static inline T highest() { return (numext::numeric_limits<T>::max)(); } static inline T lowest() { return IsInteger ? (numext::numeric_limits<T>::min)() : (-(numext::numeric_limits<T>::max)()); } static inline T infinity() { return numext::numeric_limits<T>::infinity(); } static inline T quiet_NaN() { return numext::numeric_limits<T>::quiet_NaN(); } }; template<typename T> struct NumTraits : GenericNumTraits<T> {}; template<> struct NumTraits<float> : GenericNumTraits<float> { static inline float dummy_precision() { return 1e-5f; } }; template<> struct NumTraits<double> : GenericNumTraits<double> { static inline double dummy_precision() { return 1e-12; } }; template<> struct NumTraits<long double> : GenericNumTraits<long double> { static inline long double dummy_precision() { return 1e-15l; } }; template<typename _Real> struct NumTraits<std::complex<_Real> > : GenericNumTraits<std::complex<_Real> > { typedef _Real Real; typedef typename NumTraits<_Real>::Literal Literal; enum { IsComplex = 1, RequireInitialization = NumTraits<_Real>::RequireInitialization, ReadCost = 2 * NumTraits<_Real>::ReadCost, AddCost = 2 * NumTraits<Real>::AddCost, MulCost = 4 * NumTraits<Real>::MulCost + 2 * NumTraits<Real>::AddCost }; static inline Real epsilon() { return NumTraits<Real>::epsilon(); } static inline Real dummy_precision() { return NumTraits<Real>::dummy_precision(); } static inline int digits10() { return NumTraits<Real>::digits10(); } }; template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols> struct NumTraits<Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> > { typedef Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> ArrayType; typedef typename NumTraits<Scalar>::Real RealScalar; typedef Array<RealScalar, Rows, Cols, Options, MaxRows, MaxCols> Real; typedef typename NumTraits<Scalar>::NonInteger NonIntegerScalar; typedef Array<NonIntegerScalar, Rows, Cols, Options, MaxRows, MaxCols> NonInteger; typedef ArrayType & Nested; typedef typename NumTraits<Scalar>::Literal Literal; enum { IsComplex = NumTraits<Scalar>::IsComplex, IsInteger = NumTraits<Scalar>::IsInteger, IsSigned = NumTraits<Scalar>::IsSigned, RequireInitialization = 1, ReadCost = ArrayType::SizeAtCompileTime==Dynamic ? HugeCost : ArrayType::SizeAtCompileTime * NumTraits<Scalar>::ReadCost, AddCost = ArrayType::SizeAtCompileTime==Dynamic ? HugeCost : ArrayType::SizeAtCompileTime * NumTraits<Scalar>::AddCost, MulCost = ArrayType::SizeAtCompileTime==Dynamic ? HugeCost : ArrayType::SizeAtCompileTime * NumTraits<Scalar>::MulCost }; static inline RealScalar epsilon() { return NumTraits<RealScalar>::epsilon(); } static inline RealScalar dummy_precision() { return NumTraits<RealScalar>::dummy_precision(); } static inline int digits10() { return NumTraits<Scalar>::digits10(); } }; template<> struct NumTraits<std::string> : GenericNumTraits<std::string> { enum { RequireInitialization = 1, ReadCost = HugeCost, AddCost = HugeCost, MulCost = HugeCost }; static inline int digits10() { return 0; } private: static inline std::string epsilon(); static inline std::string dummy_precision(); static inline std::string lowest(); static inline std::string highest(); static inline std::string infinity(); static inline std::string quiet_NaN(); }; template<> struct NumTraits<void> {}; } # 371 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" 1 # 18 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" namespace Eigen { # 29 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" namespace internal { # 51 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T, typename dummy = void> struct global_math_functions_filtering_base { typedef T type; }; template<typename T> struct always_void { typedef void type; }; template<typename T> struct global_math_functions_filtering_base <T, typename always_void<typename T::Eigen_BaseClassForSpecializationOfGlobalMathFuncImpl>::type > { typedef typename T::Eigen_BaseClassForSpecializationOfGlobalMathFuncImpl type; }; # 75 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex> struct real_default_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { return x; } }; template<typename Scalar> struct real_default_impl<Scalar,true> { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { using std::real; return real(x); } }; template<typename Scalar> struct real_impl : real_default_impl<Scalar> {}; # 113 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename Scalar> struct real_retval { typedef typename NumTraits<Scalar>::Real type; }; template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex> struct imag_default_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar&) { return RealScalar(0); } }; template<typename Scalar> struct imag_default_impl<Scalar,true> { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { using std::imag; return imag(x); } }; template<typename Scalar> struct imag_impl : imag_default_impl<Scalar> {}; # 161 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename Scalar> struct imag_retval { typedef typename NumTraits<Scalar>::Real type; }; template<typename Scalar> struct real_ref_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar& run(Scalar& x) { return reinterpret_cast<RealScalar*>(&x)[0]; } static inline const RealScalar& run(const Scalar& x) { return reinterpret_cast<const RealScalar*>(&x)[0]; } }; template<typename Scalar> struct real_ref_retval { typedef typename NumTraits<Scalar>::Real & type; }; template<typename Scalar, bool IsComplex> struct imag_ref_default_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar& run(Scalar& x) { return reinterpret_cast<RealScalar*>(&x)[1]; } static inline const RealScalar& run(const Scalar& x) { return reinterpret_cast<RealScalar*>(&x)[1]; } }; template<typename Scalar> struct imag_ref_default_impl<Scalar, false> { static inline Scalar run(Scalar&) { return Scalar(0); } static inline const Scalar run(const Scalar&) { return Scalar(0); } }; template<typename Scalar> struct imag_ref_impl : imag_ref_default_impl<Scalar, NumTraits<Scalar>::IsComplex> {}; template<typename Scalar> struct imag_ref_retval { typedef typename NumTraits<Scalar>::Real & type; }; template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex> struct conj_impl { static inline Scalar run(const Scalar& x) { return x; } }; template<typename Scalar> struct conj_impl<Scalar,true> { static inline Scalar run(const Scalar& x) { using std::conj; return conj(x); } }; template<typename Scalar> struct conj_retval { typedef Scalar type; }; template<typename Scalar,bool IsComplex> struct abs2_impl_default { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { return x*x; } }; template<typename Scalar> struct abs2_impl_default<Scalar, true> { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { return real(x)*real(x) + imag(x)*imag(x); } }; template<typename Scalar> struct abs2_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { return abs2_impl_default<Scalar,NumTraits<Scalar>::IsComplex>::run(x); } }; template<typename Scalar> struct abs2_retval { typedef typename NumTraits<Scalar>::Real type; }; template<typename Scalar, bool IsComplex> struct norm1_default_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { using std::abs;; return abs(real(x)) + abs(imag(x)); } }; template<typename Scalar> struct norm1_default_impl<Scalar, false> { static inline Scalar run(const Scalar& x) { using std::abs;; return abs(x); } }; template<typename Scalar> struct norm1_impl : norm1_default_impl<Scalar, NumTraits<Scalar>::IsComplex> {}; template<typename Scalar> struct norm1_retval { typedef typename NumTraits<Scalar>::Real type; }; template<typename Scalar> struct hypot_impl; template<typename Scalar> struct hypot_retval { typedef typename NumTraits<Scalar>::Real type; }; template<typename OldType, typename NewType> struct cast_impl { static inline NewType run(const OldType& x) { return static_cast<NewType>(x); } }; template<typename OldType, typename NewType> inline NewType cast(const OldType& x) { return cast_impl<OldType, NewType>::run(x); } # 397 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename Scalar> struct round_impl { static inline Scalar run(const Scalar& x) { if (Eigen::internal::static_assertion<static_cast<bool>((!NumTraits<Scalar>::IsComplex))>::NUMERIC_TYPE_MUST_BE_REAL) {} using std::floor;; using std::ceil;; return (x > Scalar(0)) ? floor(x + Scalar(0.5)) : ceil(x - Scalar(0.5)); } }; template<typename Scalar> struct round_retval { typedef Scalar type; }; # 430 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex> struct arg_default_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { return (x < Scalar(0)) ? Scalar(3.141592653589793238462643383279502884197169399375105820974944592307816406L) : Scalar(0); } }; template<typename Scalar> struct arg_default_impl<Scalar,true> { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x) { using std::arg;; return arg(x); } }; template<typename Scalar> struct arg_impl : arg_default_impl<Scalar> {}; template<typename Scalar> struct arg_retval { typedef typename NumTraits<Scalar>::Real type; }; namespace std_fallback { template<typename Scalar> inline Scalar log1p(const Scalar& x) { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {} typedef typename NumTraits<Scalar>::Real RealScalar; using std::log;; Scalar x1p = RealScalar(1) + x; return numext::equal_strict(x1p, Scalar(1)) ? x : x * ( log(x1p) / (x1p - RealScalar(1)) ); } } template<typename Scalar> struct log1p_impl { static inline Scalar run(const Scalar& x) { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {} using std_fallback::log1p; return log1p(x); } }; template<typename Scalar> struct log1p_retval { typedef Scalar type; }; template<typename ScalarX,typename ScalarY, bool IsInteger = NumTraits<ScalarX>::IsInteger&&NumTraits<ScalarY>::IsInteger> struct pow_impl { typedef typename ScalarBinaryOpTraits<ScalarX,ScalarY,internal::scalar_pow_op<ScalarX,ScalarY> >::ReturnType result_type; static inline result_type run(const ScalarX& x, const ScalarY& y) { using std::pow;; return pow(x, y); } }; template<typename ScalarX,typename ScalarY> struct pow_impl<ScalarX,ScalarY, true> { typedef ScalarX result_type; static inline ScalarX run(ScalarX x, ScalarY y) { ScalarX res(1); ((!NumTraits<ScalarY>::IsSigned || y >= 0) ? static_cast<void> (0) : __assert_fail ("!NumTraits<ScalarY>::IsSigned || y >= 0", "eigen-3.3.7/Eigen/src/Core/MathFunctions.h", 521, __PRETTY_FUNCTION__)); if(y & 1) res *= x; y >>= 1; while(y) { x *= x; if(y&1) res *= x; y >>= 1; } return res; } }; template<typename Scalar, bool IsComplex, bool IsInteger> struct random_default_impl {}; template<typename Scalar> struct random_impl : random_default_impl<Scalar, NumTraits<Scalar>::IsComplex, NumTraits<Scalar>::IsInteger> {}; template<typename Scalar> struct random_retval { typedef Scalar type; }; template<typename Scalar> inline typename Eigen::internal::random_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type random(const Scalar& x, const Scalar& y); template<typename Scalar> inline typename Eigen::internal::random_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type random(); template<typename Scalar> struct random_default_impl<Scalar, false, false> { static inline Scalar run(const Scalar& x, const Scalar& y) { return x + (y-x) * Scalar(std::rand()) / Scalar(2147483647); } static inline Scalar run() { return run(Scalar(NumTraits<Scalar>::IsSigned ? -1 : 0), Scalar(1)); } }; enum { meta_floor_log2_terminate, meta_floor_log2_move_up, meta_floor_log2_move_down, meta_floor_log2_bogus }; template<unsigned int n, int lower, int upper> struct meta_floor_log2_selector { enum { middle = (lower + upper) / 2, value = (upper <= lower + 1) ? int(meta_floor_log2_terminate) : (n < (1 << middle)) ? int(meta_floor_log2_move_down) : (n==0) ? int(meta_floor_log2_bogus) : int(meta_floor_log2_move_up) }; }; template<unsigned int n, int lower = 0, int upper = sizeof(unsigned int) * 8 - 1, int selector = meta_floor_log2_selector<n, lower, upper>::value> struct meta_floor_log2 {}; template<unsigned int n, int lower, int upper> struct meta_floor_log2<n, lower, upper, meta_floor_log2_move_down> { enum { value = meta_floor_log2<n, lower, meta_floor_log2_selector<n, lower, upper>::middle>::value }; }; template<unsigned int n, int lower, int upper> struct meta_floor_log2<n, lower, upper, meta_floor_log2_move_up> { enum { value = meta_floor_log2<n, meta_floor_log2_selector<n, lower, upper>::middle, upper>::value }; }; template<unsigned int n, int lower, int upper> struct meta_floor_log2<n, lower, upper, meta_floor_log2_terminate> { enum { value = (n >= ((unsigned int)(1) << (lower+1))) ? lower+1 : lower }; }; template<unsigned int n, int lower, int upper> struct meta_floor_log2<n, lower, upper, meta_floor_log2_bogus> { }; template<typename Scalar> struct random_default_impl<Scalar, false, true> { static inline Scalar run(const Scalar& x, const Scalar& y) { if (y <= x) return x; typedef typename make_unsigned<Scalar>::type ScalarU; typedef typename conditional<(ScalarU(-1) > unsigned(-1)), ScalarU, unsigned>::type ScalarX; ScalarX range = ScalarX(y) - ScalarX(x); ScalarX offset = 0; ScalarX divisor = 1; ScalarX multiplier = 1; const unsigned rand_max = 2147483647; if (range <= rand_max) divisor = (rand_max + 1) / (range + 1); else multiplier = 1 + range / (rand_max + 1); do { offset = (unsigned(std::rand()) * multiplier) / divisor; } while (offset > range); return Scalar(ScalarX(x) + offset); } static inline Scalar run() { enum { rand_bits = meta_floor_log2<(unsigned int)(2147483647)+1>::value, scalar_bits = sizeof(Scalar) * 8, shift = (((int)0 >= (int)int(rand_bits) - int(scalar_bits)) ? (int)0 : (int)int(rand_bits) - int(scalar_bits)), offset = NumTraits<Scalar>::IsSigned ? (1 << ((((int)rand_bits <= (int)scalar_bits) ? (int)rand_bits : (int)scalar_bits)-1)) : 0 }; return Scalar((std::rand() >> shift) - offset); } }; template<typename Scalar> struct random_default_impl<Scalar, true, false> { static inline Scalar run(const Scalar& x, const Scalar& y) { return Scalar(random(real(x), real(y)), random(imag(x), imag(y))); } static inline Scalar run() { typedef typename NumTraits<Scalar>::Real RealScalar; return Scalar(random<RealScalar>(), random<RealScalar>()); } }; template<typename Scalar> inline typename Eigen::internal::random_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type random(const Scalar& x, const Scalar& y) { return Eigen::internal::random_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x, y); } template<typename Scalar> inline typename Eigen::internal::random_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type random() { return Eigen::internal::random_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(); } # 696 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> typename internal::enable_if<internal::is_integral<T>::value,bool>::type isnan_impl(const T&) { return false; } template<typename T> typename internal::enable_if<internal::is_integral<T>::value,bool>::type isinf_impl(const T&) { return false; } template<typename T> typename internal::enable_if<internal::is_integral<T>::value,bool>::type isfinite_impl(const T&) { return true; } template<typename T> typename internal::enable_if<(!internal::is_integral<T>::value)&&(!NumTraits<T>::IsComplex),bool>::type isfinite_impl(const T& x) { return x<=NumTraits<T>::highest() && x>=NumTraits<T>::lowest(); } template<typename T> typename internal::enable_if<(!internal::is_integral<T>::value)&&(!NumTraits<T>::IsComplex),bool>::type isinf_impl(const T& x) { return x>NumTraits<T>::highest() || x<NumTraits<T>::lowest(); } template<typename T> typename internal::enable_if<(!internal::is_integral<T>::value)&&(!NumTraits<T>::IsComplex),bool>::type isnan_impl(const T& x) { return x != x; } # 798 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> bool isfinite_impl(const std::complex<T>& x); template<typename T> bool isnan_impl(const std::complex<T>& x); template<typename T> bool isinf_impl(const std::complex<T>& x); template<typename T> T generic_fast_tanh_float(const T& a_x); } namespace numext { template<typename T> __attribute__((always_inline)) inline T mini(const T& x, const T& y) { using std::min;; return min (x,y); } template<typename T> __attribute__((always_inline)) inline T maxi(const T& x, const T& y) { using std::max;; return max (x,y); } # 856 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename Scalar> inline typename Eigen::internal::real_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type real(const Scalar& x) { return Eigen::internal::real_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename internal::add_const_on_value_type< typename Eigen::internal::real_ref_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type >::type real_ref(const Scalar& x) { return internal::real_ref_impl<Scalar>::run(x); } template<typename Scalar> inline typename Eigen::internal::real_ref_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type real_ref(Scalar& x) { return Eigen::internal::real_ref_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename Eigen::internal::imag_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type imag(const Scalar& x) { return Eigen::internal::imag_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename Eigen::internal::arg_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type arg(const Scalar& x) { return Eigen::internal::arg_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename internal::add_const_on_value_type< typename Eigen::internal::imag_ref_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type >::type imag_ref(const Scalar& x) { return internal::imag_ref_impl<Scalar>::run(x); } template<typename Scalar> inline typename Eigen::internal::imag_ref_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type imag_ref(Scalar& x) { return Eigen::internal::imag_ref_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename Eigen::internal::conj_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type conj(const Scalar& x) { return Eigen::internal::conj_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename Eigen::internal::abs2_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type abs2(const Scalar& x) { return Eigen::internal::abs2_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename Eigen::internal::norm1_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type norm1(const Scalar& x) { return Eigen::internal::norm1_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename Scalar> inline typename Eigen::internal::hypot_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type hypot(const Scalar& x, const Scalar& y) { return Eigen::internal::hypot_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x, y); } template<typename Scalar> inline typename Eigen::internal::log1p_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type log1p(const Scalar& x) { return Eigen::internal::log1p_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } # 948 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename ScalarX,typename ScalarY> inline typename internal::pow_impl<ScalarX,ScalarY>::result_type pow(const ScalarX& x, const ScalarY& y) { return internal::pow_impl<ScalarX,ScalarY>::run(x, y); } template<typename T> bool (isnan) (const T &x) { return internal::isnan_impl(x); } template<typename T> bool (isinf) (const T &x) { return internal::isinf_impl(x); } template<typename T> bool (isfinite)(const T &x) { return internal::isfinite_impl(x); } template<typename Scalar> inline typename Eigen::internal::round_retval<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::type round(const Scalar& x) { return Eigen::internal::round_impl<typename Eigen::internal::global_math_functions_filtering_base<Scalar>::type>::run(x); } template<typename T> T (floor)(const T& x) { using std::floor;; return floor(x); } # 982 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> T (ceil)(const T& x) { using std::ceil;; return ceil(x); } # 1001 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" inline int log2(int x) { ((x>=0) ? static_cast<void> (0) : __assert_fail ("x>=0", "eigen-3.3.7/Eigen/src/Core/MathFunctions.h", 1003, __PRETTY_FUNCTION__)); unsigned int v(x); static const int table[32] = { 0, 9, 1, 10, 13, 21, 2, 29, 11, 14, 16, 18, 22, 25, 3, 30, 8, 12, 20, 28, 15, 17, 24, 7, 19, 27, 23, 6, 26, 5, 4, 31 }; v |= v >> 1; v |= v >> 2; v |= v >> 4; v |= v >> 8; v |= v >> 16; return table[(v * 0x07C4ACDDU) >> 27]; } # 1023 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T sqrt(const T &x) { using std::sqrt;; return sqrt(x); } template<typename T> __attribute__((always_inline)) inline T log(const T &x) { using std::log;; return log(x); } # 1046 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline typename internal::enable_if<NumTraits<T>::IsSigned || NumTraits<T>::IsComplex,typename NumTraits<T>::Real>::type abs(const T &x) { using std::abs;; return abs(x); } template<typename T> __attribute__((always_inline)) inline typename internal::enable_if<!(NumTraits<T>::IsSigned || NumTraits<T>::IsComplex),typename NumTraits<T>::Real>::type abs(const T &x) { return x; } # 1084 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T exp(const T &x) { using std::exp;; return exp(x); } # 1099 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T cos(const T &x) { using std::cos;; return cos(x); } # 1114 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T sin(const T &x) { using std::sin;; return sin(x); } # 1129 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T tan(const T &x) { using std::tan;; return tan(x); } # 1144 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T acos(const T &x) { using std::acos;; return acos(x); } # 1159 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T asin(const T &x) { using std::asin;; return asin(x); } # 1174 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T atan(const T &x) { using std::atan;; return atan(x); } # 1190 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T cosh(const T &x) { using std::cosh;; return cosh(x); } # 1205 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T sinh(const T &x) { using std::sinh;; return sinh(x); } # 1220 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template<typename T> __attribute__((always_inline)) inline T tanh(const T &x) { using std::tanh;; return tanh(x); } __attribute__((always_inline)) inline float tanh(float x) { return internal::generic_fast_tanh_float(x); } # 1240 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" template <typename T> __attribute__((always_inline)) inline T fmod(const T& a, const T& b) { using std::fmod;; return fmod(a, b); } # 1261 "eigen-3.3.7/Eigen/src/Core/MathFunctions.h" } namespace internal { template<typename T> bool isfinite_impl(const std::complex<T>& x) { return (numext::isfinite)(numext::real(x)) && (numext::isfinite)(numext::imag(x)); } template<typename T> bool isnan_impl(const std::complex<T>& x) { return (numext::isnan)(numext::real(x)) || (numext::isnan)(numext::imag(x)); } template<typename T> bool isinf_impl(const std::complex<T>& x) { return ((numext::isinf)(numext::real(x)) || (numext::isinf)(numext::imag(x))) && (!(numext::isnan)(x)); } template<typename Scalar, bool IsComplex, bool IsInteger> struct scalar_fuzzy_default_impl {}; template<typename Scalar> struct scalar_fuzzy_default_impl<Scalar, false, false> { typedef typename NumTraits<Scalar>::Real RealScalar; template<typename OtherScalar> static inline bool isMuchSmallerThan(const Scalar& x, const OtherScalar& y, const RealScalar& prec) { return numext::abs(x) <= numext::abs(y) * prec; } static inline bool isApprox(const Scalar& x, const Scalar& y, const RealScalar& prec) { return numext::abs(x - y) <= numext::mini(numext::abs(x), numext::abs(y)) * prec; } static inline bool isApproxOrLessThan(const Scalar& x, const Scalar& y, const RealScalar& prec) { return x <= y || isApprox(x, y, prec); } }; template<typename Scalar> struct scalar_fuzzy_default_impl<Scalar, false, true> { typedef typename NumTraits<Scalar>::Real RealScalar; template<typename OtherScalar> static inline bool isMuchSmallerThan(const Scalar& x, const Scalar&, const RealScalar&) { return x == Scalar(0); } static inline bool isApprox(const Scalar& x, const Scalar& y, const RealScalar&) { return x == y; } static inline bool isApproxOrLessThan(const Scalar& x, const Scalar& y, const RealScalar&) { return x <= y; } }; template<typename Scalar> struct scalar_fuzzy_default_impl<Scalar, true, false> { typedef typename NumTraits<Scalar>::Real RealScalar; template<typename OtherScalar> static inline bool isMuchSmallerThan(const Scalar& x, const OtherScalar& y, const RealScalar& prec) { return numext::abs2(x) <= numext::abs2(y) * prec * prec; } static inline bool isApprox(const Scalar& x, const Scalar& y, const RealScalar& prec) { return numext::abs2(x - y) <= numext::mini(numext::abs2(x), numext::abs2(y)) * prec * prec; } }; template<typename Scalar> struct scalar_fuzzy_impl : scalar_fuzzy_default_impl<Scalar, NumTraits<Scalar>::IsComplex, NumTraits<Scalar>::IsInteger> {}; template<typename Scalar, typename OtherScalar> inline bool isMuchSmallerThan(const Scalar& x, const OtherScalar& y, const typename NumTraits<Scalar>::Real &precision = NumTraits<Scalar>::dummy_precision()) { return scalar_fuzzy_impl<Scalar>::template isMuchSmallerThan<OtherScalar>(x, y, precision); } template<typename Scalar> inline bool isApprox(const Scalar& x, const Scalar& y, const typename NumTraits<Scalar>::Real &precision = NumTraits<Scalar>::dummy_precision()) { return scalar_fuzzy_impl<Scalar>::isApprox(x, y, precision); } template<typename Scalar> inline bool isApproxOrLessThan(const Scalar& x, const Scalar& y, const typename NumTraits<Scalar>::Real &precision = NumTraits<Scalar>::dummy_precision()) { return scalar_fuzzy_impl<Scalar>::isApproxOrLessThan(x, y, precision); } template<> struct random_impl<bool> { static inline bool run() { return random<int>(0,1)==0 ? false : true; } }; template<> struct scalar_fuzzy_impl<bool> { typedef bool RealScalar; template<typename OtherScalar> static inline bool isMuchSmallerThan(const bool& x, const bool&, const bool&) { return !x; } static inline bool isApprox(bool x, bool y, bool) { return x == y; } static inline bool isApproxOrLessThan(const bool& x, const bool& y, const bool&) { return (!x) || y; } }; } } # 372 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" namespace Eigen { namespace internal { # 42 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" struct default_packet_traits { enum { HasHalfPacket = 0, HasAdd = 1, HasSub = 1, HasMul = 1, HasNegate = 1, HasAbs = 1, HasArg = 0, HasAbs2 = 1, HasMin = 1, HasMax = 1, HasConj = 1, HasSetLinear = 1, HasBlend = 0, HasDiv = 0, HasSqrt = 0, HasRsqrt = 0, HasExp = 0, HasLog = 0, HasLog1p = 0, HasLog10 = 0, HasPow = 0, HasSin = 0, HasCos = 0, HasTan = 0, HasASin = 0, HasACos = 0, HasATan = 0, HasSinh = 0, HasCosh = 0, HasTanh = 0, HasLGamma = 0, HasDiGamma = 0, HasZeta = 0, HasPolygamma = 0, HasErf = 0, HasErfc = 0, HasIGamma = 0, HasIGammac = 0, HasBetaInc = 0, HasRound = 0, HasFloor = 0, HasCeil = 0, HasSign = 0 }; }; template<typename T> struct packet_traits : default_packet_traits { typedef T type; typedef T half; enum { Vectorizable = 0, size = 1, AlignedOnScalar = 0, HasHalfPacket = 0 }; enum { HasAdd = 0, HasSub = 0, HasMul = 0, HasNegate = 0, HasAbs = 0, HasAbs2 = 0, HasMin = 0, HasMax = 0, HasConj = 0, HasSetLinear = 0 }; }; template<typename T> struct packet_traits<const T> : packet_traits<T> { }; template <typename Src, typename Tgt> struct type_casting_traits { enum { VectorizedCast = 0, SrcCoeffRatio = 1, TgtCoeffRatio = 1 }; }; template <typename SrcPacket, typename TgtPacket> inline TgtPacket pcast(const SrcPacket& a) { return static_cast<TgtPacket>(a); } template <typename SrcPacket, typename TgtPacket> inline TgtPacket pcast(const SrcPacket& a, const SrcPacket& ) { return static_cast<TgtPacket>(a); } template <typename SrcPacket, typename TgtPacket> inline TgtPacket pcast(const SrcPacket& a, const SrcPacket& , const SrcPacket& , const SrcPacket& ) { return static_cast<TgtPacket>(a); } template<typename Packet> inline Packet padd(const Packet& a, const Packet& b) { return a+b; } template<typename Packet> inline Packet psub(const Packet& a, const Packet& b) { return a-b; } template<typename Packet> inline Packet pnegate(const Packet& a) { return -a; } template<typename Packet> inline Packet pconj(const Packet& a) { return numext::conj(a); } template<typename Packet> inline Packet pmul(const Packet& a, const Packet& b) { return a*b; } template<typename Packet> inline Packet pdiv(const Packet& a, const Packet& b) { return a/b; } template<typename Packet> inline Packet pmin(const Packet& a, const Packet& b) { return numext::mini(a, b); } template<typename Packet> inline Packet pmax(const Packet& a, const Packet& b) { return numext::maxi(a, b); } template<typename Packet> inline Packet pabs(const Packet& a) { using std::abs; return abs(a); } template<typename Packet> inline Packet parg(const Packet& a) { using numext::arg; return arg(a); } template<typename Packet> inline Packet pand(const Packet& a, const Packet& b) { return a & b; } template<typename Packet> inline Packet por(const Packet& a, const Packet& b) { return a | b; } template<typename Packet> inline Packet pxor(const Packet& a, const Packet& b) { return a ^ b; } template<typename Packet> inline Packet pandnot(const Packet& a, const Packet& b) { return a & (!b); } template<typename Packet> inline Packet pload(const typename unpacket_traits<Packet>::type* from) { return *from; } template<typename Packet> inline Packet ploadu(const typename unpacket_traits<Packet>::type* from) { return *from; } template<typename Packet> inline Packet pset1(const typename unpacket_traits<Packet>::type& a) { return a; } template<typename Packet> inline Packet pload1(const typename unpacket_traits<Packet>::type *a) { return pset1<Packet>(*a); } template<typename Packet> inline Packet ploaddup(const typename unpacket_traits<Packet>::type* from) { return *from; } template<typename Packet> inline Packet ploadquad(const typename unpacket_traits<Packet>::type* from) { return pload1<Packet>(from); } # 255 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" template<typename Packet> inline void pbroadcast4(const typename unpacket_traits<Packet>::type *a, Packet& a0, Packet& a1, Packet& a2, Packet& a3) { a0 = pload1<Packet>(a+0); a1 = pload1<Packet>(a+1); a2 = pload1<Packet>(a+2); a3 = pload1<Packet>(a+3); } # 272 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" template<typename Packet> inline void pbroadcast2(const typename unpacket_traits<Packet>::type *a, Packet& a0, Packet& a1) { a0 = pload1<Packet>(a+0); a1 = pload1<Packet>(a+1); } template<typename Packet> inline Packet plset(const typename unpacket_traits<Packet>::type& a) { return a; } template<typename Scalar, typename Packet> inline void pstore(Scalar* to, const Packet& from) { (*to) = from; } template<typename Scalar, typename Packet> inline void pstoreu(Scalar* to, const Packet& from) { (*to) = from; } template<typename Scalar, typename Packet> inline Packet pgather(const Scalar* from, Index ) { return ploadu<Packet>(from); } template<typename Scalar, typename Packet> inline void pscatter(Scalar* to, const Packet& from, Index ) { pstore(to, from); } template<typename Scalar> inline void prefetch(const Scalar* addr) { # 310 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" __builtin_prefetch(addr); } template<typename Packet> inline typename unpacket_traits<Packet>::type pfirst(const Packet& a) { return a; } template<typename Packet> inline Packet preduxp(const Packet* vecs) { return vecs[0]; } template<typename Packet> inline typename unpacket_traits<Packet>::type predux(const Packet& a) { return a; } template<typename Packet> inline typename conditional<(unpacket_traits<Packet>::size%8)==0,typename unpacket_traits<Packet>::half,Packet>::type predux_downto4(const Packet& a) { return a; } template<typename Packet> inline typename unpacket_traits<Packet>::type predux_mul(const Packet& a) { return a; } template<typename Packet> inline typename unpacket_traits<Packet>::type predux_min(const Packet& a) { return a; } template<typename Packet> inline typename unpacket_traits<Packet>::type predux_max(const Packet& a) { return a; } template<typename Packet> inline Packet preverse(const Packet& a) { return a; } template<typename Packet> inline Packet pcplxflip(const Packet& a) { return Packet(imag(a),real(a)); } template<typename Packet> Packet psin(const Packet& a) { using std::sin; return sin(a); } template<typename Packet> Packet pcos(const Packet& a) { using std::cos; return cos(a); } template<typename Packet> Packet ptan(const Packet& a) { using std::tan; return tan(a); } template<typename Packet> Packet pasin(const Packet& a) { using std::asin; return asin(a); } template<typename Packet> Packet pacos(const Packet& a) { using std::acos; return acos(a); } template<typename Packet> Packet patan(const Packet& a) { using std::atan; return atan(a); } template<typename Packet> Packet psinh(const Packet& a) { using std::sinh; return sinh(a); } template<typename Packet> Packet pcosh(const Packet& a) { using std::cosh; return cosh(a); } template<typename Packet> Packet ptanh(const Packet& a) { using std::tanh; return tanh(a); } template<typename Packet> Packet pexp(const Packet& a) { using std::exp; return exp(a); } template<typename Packet> Packet plog(const Packet& a) { using std::log; return log(a); } template<typename Packet> Packet plog1p(const Packet& a) { return numext::log1p(a); } template<typename Packet> Packet plog10(const Packet& a) { using std::log10; return log10(a); } template<typename Packet> Packet psqrt(const Packet& a) { using std::sqrt; return sqrt(a); } template<typename Packet> Packet prsqrt(const Packet& a) { return pdiv(pset1<Packet>(1), psqrt(a)); } template<typename Packet> Packet pround(const Packet& a) { using numext::round; return round(a); } template<typename Packet> Packet pfloor(const Packet& a) { using numext::floor; return floor(a); } template<typename Packet> Packet pceil(const Packet& a) { using numext::ceil; return ceil(a); } template<typename Packet> inline void pstore1(typename unpacket_traits<Packet>::type* to, const typename unpacket_traits<Packet>::type& a) { pstore(to, pset1<Packet>(a)); } template<typename Packet> inline Packet pmadd(const Packet& a, const Packet& b, const Packet& c) { return padd(pmul(a, b),c); } template<typename Packet, int Alignment> __attribute__((always_inline)) inline Packet ploadt(const typename unpacket_traits<Packet>::type* from) { if(Alignment >= unpacket_traits<Packet>::alignment) return pload<Packet>(from); else return ploadu<Packet>(from); } template<typename Scalar, typename Packet, int Alignment> __attribute__((always_inline)) inline void pstoret(Scalar* to, const Packet& from) { if(Alignment >= unpacket_traits<Packet>::alignment) pstore(to, from); else pstoreu(to, from); } template<typename Packet, int LoadMode> __attribute__((always_inline)) inline Packet ploadt_ro(const typename unpacket_traits<Packet>::type* from) { return ploadt<Packet, LoadMode>(from); } template<int Offset,typename PacketType> struct palign_impl { static inline void run(PacketType&, const PacketType&) {} }; # 513 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" template<int Offset,typename PacketType> inline void palign(PacketType& first, const PacketType& second) { palign_impl<Offset,PacketType>::run(first,second); } # 526 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" template<> inline std::complex<float> pmul(const std::complex<float>& a, const std::complex<float>& b) { return std::complex<float>(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); } template<> inline std::complex<double> pmul(const std::complex<double>& a, const std::complex<double>& b) { return std::complex<double>(real(a)*real(b) - imag(a)*imag(b), imag(a)*real(b) + real(a)*imag(b)); } # 539 "eigen-3.3.7/Eigen/src/Core/GenericPacketMath.h" template <typename Packet,int N=unpacket_traits<Packet>::size> struct PacketBlock { Packet packet[N]; }; template<typename Packet> inline void ptranspose(PacketBlock<Packet,1>& ) { } template <size_t N> struct Selector { bool select[N]; }; template<typename Packet> inline Packet pblend(const Selector<unpacket_traits<Packet>::size>& ifPacket, const Packet& thenPacket, const Packet& elsePacket) { return ifPacket.select[0] ? thenPacket : elsePacket; } template<typename Packet> inline Packet pinsertfirst(const Packet& a, typename unpacket_traits<Packet>::type b) { Selector<unpacket_traits<Packet>::size> mask; mask.select[0] = true; for(Index i=1; i<unpacket_traits<Packet>::size; ++i) mask.select[i] = false; return pblend(mask, pset1<Packet>(b), a); } template<typename Packet> inline Packet pinsertlast(const Packet& a, typename unpacket_traits<Packet>::type b) { Selector<unpacket_traits<Packet>::size> mask; for(Index i=0; i<unpacket_traits<Packet>::size-1; ++i) mask.select[i] = false; mask.select[unpacket_traits<Packet>::size-1] = true; return pblend(mask, pset1<Packet>(b), a); } } } # 373 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/MathFunctionsImpl.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/MathFunctionsImpl.h" namespace Eigen { namespace internal { # 25 "eigen-3.3.7/Eigen/src/Core/MathFunctionsImpl.h" template<typename T> T generic_fast_tanh_float(const T& a_x) { const T plus_9 = pset1<T>(9.f); const T minus_9 = pset1<T>(-9.f); const T x = pmax(minus_9,pmin(plus_9,a_x)); const T alpha_1 = pset1<T>(4.89352455891786e-03f); const T alpha_3 = pset1<T>(6.37261928875436e-04f); const T alpha_5 = pset1<T>(1.48572235717979e-05f); const T alpha_7 = pset1<T>(5.12229709037114e-08f); const T alpha_9 = pset1<T>(-8.60467152213735e-11f); const T alpha_11 = pset1<T>(2.00018790482477e-13f); const T alpha_13 = pset1<T>(-2.76076847742355e-16f); const T beta_0 = pset1<T>(4.89352518554385e-03f); const T beta_2 = pset1<T>(2.26843463243900e-03f); const T beta_4 = pset1<T>(1.18534705686654e-04f); const T beta_6 = pset1<T>(1.19825839466702e-06f); const T x2 = pmul(x, x); T p = pmadd(x2, alpha_13, alpha_11); p = pmadd(x2, p, alpha_9); p = pmadd(x2, p, alpha_7); p = pmadd(x2, p, alpha_5); p = pmadd(x2, p, alpha_3); p = pmadd(x2, p, alpha_1); p = pmul(x, p); T q = pmadd(x2, beta_6, beta_4); q = pmadd(x2, q, beta_2); q = pmadd(x2, q, beta_0); return pdiv(p, q); } template<typename RealScalar> inline RealScalar positive_real_hypot(const RealScalar& x, const RealScalar& y) { using std::sqrt;; RealScalar p, qp; p = numext::maxi(x,y); if(p==RealScalar(0)) return RealScalar(0); qp = numext::mini(y,x) / p; return p * sqrt(RealScalar(1) + qp*qp); } template<typename Scalar> struct hypot_impl { typedef typename NumTraits<Scalar>::Real RealScalar; static inline RealScalar run(const Scalar& x, const Scalar& y) { using std::abs;; return positive_real_hypot<RealScalar>(abs(x), abs(y)); } }; } } # 374 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/arch/Default/ConjHelper.h" 1 # 375 "eigen-3.3.7/Eigen/Core" 2 # 411 "eigen-3.3.7/Eigen/Core" # 1 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Half.h" 1 # 46 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Half.h" namespace Eigen { struct half; namespace half_impl { struct __half_raw { __half_raw() : x(0) {} explicit __half_raw(unsigned short raw) : x(raw) {} unsigned short x; }; inline __half_raw raw_uint16_to_half(unsigned short x); inline __half_raw float_to_half_rtne(float ff); inline float half_to_float(__half_raw h); struct half_base : public __half_raw { half_base() {} half_base(const half_base& h) : __half_raw(h) {} half_base(const __half_raw& h) : __half_raw(h) {} }; } struct half : public half_impl::half_base { typedef half_impl::__half_raw __half_raw; half() {} half(const __half_raw& h) : half_impl::half_base(h) {} half(const half& h) : half_impl::half_base(h) {} explicit half(bool b) : half_impl::half_base(half_impl::raw_uint16_to_half(b ? 0x3c00 : 0)) {} template<class T> explicit half(const T& val) : half_impl::half_base(half_impl::float_to_half_rtne(static_cast<float>(val))) {} explicit half(float f) : half_impl::half_base(half_impl::float_to_half_rtne(f)) {} operator bool() const { return (x & 0x7fff) != 0; } operator signed char() const { return static_cast<signed char>(half_impl::half_to_float(*this)); } operator unsigned char() const { return static_cast<unsigned char>(half_impl::half_to_float(*this)); } operator short() const { return static_cast<short>(half_impl::half_to_float(*this)); } operator unsigned short() const { return static_cast<unsigned short>(half_impl::half_to_float(*this)); } operator int() const { return static_cast<int>(half_impl::half_to_float(*this)); } operator unsigned int() const { return static_cast<unsigned int>(half_impl::half_to_float(*this)); } operator long() const { return static_cast<long>(half_impl::half_to_float(*this)); } operator unsigned long() const { return static_cast<unsigned long>(half_impl::half_to_float(*this)); } operator long long() const { return static_cast<long long>(half_impl::half_to_float(*this)); } operator unsigned long long() const { return static_cast<unsigned long long>(half_to_float(*this)); } operator float() const { return half_impl::half_to_float(*this); } operator double() const { return static_cast<double>(half_impl::half_to_float(*this)); } half& operator=(const half& other) { x = other.x; return *this; } }; } namespace std { template<> struct numeric_limits<Eigen::half> { static const bool is_specialized = true; static const bool is_signed = true; static const bool is_integer = false; static const bool is_exact = false; static const bool has_infinity = true; static const bool has_quiet_NaN = true; static const bool has_signaling_NaN = true; static const float_denorm_style has_denorm = denorm_present; static const bool has_denorm_loss = false; static const std::float_round_style round_style = std::round_to_nearest; static const bool is_iec559 = false; static const bool is_bounded = false; static const bool is_modulo = false; static const int digits = 11; static const int digits10 = 3; static const int max_digits10 = 5; static const int radix = 2; static const int min_exponent = -13; static const int min_exponent10 = -4; static const int max_exponent = 16; static const int max_exponent10 = 4; static const bool traps = true; static const bool tinyness_before = false; static Eigen::half (min)() { return Eigen::half_impl::raw_uint16_to_half(0x400); } static Eigen::half lowest() { return Eigen::half_impl::raw_uint16_to_half(0xfbff); } static Eigen::half (max)() { return Eigen::half_impl::raw_uint16_to_half(0x7bff); } static Eigen::half epsilon() { return Eigen::half_impl::raw_uint16_to_half(0x0800); } static Eigen::half round_error() { return Eigen::half(0.5); } static Eigen::half infinity() { return Eigen::half_impl::raw_uint16_to_half(0x7c00); } static Eigen::half quiet_NaN() { return Eigen::half_impl::raw_uint16_to_half(0x7e00); } static Eigen::half signaling_NaN() { return Eigen::half_impl::raw_uint16_to_half(0x7e00); } static Eigen::half denorm_min() { return Eigen::half_impl::raw_uint16_to_half(0x1); } }; template<> struct numeric_limits<const Eigen::half> : numeric_limits<Eigen::half> {}; template<> struct numeric_limits<volatile Eigen::half> : numeric_limits<Eigen::half> {}; template<> struct numeric_limits<const volatile Eigen::half> : numeric_limits<Eigen::half> {}; } namespace Eigen { namespace half_impl { # 268 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Half.h" inline half operator + (const half& a, const half& b) { return half(float(a) + float(b)); } inline half operator * (const half& a, const half& b) { return half(float(a) * float(b)); } inline half operator - (const half& a, const half& b) { return half(float(a) - float(b)); } inline half operator / (const half& a, const half& b) { return half(float(a) / float(b)); } inline half operator - (const half& a) { half result; result.x = a.x ^ 0x8000; return result; } inline half& operator += (half& a, const half& b) { a = half(float(a) + float(b)); return a; } inline half& operator *= (half& a, const half& b) { a = half(float(a) * float(b)); return a; } inline half& operator -= (half& a, const half& b) { a = half(float(a) - float(b)); return a; } inline half& operator /= (half& a, const half& b) { a = half(float(a) / float(b)); return a; } inline bool operator == (const half& a, const half& b) { return numext::equal_strict(float(a),float(b)); } inline bool operator != (const half& a, const half& b) { return numext::not_equal_strict(float(a), float(b)); } inline bool operator < (const half& a, const half& b) { return float(a) < float(b); } inline bool operator <= (const half& a, const half& b) { return float(a) <= float(b); } inline bool operator > (const half& a, const half& b) { return float(a) > float(b); } inline bool operator >= (const half& a, const half& b) { return float(a) >= float(b); } inline half operator / (const half& a, Index b) { return half(static_cast<float>(a) / static_cast<float>(b)); } inline __half_raw raw_uint16_to_half(unsigned short x) { __half_raw h; h.x = x; return h; } union float32_bits { unsigned int u; float f; }; inline __half_raw float_to_half_rtne(float ff) { # 355 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Half.h" float32_bits f; f.f = ff; const float32_bits f32infty = { 255 << 23 }; const float32_bits f16max = { (127 + 16) << 23 }; const float32_bits denorm_magic = { ((127 - 15) + (23 - 10) + 1) << 23 }; unsigned int sign_mask = 0x80000000u; __half_raw o; o.x = static_cast<unsigned short>(0x0u); unsigned int sign = f.u & sign_mask; f.u ^= sign; if (f.u >= f16max.u) { o.x = (f.u > f32infty.u) ? 0x7e00 : 0x7c00; } else { if (f.u < (113 << 23)) { f.f += denorm_magic.f; o.x = static_cast<unsigned short>(f.u - denorm_magic.u); } else { unsigned int mant_odd = (f.u >> 13) & 1; f.u += ((unsigned int)(15 - 127) << 23) + 0xfff; f.u += mant_odd; o.x = static_cast<unsigned short>(f.u >> 13); } } o.x |= static_cast<unsigned short>(sign >> 16); return o; } inline float half_to_float(__half_raw h) { const float32_bits magic = { 113 << 23 }; const unsigned int shifted_exp = 0x7c00 << 13; float32_bits o; o.u = (h.x & 0x7fff) << 13; unsigned int exp = shifted_exp & o.u; o.u += (127 - 15) << 23; if (exp == shifted_exp) { o.u += (128 - 16) << 23; } else if (exp == 0) { o.u += 1 << 23; o.f -= magic.f; } o.u |= (h.x & 0x8000) << 16; return o.f; } inline bool (isinf)(const half& a) { return (a.x & 0x7fff) == 0x7c00; } inline bool (isnan)(const half& a) { return (a.x & 0x7fff) > 0x7c00; } inline bool (isfinite)(const half& a) { return !(isinf (a)) && !(isnan (a)); } inline half abs(const half& a) { half result; result.x = a.x & 0x7FFF; return result; } inline half exp(const half& a) { return half(::expf(float(a))); } inline half log(const half& a) { return half(::logf(float(a))); } inline half log1p(const half& a) { return half(numext::log1p(float(a))); } inline half log10(const half& a) { return half(::log10f(float(a))); } inline half sqrt(const half& a) { return half(::sqrtf(float(a))); } inline half pow(const half& a, const half& b) { return half(::powf(float(a), float(b))); } inline half sin(const half& a) { return half(::sinf(float(a))); } inline half cos(const half& a) { return half(::cosf(float(a))); } inline half tan(const half& a) { return half(::tanf(float(a))); } inline half tanh(const half& a) { return half(::tanhf(float(a))); } inline half floor(const half& a) { return half(::floorf(float(a))); } inline half ceil(const half& a) { return half(::ceilf(float(a))); } inline half (min)(const half& a, const half& b) { const float f1 = static_cast<float>(a); const float f2 = static_cast<float>(b); return f2 < f1 ? b : a; } inline half (max)(const half& a, const half& b) { const float f1 = static_cast<float>(a); const float f2 = static_cast<float>(b); return f1 < f2 ? b : a; } __attribute__((always_inline)) inline std::ostream& operator << (std::ostream& os, const half& v) { os << static_cast<float>(v); return os; } } namespace internal { template<> struct random_default_impl<half, false, false> { static inline half run(const half& x, const half& y) { return x + (y-x) * half(float(std::rand()) / float(2147483647)); } static inline half run() { return run(half(-1.f), half(1.f)); } }; template<> struct is_arithmetic<half> { enum { value = true }; }; } template<> struct NumTraits<Eigen::half> : GenericNumTraits<Eigen::half> { enum { IsSigned = true, IsInteger = false, IsComplex = false, RequireInitialization = false }; static inline Eigen::half epsilon() { return half_impl::raw_uint16_to_half(0x0800); } static inline Eigen::half dummy_precision() { return Eigen::half(1e-2f); } static inline Eigen::half highest() { return half_impl::raw_uint16_to_half(0x7bff); } static inline Eigen::half lowest() { return half_impl::raw_uint16_to_half(0xfbff); } static inline Eigen::half infinity() { return half_impl::raw_uint16_to_half(0x7c00); } static inline Eigen::half quiet_NaN() { return half_impl::raw_uint16_to_half(0x7c01); } }; } inline Eigen::half fabsh(const Eigen::half& a) { Eigen::half result; result.x = a.x & 0x7FFF; return result; } inline Eigen::half exph(const Eigen::half& a) { return Eigen::half(::expf(float(a))); } inline Eigen::half logh(const Eigen::half& a) { return Eigen::half(::logf(float(a))); } inline Eigen::half sqrth(const Eigen::half& a) { return Eigen::half(::sqrtf(float(a))); } inline Eigen::half powh(const Eigen::half& a, const Eigen::half& b) { return Eigen::half(::powf(float(a), float(b))); } inline Eigen::half floorh(const Eigen::half& a) { return Eigen::half(::floorf(float(a))); } inline Eigen::half ceilh(const Eigen::half& a) { return Eigen::half(::ceilf(float(a))); } namespace std { # 625 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Half.h" } # 412 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/PacketMathHalf.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/PacketMathHalf.h" namespace Eigen { namespace internal { # 1121 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/PacketMathHalf.h" } } # 413 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/TypeCasting.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/TypeCasting.h" namespace Eigen { namespace internal { template<> struct scalar_cast_op<float, Eigen::half> { inline scalar_cast_op() {} inline scalar_cast_op(const scalar_cast_op& ) {} typedef Eigen::half result_type; inline Eigen::half operator() (const float& a) const { return Eigen::half(a); } }; template<> struct functor_traits<scalar_cast_op<float, Eigen::half> > { enum { Cost = NumTraits<float>::AddCost, PacketAccess = false }; }; template<> struct scalar_cast_op<int, Eigen::half> { inline scalar_cast_op() {} inline scalar_cast_op(const scalar_cast_op& ) {} typedef Eigen::half result_type; inline Eigen::half operator() (const int& a) const { return Eigen::half(static_cast<float>(a)); } }; template<> struct functor_traits<scalar_cast_op<int, Eigen::half> > { enum { Cost = NumTraits<float>::AddCost, PacketAccess = false }; }; template<> struct scalar_cast_op<Eigen::half, float> { inline scalar_cast_op() {} inline scalar_cast_op(const scalar_cast_op& ) {} typedef float result_type; inline float operator() (const Eigen::half& a) const { return static_cast<float>(a); } }; template<> struct functor_traits<scalar_cast_op<Eigen::half, float> > { enum { Cost = NumTraits<float>::AddCost, PacketAccess = false }; }; # 208 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/TypeCasting.h" } } # 414 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/arch/Default/Settings.h" 1 # 421 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/functors/TernaryFunctors.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/functors/TernaryFunctors.h" namespace Eigen { namespace internal { } } # 423 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/functors/BinaryFunctors.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/functors/BinaryFunctors.h" namespace Eigen { namespace internal { template<typename Arg1, typename Arg2> struct binary_op_base { typedef Arg1 first_argument_type; typedef Arg2 second_argument_type; }; template<typename LhsScalar,typename RhsScalar> struct scalar_sum_op : binary_op_base<LhsScalar,RhsScalar> { typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar,scalar_sum_op>::ReturnType result_type; inline scalar_sum_op() {} inline scalar_sum_op(const scalar_sum_op& ) {} inline const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a + b; } template<typename Packet> inline const Packet packetOp(const Packet& a, const Packet& b) const { return internal::padd(a,b); } template<typename Packet> inline const result_type predux(const Packet& a) const { return internal::predux(a); } }; template<typename LhsScalar,typename RhsScalar> struct functor_traits<scalar_sum_op<LhsScalar,RhsScalar> > { enum { Cost = (NumTraits<LhsScalar>::AddCost+NumTraits<RhsScalar>::AddCost)/2, PacketAccess = is_same<LhsScalar,RhsScalar>::value && packet_traits<LhsScalar>::HasAdd && packet_traits<RhsScalar>::HasAdd }; }; template<> struct scalar_sum_op<bool,bool> : scalar_sum_op<int,int> { __attribute__((deprecated)) scalar_sum_op() {} }; template<typename LhsScalar,typename RhsScalar> struct scalar_product_op : binary_op_base<LhsScalar,RhsScalar> { typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar,scalar_product_op>::ReturnType result_type; inline scalar_product_op() {} inline scalar_product_op(const scalar_product_op& ) {} inline const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a * b; } template<typename Packet> inline const Packet packetOp(const Packet& a, const Packet& b) const { return internal::pmul(a,b); } template<typename Packet> inline const result_type predux(const Packet& a) const { return internal::predux_mul(a); } }; template<typename LhsScalar,typename RhsScalar> struct functor_traits<scalar_product_op<LhsScalar,RhsScalar> > { enum { Cost = (NumTraits<LhsScalar>::MulCost + NumTraits<RhsScalar>::MulCost)/2, PacketAccess = is_same<LhsScalar,RhsScalar>::value && packet_traits<LhsScalar>::HasMul && packet_traits<RhsScalar>::HasMul }; }; template<typename LhsScalar,typename RhsScalar> struct scalar_conj_product_op : binary_op_base<LhsScalar,RhsScalar> { enum { Conj = NumTraits<LhsScalar>::IsComplex }; typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar,scalar_conj_product_op>::ReturnType result_type; inline scalar_conj_product_op() {} inline scalar_conj_product_op(const scalar_conj_product_op& ) {} inline const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return conj_helper<LhsScalar,RhsScalar,Conj,false>().pmul(a,b); } template<typename Packet> inline const Packet packetOp(const Packet& a, const Packet& b) const { return conj_helper<Packet,Packet,Conj,false>().pmul(a,b); } }; template<typename LhsScalar,typename RhsScalar> struct functor_traits<scalar_conj_product_op<LhsScalar,RhsScalar> > { enum { Cost = NumTraits<LhsScalar>::MulCost, PacketAccess = internal::is_same<LhsScalar, RhsScalar>::value && packet_traits<LhsScalar>::HasMul }; }; template<typename LhsScalar,typename RhsScalar> struct scalar_min_op : binary_op_base<LhsScalar,RhsScalar> { typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar,scalar_min_op>::ReturnType result_type; inline scalar_min_op() {} inline scalar_min_op(const scalar_min_op& ) {} inline const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return numext::mini(a, b); } template<typename Packet> inline const Packet packetOp(const Packet& a, const Packet& b) const { return internal::pmin(a,b); } template<typename Packet> inline const result_type predux(const Packet& a) const { return internal::predux_min(a); } }; template<typename LhsScalar,typename RhsScalar> struct functor_traits<scalar_min_op<LhsScalar,RhsScalar> > { enum { Cost = (NumTraits<LhsScalar>::AddCost+NumTraits<RhsScalar>::AddCost)/2, PacketAccess = internal::is_same<LhsScalar, RhsScalar>::value && packet_traits<LhsScalar>::HasMin }; }; template<typename LhsScalar,typename RhsScalar> struct scalar_max_op : binary_op_base<LhsScalar,RhsScalar> { typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar,scalar_max_op>::ReturnType result_type; inline scalar_max_op() {} inline scalar_max_op(const scalar_max_op& ) {} inline const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return numext::maxi(a, b); } template<typename Packet> inline const Packet packetOp(const Packet& a, const Packet& b) const { return internal::pmax(a,b); } template<typename Packet> inline const result_type predux(const Packet& a) const { return internal::predux_max(a); } }; template<typename LhsScalar,typename RhsScalar> struct functor_traits<scalar_max_op<LhsScalar,RhsScalar> > { enum { Cost = (NumTraits<LhsScalar>::AddCost+NumTraits<RhsScalar>::AddCost)/2, PacketAccess = internal::is_same<LhsScalar, RhsScalar>::value && packet_traits<LhsScalar>::HasMax }; }; template<typename LhsScalar, typename RhsScalar, ComparisonName cmp> struct scalar_cmp_op; template<typename LhsScalar, typename RhsScalar, ComparisonName cmp> struct functor_traits<scalar_cmp_op<LhsScalar,RhsScalar, cmp> > { enum { Cost = (NumTraits<LhsScalar>::AddCost+NumTraits<RhsScalar>::AddCost)/2, PacketAccess = false }; }; template<ComparisonName Cmp, typename LhsScalar, typename RhsScalar> struct result_of<scalar_cmp_op<LhsScalar, RhsScalar, Cmp>(LhsScalar,RhsScalar)> { typedef bool type; }; template<typename LhsScalar, typename RhsScalar> struct scalar_cmp_op<LhsScalar,RhsScalar, cmp_EQ> : binary_op_base<LhsScalar,RhsScalar> { typedef bool result_type; inline scalar_cmp_op() {} inline scalar_cmp_op(const scalar_cmp_op& ) {} inline bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a==b;} }; template<typename LhsScalar, typename RhsScalar> struct scalar_cmp_op<LhsScalar,RhsScalar, cmp_LT> : binary_op_base<LhsScalar,RhsScalar> { typedef bool result_type; inline scalar_cmp_op() {} inline scalar_cmp_op(const scalar_cmp_op& ) {} inline bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a<b;} }; template<typename LhsScalar, typename RhsScalar> struct scalar_cmp_op<LhsScalar,RhsScalar, cmp_LE> : binary_op_base<LhsScalar,RhsScalar> { typedef bool result_type; inline scalar_cmp_op() {} inline scalar_cmp_op(const scalar_cmp_op& ) {} inline bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a<=b;} }; template<typename LhsScalar, typename RhsScalar> struct scalar_cmp_op<LhsScalar,RhsScalar, cmp_GT> : binary_op_base<LhsScalar,RhsScalar> { typedef bool result_type; inline scalar_cmp_op() {} inline scalar_cmp_op(const scalar_cmp_op& ) {} inline bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a>b;} }; template<typename LhsScalar, typename RhsScalar> struct scalar_cmp_op<LhsScalar,RhsScalar, cmp_GE> : binary_op_base<LhsScalar,RhsScalar> { typedef bool result_type; inline scalar_cmp_op() {} inline scalar_cmp_op(const scalar_cmp_op& ) {} inline bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a>=b;} }; template<typename LhsScalar, typename RhsScalar> struct scalar_cmp_op<LhsScalar,RhsScalar, cmp_UNORD> : binary_op_base<LhsScalar,RhsScalar> { typedef bool result_type; inline scalar_cmp_op() {} inline scalar_cmp_op(const scalar_cmp_op& ) {} inline bool operator()(const LhsScalar& a, const RhsScalar& b) const {return !(a<=b || b<=a);} }; template<typename LhsScalar, typename RhsScalar> struct scalar_cmp_op<LhsScalar,RhsScalar, cmp_NEQ> : binary_op_base<LhsScalar,RhsScalar> { typedef bool result_type; inline scalar_cmp_op() {} inline scalar_cmp_op(const scalar_cmp_op& ) {} inline bool operator()(const LhsScalar& a, const RhsScalar& b) const {return a!=b;} }; template<typename Scalar> struct scalar_hypot_op<Scalar,Scalar> : binary_op_base<Scalar,Scalar> { inline scalar_hypot_op() {} inline scalar_hypot_op(const scalar_hypot_op& ) {} inline const Scalar operator() (const Scalar &x, const Scalar &y) const { return internal::positive_real_hypot(x,y); } }; template<typename Scalar> struct functor_traits<scalar_hypot_op<Scalar,Scalar> > { enum { Cost = 3 * NumTraits<Scalar>::AddCost + 2 * NumTraits<Scalar>::MulCost + 2 * scalar_div_cost<Scalar,false>::value, PacketAccess = false }; }; template<typename Scalar, typename Exponent> struct scalar_pow_op : binary_op_base<Scalar,Exponent> { typedef typename ScalarBinaryOpTraits<Scalar,Exponent,scalar_pow_op>::ReturnType result_type; inline scalar_pow_op() {} inline scalar_pow_op(const scalar_pow_op& ) {} inline result_type operator() (const Scalar& a, const Exponent& b) const { return numext::pow(a, b); } }; template<typename Scalar, typename Exponent> struct functor_traits<scalar_pow_op<Scalar,Exponent> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false }; }; # 321 "eigen-3.3.7/Eigen/src/Core/functors/BinaryFunctors.h" template<typename LhsScalar,typename RhsScalar> struct scalar_difference_op : binary_op_base<LhsScalar,RhsScalar> { typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar,scalar_difference_op>::ReturnType result_type; inline scalar_difference_op() {} inline scalar_difference_op(const scalar_difference_op& ) {} inline const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a - b; } template<typename Packet> inline const Packet packetOp(const Packet& a, const Packet& b) const { return internal::psub(a,b); } }; template<typename LhsScalar,typename RhsScalar> struct functor_traits<scalar_difference_op<LhsScalar,RhsScalar> > { enum { Cost = (NumTraits<LhsScalar>::AddCost+NumTraits<RhsScalar>::AddCost)/2, PacketAccess = is_same<LhsScalar,RhsScalar>::value && packet_traits<LhsScalar>::HasSub && packet_traits<RhsScalar>::HasSub }; }; template<typename LhsScalar,typename RhsScalar> struct scalar_quotient_op : binary_op_base<LhsScalar,RhsScalar> { typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar,scalar_quotient_op>::ReturnType result_type; inline scalar_quotient_op() {} inline scalar_quotient_op(const scalar_quotient_op& ) {} inline const result_type operator() (const LhsScalar& a, const RhsScalar& b) const { return a / b; } template<typename Packet> inline const Packet packetOp(const Packet& a, const Packet& b) const { return internal::pdiv(a,b); } }; template<typename LhsScalar,typename RhsScalar> struct functor_traits<scalar_quotient_op<LhsScalar,RhsScalar> > { typedef typename scalar_quotient_op<LhsScalar,RhsScalar>::result_type result_type; enum { PacketAccess = is_same<LhsScalar,RhsScalar>::value && packet_traits<LhsScalar>::HasDiv && packet_traits<RhsScalar>::HasDiv, Cost = scalar_div_cost<result_type,PacketAccess>::value }; }; # 382 "eigen-3.3.7/Eigen/src/Core/functors/BinaryFunctors.h" struct scalar_boolean_and_op { inline scalar_boolean_and_op() {} inline scalar_boolean_and_op(const scalar_boolean_and_op& ) {} inline bool operator() (const bool& a, const bool& b) const { return a && b; } }; template<> struct functor_traits<scalar_boolean_and_op> { enum { Cost = NumTraits<bool>::AddCost, PacketAccess = false }; }; struct scalar_boolean_or_op { inline scalar_boolean_or_op() {} inline scalar_boolean_or_op(const scalar_boolean_or_op& ) {} inline bool operator() (const bool& a, const bool& b) const { return a || b; } }; template<> struct functor_traits<scalar_boolean_or_op> { enum { Cost = NumTraits<bool>::AddCost, PacketAccess = false }; }; struct scalar_boolean_xor_op { inline scalar_boolean_xor_op() {} inline scalar_boolean_xor_op(const scalar_boolean_xor_op& ) {} inline bool operator() (const bool& a, const bool& b) const { return a ^ b; } }; template<> struct functor_traits<scalar_boolean_xor_op> { enum { Cost = NumTraits<bool>::AddCost, PacketAccess = false }; }; # 433 "eigen-3.3.7/Eigen/src/Core/functors/BinaryFunctors.h" template<typename BinaryOp> struct bind1st_op : BinaryOp { typedef typename BinaryOp::first_argument_type first_argument_type; typedef typename BinaryOp::second_argument_type second_argument_type; typedef typename BinaryOp::result_type result_type; bind1st_op(const first_argument_type &val) : m_value(val) {} inline const result_type operator() (const second_argument_type& b) const { return BinaryOp::operator()(m_value,b); } template<typename Packet> inline const Packet packetOp(const Packet& b) const { return BinaryOp::packetOp(internal::pset1<Packet>(m_value), b); } first_argument_type m_value; }; template<typename BinaryOp> struct functor_traits<bind1st_op<BinaryOp> > : functor_traits<BinaryOp> {}; template<typename BinaryOp> struct bind2nd_op : BinaryOp { typedef typename BinaryOp::first_argument_type first_argument_type; typedef typename BinaryOp::second_argument_type second_argument_type; typedef typename BinaryOp::result_type result_type; bind2nd_op(const second_argument_type &val) : m_value(val) {} inline const result_type operator() (const first_argument_type& a) const { return BinaryOp::operator()(a,m_value); } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return BinaryOp::packetOp(a,internal::pset1<Packet>(m_value)); } second_argument_type m_value; }; template<typename BinaryOp> struct functor_traits<bind2nd_op<BinaryOp> > : functor_traits<BinaryOp> {}; } } # 424 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/functors/UnaryFunctors.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/functors/UnaryFunctors.h" namespace Eigen { namespace internal { template<typename Scalar> struct scalar_opposite_op { inline scalar_opposite_op() {} inline scalar_opposite_op(const scalar_opposite_op& ) {} inline const Scalar operator() (const Scalar& a) const { return -a; } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::pnegate(a); } }; template<typename Scalar> struct functor_traits<scalar_opposite_op<Scalar> > { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasNegate }; }; template<typename Scalar> struct scalar_abs_op { inline scalar_abs_op() {} inline scalar_abs_op(const scalar_abs_op& ) {} typedef typename NumTraits<Scalar>::Real result_type; inline const result_type operator() (const Scalar& a) const { return numext::abs(a); } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::pabs(a); } }; template<typename Scalar> struct functor_traits<scalar_abs_op<Scalar> > { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasAbs }; }; template<typename Scalar> struct scalar_score_coeff_op : scalar_abs_op<Scalar> { typedef void Score_is_abs; }; template<typename Scalar> struct functor_traits<scalar_score_coeff_op<Scalar> > : functor_traits<scalar_abs_op<Scalar> > {}; template<typename Scalar, typename=void> struct abs_knowing_score { inline abs_knowing_score() {} inline abs_knowing_score(const abs_knowing_score& ) {} typedef typename NumTraits<Scalar>::Real result_type; template<typename Score> inline const result_type operator() (const Scalar& a, const Score&) const { return numext::abs(a); } }; template<typename Scalar> struct abs_knowing_score<Scalar, typename scalar_score_coeff_op<Scalar>::Score_is_abs> { inline abs_knowing_score() {} inline abs_knowing_score(const abs_knowing_score& ) {} typedef typename NumTraits<Scalar>::Real result_type; template<typename Scal> inline const result_type operator() (const Scal&, const result_type& a) const { return a; } }; template<typename Scalar> struct scalar_abs2_op { inline scalar_abs2_op() {} inline scalar_abs2_op(const scalar_abs2_op& ) {} typedef typename NumTraits<Scalar>::Real result_type; inline const result_type operator() (const Scalar& a) const { return numext::abs2(a); } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::pmul(a,a); } }; template<typename Scalar> struct functor_traits<scalar_abs2_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasAbs2 }; }; template<typename Scalar> struct scalar_conjugate_op { inline scalar_conjugate_op() {} inline scalar_conjugate_op(const scalar_conjugate_op& ) {} inline const Scalar operator() (const Scalar& a) const { using numext::conj; return conj(a); } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::pconj(a); } }; template<typename Scalar> struct functor_traits<scalar_conjugate_op<Scalar> > { enum { Cost = NumTraits<Scalar>::IsComplex ? NumTraits<Scalar>::AddCost : 0, PacketAccess = packet_traits<Scalar>::HasConj }; }; template<typename Scalar> struct scalar_arg_op { inline scalar_arg_op() {} inline scalar_arg_op(const scalar_arg_op& ) {} typedef typename NumTraits<Scalar>::Real result_type; inline const result_type operator() (const Scalar& a) const { using numext::arg; return arg(a); } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::parg(a); } }; template<typename Scalar> struct functor_traits<scalar_arg_op<Scalar> > { enum { Cost = NumTraits<Scalar>::IsComplex ? 5 * NumTraits<Scalar>::MulCost : NumTraits<Scalar>::AddCost, PacketAccess = packet_traits<Scalar>::HasArg }; }; template<typename Scalar, typename NewType> struct scalar_cast_op { inline scalar_cast_op() {} inline scalar_cast_op(const scalar_cast_op& ) {} typedef NewType result_type; inline const NewType operator() (const Scalar& a) const { return cast<Scalar, NewType>(a); } }; template<typename Scalar, typename NewType> struct functor_traits<scalar_cast_op<Scalar,NewType> > { enum { Cost = is_same<Scalar, NewType>::value ? 0 : NumTraits<NewType>::AddCost, PacketAccess = false }; }; template<typename Scalar> struct scalar_real_op { inline scalar_real_op() {} inline scalar_real_op(const scalar_real_op& ) {} typedef typename NumTraits<Scalar>::Real result_type; inline result_type operator() (const Scalar& a) const { return numext::real(a); } }; template<typename Scalar> struct functor_traits<scalar_real_op<Scalar> > { enum { Cost = 0, PacketAccess = false }; }; template<typename Scalar> struct scalar_imag_op { inline scalar_imag_op() {} inline scalar_imag_op(const scalar_imag_op& ) {} typedef typename NumTraits<Scalar>::Real result_type; inline result_type operator() (const Scalar& a) const { return numext::imag(a); } }; template<typename Scalar> struct functor_traits<scalar_imag_op<Scalar> > { enum { Cost = 0, PacketAccess = false }; }; template<typename Scalar> struct scalar_real_ref_op { inline scalar_real_ref_op() {} inline scalar_real_ref_op(const scalar_real_ref_op& ) {} typedef typename NumTraits<Scalar>::Real result_type; inline result_type& operator() (const Scalar& a) const { return numext::real_ref(*const_cast<Scalar*>(&a)); } }; template<typename Scalar> struct functor_traits<scalar_real_ref_op<Scalar> > { enum { Cost = 0, PacketAccess = false }; }; template<typename Scalar> struct scalar_imag_ref_op { inline scalar_imag_ref_op() {} inline scalar_imag_ref_op(const scalar_imag_ref_op& ) {} typedef typename NumTraits<Scalar>::Real result_type; inline result_type& operator() (const Scalar& a) const { return numext::imag_ref(*const_cast<Scalar*>(&a)); } }; template<typename Scalar> struct functor_traits<scalar_imag_ref_op<Scalar> > { enum { Cost = 0, PacketAccess = false }; }; template<typename Scalar> struct scalar_exp_op { inline scalar_exp_op() {} inline scalar_exp_op(const scalar_exp_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::exp(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pexp(a); } }; template <typename Scalar> struct functor_traits<scalar_exp_op<Scalar> > { enum { PacketAccess = packet_traits<Scalar>::HasExp, # 253 "eigen-3.3.7/Eigen/src/Core/functors/UnaryFunctors.h" Cost = (sizeof(Scalar) == 4 ? (21 * NumTraits<Scalar>::AddCost + 13 * NumTraits<Scalar>::MulCost) : (23 * NumTraits<Scalar>::AddCost + 12 * NumTraits<Scalar>::MulCost + scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value)) }; }; template<typename Scalar> struct scalar_log_op { inline scalar_log_op() {} inline scalar_log_op(const scalar_log_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::log(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::plog(a); } }; template <typename Scalar> struct functor_traits<scalar_log_op<Scalar> > { enum { PacketAccess = packet_traits<Scalar>::HasLog, Cost = (PacketAccess ? (36 * NumTraits<Scalar>::AddCost + 14 * NumTraits<Scalar>::MulCost) : sizeof(Scalar)==4 ? 40 : 85) }; }; template<typename Scalar> struct scalar_log1p_op { inline scalar_log1p_op() {} inline scalar_log1p_op(const scalar_log1p_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::log1p(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::plog1p(a); } }; template <typename Scalar> struct functor_traits<scalar_log1p_op<Scalar> > { enum { PacketAccess = packet_traits<Scalar>::HasLog1p, Cost = functor_traits<scalar_log_op<Scalar> >::Cost }; }; template<typename Scalar> struct scalar_log10_op { inline scalar_log10_op() {} inline scalar_log10_op(const scalar_log10_op& ) {} inline const Scalar operator() (const Scalar& a) const { using std::log10; return log10(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::plog10(a); } }; template<typename Scalar> struct functor_traits<scalar_log10_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasLog10 }; }; template<typename Scalar> struct scalar_sqrt_op { inline scalar_sqrt_op() {} inline scalar_sqrt_op(const scalar_sqrt_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::sqrt(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::psqrt(a); } }; template <typename Scalar> struct functor_traits<scalar_sqrt_op<Scalar> > { enum { Cost = (sizeof(Scalar) == 8 ? 28 : (3 * NumTraits<Scalar>::AddCost + 5 * NumTraits<Scalar>::MulCost)), PacketAccess = packet_traits<Scalar>::HasSqrt }; }; template<typename Scalar> struct scalar_rsqrt_op { inline scalar_rsqrt_op() {} inline scalar_rsqrt_op(const scalar_rsqrt_op& ) {} inline const Scalar operator() (const Scalar& a) const { return Scalar(1)/numext::sqrt(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::prsqrt(a); } }; template<typename Scalar> struct functor_traits<scalar_rsqrt_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasRsqrt }; }; template<typename Scalar> struct scalar_cos_op { inline scalar_cos_op() {} inline scalar_cos_op(const scalar_cos_op& ) {} inline Scalar operator() (const Scalar& a) const { return numext::cos(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pcos(a); } }; template<typename Scalar> struct functor_traits<scalar_cos_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasCos }; }; template<typename Scalar> struct scalar_sin_op { inline scalar_sin_op() {} inline scalar_sin_op(const scalar_sin_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::sin(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::psin(a); } }; template<typename Scalar> struct functor_traits<scalar_sin_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasSin }; }; template<typename Scalar> struct scalar_tan_op { inline scalar_tan_op() {} inline scalar_tan_op(const scalar_tan_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::tan(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::ptan(a); } }; template<typename Scalar> struct functor_traits<scalar_tan_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasTan }; }; template<typename Scalar> struct scalar_acos_op { inline scalar_acos_op() {} inline scalar_acos_op(const scalar_acos_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::acos(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pacos(a); } }; template<typename Scalar> struct functor_traits<scalar_acos_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasACos }; }; template<typename Scalar> struct scalar_asin_op { inline scalar_asin_op() {} inline scalar_asin_op(const scalar_asin_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::asin(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pasin(a); } }; template<typename Scalar> struct functor_traits<scalar_asin_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasASin }; }; template<typename Scalar> struct scalar_atan_op { inline scalar_atan_op() {} inline scalar_atan_op(const scalar_atan_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::atan(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::patan(a); } }; template<typename Scalar> struct functor_traits<scalar_atan_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasATan }; }; template <typename Scalar> struct scalar_tanh_op { inline scalar_tanh_op() {} inline scalar_tanh_op(const scalar_tanh_op& ) {} inline const Scalar operator()(const Scalar& a) const { return numext::tanh(a); } template <typename Packet> inline Packet packetOp(const Packet& x) const { return ptanh(x); } }; template <typename Scalar> struct functor_traits<scalar_tanh_op<Scalar> > { enum { PacketAccess = packet_traits<Scalar>::HasTanh, Cost = ( (1 && is_same<Scalar,float>::value) # 519 "eigen-3.3.7/Eigen/src/Core/functors/UnaryFunctors.h" ? (11 * NumTraits<Scalar>::AddCost + 11 * NumTraits<Scalar>::MulCost + scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value) : (6 * NumTraits<Scalar>::AddCost + 3 * NumTraits<Scalar>::MulCost + 2 * scalar_div_cost<Scalar,packet_traits<Scalar>::HasDiv>::value + functor_traits<scalar_exp_op<Scalar> >::Cost)) }; }; template<typename Scalar> struct scalar_sinh_op { inline scalar_sinh_op() {} inline scalar_sinh_op(const scalar_sinh_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::sinh(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::psinh(a); } }; template<typename Scalar> struct functor_traits<scalar_sinh_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasSinh }; }; template<typename Scalar> struct scalar_cosh_op { inline scalar_cosh_op() {} inline scalar_cosh_op(const scalar_cosh_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::cosh(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pcosh(a); } }; template<typename Scalar> struct functor_traits<scalar_cosh_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasCosh }; }; template<typename Scalar> struct scalar_inverse_op { inline scalar_inverse_op() {} inline scalar_inverse_op(const scalar_inverse_op& ) {} inline Scalar operator() (const Scalar& a) const { return Scalar(1)/a; } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::pdiv(pset1<Packet>(Scalar(1)),a); } }; template<typename Scalar> struct functor_traits<scalar_inverse_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasDiv }; }; template<typename Scalar> struct scalar_square_op { inline scalar_square_op() {} inline scalar_square_op(const scalar_square_op& ) {} inline Scalar operator() (const Scalar& a) const { return a*a; } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::pmul(a,a); } }; template<typename Scalar> struct functor_traits<scalar_square_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; template<typename Scalar> struct scalar_cube_op { inline scalar_cube_op() {} inline scalar_cube_op(const scalar_cube_op& ) {} inline Scalar operator() (const Scalar& a) const { return a*a*a; } template<typename Packet> inline const Packet packetOp(const Packet& a) const { return internal::pmul(a,pmul(a,a)); } }; template<typename Scalar> struct functor_traits<scalar_cube_op<Scalar> > { enum { Cost = 2*NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasMul }; }; template<typename Scalar> struct scalar_round_op { inline scalar_round_op() {} inline scalar_round_op(const scalar_round_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::round(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pround(a); } }; template<typename Scalar> struct functor_traits<scalar_round_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasRound }; }; template<typename Scalar> struct scalar_floor_op { inline scalar_floor_op() {} inline scalar_floor_op(const scalar_floor_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::floor(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pfloor(a); } }; template<typename Scalar> struct functor_traits<scalar_floor_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasFloor }; }; template<typename Scalar> struct scalar_ceil_op { inline scalar_ceil_op() {} inline scalar_ceil_op(const scalar_ceil_op& ) {} inline const Scalar operator() (const Scalar& a) const { return numext::ceil(a); } template <typename Packet> inline Packet packetOp(const Packet& a) const { return internal::pceil(a); } }; template<typename Scalar> struct functor_traits<scalar_ceil_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = packet_traits<Scalar>::HasCeil }; }; template<typename Scalar> struct scalar_isnan_op { inline scalar_isnan_op() {} inline scalar_isnan_op(const scalar_isnan_op& ) {} typedef bool result_type; inline result_type operator() (const Scalar& a) const { return (numext::isnan)(a); } }; template<typename Scalar> struct functor_traits<scalar_isnan_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = false }; }; template<typename Scalar> struct scalar_isinf_op { inline scalar_isinf_op() {} inline scalar_isinf_op(const scalar_isinf_op& ) {} typedef bool result_type; inline result_type operator() (const Scalar& a) const { return (numext::isinf)(a); } }; template<typename Scalar> struct functor_traits<scalar_isinf_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = false }; }; template<typename Scalar> struct scalar_isfinite_op { inline scalar_isfinite_op() {} inline scalar_isfinite_op(const scalar_isfinite_op& ) {} typedef bool result_type; inline result_type operator() (const Scalar& a) const { return (numext::isfinite)(a); } }; template<typename Scalar> struct functor_traits<scalar_isfinite_op<Scalar> > { enum { Cost = NumTraits<Scalar>::MulCost, PacketAccess = false }; }; template<typename Scalar> struct scalar_boolean_not_op { inline scalar_boolean_not_op() {} inline scalar_boolean_not_op(const scalar_boolean_not_op& ) {} inline bool operator() (const bool& a) const { return !a; } }; template<typename Scalar> struct functor_traits<scalar_boolean_not_op<Scalar> > { enum { Cost = NumTraits<bool>::AddCost, PacketAccess = false }; }; template<typename Scalar,bool iscpx=(NumTraits<Scalar>::IsComplex!=0) > struct scalar_sign_op; template<typename Scalar> struct scalar_sign_op<Scalar,false> { inline scalar_sign_op() {} inline scalar_sign_op(const scalar_sign_op& ) {} inline const Scalar operator() (const Scalar& a) const { return Scalar( (a>Scalar(0)) - (a<Scalar(0)) ); } }; template<typename Scalar> struct scalar_sign_op<Scalar,true> { inline scalar_sign_op() {} inline scalar_sign_op(const scalar_sign_op& ) {} inline const Scalar operator() (const Scalar& a) const { typedef typename NumTraits<Scalar>::Real real_type; real_type aa = numext::abs(a); if (aa==real_type(0)) return Scalar(0); aa = real_type(1)/aa; return Scalar(real(a)*aa, imag(a)*aa ); } }; template<typename Scalar> struct functor_traits<scalar_sign_op<Scalar> > { enum { Cost = NumTraits<Scalar>::IsComplex ? ( 8*NumTraits<Scalar>::MulCost ) : ( 3*NumTraits<Scalar>::AddCost), PacketAccess = packet_traits<Scalar>::HasSign }; }; } } # 425 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/functors/NullaryFunctors.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/functors/NullaryFunctors.h" namespace Eigen { namespace internal { template<typename Scalar> struct scalar_constant_op { inline scalar_constant_op(const scalar_constant_op& other) : m_other(other.m_other) { } inline scalar_constant_op(const Scalar& other) : m_other(other) { } inline const Scalar operator() () const { return m_other; } template<typename PacketType> inline const PacketType packetOp() const { return internal::pset1<PacketType>(m_other); } const Scalar m_other; }; template<typename Scalar> struct functor_traits<scalar_constant_op<Scalar> > { enum { Cost = 0 , PacketAccess = packet_traits<Scalar>::Vectorizable, IsRepeatable = true }; }; template<typename Scalar> struct scalar_identity_op { inline scalar_identity_op() {} inline scalar_identity_op(const scalar_identity_op& ) {} template<typename IndexType> inline const Scalar operator() (IndexType row, IndexType col) const { return row==col ? Scalar(1) : Scalar(0); } }; template<typename Scalar> struct functor_traits<scalar_identity_op<Scalar> > { enum { Cost = NumTraits<Scalar>::AddCost, PacketAccess = false, IsRepeatable = true }; }; template <typename Scalar, typename Packet, bool IsInteger> struct linspaced_op_impl; template <typename Scalar, typename Packet> struct linspaced_op_impl<Scalar,Packet, false> { linspaced_op_impl(const Scalar& low, const Scalar& high, Index num_steps) : m_low(low), m_high(high), m_size1(num_steps==1 ? 1 : num_steps-1), m_step(num_steps==1 ? Scalar() : (high-low)/Scalar(num_steps-1)), m_flip(numext::abs(high)<numext::abs(low)) {} template<typename IndexType> inline const Scalar operator() (IndexType i) const { typedef typename NumTraits<Scalar>::Real RealScalar; if(m_flip) return (i==0)? m_low : (m_high - RealScalar(m_size1-i)*m_step); else return (i==m_size1)? m_high : (m_low + RealScalar(i)*m_step); } template<typename IndexType> inline const Packet packetOp(IndexType i) const { if(m_flip) { Packet pi = plset<Packet>(Scalar(i-m_size1)); Packet res = padd(pset1<Packet>(m_high), pmul(pset1<Packet>(m_step), pi)); if(i==0) res = pinsertfirst(res, m_low); return res; } else { Packet pi = plset<Packet>(Scalar(i)); Packet res = padd(pset1<Packet>(m_low), pmul(pset1<Packet>(m_step), pi)); if(i==m_size1-unpacket_traits<Packet>::size+1) res = pinsertlast(res, m_high); return res; } } const Scalar m_low; const Scalar m_high; const Index m_size1; const Scalar m_step; const bool m_flip; }; template <typename Scalar, typename Packet> struct linspaced_op_impl<Scalar,Packet, true> { linspaced_op_impl(const Scalar& low, const Scalar& high, Index num_steps) : m_low(low), m_multiplier((high-low)/convert_index<Scalar>(num_steps<=1 ? 1 : num_steps-1)), m_divisor(convert_index<Scalar>((high>=low?num_steps:-num_steps)+(high-low))/((numext::abs(high-low)+1)==0?1:(numext::abs(high-low)+1))), m_use_divisor(num_steps>1 && (numext::abs(high-low)+1)<num_steps) {} template<typename IndexType> inline const Scalar operator() (IndexType i) const { if(m_use_divisor) return m_low + convert_index<Scalar>(i)/m_divisor; else return m_low + convert_index<Scalar>(i)*m_multiplier; } const Scalar m_low; const Scalar m_multiplier; const Scalar m_divisor; const bool m_use_divisor; }; template <typename Scalar, typename PacketType> struct linspaced_op; template <typename Scalar, typename PacketType> struct functor_traits< linspaced_op<Scalar,PacketType> > { enum { Cost = 1, PacketAccess = (!NumTraits<Scalar>::IsInteger) && packet_traits<Scalar>::HasSetLinear && packet_traits<Scalar>::HasBlend, IsRepeatable = true }; }; template <typename Scalar, typename PacketType> struct linspaced_op { linspaced_op(const Scalar& low, const Scalar& high, Index num_steps) : impl((num_steps==1 ? high : low),high,num_steps) {} template<typename IndexType> inline const Scalar operator() (IndexType i) const { return impl(i); } template<typename Packet,typename IndexType> inline const Packet packetOp(IndexType i) const { return impl.packetOp(i); } const linspaced_op_impl<Scalar,PacketType,NumTraits<Scalar>::IsInteger> impl; }; template<typename Functor> struct functor_has_linear_access { enum { ret = !has_binary_operator<Functor>::value }; }; template<typename Scalar,typename IndexType> struct has_nullary_operator<scalar_constant_op<Scalar>,IndexType> { enum { value = 1}; }; template<typename Scalar,typename IndexType> struct has_unary_operator<scalar_constant_op<Scalar>,IndexType> { enum { value = 0}; }; template<typename Scalar,typename IndexType> struct has_binary_operator<scalar_constant_op<Scalar>,IndexType> { enum { value = 0}; }; template<typename Scalar,typename IndexType> struct has_nullary_operator<scalar_identity_op<Scalar>,IndexType> { enum { value = 0}; }; template<typename Scalar,typename IndexType> struct has_unary_operator<scalar_identity_op<Scalar>,IndexType> { enum { value = 0}; }; template<typename Scalar,typename IndexType> struct has_binary_operator<scalar_identity_op<Scalar>,IndexType> { enum { value = 1}; }; template<typename Scalar, typename PacketType,typename IndexType> struct has_nullary_operator<linspaced_op<Scalar,PacketType>,IndexType> { enum { value = 0}; }; template<typename Scalar, typename PacketType,typename IndexType> struct has_unary_operator<linspaced_op<Scalar,PacketType>,IndexType> { enum { value = 1}; }; template<typename Scalar, typename PacketType,typename IndexType> struct has_binary_operator<linspaced_op<Scalar,PacketType>,IndexType> { enum { value = 0}; }; template<typename Scalar,typename IndexType> struct has_nullary_operator<scalar_random_op<Scalar>,IndexType> { enum { value = 1}; }; template<typename Scalar,typename IndexType> struct has_unary_operator<scalar_random_op<Scalar>,IndexType> { enum { value = 0}; }; template<typename Scalar,typename IndexType> struct has_binary_operator<scalar_random_op<Scalar>,IndexType> { enum { value = 0}; }; } } # 426 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/functors/StlFunctors.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/functors/StlFunctors.h" namespace Eigen { namespace internal { template<typename T> struct functor_traits<std::multiplies<T> > { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::divides<T> > { enum { Cost = NumTraits<T>::MulCost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::plus<T> > { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::minus<T> > { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::negate<T> > { enum { Cost = NumTraits<T>::AddCost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::logical_or<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::logical_and<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::logical_not<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::greater<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::less<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::greater_equal<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::less_equal<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::equal_to<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::not_equal_to<T> > { enum { Cost = 1, PacketAccess = false }; }; template<typename T> struct functor_traits<std::binder2nd<T> > { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::binder1st<T> > { enum { Cost = functor_traits<T>::Cost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::unary_negate<T> > { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; template<typename T> struct functor_traits<std::binary_negate<T> > { enum { Cost = 1 + functor_traits<T>::Cost, PacketAccess = false }; }; # 132 "eigen-3.3.7/Eigen/src/Core/functors/StlFunctors.h" } } # 427 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/functors/AssignmentFunctors.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/functors/AssignmentFunctors.h" namespace Eigen { namespace internal { template<typename DstScalar,typename SrcScalar> struct assign_op { inline assign_op() {} inline assign_op(const assign_op& ) {} inline void assignCoeff(DstScalar& a, const SrcScalar& b) const { a = b; } template<int Alignment, typename Packet> inline void assignPacket(DstScalar* a, const Packet& b) const { internal::pstoret<DstScalar,Packet,Alignment>(a,b); } }; template<typename DstScalar> struct assign_op<DstScalar,void> {}; template<typename DstScalar,typename SrcScalar> struct functor_traits<assign_op<DstScalar,SrcScalar> > { enum { Cost = NumTraits<DstScalar>::ReadCost, PacketAccess = is_same<DstScalar,SrcScalar>::value && packet_traits<DstScalar>::Vectorizable && packet_traits<SrcScalar>::Vectorizable }; }; template<typename DstScalar,typename SrcScalar> struct add_assign_op { inline add_assign_op() {} inline add_assign_op(const add_assign_op& ) {} inline void assignCoeff(DstScalar& a, const SrcScalar& b) const { a += b; } template<int Alignment, typename Packet> inline void assignPacket(DstScalar* a, const Packet& b) const { internal::pstoret<DstScalar,Packet,Alignment>(a,internal::padd(internal::ploadt<Packet,Alignment>(a),b)); } }; template<typename DstScalar,typename SrcScalar> struct functor_traits<add_assign_op<DstScalar,SrcScalar> > { enum { Cost = NumTraits<DstScalar>::ReadCost + NumTraits<DstScalar>::AddCost, PacketAccess = is_same<DstScalar,SrcScalar>::value && packet_traits<DstScalar>::HasAdd }; }; template<typename DstScalar,typename SrcScalar> struct sub_assign_op { inline sub_assign_op() {} inline sub_assign_op(const sub_assign_op& ) {} inline void assignCoeff(DstScalar& a, const SrcScalar& b) const { a -= b; } template<int Alignment, typename Packet> inline void assignPacket(DstScalar* a, const Packet& b) const { internal::pstoret<DstScalar,Packet,Alignment>(a,internal::psub(internal::ploadt<Packet,Alignment>(a),b)); } }; template<typename DstScalar,typename SrcScalar> struct functor_traits<sub_assign_op<DstScalar,SrcScalar> > { enum { Cost = NumTraits<DstScalar>::ReadCost + NumTraits<DstScalar>::AddCost, PacketAccess = is_same<DstScalar,SrcScalar>::value && packet_traits<DstScalar>::HasSub }; }; template<typename DstScalar, typename SrcScalar=DstScalar> struct mul_assign_op { inline mul_assign_op() {} inline mul_assign_op(const mul_assign_op& ) {} inline void assignCoeff(DstScalar& a, const SrcScalar& b) const { a *= b; } template<int Alignment, typename Packet> inline void assignPacket(DstScalar* a, const Packet& b) const { internal::pstoret<DstScalar,Packet,Alignment>(a,internal::pmul(internal::ploadt<Packet,Alignment>(a),b)); } }; template<typename DstScalar, typename SrcScalar> struct functor_traits<mul_assign_op<DstScalar,SrcScalar> > { enum { Cost = NumTraits<DstScalar>::ReadCost + NumTraits<DstScalar>::MulCost, PacketAccess = is_same<DstScalar,SrcScalar>::value && packet_traits<DstScalar>::HasMul }; }; template<typename DstScalar, typename SrcScalar=DstScalar> struct div_assign_op { inline div_assign_op() {} inline div_assign_op(const div_assign_op& ) {} inline void assignCoeff(DstScalar& a, const SrcScalar& b) const { a /= b; } template<int Alignment, typename Packet> inline void assignPacket(DstScalar* a, const Packet& b) const { internal::pstoret<DstScalar,Packet,Alignment>(a,internal::pdiv(internal::ploadt<Packet,Alignment>(a),b)); } }; template<typename DstScalar, typename SrcScalar> struct functor_traits<div_assign_op<DstScalar,SrcScalar> > { enum { Cost = NumTraits<DstScalar>::ReadCost + NumTraits<DstScalar>::MulCost, PacketAccess = is_same<DstScalar,SrcScalar>::value && packet_traits<DstScalar>::HasDiv }; }; # 142 "eigen-3.3.7/Eigen/src/Core/functors/AssignmentFunctors.h" template<typename Scalar> struct swap_assign_op { inline swap_assign_op() {} inline swap_assign_op(const swap_assign_op& ) {} inline void assignCoeff(Scalar& a, const Scalar& b) const { using std::swap; swap(a,const_cast<Scalar&>(b)); } }; template<typename Scalar> struct functor_traits<swap_assign_op<Scalar> > { enum { Cost = 3 * NumTraits<Scalar>::ReadCost, PacketAccess = packet_traits<Scalar>::Vectorizable }; }; } } # 428 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Complex.h" 1 # 15 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Complex.h" namespace Eigen { namespace internal { # 99 "eigen-3.3.7/Eigen/src/Core/arch/CUDA/Complex.h" } } # 432 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/IO.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/IO.h" namespace Eigen { enum { DontAlignCols = 1 }; enum { StreamPrecision = -1, FullPrecision = -2 }; namespace internal { template<typename Derived> std::ostream & print_matrix(std::ostream & s, const Derived& _m, const IOFormat& fmt); } # 50 "eigen-3.3.7/Eigen/src/Core/IO.h" struct IOFormat { IOFormat(int _precision = StreamPrecision, int _flags = 0, const std::string& _coeffSeparator = " ", const std::string& _rowSeparator = "\n", const std::string& _rowPrefix="", const std::string& _rowSuffix="", const std::string& _matPrefix="", const std::string& _matSuffix="") : matPrefix(_matPrefix), matSuffix(_matSuffix), rowPrefix(_rowPrefix), rowSuffix(_rowSuffix), rowSeparator(_rowSeparator), rowSpacer(""), coeffSeparator(_coeffSeparator), precision(_precision), flags(_flags) { if((flags & DontAlignCols)) return; int i = int(matSuffix.length())-1; while (i>=0 && matSuffix[i]!='\n') { rowSpacer += ' '; i--; } } std::string matPrefix, matSuffix; std::string rowPrefix, rowSuffix, rowSeparator, rowSpacer; std::string coeffSeparator; int precision; int flags; }; # 93 "eigen-3.3.7/Eigen/src/Core/IO.h" template<typename ExpressionType> class WithFormat { public: WithFormat(const ExpressionType& matrix, const IOFormat& format) : m_matrix(matrix), m_format(format) {} friend std::ostream & operator << (std::ostream & s, const WithFormat& wf) { return internal::print_matrix(s, wf.m_matrix.eval(), wf.m_format); } protected: typename ExpressionType::Nested m_matrix; IOFormat m_format; }; namespace internal { template<typename Scalar> struct significant_decimals_impl { static inline int run() { return NumTraits<Scalar>::digits10(); } }; template<typename Derived> std::ostream & print_matrix(std::ostream & s, const Derived& _m, const IOFormat& fmt) { if(_m.size() == 0) { s << fmt.matPrefix << fmt.matSuffix; return s; } typename Derived::Nested m = _m; typedef typename Derived::Scalar Scalar; Index width = 0; std::streamsize explicit_precision; if(fmt.precision == StreamPrecision) { explicit_precision = 0; } else if(fmt.precision == FullPrecision) { if (NumTraits<Scalar>::IsInteger) { explicit_precision = 0; } else { explicit_precision = significant_decimals_impl<Scalar>::run(); } } else { explicit_precision = fmt.precision; } std::streamsize old_precision = 0; if(explicit_precision) old_precision = s.precision(explicit_precision); bool align_cols = !(fmt.flags & DontAlignCols); if(align_cols) { for(Index j = 0; j < m.cols(); ++j) for(Index i = 0; i < m.rows(); ++i) { std::stringstream sstr; sstr.copyfmt(s); sstr << m.coeff(i,j); width = std::max<Index>(width, Index(sstr.str().length())); } } s << fmt.matPrefix; for(Index i = 0; i < m.rows(); ++i) { if (i) s << fmt.rowSpacer; s << fmt.rowPrefix; if(width) s.width(width); s << m.coeff(i, 0); for(Index j = 1; j < m.cols(); ++j) { s << fmt.coeffSeparator; if (width) s.width(width); s << m.coeff(i, j); } s << fmt.rowSuffix; if( i < m.rows() - 1) s << fmt.rowSeparator; } s << fmt.matSuffix; if(explicit_precision) s.precision(old_precision); return s; } } # 215 "eigen-3.3.7/Eigen/src/Core/IO.h" template<typename Derived> std::ostream & operator << (std::ostream & s, const DenseBase<Derived> & m) { return internal::print_matrix(s, m.eval(), Eigen::IOFormat()); } } # 434 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" namespace Eigen { namespace internal { template<typename T> struct add_const_on_value_type_if_arithmetic { typedef typename conditional<is_arithmetic<T>::value, T, typename add_const_on_value_type<T>::type>::type type; }; } # 33 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" template<typename Derived> class DenseCoeffsBase<Derived,ReadOnlyAccessors> : public EigenBase<Derived> { public: typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename internal::packet_traits<Scalar>::type PacketScalar; # 48 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" typedef typename internal::conditional<bool(internal::traits<Derived>::Flags&LvalueBit), const Scalar&, typename internal::conditional<internal::is_arithmetic<Scalar>::value, Scalar, const Scalar>::type >::type CoeffReturnType; typedef typename internal::add_const_on_value_type_if_arithmetic< typename internal::packet_traits<Scalar>::type >::type PacketReturnType; typedef EigenBase<Derived> Base; using Base::rows; using Base::cols; using Base::size; using Base::derived; inline Index rowIndexByOuterInner(Index outer, Index inner) const { return int(Derived::RowsAtCompileTime) == 1 ? 0 : int(Derived::ColsAtCompileTime) == 1 ? inner : int(Derived::Flags)&RowMajorBit ? outer : inner; } inline Index colIndexByOuterInner(Index outer, Index inner) const { return int(Derived::ColsAtCompileTime) == 1 ? 0 : int(Derived::RowsAtCompileTime) == 1 ? inner : int(Derived::Flags)&RowMajorBit ? inner : outer; } # 95 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline CoeffReturnType coeff(Index row, Index col) const { ; return internal::evaluator<Derived>(derived()).coeff(row,col); } inline CoeffReturnType coeffByOuterInner(Index outer, Index inner) const { return coeff(rowIndexByOuterInner(outer, inner), colIndexByOuterInner(outer, inner)); } inline CoeffReturnType operator()(Index row, Index col) const { ((row >= 0 && row < rows() && col >= 0 && col < cols()) ? static_cast<void> (0) : __assert_fail ("row >= 0 && row < rows() && col >= 0 && col < cols()", "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" # 117 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" , 118 # 117 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" , __PRETTY_FUNCTION__)) ; return coeff(row, col); } # 137 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline CoeffReturnType coeff(Index index) const { if (Eigen::internal::static_assertion<static_cast<bool>(internal::evaluator<Derived>::Flags & LinearAccessBit)>::THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS) {} ; return internal::evaluator<Derived>(derived()).coeff(index); } # 156 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline CoeffReturnType operator[](Index index) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::THE_BRACKET_OPERATOR_IS_ONLY_FOR_VECTORS__USE_THE_PARENTHESIS_OPERATOR_INSTEAD) {} ((index >= 0 && index < size()) ? static_cast<void> (0) : __assert_fail ("index >= 0 && index < size()", "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h", 162, __PRETTY_FUNCTION__)); return coeff(index); } # 176 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline CoeffReturnType operator()(Index index) const { ((index >= 0 && index < size()) ? static_cast<void> (0) : __assert_fail ("index >= 0 && index < size()", "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h", 180, __PRETTY_FUNCTION__)); return coeff(index); } inline CoeffReturnType x() const { return (*this)[0]; } inline CoeffReturnType y() const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=2)>::OUT_OF_RANGE_ACCESS) {}; return (*this)[1]; } inline CoeffReturnType z() const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=3)>::OUT_OF_RANGE_ACCESS) {}; return (*this)[2]; } inline CoeffReturnType w() const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=4)>::OUT_OF_RANGE_ACCESS) {}; return (*this)[3]; } # 230 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" template<int LoadMode> inline PacketReturnType packet(Index row, Index col) const { typedef typename internal::packet_traits<Scalar>::type DefaultPacketType; ; return internal::evaluator<Derived>(derived()).template packet<LoadMode,DefaultPacketType>(row,col); } template<int LoadMode> inline PacketReturnType packetByOuterInner(Index outer, Index inner) const { return packet<LoadMode>(rowIndexByOuterInner(outer, inner), colIndexByOuterInner(outer, inner)); } # 257 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" template<int LoadMode> inline PacketReturnType packet(Index index) const { if (Eigen::internal::static_assertion<static_cast<bool>(internal::evaluator<Derived>::Flags & LinearAccessBit)>::THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS) {} typedef typename internal::packet_traits<Scalar>::type DefaultPacketType; ; return internal::evaluator<Derived>(derived()).template packet<LoadMode,DefaultPacketType>(index); } protected: void coeffRef(); void coeffRefByOuterInner(); void writePacket(); void writePacketByOuterInner(); void copyCoeff(); void copyCoeffByOuterInner(); void copyPacket(); void copyPacketByOuterInner(); void stride(); void innerStride(); void outerStride(); void rowStride(); void colStride(); }; # 299 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" template<typename Derived> class DenseCoeffsBase<Derived, WriteAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors> { public: typedef DenseCoeffsBase<Derived, ReadOnlyAccessors> Base; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename internal::packet_traits<Scalar>::type PacketScalar; typedef typename NumTraits<Scalar>::Real RealScalar; using Base::coeff; using Base::rows; using Base::cols; using Base::size; using Base::derived; using Base::rowIndexByOuterInner; using Base::colIndexByOuterInner; using Base::operator[]; using Base::operator(); using Base::x; using Base::y; using Base::z; using Base::w; # 339 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline Scalar& coeffRef(Index row, Index col) { ; return internal::evaluator<Derived>(derived()).coeffRef(row,col); } inline Scalar& coeffRefByOuterInner(Index outer, Index inner) { return coeffRef(rowIndexByOuterInner(outer, inner), colIndexByOuterInner(outer, inner)); } inline Scalar& operator()(Index row, Index col) { ((row >= 0 && row < rows() && col >= 0 && col < cols()) ? static_cast<void> (0) : __assert_fail ("row >= 0 && row < rows() && col >= 0 && col < cols()", "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" # 364 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" , 365 # 364 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" , __PRETTY_FUNCTION__)) ; return coeffRef(row, col); } # 385 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline Scalar& coeffRef(Index index) { if (Eigen::internal::static_assertion<static_cast<bool>(internal::evaluator<Derived>::Flags & LinearAccessBit)>::THIS_COEFFICIENT_ACCESSOR_TAKING_ONE_ACCESS_IS_ONLY_FOR_EXPRESSIONS_ALLOWING_LINEAR_ACCESS) {} ; return internal::evaluator<Derived>(derived()).coeffRef(index); } # 402 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline Scalar& operator[](Index index) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::THE_BRACKET_OPERATOR_IS_ONLY_FOR_VECTORS__USE_THE_PARENTHESIS_OPERATOR_INSTEAD) {} ((index >= 0 && index < size()) ? static_cast<void> (0) : __assert_fail ("index >= 0 && index < size()", "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h", 408, __PRETTY_FUNCTION__)); return coeffRef(index); } # 421 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" inline Scalar& operator()(Index index) { ((index >= 0 && index < size()) ? static_cast<void> (0) : __assert_fail ("index >= 0 && index < size()", "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h", 425, __PRETTY_FUNCTION__)); return coeffRef(index); } inline Scalar& x() { return (*this)[0]; } inline Scalar& y() { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=2)>::OUT_OF_RANGE_ACCESS) {}; return (*this)[1]; } inline Scalar& z() { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=3)>::OUT_OF_RANGE_ACCESS) {}; return (*this)[2]; } inline Scalar& w() { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==-1 || Derived::SizeAtCompileTime>=4)>::OUT_OF_RANGE_ACCESS) {}; return (*this)[3]; } }; # 477 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" template<typename Derived> class DenseCoeffsBase<Derived, DirectAccessors> : public DenseCoeffsBase<Derived, ReadOnlyAccessors> { public: typedef DenseCoeffsBase<Derived, ReadOnlyAccessors> Base; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; using Base::rows; using Base::cols; using Base::size; using Base::derived; inline Index innerStride() const { return derived().innerStride(); } inline Index outerStride() const { return derived().outerStride(); } inline Index stride() const { return Derived::IsVectorAtCompileTime ? innerStride() : outerStride(); } inline Index rowStride() const { return Derived::IsRowMajor ? outerStride() : innerStride(); } inline Index colStride() const { return Derived::IsRowMajor ? innerStride() : outerStride(); } }; # 550 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" template<typename Derived> class DenseCoeffsBase<Derived, DirectWriteAccessors> : public DenseCoeffsBase<Derived, WriteAccessors> { public: typedef DenseCoeffsBase<Derived, WriteAccessors> Base; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; using Base::rows; using Base::cols; using Base::size; using Base::derived; inline Index innerStride() const { return derived().innerStride(); } inline Index outerStride() const { return derived().outerStride(); } inline Index stride() const { return Derived::IsVectorAtCompileTime ? innerStride() : outerStride(); } inline Index rowStride() const { return Derived::IsRowMajor ? outerStride() : innerStride(); } inline Index colStride() const { return Derived::IsRowMajor ? innerStride() : outerStride(); } }; namespace internal { template<int Alignment, typename Derived, bool JustReturnZero> struct first_aligned_impl { static inline Index run(const Derived&) { return 0; } }; template<int Alignment, typename Derived> struct first_aligned_impl<Alignment, Derived, false> { static inline Index run(const Derived& m) { return internal::first_aligned<Alignment>(m.data(), m.size()); } }; # 638 "eigen-3.3.7/Eigen/src/Core/DenseCoeffsBase.h" template<int Alignment, typename Derived> static inline Index first_aligned(const DenseBase<Derived>& m) { enum { ReturnZero = (int(evaluator<Derived>::Alignment) >= Alignment) || !(Derived::Flags & DirectAccessBit) }; return first_aligned_impl<Alignment, Derived, ReturnZero>::run(m.derived()); } template<typename Derived> static inline Index first_default_aligned(const DenseBase<Derived>& m) { typedef typename Derived::Scalar Scalar; typedef typename packet_traits<Scalar>::type DefaultPacketType; return internal::first_aligned<int(unpacket_traits<DefaultPacketType>::alignment),Derived>(m); } template<typename Derived, bool HasDirectAccess = has_direct_access<Derived>::ret> struct inner_stride_at_compile_time { enum { ret = traits<Derived>::InnerStrideAtCompileTime }; }; template<typename Derived> struct inner_stride_at_compile_time<Derived, false> { enum { ret = 0 }; }; template<typename Derived, bool HasDirectAccess = has_direct_access<Derived>::ret> struct outer_stride_at_compile_time { enum { ret = traits<Derived>::OuterStrideAtCompileTime }; }; template<typename Derived> struct outer_stride_at_compile_time<Derived, false> { enum { ret = 0 }; }; } } # 435 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" namespace Eigen { namespace internal { static inline void check_DenseIndex_is_signed() { if (Eigen::internal::static_assertion<static_cast<bool>(NumTraits<DenseIndex>::IsSigned)>::THE_INDEX_TYPE_MUST_BE_A_SIGNED_TYPE) {}; } } # 41 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" template<typename Derived> class DenseBase : public DenseCoeffsBase<Derived> { public: typedef Eigen::InnerIterator<Derived> InnerIterator; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::StorageIndex StorageIndex; typedef typename internal::traits<Derived>::Scalar Scalar; typedef Scalar value_type; typedef typename NumTraits<Scalar>::Real RealScalar; typedef DenseCoeffsBase<Derived> Base; using Base::derived; using Base::const_cast_derived; using Base::rows; using Base::cols; using Base::size; using Base::rowIndexByOuterInner; using Base::colIndexByOuterInner; using Base::coeff; using Base::coeffByOuterInner; using Base::operator(); using Base::operator[]; using Base::x; using Base::y; using Base::z; using Base::w; using Base::stride; using Base::innerStride; using Base::outerStride; using Base::rowStride; using Base::colStride; typedef typename Base::CoeffReturnType CoeffReturnType; enum { RowsAtCompileTime = internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = internal::traits<Derived>::ColsAtCompileTime, SizeAtCompileTime = (internal::size_at_compile_time<internal::traits<Derived>::RowsAtCompileTime, internal::traits<Derived>::ColsAtCompileTime>::ret), MaxRowsAtCompileTime = internal::traits<Derived>::MaxRowsAtCompileTime, # 130 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" MaxColsAtCompileTime = internal::traits<Derived>::MaxColsAtCompileTime, # 141 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" MaxSizeAtCompileTime = (internal::size_at_compile_time<internal::traits<Derived>::MaxRowsAtCompileTime, internal::traits<Derived>::MaxColsAtCompileTime>::ret), # 153 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" IsVectorAtCompileTime = internal::traits<Derived>::MaxRowsAtCompileTime == 1 || internal::traits<Derived>::MaxColsAtCompileTime == 1, Flags = internal::traits<Derived>::Flags, IsRowMajor = int(Flags) & RowMajorBit, InnerSizeAtCompileTime = int(IsVectorAtCompileTime) ? int(SizeAtCompileTime) : int(IsRowMajor) ? int(ColsAtCompileTime) : int(RowsAtCompileTime), InnerStrideAtCompileTime = internal::inner_stride_at_compile_time<Derived>::ret, OuterStrideAtCompileTime = internal::outer_stride_at_compile_time<Derived>::ret }; typedef typename internal::find_best_packet<Scalar,SizeAtCompileTime>::type PacketScalar; enum { IsPlainObjectBase = 0 }; typedef Matrix<typename internal::traits<Derived>::Scalar, internal::traits<Derived>::RowsAtCompileTime, internal::traits<Derived>::ColsAtCompileTime, AutoAlign | (internal::traits<Derived>::Flags&RowMajorBit ? RowMajor : ColMajor), internal::traits<Derived>::MaxRowsAtCompileTime, internal::traits<Derived>::MaxColsAtCompileTime > PlainMatrix; typedef Array<typename internal::traits<Derived>::Scalar, internal::traits<Derived>::RowsAtCompileTime, internal::traits<Derived>::ColsAtCompileTime, AutoAlign | (internal::traits<Derived>::Flags&RowMajorBit ? RowMajor : ColMajor), internal::traits<Derived>::MaxRowsAtCompileTime, internal::traits<Derived>::MaxColsAtCompileTime > PlainArray; typedef typename internal::conditional<internal::is_same<typename internal::traits<Derived>::XprKind,MatrixXpr >::value, PlainMatrix, PlainArray>::type PlainObject; inline Index nonZeros() const { return size(); } Index outerSize() const { return IsVectorAtCompileTime ? 1 : int(IsRowMajor) ? this->rows() : this->cols(); } Index innerSize() const { return IsVectorAtCompileTime ? this->size() : int(IsRowMajor) ? this->cols() : this->rows(); } void resize(Index newSize) { ; ((newSize == this->size() && "DenseBase::resize() does not actually allow to resize.") ? static_cast<void> (0) : __assert_fail ("newSize == this->size() && \"DenseBase::resize() does not actually allow to resize.\"", "eigen-3.3.7/Eigen/src/Core/DenseBase.h" # 244 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" , 245 # 244 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" , __PRETTY_FUNCTION__)) ; } void resize(Index rows, Index cols) { ; ; ((rows == this->rows() && cols == this->cols() && "DenseBase::resize() does not actually allow to resize.") ? static_cast<void> (0) : __assert_fail ("rows == this->rows() && cols == this->cols() && \"DenseBase::resize() does not actually allow to resize.\"", "eigen-3.3.7/Eigen/src/Core/DenseBase.h" # 256 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" , 257 # 256 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" , __PRETTY_FUNCTION__)) ; } typedef CwiseNullaryOp<internal::scalar_constant_op<Scalar>,PlainObject> ConstantReturnType; typedef CwiseNullaryOp<internal::linspaced_op<Scalar,PacketScalar>,PlainObject> SequentialLinSpacedReturnType; typedef CwiseNullaryOp<internal::linspaced_op<Scalar,PacketScalar>,PlainObject> RandomAccessLinSpacedReturnType; typedef Matrix<typename NumTraits<typename internal::traits<Derived>::Scalar>::Real, internal::traits<Derived>::ColsAtCompileTime, 1> EigenvaluesReturnType; template<typename OtherDerived> inline Derived& operator=(const DenseBase<OtherDerived>& other); inline Derived& operator=(const DenseBase& other); template<typename OtherDerived> Derived& operator=(const EigenBase<OtherDerived> &other); template<typename OtherDerived> Derived& operator+=(const EigenBase<OtherDerived> &other); template<typename OtherDerived> Derived& operator-=(const EigenBase<OtherDerived> &other); template<typename OtherDerived> Derived& operator=(const ReturnByValue<OtherDerived>& func); template<typename OtherDerived> Derived& lazyAssign(const DenseBase<OtherDerived>& other); CommaInitializer<Derived> operator<< (const Scalar& s); template<unsigned int Added,unsigned int Removed> __attribute__((deprecated)) const Derived& flagged() const { return derived(); } template<typename OtherDerived> CommaInitializer<Derived> operator<< (const DenseBase<OtherDerived>& other); typedef Transpose<Derived> TransposeReturnType; TransposeReturnType transpose(); typedef typename internal::add_const<Transpose<const Derived> >::type ConstTransposeReturnType; ConstTransposeReturnType transpose() const; void transposeInPlace(); static const ConstantReturnType Constant(Index rows, Index cols, const Scalar& value); static const ConstantReturnType Constant(Index size, const Scalar& value); static const ConstantReturnType Constant(const Scalar& value); static const SequentialLinSpacedReturnType LinSpaced(Sequential_t, Index size, const Scalar& low, const Scalar& high); static const RandomAccessLinSpacedReturnType LinSpaced(Index size, const Scalar& low, const Scalar& high); static const SequentialLinSpacedReturnType LinSpaced(Sequential_t, const Scalar& low, const Scalar& high); static const RandomAccessLinSpacedReturnType LinSpaced(const Scalar& low, const Scalar& high); template<typename CustomNullaryOp> static const CwiseNullaryOp<CustomNullaryOp, PlainObject> NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func); template<typename CustomNullaryOp> static const CwiseNullaryOp<CustomNullaryOp, PlainObject> NullaryExpr(Index size, const CustomNullaryOp& func); template<typename CustomNullaryOp> static const CwiseNullaryOp<CustomNullaryOp, PlainObject> NullaryExpr(const CustomNullaryOp& func); static const ConstantReturnType Zero(Index rows, Index cols); static const ConstantReturnType Zero(Index size); static const ConstantReturnType Zero(); static const ConstantReturnType Ones(Index rows, Index cols); static const ConstantReturnType Ones(Index size); static const ConstantReturnType Ones(); void fill(const Scalar& value); Derived& setConstant(const Scalar& value); Derived& setLinSpaced(Index size, const Scalar& low, const Scalar& high); Derived& setLinSpaced(const Scalar& low, const Scalar& high); Derived& setZero(); Derived& setOnes(); Derived& setRandom(); template<typename OtherDerived> bool isApprox(const DenseBase<OtherDerived>& other, const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isMuchSmallerThan(const RealScalar& other, const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; template<typename OtherDerived> bool isMuchSmallerThan(const DenseBase<OtherDerived>& other, const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isApproxToConstant(const Scalar& value, const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isConstant(const Scalar& value, const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isZero(const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isOnes(const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; inline bool hasNaN() const; inline bool allFinite() const; inline Derived& operator*=(const Scalar& other); inline Derived& operator/=(const Scalar& other); typedef typename internal::add_const_on_value_type<typename internal::eval<Derived>::type>::type EvalReturnType; inline EvalReturnType eval() const { return typename internal::eval<Derived>::type(derived()); } template<typename OtherDerived> void swap(const DenseBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>(!OtherDerived::IsPlainObjectBase)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {}; ((rows()==other.rows() && cols()==other.cols()) ? static_cast<void> (0) : __assert_fail ("rows()==other.rows() && cols()==other.cols()", "eigen-3.3.7/Eigen/src/Core/DenseBase.h", 417, __PRETTY_FUNCTION__)); call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op<Scalar>()); } template<typename OtherDerived> void swap(PlainObjectBase<OtherDerived>& other) { ((rows()==other.rows() && cols()==other.cols()) ? static_cast<void> (0) : __assert_fail ("rows()==other.rows() && cols()==other.cols()", "eigen-3.3.7/Eigen/src/Core/DenseBase.h", 428, __PRETTY_FUNCTION__)); call_assignment(derived(), other.derived(), internal::swap_assign_op<Scalar>()); } inline const NestByValue<Derived> nestByValue() const; inline const ForceAlignedAccess<Derived> forceAlignedAccess() const; inline ForceAlignedAccess<Derived> forceAlignedAccess(); template<bool Enable> inline const typename internal::conditional<Enable,ForceAlignedAccess<Derived>,Derived&>::type forceAlignedAccessIf() const; template<bool Enable> inline typename internal::conditional<Enable,ForceAlignedAccess<Derived>,Derived&>::type forceAlignedAccessIf(); Scalar sum() const; Scalar mean() const; Scalar trace() const; Scalar prod() const; typename internal::traits<Derived>::Scalar minCoeff() const; typename internal::traits<Derived>::Scalar maxCoeff() const; template<typename IndexType> typename internal::traits<Derived>::Scalar minCoeff(IndexType* row, IndexType* col) const; template<typename IndexType> typename internal::traits<Derived>::Scalar maxCoeff(IndexType* row, IndexType* col) const; template<typename IndexType> typename internal::traits<Derived>::Scalar minCoeff(IndexType* index) const; template<typename IndexType> typename internal::traits<Derived>::Scalar maxCoeff(IndexType* index) const; template<typename BinaryOp> Scalar redux(const BinaryOp& func) const; template<typename Visitor> void visit(Visitor& func) const; # 473 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" inline const WithFormat<Derived> format(const IOFormat& fmt) const { return WithFormat<Derived>(derived(), fmt); } CoeffReturnType value() const { if (Eigen::internal::static_assertion<static_cast<bool>((Derived::RowsAtCompileTime == 1 || Derived::RowsAtCompileTime == Dynamic) && (Derived::ColsAtCompileTime == 1 || Derived::ColsAtCompileTime == Dynamic))>::THIS_METHOD_IS_ONLY_FOR_1x1_EXPRESSIONS) {} ((this->rows() == 1 && this->cols() == 1) ? static_cast<void> (0) : __assert_fail ("this->rows() == 1 && this->cols() == 1", "eigen-3.3.7/Eigen/src/Core/DenseBase.h", 483, __PRETTY_FUNCTION__)); return derived().coeff(0,0); } bool all() const; bool any() const; Index count() const; typedef VectorwiseOp<Derived, Horizontal> RowwiseReturnType; typedef const VectorwiseOp<const Derived, Horizontal> ConstRowwiseReturnType; typedef VectorwiseOp<Derived, Vertical> ColwiseReturnType; typedef const VectorwiseOp<const Derived, Vertical> ConstColwiseReturnType; # 504 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" inline ConstRowwiseReturnType rowwise() const { return ConstRowwiseReturnType(derived()); } RowwiseReturnType rowwise(); # 516 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" inline ConstColwiseReturnType colwise() const { return ConstColwiseReturnType(derived()); } ColwiseReturnType colwise(); typedef CwiseNullaryOp<internal::scalar_random_op<Scalar>,PlainObject> RandomReturnType; static const RandomReturnType Random(Index rows, Index cols); static const RandomReturnType Random(Index size); static const RandomReturnType Random(); template<typename ThenDerived,typename ElseDerived> const Select<Derived,ThenDerived,ElseDerived> select(const DenseBase<ThenDerived>& thenMatrix, const DenseBase<ElseDerived>& elseMatrix) const; template<typename ThenDerived> inline const Select<Derived,ThenDerived, typename ThenDerived::ConstantReturnType> select(const DenseBase<ThenDerived>& thenMatrix, const typename ThenDerived::Scalar& elseScalar) const; template<typename ElseDerived> inline const Select<Derived, typename ElseDerived::ConstantReturnType, ElseDerived > select(const typename ElseDerived::Scalar& thenScalar, const DenseBase<ElseDerived>& elseMatrix) const; template<int p> RealScalar lpNorm() const; template<int RowFactor, int ColFactor> const Replicate<Derived,RowFactor,ColFactor> replicate() const; # 553 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" const Replicate<Derived, Dynamic, Dynamic> replicate(Index rowFactor, Index colFactor) const { return Replicate<Derived, Dynamic, Dynamic>(derived(), rowFactor, colFactor); } typedef Reverse<Derived, BothDirections> ReverseReturnType; typedef const Reverse<const Derived, BothDirections> ConstReverseReturnType; ReverseReturnType reverse(); ConstReverseReturnType reverse() const { return ConstReverseReturnType(derived()); } void reverseInPlace(); # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" typedef Block<Derived, internal::traits<Derived>::RowsAtCompileTime, 1, !IsRowMajor> ColXpr; typedef const Block<const Derived, internal::traits<Derived>::RowsAtCompileTime, 1, !IsRowMajor> ConstColXpr; typedef Block<Derived, 1, internal::traits<Derived>::ColsAtCompileTime, IsRowMajor> RowXpr; typedef const Block<const Derived, 1, internal::traits<Derived>::ColsAtCompileTime, IsRowMajor> ConstRowXpr; typedef Block<Derived, internal::traits<Derived>::RowsAtCompileTime, Dynamic, !IsRowMajor> ColsBlockXpr; typedef const Block<const Derived, internal::traits<Derived>::RowsAtCompileTime, Dynamic, !IsRowMajor> ConstColsBlockXpr; typedef Block<Derived, Dynamic, internal::traits<Derived>::ColsAtCompileTime, IsRowMajor> RowsBlockXpr; typedef const Block<const Derived, Dynamic, internal::traits<Derived>::ColsAtCompileTime, IsRowMajor> ConstRowsBlockXpr; template<int N> struct NColsBlockXpr { typedef Block<Derived, internal::traits<Derived>::RowsAtCompileTime, N, !IsRowMajor> Type; }; template<int N> struct ConstNColsBlockXpr { typedef const Block<const Derived, internal::traits<Derived>::RowsAtCompileTime, N, !IsRowMajor> Type; }; template<int N> struct NRowsBlockXpr { typedef Block<Derived, N, internal::traits<Derived>::ColsAtCompileTime, IsRowMajor> Type; }; template<int N> struct ConstNRowsBlockXpr { typedef const Block<const Derived, N, internal::traits<Derived>::ColsAtCompileTime, IsRowMajor> Type; }; typedef Block<Derived> BlockXpr; typedef const Block<const Derived> ConstBlockXpr; template<int Rows, int Cols> struct FixedBlockXpr { typedef Block<Derived,Rows,Cols> Type; }; template<int Rows, int Cols> struct ConstFixedBlockXpr { typedef Block<const Derived,Rows,Cols> Type; }; typedef VectorBlock<Derived> SegmentReturnType; typedef const VectorBlock<const Derived> ConstSegmentReturnType; template<int Size> struct FixedSegmentReturnType { typedef VectorBlock<Derived, Size> Type; }; template<int Size> struct ConstFixedSegmentReturnType { typedef const VectorBlock<const Derived, Size> Type; }; # 59 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline BlockXpr block(Index startRow, Index startCol, Index blockRows, Index blockCols) { return BlockXpr(derived(), startRow, startCol, blockRows, blockCols); } inline const ConstBlockXpr block(Index startRow, Index startCol, Index blockRows, Index blockCols) const { return ConstBlockXpr(derived(), startRow, startCol, blockRows, blockCols); } # 87 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline BlockXpr topRightCorner(Index cRows, Index cCols) { return BlockXpr(derived(), 0, cols() - cCols, cRows, cCols); } inline const ConstBlockXpr topRightCorner(Index cRows, Index cCols) const { return ConstBlockXpr(derived(), 0, cols() - cCols, cRows, cCols); } # 112 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type topRightCorner() { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), 0, cols() - CCols); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type topRightCorner() const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), 0, cols() - CCols); } # 146 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type topRightCorner(Index cRows, Index cCols) { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), 0, cols() - cCols, cRows, cCols); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type topRightCorner(Index cRows, Index cCols) const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), 0, cols() - cCols, cRows, cCols); } # 173 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline BlockXpr topLeftCorner(Index cRows, Index cCols) { return BlockXpr(derived(), 0, 0, cRows, cCols); } inline const ConstBlockXpr topLeftCorner(Index cRows, Index cCols) const { return ConstBlockXpr(derived(), 0, 0, cRows, cCols); } # 197 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type topLeftCorner() { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), 0, 0); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type topLeftCorner() const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), 0, 0); } # 231 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type topLeftCorner(Index cRows, Index cCols) { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), 0, 0, cRows, cCols); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type topLeftCorner(Index cRows, Index cCols) const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), 0, 0, cRows, cCols); } # 258 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline BlockXpr bottomRightCorner(Index cRows, Index cCols) { return BlockXpr(derived(), rows() - cRows, cols() - cCols, cRows, cCols); } inline const ConstBlockXpr bottomRightCorner(Index cRows, Index cCols) const { return ConstBlockXpr(derived(), rows() - cRows, cols() - cCols, cRows, cCols); } # 282 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type bottomRightCorner() { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), rows() - CRows, cols() - CCols); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type bottomRightCorner() const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), rows() - CRows, cols() - CCols); } # 316 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type bottomRightCorner(Index cRows, Index cCols) { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), rows() - cRows, cols() - cCols, cRows, cCols); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type bottomRightCorner(Index cRows, Index cCols) const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), rows() - cRows, cols() - cCols, cRows, cCols); } # 343 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline BlockXpr bottomLeftCorner(Index cRows, Index cCols) { return BlockXpr(derived(), rows() - cRows, 0, cRows, cCols); } inline const ConstBlockXpr bottomLeftCorner(Index cRows, Index cCols) const { return ConstBlockXpr(derived(), rows() - cRows, 0, cRows, cCols); } # 367 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type bottomLeftCorner() { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), rows() - CRows, 0); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type bottomLeftCorner() const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), rows() - CRows, 0); } # 401 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int CRows, int CCols> inline typename FixedBlockXpr<CRows,CCols>::Type bottomLeftCorner(Index cRows, Index cCols) { return typename FixedBlockXpr<CRows,CCols>::Type(derived(), rows() - cRows, 0, cRows, cCols); } template<int CRows, int CCols> inline const typename ConstFixedBlockXpr<CRows,CCols>::Type bottomLeftCorner(Index cRows, Index cCols) const { return typename ConstFixedBlockXpr<CRows,CCols>::Type(derived(), rows() - cRows, 0, cRows, cCols); } # 427 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline RowsBlockXpr topRows(Index n) { return RowsBlockXpr(derived(), 0, 0, n, cols()); } inline ConstRowsBlockXpr topRows(Index n) const { return ConstRowsBlockXpr(derived(), 0, 0, n, cols()); } # 455 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename NRowsBlockXpr<N>::Type topRows(Index n = N) { return typename NRowsBlockXpr<N>::Type(derived(), 0, 0, n, cols()); } template<int N> inline typename ConstNRowsBlockXpr<N>::Type topRows(Index n = N) const { return typename ConstNRowsBlockXpr<N>::Type(derived(), 0, 0, n, cols()); } # 483 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline RowsBlockXpr bottomRows(Index n) { return RowsBlockXpr(derived(), rows() - n, 0, n, cols()); } inline ConstRowsBlockXpr bottomRows(Index n) const { return ConstRowsBlockXpr(derived(), rows() - n, 0, n, cols()); } # 511 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename NRowsBlockXpr<N>::Type bottomRows(Index n = N) { return typename NRowsBlockXpr<N>::Type(derived(), rows() - n, 0, n, cols()); } template<int N> inline typename ConstNRowsBlockXpr<N>::Type bottomRows(Index n = N) const { return typename ConstNRowsBlockXpr<N>::Type(derived(), rows() - n, 0, n, cols()); } # 540 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline RowsBlockXpr middleRows(Index startRow, Index n) { return RowsBlockXpr(derived(), startRow, 0, n, cols()); } inline ConstRowsBlockXpr middleRows(Index startRow, Index n) const { return ConstRowsBlockXpr(derived(), startRow, 0, n, cols()); } # 569 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename NRowsBlockXpr<N>::Type middleRows(Index startRow, Index n = N) { return typename NRowsBlockXpr<N>::Type(derived(), startRow, 0, n, cols()); } template<int N> inline typename ConstNRowsBlockXpr<N>::Type middleRows(Index startRow, Index n = N) const { return typename ConstNRowsBlockXpr<N>::Type(derived(), startRow, 0, n, cols()); } # 597 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline ColsBlockXpr leftCols(Index n) { return ColsBlockXpr(derived(), 0, 0, rows(), n); } inline ConstColsBlockXpr leftCols(Index n) const { return ConstColsBlockXpr(derived(), 0, 0, rows(), n); } # 625 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename NColsBlockXpr<N>::Type leftCols(Index n = N) { return typename NColsBlockXpr<N>::Type(derived(), 0, 0, rows(), n); } template<int N> inline typename ConstNColsBlockXpr<N>::Type leftCols(Index n = N) const { return typename ConstNColsBlockXpr<N>::Type(derived(), 0, 0, rows(), n); } # 653 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline ColsBlockXpr rightCols(Index n) { return ColsBlockXpr(derived(), 0, cols() - n, rows(), n); } inline ConstColsBlockXpr rightCols(Index n) const { return ConstColsBlockXpr(derived(), 0, cols() - n, rows(), n); } # 681 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename NColsBlockXpr<N>::Type rightCols(Index n = N) { return typename NColsBlockXpr<N>::Type(derived(), 0, cols() - n, rows(), n); } template<int N> inline typename ConstNColsBlockXpr<N>::Type rightCols(Index n = N) const { return typename ConstNColsBlockXpr<N>::Type(derived(), 0, cols() - n, rows(), n); } # 710 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline ColsBlockXpr middleCols(Index startCol, Index numCols) { return ColsBlockXpr(derived(), 0, startCol, rows(), numCols); } inline ConstColsBlockXpr middleCols(Index startCol, Index numCols) const { return ConstColsBlockXpr(derived(), 0, startCol, rows(), numCols); } # 739 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename NColsBlockXpr<N>::Type middleCols(Index startCol, Index n = N) { return typename NColsBlockXpr<N>::Type(derived(), 0, startCol, rows(), n); } template<int N> inline typename ConstNColsBlockXpr<N>::Type middleCols(Index startCol, Index n = N) const { return typename ConstNColsBlockXpr<N>::Type(derived(), 0, startCol, rows(), n); } # 774 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int NRows, int NCols> inline typename FixedBlockXpr<NRows,NCols>::Type block(Index startRow, Index startCol) { return typename FixedBlockXpr<NRows,NCols>::Type(derived(), startRow, startCol); } template<int NRows, int NCols> inline const typename ConstFixedBlockXpr<NRows,NCols>::Type block(Index startRow, Index startCol) const { return typename ConstFixedBlockXpr<NRows,NCols>::Type(derived(), startRow, startCol); } # 810 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int NRows, int NCols> inline typename FixedBlockXpr<NRows,NCols>::Type block(Index startRow, Index startCol, Index blockRows, Index blockCols) { return typename FixedBlockXpr<NRows,NCols>::Type(derived(), startRow, startCol, blockRows, blockCols); } template<int NRows, int NCols> inline const typename ConstFixedBlockXpr<NRows,NCols>::Type block(Index startRow, Index startCol, Index blockRows, Index blockCols) const { return typename ConstFixedBlockXpr<NRows,NCols>::Type(derived(), startRow, startCol, blockRows, blockCols); } inline ColXpr col(Index i) { return ColXpr(derived(), i); } inline ConstColXpr col(Index i) const { return ConstColXpr(derived(), i); } inline RowXpr row(Index i) { return RowXpr(derived(), i); } inline ConstRowXpr row(Index i) const { return ConstRowXpr(derived(), i); } # 887 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline SegmentReturnType segment(Index start, Index n) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return SegmentReturnType(derived(), start, n); } inline ConstSegmentReturnType segment(Index start, Index n) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return ConstSegmentReturnType(derived(), start, n); } # 918 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline SegmentReturnType head(Index n) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return SegmentReturnType(derived(), 0, n); } inline ConstSegmentReturnType head(Index n) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return ConstSegmentReturnType(derived(), 0, n); } # 948 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" inline SegmentReturnType tail(Index n) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return SegmentReturnType(derived(), this->size() - n, n); } inline ConstSegmentReturnType tail(Index n) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return ConstSegmentReturnType(derived(), this->size() - n, n); } # 979 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename FixedSegmentReturnType<N>::Type segment(Index start, Index n = N) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return typename FixedSegmentReturnType<N>::Type(derived(), start, n); } template<int N> inline typename ConstFixedSegmentReturnType<N>::Type segment(Index start, Index n = N) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return typename ConstFixedSegmentReturnType<N>::Type(derived(), start, n); } # 1011 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename FixedSegmentReturnType<N>::Type head(Index n = N) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return typename FixedSegmentReturnType<N>::Type(derived(), 0, n); } template<int N> inline typename ConstFixedSegmentReturnType<N>::Type head(Index n = N) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return typename ConstFixedSegmentReturnType<N>::Type(derived(), 0, n); } # 1043 "eigen-3.3.7/Eigen/src/Core/../plugins/BlockMethods.h" template<int N> inline typename FixedSegmentReturnType<N>::Type tail(Index n = N) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return typename FixedSegmentReturnType<N>::Type(derived(), size() - n); } template<int N> inline typename ConstFixedSegmentReturnType<N>::Type tail(Index n = N) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return typename ConstFixedSegmentReturnType<N>::Type(derived(), size() - n); } # 574 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" 2 # 582 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" template<typename Dest> inline void evalTo(Dest& ) const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<Dest,void>::value))>::THE_EVAL_EVALTO_FUNCTION_SHOULD_NEVER_BE_CALLED_FOR_DENSE_OBJECTS) {}; } protected: DenseBase() { # 601 "eigen-3.3.7/Eigen/src/Core/DenseBase.h" } private: explicit DenseBase(int); DenseBase(int,int); template<typename OtherDerived> explicit DenseBase(const DenseBase<OtherDerived>&); }; } # 436 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" namespace Eigen { # 48 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" template<typename Derived> class MatrixBase : public DenseBase<Derived> { public: typedef MatrixBase StorageBaseType; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::StorageIndex StorageIndex; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename internal::packet_traits<Scalar>::type PacketScalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef DenseBase<Derived> Base; using Base::RowsAtCompileTime; using Base::ColsAtCompileTime; using Base::SizeAtCompileTime; using Base::MaxRowsAtCompileTime; using Base::MaxColsAtCompileTime; using Base::MaxSizeAtCompileTime; using Base::IsVectorAtCompileTime; using Base::Flags; using Base::derived; using Base::const_cast_derived; using Base::rows; using Base::cols; using Base::size; using Base::coeff; using Base::coeffRef; using Base::lazyAssign; using Base::eval; using Base::operator+=; using Base::operator-=; using Base::operator*=; using Base::operator/=; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Base::ConstTransposeReturnType ConstTransposeReturnType; typedef typename Base::RowXpr RowXpr; typedef typename Base::ColXpr ColXpr; typedef Matrix<Scalar,(((int)RowsAtCompileTime == Dynamic || (int)ColsAtCompileTime == Dynamic) ? Dynamic : ((int)RowsAtCompileTime >= (int)ColsAtCompileTime) ? (int)RowsAtCompileTime : (int)ColsAtCompileTime), (((int)RowsAtCompileTime == Dynamic || (int)ColsAtCompileTime == Dynamic) ? Dynamic : ((int)RowsAtCompileTime >= (int)ColsAtCompileTime) ? (int)RowsAtCompileTime : (int)ColsAtCompileTime)> SquareMatrixType; inline Index diagonalSize() const { return (numext::mini)(rows(),cols()); } typedef typename Base::PlainObject PlainObject; typedef CwiseNullaryOp<internal::scalar_constant_op<Scalar>,PlainObject> ConstantReturnType; typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>, ConstTransposeReturnType>, ConstTransposeReturnType >::type AdjointReturnType; typedef Matrix<std::complex<RealScalar>, internal::traits<Derived>::ColsAtCompileTime, 1, ColMajor> EigenvaluesReturnType; typedef CwiseNullaryOp<internal::scalar_identity_op<Scalar>,PlainObject> IdentityReturnType; typedef Block<const CwiseNullaryOp<internal::scalar_identity_op<Scalar>, SquareMatrixType>, internal::traits<Derived>::RowsAtCompileTime, internal::traits<Derived>::ColsAtCompileTime> BasisReturnType; # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" 1 # 16 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, const CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>, const Derived>, const Derived& >::type ConjugateReturnType; typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, const CwiseUnaryOp<internal::scalar_real_op<Scalar>, const Derived>, const Derived& >::type RealReturnType; typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, CwiseUnaryView<internal::scalar_real_ref_op<Scalar>, Derived>, Derived& >::type NonConstRealReturnType; typedef CwiseUnaryOp<internal::scalar_imag_op<Scalar>, const Derived> ImagReturnType; typedef CwiseUnaryView<internal::scalar_imag_ref_op<Scalar>, Derived> NonConstImagReturnType; typedef CwiseUnaryOp<internal::scalar_opposite_op<Scalar>, const Derived> NegativeReturnType; inline const NegativeReturnType operator-() const { return NegativeReturnType(derived()); } template<class NewType> struct CastXpr { typedef typename internal::cast_return_type<Derived,const CwiseUnaryOp<internal::scalar_cast_op<Scalar, NewType>, const Derived> >::type Type; }; template<typename NewType> typename CastXpr<NewType>::Type cast() const { return typename CastXpr<NewType>::Type(derived()); } inline ConjugateReturnType conjugate() const { return ConjugateReturnType(derived()); } inline RealReturnType real() const { return RealReturnType(derived()); } inline const ImagReturnType imag() const { return ImagReturnType(derived()); } # 114 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" template<typename CustomUnaryOp> inline const CwiseUnaryOp<CustomUnaryOp, const Derived> unaryExpr(const CustomUnaryOp& func = CustomUnaryOp()) const { return CwiseUnaryOp<CustomUnaryOp, const Derived>(derived(), func); } # 135 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" template<typename CustomViewOp> inline const CwiseUnaryView<CustomViewOp, const Derived> unaryViewExpr(const CustomViewOp& func = CustomViewOp()) const { return CwiseUnaryView<CustomViewOp, const Derived>(derived(), func); } inline NonConstRealReturnType real() { return NonConstRealReturnType(derived()); } inline NonConstImagReturnType imag() { return NonConstImagReturnType(derived()); } # 126 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" 1 # 19 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_difference_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > (operator-)(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_difference_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_sum_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > (operator+)(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_sum_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } # 40 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename CustomBinaryOp, typename OtherDerived> inline const CwiseBinaryOp<CustomBinaryOp, const Derived, const OtherDerived> binaryExpr(const Eigen::MatrixBase<OtherDerived> &other, const CustomBinaryOp& func = CustomBinaryOp()) const { return CwiseBinaryOp<CustomBinaryOp, const Derived, const OtherDerived>(derived(), other.derived(), func); } template <typename T> inline friend typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_product_op<typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_product_op<T,Scalar> > >::value)>::type,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_product_op<T,Scalar> > >::value)>::type>::type, const Derived> >::type (operator*)(const T& scalar, const StorageBaseType& matrix) { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_product_op<T,Scalar> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_product_op<PromotedT,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,PromotedT>::type, const Derived>( typename internal::plain_constant_type<Derived,PromotedT>::type(matrix.derived().rows(), matrix.derived().cols(), internal::scalar_constant_op<PromotedT>(scalar)), matrix.derived()); } template <typename T> inline typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_product_op<typename internal::traits<Derived>::Scalar,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_product_op<Scalar,T> > >::value)>::type>, const Derived, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_product_op<Scalar,T> > >::value)>::type>::type> >::type (operator*)(const T& scalar) const { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_product_op<Scalar,T> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_product_op<typename internal::traits<Derived>::Scalar,PromotedT>, const Derived, const typename internal::plain_constant_type<Derived,PromotedT>::type>(derived(), typename internal::plain_constant_type<Derived,PromotedT>::type(derived().rows(), derived().cols(), internal::scalar_constant_op<PromotedT>(scalar))); } # 69 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template <typename T> inline typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_quotient_op<typename internal::traits<Derived>::Scalar,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_quotient_op<Scalar,T> > >::value)>::type>, const Derived, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_quotient_op<Scalar,T> > >::value)>::type>::type> >::type (operator/)(const T& scalar) const { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_quotient_op<Scalar,T> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_quotient_op<typename internal::traits<Derived>::Scalar,PromotedT>, const Derived, const typename internal::plain_constant_type<Derived,PromotedT>::type>(derived(), typename internal::plain_constant_type<Derived,PromotedT>::type(derived().rows(), derived().cols(), internal::scalar_constant_op<PromotedT>(scalar))); } # 88 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_boolean_and_op, const Derived, const OtherDerived> operator&&(const Eigen::MatrixBase<OtherDerived> &other) const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<bool,Scalar>::value && internal::is_same<bool,typename OtherDerived::Scalar>::value))>::THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL) {} ; return CwiseBinaryOp<internal::scalar_boolean_and_op, const Derived, const OtherDerived>(derived(),other.derived()); } # 107 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_boolean_or_op, const Derived, const OtherDerived> operator||(const Eigen::MatrixBase<OtherDerived> &other) const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<bool,Scalar>::value && internal::is_same<bool,typename OtherDerived::Scalar>::value))>::THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL) {} ; return CwiseBinaryOp<internal::scalar_boolean_or_op, const Derived, const OtherDerived>(derived(),other.derived()); } # 127 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseUnaryOps.h" 1 # 15 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseUnaryOps.h" typedef CwiseUnaryOp<internal::scalar_abs_op<Scalar>, const Derived> CwiseAbsReturnType; typedef CwiseUnaryOp<internal::scalar_abs2_op<Scalar>, const Derived> CwiseAbs2ReturnType; typedef CwiseUnaryOp<internal::scalar_sqrt_op<Scalar>, const Derived> CwiseSqrtReturnType; typedef CwiseUnaryOp<internal::scalar_sign_op<Scalar>, const Derived> CwiseSignReturnType; typedef CwiseUnaryOp<internal::scalar_inverse_op<Scalar>, const Derived> CwiseInverseReturnType; inline const CwiseAbsReturnType cwiseAbs() const { return CwiseAbsReturnType(derived()); } inline const CwiseAbs2ReturnType cwiseAbs2() const { return CwiseAbs2ReturnType(derived()); } inline const CwiseSqrtReturnType cwiseSqrt() const { return CwiseSqrtReturnType(derived()); } inline const CwiseSignReturnType cwiseSign() const { return CwiseSignReturnType(derived()); } inline const CwiseInverseReturnType cwiseInverse() const { return CwiseInverseReturnType(derived()); } # 128 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" 1 # 20 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_product_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > cwiseProduct(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_product_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } # 40 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<std::equal_to<Scalar>, const Derived, const OtherDerived> cwiseEqual(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp<std::equal_to<Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } # 60 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<std::not_equal_to<Scalar>, const Derived, const OtherDerived> cwiseNotEqual(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp<std::not_equal_to<Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } # 75 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_min_op<Scalar,Scalar>, const Derived, const OtherDerived> cwiseMin(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_min_op<Scalar,Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } inline const CwiseBinaryOp<internal::scalar_min_op<Scalar,Scalar>, const Derived, const ConstantReturnType> cwiseMin(const Scalar &other) const { return cwiseMin(Derived::Constant(rows(), cols(), other)); } # 101 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_max_op<Scalar,Scalar>, const Derived, const OtherDerived> cwiseMax(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_max_op<Scalar,Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } inline const CwiseBinaryOp<internal::scalar_max_op<Scalar,Scalar>, const Derived, const ConstantReturnType> cwiseMax(const Scalar &other) const { return cwiseMax(Derived::Constant(rows(), cols(), other)); } # 128 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const Derived, const OtherDerived> cwiseQuotient(const Eigen::MatrixBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar,internal::cmp_EQ>, const Derived, const ConstantReturnType> CwiseScalarEqualReturnType; # 147 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" inline const CwiseScalarEqualReturnType cwiseEqual(const Scalar& s) const { return CwiseScalarEqualReturnType(derived(), Derived::Constant(rows(), cols(), s), internal::scalar_cmp_op<Scalar,Scalar,internal::cmp_EQ>()); } # 129 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" 2 # 138 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" inline Derived& operator=(const MatrixBase& other); template <typename OtherDerived> inline Derived& operator=(const DenseBase<OtherDerived>& other); template <typename OtherDerived> Derived& operator=(const EigenBase<OtherDerived>& other); template<typename OtherDerived> Derived& operator=(const ReturnByValue<OtherDerived>& other); template<typename OtherDerived> inline Derived& operator+=(const MatrixBase<OtherDerived>& other); template<typename OtherDerived> inline Derived& operator-=(const MatrixBase<OtherDerived>& other); template<typename OtherDerived> const Product<Derived,OtherDerived> operator*(const MatrixBase<OtherDerived> &other) const; template<typename OtherDerived> const Product<Derived,OtherDerived,LazyProduct> lazyProduct(const MatrixBase<OtherDerived> &other) const; template<typename OtherDerived> Derived& operator*=(const EigenBase<OtherDerived>& other); template<typename OtherDerived> void applyOnTheLeft(const EigenBase<OtherDerived>& other); template<typename OtherDerived> void applyOnTheRight(const EigenBase<OtherDerived>& other); template<typename DiagonalDerived> const Product<Derived, DiagonalDerived, LazyProduct> operator*(const DiagonalBase<DiagonalDerived> &diagonal) const; template<typename OtherDerived> typename ScalarBinaryOpTraits<typename internal::traits<Derived>::Scalar,typename internal::traits<OtherDerived>::Scalar>::ReturnType dot(const MatrixBase<OtherDerived>& other) const; RealScalar squaredNorm() const; RealScalar norm() const; RealScalar stableNorm() const; RealScalar blueNorm() const; RealScalar hypotNorm() const; const PlainObject normalized() const; const PlainObject stableNormalized() const; void normalize(); void stableNormalize(); const AdjointReturnType adjoint() const; void adjointInPlace(); typedef Diagonal<Derived> DiagonalReturnType; DiagonalReturnType diagonal(); typedef typename internal::add_const<Diagonal<const Derived> >::type ConstDiagonalReturnType; ConstDiagonalReturnType diagonal() const; template<int Index> struct DiagonalIndexReturnType { typedef Diagonal<Derived,Index> Type; }; template<int Index> struct ConstDiagonalIndexReturnType { typedef const Diagonal<const Derived,Index> Type; }; template<int Index> typename DiagonalIndexReturnType<Index>::Type diagonal(); template<int Index> typename ConstDiagonalIndexReturnType<Index>::Type diagonal() const; typedef Diagonal<Derived,DynamicIndex> DiagonalDynamicIndexReturnType; typedef typename internal::add_const<Diagonal<const Derived,DynamicIndex> >::type ConstDiagonalDynamicIndexReturnType; DiagonalDynamicIndexReturnType diagonal(Index index); ConstDiagonalDynamicIndexReturnType diagonal(Index index) const; template<unsigned int Mode> struct TriangularViewReturnType { typedef TriangularView<Derived, Mode> Type; }; template<unsigned int Mode> struct ConstTriangularViewReturnType { typedef const TriangularView<const Derived, Mode> Type; }; template<unsigned int Mode> typename TriangularViewReturnType<Mode>::Type triangularView(); template<unsigned int Mode> typename ConstTriangularViewReturnType<Mode>::Type triangularView() const; template<unsigned int UpLo> struct SelfAdjointViewReturnType { typedef SelfAdjointView<Derived, UpLo> Type; }; template<unsigned int UpLo> struct ConstSelfAdjointViewReturnType { typedef const SelfAdjointView<const Derived, UpLo> Type; }; template<unsigned int UpLo> typename SelfAdjointViewReturnType<UpLo>::Type selfadjointView(); template<unsigned int UpLo> typename ConstSelfAdjointViewReturnType<UpLo>::Type selfadjointView() const; const SparseView<Derived> sparseView(const Scalar& m_reference = Scalar(0), const typename NumTraits<Scalar>::Real& m_epsilon = NumTraits<Scalar>::dummy_precision()) const; static const IdentityReturnType Identity(); static const IdentityReturnType Identity(Index rows, Index cols); static const BasisReturnType Unit(Index size, Index i); static const BasisReturnType Unit(Index i); static const BasisReturnType UnitX(); static const BasisReturnType UnitY(); static const BasisReturnType UnitZ(); static const BasisReturnType UnitW(); const DiagonalWrapper<const Derived> asDiagonal() const; const PermutationWrapper<const Derived> asPermutation() const; Derived& setIdentity(); Derived& setIdentity(Index rows, Index cols); bool isIdentity(const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isDiagonal(const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isUpperTriangular(const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isLowerTriangular(const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; template<typename OtherDerived> bool isOrthogonal(const MatrixBase<OtherDerived>& other, const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; bool isUnitary(const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const; template<typename OtherDerived> inline bool operator==(const MatrixBase<OtherDerived>& other) const { return cwiseEqual(other).all(); } template<typename OtherDerived> inline bool operator!=(const MatrixBase<OtherDerived>& other) const { return cwiseNotEqual(other).any(); } NoAlias<Derived,Eigen::MatrixBase > noalias(); inline const Derived& forceAlignedAccess() const { return derived(); } inline Derived& forceAlignedAccess() { return derived(); } template<bool Enable> inline const Derived& forceAlignedAccessIf() const { return derived(); } template<bool Enable> inline Derived& forceAlignedAccessIf() { return derived(); } Scalar trace() const; template<int p> RealScalar lpNorm() const; MatrixBase<Derived>& matrix() { return *this; } const MatrixBase<Derived>& matrix() const { return *this; } inline ArrayWrapper<Derived> array() { return ArrayWrapper<Derived>(derived()); } inline const ArrayWrapper<const Derived> array() const { return ArrayWrapper<const Derived>(derived()); } inline const FullPivLU<PlainObject> fullPivLu() const; inline const PartialPivLU<PlainObject> partialPivLu() const; inline const PartialPivLU<PlainObject> lu() const; inline const Inverse<Derived> inverse() const; template<typename ResultType> inline void computeInverseAndDetWithCheck( ResultType& inverse, typename ResultType::Scalar& determinant, bool& invertible, const RealScalar& absDeterminantThreshold = NumTraits<Scalar>::dummy_precision() ) const; template<typename ResultType> inline void computeInverseWithCheck( ResultType& inverse, bool& invertible, const RealScalar& absDeterminantThreshold = NumTraits<Scalar>::dummy_precision() ) const; Scalar determinant() const; inline const LLT<PlainObject> llt() const; inline const LDLT<PlainObject> ldlt() const; inline const HouseholderQR<PlainObject> householderQr() const; inline const ColPivHouseholderQR<PlainObject> colPivHouseholderQr() const; inline const FullPivHouseholderQR<PlainObject> fullPivHouseholderQr() const; inline const CompleteOrthogonalDecomposition<PlainObject> completeOrthogonalDecomposition() const; inline EigenvaluesReturnType eigenvalues() const; inline RealScalar operatorNorm() const; inline JacobiSVD<PlainObject> jacobiSvd(unsigned int computationOptions = 0) const; inline BDCSVD<PlainObject> bdcSvd(unsigned int computationOptions = 0) const; template<typename OtherDerived> struct cross_product_return_type { typedef typename ScalarBinaryOpTraits<typename internal::traits<Derived>::Scalar,typename internal::traits<OtherDerived>::Scalar>::ReturnType Scalar; typedef Matrix<Scalar,MatrixBase::RowsAtCompileTime,MatrixBase::ColsAtCompileTime> type; }; template<typename OtherDerived> inline typename cross_product_return_type<OtherDerived>::type cross(const MatrixBase<OtherDerived>& other) const; template<typename OtherDerived> inline PlainObject cross3(const MatrixBase<OtherDerived>& other) const; inline PlainObject unitOrthogonal(void) const; inline Matrix<Scalar,3,1> eulerAngles(Index a0, Index a1, Index a2) const; enum { HomogeneousReturnTypeDirection = ColsAtCompileTime==1&&RowsAtCompileTime==1 ? ((internal::traits<Derived>::Flags&RowMajorBit)==RowMajorBit ? Horizontal : Vertical) : ColsAtCompileTime==1 ? Vertical : Horizontal }; typedef Homogeneous<Derived, HomogeneousReturnTypeDirection> HomogeneousReturnType; inline HomogeneousReturnType homogeneous() const; enum { SizeMinusOne = SizeAtCompileTime==Dynamic ? Dynamic : SizeAtCompileTime-1 }; typedef Block<const Derived, internal::traits<Derived>::ColsAtCompileTime==1 ? SizeMinusOne : 1, internal::traits<Derived>::ColsAtCompileTime==1 ? 1 : SizeMinusOne> ConstStartMinusOne; typedef CwiseBinaryOp<internal::scalar_quotient_op<typename internal::traits<ConstStartMinusOne>::Scalar,Scalar>, const ConstStartMinusOne, const typename internal::plain_constant_type<ConstStartMinusOne,Scalar>::type> HNormalizedReturnType; inline const HNormalizedReturnType hnormalized() const; void makeHouseholderInPlace(Scalar& tau, RealScalar& beta); template<typename EssentialPart> void makeHouseholder(EssentialPart& essential, Scalar& tau, RealScalar& beta) const; template<typename EssentialPart> void applyHouseholderOnTheLeft(const EssentialPart& essential, const Scalar& tau, Scalar* workspace); template<typename EssentialPart> void applyHouseholderOnTheRight(const EssentialPart& essential, const Scalar& tau, Scalar* workspace); template<typename OtherScalar> void applyOnTheLeft(Index p, Index q, const JacobiRotation<OtherScalar>& j); template<typename OtherScalar> void applyOnTheRight(Index p, Index q, const JacobiRotation<OtherScalar>& j); template<typename OtherDerived> inline const typename SparseMatrixBase<OtherDerived>::template CwiseProductDenseReturnType<Derived>::Type cwiseProduct(const SparseMatrixBase<OtherDerived> &other) const { return other.cwiseProduct(derived()); } typedef typename internal::stem_function<Scalar>::type StemFunction; const MatrixExponentialReturnValue<Derived> exp() const; const MatrixFunctionReturnValue<Derived> matrixFunction(StemFunction f) const; const MatrixFunctionReturnValue<Derived> cosh() const; const MatrixFunctionReturnValue<Derived> sinh() const; const MatrixFunctionReturnValue<Derived> cos() const; const MatrixFunctionReturnValue<Derived> sin() const; const MatrixSquareRootReturnValue<Derived> sqrt() const; const MatrixLogarithmReturnValue<Derived> log() const; const MatrixPowerReturnValue<Derived> pow(const RealScalar& p) const; const MatrixComplexPowerReturnValue<Derived> pow(const std::complex<RealScalar>& p) const; protected: MatrixBase() : Base() {} private: explicit MatrixBase(int); MatrixBase(int,int); template<typename OtherDerived> explicit MatrixBase(const MatrixBase<OtherDerived>&); protected: template<typename OtherDerived> Derived& operator+=(const ArrayBase<OtherDerived>& ) {if (Eigen::internal::static_assertion<static_cast<bool>(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1)>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {}; return *this;} template<typename OtherDerived> Derived& operator-=(const ArrayBase<OtherDerived>& ) {if (Eigen::internal::static_assertion<static_cast<bool>(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1)>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {}; return *this;} }; # 494 "eigen-3.3.7/Eigen/src/Core/MatrixBase.h" template<typename Derived> template<typename OtherDerived> inline Derived& MatrixBase<Derived>::operator*=(const EigenBase<OtherDerived> &other) { other.derived().applyThisOnTheRight(derived()); return derived(); } template<typename Derived> template<typename OtherDerived> inline void MatrixBase<Derived>::applyOnTheRight(const EigenBase<OtherDerived> &other) { other.derived().applyThisOnTheRight(derived()); } template<typename Derived> template<typename OtherDerived> inline void MatrixBase<Derived>::applyOnTheLeft(const EigenBase<OtherDerived> &other) { other.derived().applyThisOnTheLeft(derived()); } } # 437 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/EigenBase.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/EigenBase.h" namespace Eigen { # 29 "eigen-3.3.7/Eigen/src/Core/EigenBase.h" template<typename Derived> struct EigenBase { typedef Eigen::Index Index; typedef typename internal::traits<Derived>::StorageKind StorageKind; Derived& derived() { return *static_cast<Derived*>(this); } const Derived& derived() const { return *static_cast<const Derived*>(this); } inline Derived& const_cast_derived() const { return *static_cast<Derived*>(const_cast<EigenBase*>(this)); } inline const Derived& const_derived() const { return *static_cast<const Derived*>(this); } inline Index rows() const { return derived().rows(); } inline Index cols() const { return derived().cols(); } inline Index size() const { return rows() * cols(); } template<typename Dest> inline void evalTo(Dest& dst) const { derived().evalTo(dst); } template<typename Dest> inline void addTo(Dest& dst) const { typename Dest::PlainObject res(rows(),cols()); evalTo(res); dst += res; } template<typename Dest> inline void subTo(Dest& dst) const { typename Dest::PlainObject res(rows(),cols()); evalTo(res); dst -= res; } template<typename Dest> inline void applyThisOnTheRight(Dest& dst) const { dst = dst * this->derived(); } template<typename Dest> inline void applyThisOnTheLeft(Dest& dst) const { dst = this->derived() * dst; } }; # 130 "eigen-3.3.7/Eigen/src/Core/EigenBase.h" template<typename Derived> template<typename OtherDerived> Derived& DenseBase<Derived>::operator=(const EigenBase<OtherDerived> &other) { call_assignment(derived(), other.derived()); return derived(); } template<typename Derived> template<typename OtherDerived> Derived& DenseBase<Derived>::operator+=(const EigenBase<OtherDerived> &other) { call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } template<typename Derived> template<typename OtherDerived> Derived& DenseBase<Derived>::operator-=(const EigenBase<OtherDerived> &other) { call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } } # 438 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Product.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Product.h" namespace Eigen { template<typename Lhs, typename Rhs, int Option, typename StorageKind> class ProductImpl; namespace internal { template<typename Lhs, typename Rhs, int Option> struct traits<Product<Lhs, Rhs, Option> > { typedef typename remove_all<Lhs>::type LhsCleaned; typedef typename remove_all<Rhs>::type RhsCleaned; typedef traits<LhsCleaned> LhsTraits; typedef traits<RhsCleaned> RhsTraits; typedef MatrixXpr XprKind; typedef typename ScalarBinaryOpTraits<typename traits<LhsCleaned>::Scalar, typename traits<RhsCleaned>::Scalar>::ReturnType Scalar; typedef typename product_promote_storage_type<typename LhsTraits::StorageKind, typename RhsTraits::StorageKind, internal::product_type<Lhs,Rhs>::ret>::ret StorageKind; typedef typename promote_index_type<typename LhsTraits::StorageIndex, typename RhsTraits::StorageIndex>::type StorageIndex; enum { RowsAtCompileTime = LhsTraits::RowsAtCompileTime, ColsAtCompileTime = RhsTraits::ColsAtCompileTime, MaxRowsAtCompileTime = LhsTraits::MaxRowsAtCompileTime, MaxColsAtCompileTime = RhsTraits::MaxColsAtCompileTime, InnerSize = (((int)LhsTraits::ColsAtCompileTime == 0 || (int)RhsTraits::RowsAtCompileTime == 0) ? 0 : ((int)LhsTraits::ColsAtCompileTime == 1 || (int)RhsTraits::RowsAtCompileTime == 1) ? 1 : ((int)LhsTraits::ColsAtCompileTime == Dynamic && (int)RhsTraits::RowsAtCompileTime == Dynamic) ? Dynamic : ((int)LhsTraits::ColsAtCompileTime == Dynamic) ? (int)RhsTraits::RowsAtCompileTime : ((int)RhsTraits::RowsAtCompileTime == Dynamic) ? (int)LhsTraits::ColsAtCompileTime : ((int)LhsTraits::ColsAtCompileTime <= (int)RhsTraits::RowsAtCompileTime) ? (int)LhsTraits::ColsAtCompileTime : (int)RhsTraits::RowsAtCompileTime), Flags = (MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1) ? RowMajorBit : (MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1) ? 0 : ( ((LhsTraits::Flags&NoPreferredStorageOrderBit) && (RhsTraits::Flags&RowMajorBit)) || ((RhsTraits::Flags&NoPreferredStorageOrderBit) && (LhsTraits::Flags&RowMajorBit)) ) ? RowMajorBit : NoPreferredStorageOrderBit }; }; } # 70 "eigen-3.3.7/Eigen/src/Core/Product.h" template<typename _Lhs, typename _Rhs, int Option> class Product : public ProductImpl<_Lhs,_Rhs,Option, typename internal::product_promote_storage_type<typename internal::traits<_Lhs>::StorageKind, typename internal::traits<_Rhs>::StorageKind, internal::product_type<_Lhs,_Rhs>::ret>::ret> { public: typedef _Lhs Lhs; typedef _Rhs Rhs; typedef typename ProductImpl< Lhs, Rhs, Option, typename internal::product_promote_storage_type<typename internal::traits<Lhs>::StorageKind, typename internal::traits<Rhs>::StorageKind, internal::product_type<Lhs,Rhs>::ret>::ret>::Base Base; typedef typename Eigen::internal::traits<Product>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Product>::type Nested; typedef typename Eigen::internal::traits<Product>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Product>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Product>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Product>::ColsAtCompileTime, Flags = Eigen::internal::traits<Product>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename internal::ref_selector<Lhs>::type LhsNested; typedef typename internal::ref_selector<Rhs>::type RhsNested; typedef typename internal::remove_all<LhsNested>::type LhsNestedCleaned; typedef typename internal::remove_all<RhsNested>::type RhsNestedCleaned; Product(const Lhs& lhs, const Rhs& rhs) : m_lhs(lhs), m_rhs(rhs) { ((lhs.cols() == rhs.rows() && "invalid matrix product" && "if you wanted a coeff-wise or a dot product use the respective explicit functions") ? static_cast<void> (0) : __assert_fail ("lhs.cols() == rhs.rows() && \"invalid matrix product\" && \"if you wanted a coeff-wise or a dot product use the respective explicit functions\"", "eigen-3.3.7/Eigen/src/Core/Product.h" # 95 "eigen-3.3.7/Eigen/src/Core/Product.h" , 97 # 95 "eigen-3.3.7/Eigen/src/Core/Product.h" , __PRETTY_FUNCTION__)) ; } inline Index rows() const { return m_lhs.rows(); } inline Index cols() const { return m_rhs.cols(); } const LhsNestedCleaned& lhs() const { return m_lhs; } const RhsNestedCleaned& rhs() const { return m_rhs; } protected: LhsNested m_lhs; RhsNested m_rhs; }; namespace internal { template<typename Lhs, typename Rhs, int Option, int ProductTag = internal::product_type<Lhs,Rhs>::ret> class dense_product_base : public internal::dense_xpr_base<Product<Lhs,Rhs,Option> >::type {}; template<typename Lhs, typename Rhs, int Option> class dense_product_base<Lhs, Rhs, Option, InnerProduct> : public internal::dense_xpr_base<Product<Lhs,Rhs,Option> >::type { typedef Product<Lhs,Rhs,Option> ProductXpr; typedef typename internal::dense_xpr_base<ProductXpr>::type Base; public: using Base::derived; typedef typename Base::Scalar Scalar; inline operator const Scalar() const { return internal::evaluator<ProductXpr>(derived()).coeff(0,0); } }; } template<typename Lhs, typename Rhs, int Option, typename StorageKind> class ProductImpl : public internal::generic_xpr_base<Product<Lhs,Rhs,Option>, MatrixXpr, StorageKind>::type { public: typedef typename internal::generic_xpr_base<Product<Lhs,Rhs,Option>, MatrixXpr, StorageKind>::type Base; }; template<typename Lhs, typename Rhs, int Option> class ProductImpl<Lhs,Rhs,Option,Dense> : public internal::dense_product_base<Lhs,Rhs,Option> { typedef Product<Lhs, Rhs, Option> Derived; public: typedef typename internal::dense_product_base<Lhs, Rhs, Option> Base; typedef typename Eigen::internal::traits<Derived>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Derived>::type Nested; typedef typename Eigen::internal::traits<Derived>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Derived>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Derived>::ColsAtCompileTime, Flags = Eigen::internal::traits<Derived>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; protected: enum { IsOneByOne = (RowsAtCompileTime == 1 || RowsAtCompileTime == Dynamic) && (ColsAtCompileTime == 1 || ColsAtCompileTime == Dynamic), EnableCoeff = IsOneByOne || Option==LazyProduct }; public: inline Scalar coeff(Index row, Index col) const { if (Eigen::internal::static_assertion<static_cast<bool>(EnableCoeff)>::THIS_METHOD_IS_ONLY_FOR_INNER_OR_LAZY_PRODUCTS) {}; (((Option==LazyProduct) || (this->rows() == 1 && this->cols() == 1)) ? static_cast<void> (0) : __assert_fail ("(Option==LazyProduct) || (this->rows() == 1 && this->cols() == 1)", "eigen-3.3.7/Eigen/src/Core/Product.h", 168, __PRETTY_FUNCTION__)); return internal::evaluator<Derived>(derived()).coeff(row,col); } inline Scalar coeff(Index i) const { if (Eigen::internal::static_assertion<static_cast<bool>(EnableCoeff)>::THIS_METHOD_IS_ONLY_FOR_INNER_OR_LAZY_PRODUCTS) {}; (((Option==LazyProduct) || (this->rows() == 1 && this->cols() == 1)) ? static_cast<void> (0) : __assert_fail ("(Option==LazyProduct) || (this->rows() == 1 && this->cols() == 1)", "eigen-3.3.7/Eigen/src/Core/Product.h", 176, __PRETTY_FUNCTION__)); return internal::evaluator<Derived>(derived()).coeff(i); } }; } # 440 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h" 1 # 16 "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h" namespace Eigen { namespace internal { template<typename StorageKind> struct storage_kind_to_evaluator_kind { typedef IndexBased Kind; }; template<typename StorageKind> struct storage_kind_to_shape; template<> struct storage_kind_to_shape<Dense> { typedef DenseShape Shape; }; template<> struct storage_kind_to_shape<SolverStorage> { typedef SolverShape Shape; }; template<> struct storage_kind_to_shape<PermutationStorage> { typedef PermutationShape Shape; }; template<> struct storage_kind_to_shape<TranspositionsStorage> { typedef TranspositionsShape Shape; }; # 49 "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h" template< typename T, typename Arg1Kind = typename evaluator_traits<typename T::Arg1>::Kind, typename Arg2Kind = typename evaluator_traits<typename T::Arg2>::Kind, typename Arg3Kind = typename evaluator_traits<typename T::Arg3>::Kind, typename Arg1Scalar = typename traits<typename T::Arg1>::Scalar, typename Arg2Scalar = typename traits<typename T::Arg2>::Scalar, typename Arg3Scalar = typename traits<typename T::Arg3>::Scalar> struct ternary_evaluator; template< typename T, typename LhsKind = typename evaluator_traits<typename T::Lhs>::Kind, typename RhsKind = typename evaluator_traits<typename T::Rhs>::Kind, typename LhsScalar = typename traits<typename T::Lhs>::Scalar, typename RhsScalar = typename traits<typename T::Rhs>::Scalar> struct binary_evaluator; template< typename T, typename Kind = typename evaluator_traits<typename T::NestedExpression>::Kind, typename Scalar = typename T::Scalar> struct unary_evaluator; template<typename T> struct evaluator_traits_base { typedef typename storage_kind_to_evaluator_kind<typename traits<T>::StorageKind>::Kind Kind; typedef typename storage_kind_to_shape<typename traits<T>::StorageKind>::Shape Shape; }; template<typename T> struct evaluator_traits : public evaluator_traits_base<T> { }; template<typename T, typename Shape = typename evaluator_traits<T>::Shape > struct evaluator_assume_aliasing { static const bool value = false; }; template<typename T> struct evaluator : public unary_evaluator<T> { typedef unary_evaluator<T> Base; explicit evaluator(const T& xpr) : Base(xpr) {} }; template<typename T> struct evaluator<const T> : evaluator<T> { explicit evaluator(const T& xpr) : evaluator<T>(xpr) {} }; template<typename ExpressionType> struct evaluator_base : public noncopyable { typedef traits<ExpressionType> ExpressionTraits; enum { Alignment = 0 }; }; # 126 "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h" template<typename Derived> struct evaluator<PlainObjectBase<Derived> > : evaluator_base<Derived> { typedef PlainObjectBase<Derived> PlainObjectType; typedef typename PlainObjectType::Scalar Scalar; typedef typename PlainObjectType::CoeffReturnType CoeffReturnType; enum { IsRowMajor = PlainObjectType::IsRowMajor, IsVectorAtCompileTime = PlainObjectType::IsVectorAtCompileTime, RowsAtCompileTime = PlainObjectType::RowsAtCompileTime, ColsAtCompileTime = PlainObjectType::ColsAtCompileTime, CoeffReadCost = NumTraits<Scalar>::ReadCost, Flags = traits<Derived>::EvaluatorFlags, Alignment = traits<Derived>::Alignment }; evaluator() : m_data(0), m_outerStride(IsVectorAtCompileTime ? 0 : int(IsRowMajor) ? ColsAtCompileTime : RowsAtCompileTime) { if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } explicit evaluator(const PlainObjectType& m) : m_data(m.data()), m_outerStride(IsVectorAtCompileTime ? 0 : m.outerStride()) { if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } inline CoeffReturnType coeff(Index row, Index col) const { if (IsRowMajor) return m_data[row * m_outerStride.value() + col]; else return m_data[row + col * m_outerStride.value()]; } inline CoeffReturnType coeff(Index index) const { return m_data[index]; } inline Scalar& coeffRef(Index row, Index col) { if (IsRowMajor) return const_cast<Scalar*>(m_data)[row * m_outerStride.value() + col]; else return const_cast<Scalar*>(m_data)[row + col * m_outerStride.value()]; } inline Scalar& coeffRef(Index index) { return const_cast<Scalar*>(m_data)[index]; } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { if (IsRowMajor) return ploadt<PacketType, LoadMode>(m_data + row * m_outerStride.value() + col); else return ploadt<PacketType, LoadMode>(m_data + row + col * m_outerStride.value()); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { return ploadt<PacketType, LoadMode>(m_data + index); } template<int StoreMode,typename PacketType> inline void writePacket(Index row, Index col, const PacketType& x) { if (IsRowMajor) return pstoret<Scalar, PacketType, StoreMode> (const_cast<Scalar*>(m_data) + row * m_outerStride.value() + col, x); else return pstoret<Scalar, PacketType, StoreMode> (const_cast<Scalar*>(m_data) + row + col * m_outerStride.value(), x); } template<int StoreMode, typename PacketType> inline void writePacket(Index index, const PacketType& x) { return pstoret<Scalar, PacketType, StoreMode>(const_cast<Scalar*>(m_data) + index, x); } protected: const Scalar *m_data; variable_if_dynamic<Index, IsVectorAtCompileTime ? 0 : int(IsRowMajor) ? ColsAtCompileTime : RowsAtCompileTime> m_outerStride; }; template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols> struct evaluator<Matrix<Scalar, Rows, Cols, Options, MaxRows, MaxCols> > : evaluator<PlainObjectBase<Matrix<Scalar, Rows, Cols, Options, MaxRows, MaxCols> > > { typedef Matrix<Scalar, Rows, Cols, Options, MaxRows, MaxCols> XprType; evaluator() {} explicit evaluator(const XprType& m) : evaluator<PlainObjectBase<XprType> >(m) { } }; template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols> struct evaluator<Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> > : evaluator<PlainObjectBase<Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> > > { typedef Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> XprType; evaluator() {} explicit evaluator(const XprType& m) : evaluator<PlainObjectBase<XprType> >(m) { } }; template<typename ArgType> struct unary_evaluator<Transpose<ArgType>, IndexBased> : evaluator_base<Transpose<ArgType> > { typedef Transpose<ArgType> XprType; enum { CoeffReadCost = evaluator<ArgType>::CoeffReadCost, Flags = evaluator<ArgType>::Flags ^ RowMajorBit, Alignment = evaluator<ArgType>::Alignment }; explicit unary_evaluator(const XprType& t) : m_argImpl(t.nestedExpression()) {} typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index col) const { return m_argImpl.coeff(col, row); } inline CoeffReturnType coeff(Index index) const { return m_argImpl.coeff(index); } inline Scalar& coeffRef(Index row, Index col) { return m_argImpl.coeffRef(col, row); } inline typename XprType::Scalar& coeffRef(Index index) { return m_argImpl.coeffRef(index); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { return m_argImpl.template packet<LoadMode,PacketType>(col, row); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { return m_argImpl.template packet<LoadMode,PacketType>(index); } template<int StoreMode, typename PacketType> inline void writePacket(Index row, Index col, const PacketType& x) { m_argImpl.template writePacket<StoreMode,PacketType>(col, row, x); } template<int StoreMode, typename PacketType> inline void writePacket(Index index, const PacketType& x) { m_argImpl.template writePacket<StoreMode,PacketType>(index, x); } protected: evaluator<ArgType> m_argImpl; }; template<typename Scalar,typename NullaryOp, bool has_nullary = has_nullary_operator<NullaryOp>::value, bool has_unary = has_unary_operator<NullaryOp>::value, bool has_binary = has_binary_operator<NullaryOp>::value> struct nullary_wrapper { template <typename IndexType> inline Scalar operator()(const NullaryOp& op, IndexType i, IndexType j) const { return op(i,j); } template <typename IndexType> inline Scalar operator()(const NullaryOp& op, IndexType i) const { return op(i); } template <typename T, typename IndexType> inline T packetOp(const NullaryOp& op, IndexType i, IndexType j) const { return op.template packetOp<T>(i,j); } template <typename T, typename IndexType> inline T packetOp(const NullaryOp& op, IndexType i) const { return op.template packetOp<T>(i); } }; template<typename Scalar,typename NullaryOp> struct nullary_wrapper<Scalar,NullaryOp,true,false,false> { template <typename IndexType> inline Scalar operator()(const NullaryOp& op, IndexType=0, IndexType=0) const { return op(); } template <typename T, typename IndexType> inline T packetOp(const NullaryOp& op, IndexType=0, IndexType=0) const { return op.template packetOp<T>(); } }; template<typename Scalar,typename NullaryOp> struct nullary_wrapper<Scalar,NullaryOp,false,false,true> { template <typename IndexType> inline Scalar operator()(const NullaryOp& op, IndexType i, IndexType j=0) const { return op(i,j); } template <typename T, typename IndexType> inline T packetOp(const NullaryOp& op, IndexType i, IndexType j=0) const { return op.template packetOp<T>(i,j); } }; template<typename Scalar,typename NullaryOp> struct nullary_wrapper<Scalar,NullaryOp,false,true,false> { template <typename IndexType> inline Scalar operator()(const NullaryOp& op, IndexType i, IndexType j) const { ((i==0 || j==0) ? static_cast<void> (0) : __assert_fail ("i==0 || j==0", "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h", 379, __PRETTY_FUNCTION__)); return op(i+j); } template <typename T, typename IndexType> inline T packetOp(const NullaryOp& op, IndexType i, IndexType j) const { ((i==0 || j==0) ? static_cast<void> (0) : __assert_fail ("i==0 || j==0", "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h", 383, __PRETTY_FUNCTION__)); return op.template packetOp<T>(i+j); } template <typename IndexType> inline Scalar operator()(const NullaryOp& op, IndexType i) const { return op(i); } template <typename T, typename IndexType> inline T packetOp(const NullaryOp& op, IndexType i) const { return op.template packetOp<T>(i); } }; template<typename Scalar,typename NullaryOp> struct nullary_wrapper<Scalar,NullaryOp,false,false,false> {}; # 454 "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h" template<typename NullaryOp, typename PlainObjectType> struct evaluator<CwiseNullaryOp<NullaryOp,PlainObjectType> > : evaluator_base<CwiseNullaryOp<NullaryOp,PlainObjectType> > { typedef CwiseNullaryOp<NullaryOp,PlainObjectType> XprType; typedef typename internal::remove_all<PlainObjectType>::type PlainObjectTypeCleaned; enum { CoeffReadCost = internal::functor_traits<NullaryOp>::Cost, Flags = (evaluator<PlainObjectTypeCleaned>::Flags & ( HereditaryBits | (functor_has_linear_access<NullaryOp>::ret ? LinearAccessBit : 0) | (functor_traits<NullaryOp>::PacketAccess ? PacketAccessBit : 0))) | (functor_traits<NullaryOp>::IsRepeatable ? 0 : EvalBeforeNestingBit), Alignment = AlignedMax }; explicit evaluator(const XprType& n) : m_functor(n.functor()), m_wrapper() { if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } typedef typename XprType::CoeffReturnType CoeffReturnType; template <typename IndexType> inline CoeffReturnType coeff(IndexType row, IndexType col) const { return m_wrapper(m_functor, row, col); } template <typename IndexType> inline CoeffReturnType coeff(IndexType index) const { return m_wrapper(m_functor,index); } template<int LoadMode, typename PacketType, typename IndexType> inline PacketType packet(IndexType row, IndexType col) const { return m_wrapper.template packetOp<PacketType>(m_functor, row, col); } template<int LoadMode, typename PacketType, typename IndexType> inline PacketType packet(IndexType index) const { return m_wrapper.template packetOp<PacketType>(m_functor, index); } protected: const NullaryOp m_functor; const internal::nullary_wrapper<CoeffReturnType,NullaryOp> m_wrapper; }; template<typename UnaryOp, typename ArgType> struct unary_evaluator<CwiseUnaryOp<UnaryOp, ArgType>, IndexBased > : evaluator_base<CwiseUnaryOp<UnaryOp, ArgType> > { typedef CwiseUnaryOp<UnaryOp, ArgType> XprType; enum { CoeffReadCost = evaluator<ArgType>::CoeffReadCost + functor_traits<UnaryOp>::Cost, Flags = evaluator<ArgType>::Flags & (HereditaryBits | LinearAccessBit | (functor_traits<UnaryOp>::PacketAccess ? PacketAccessBit : 0)), Alignment = evaluator<ArgType>::Alignment }; inline explicit unary_evaluator(const XprType& op) : m_functor(op.functor()), m_argImpl(op.nestedExpression()) { if (Eigen::internal::static_assertion<static_cast<bool>((functor_traits<UnaryOp>::Cost)>=0 && (functor_traits<UnaryOp>::Cost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } typedef typename XprType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index col) const { return m_functor(m_argImpl.coeff(row, col)); } inline CoeffReturnType coeff(Index index) const { return m_functor(m_argImpl.coeff(index)); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { return m_functor.packetOp(m_argImpl.template packet<LoadMode, PacketType>(row, col)); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { return m_functor.packetOp(m_argImpl.template packet<LoadMode, PacketType>(index)); } protected: const UnaryOp m_functor; evaluator<ArgType> m_argImpl; }; template<typename TernaryOp, typename Arg1, typename Arg2, typename Arg3> struct evaluator<CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> > : public ternary_evaluator<CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> > { typedef CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> XprType; typedef ternary_evaluator<CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> > Base; explicit evaluator(const XprType& xpr) : Base(xpr) {} }; template<typename TernaryOp, typename Arg1, typename Arg2, typename Arg3> struct ternary_evaluator<CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3>, IndexBased, IndexBased> : evaluator_base<CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> > { typedef CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> XprType; enum { CoeffReadCost = evaluator<Arg1>::CoeffReadCost + evaluator<Arg2>::CoeffReadCost + evaluator<Arg3>::CoeffReadCost + functor_traits<TernaryOp>::Cost, Arg1Flags = evaluator<Arg1>::Flags, Arg2Flags = evaluator<Arg2>::Flags, Arg3Flags = evaluator<Arg3>::Flags, SameType = is_same<typename Arg1::Scalar,typename Arg2::Scalar>::value && is_same<typename Arg1::Scalar,typename Arg3::Scalar>::value, StorageOrdersAgree = (int(Arg1Flags)&RowMajorBit)==(int(Arg2Flags)&RowMajorBit) && (int(Arg1Flags)&RowMajorBit)==(int(Arg3Flags)&RowMajorBit), Flags0 = (int(Arg1Flags) | int(Arg2Flags) | int(Arg3Flags)) & ( HereditaryBits | (int(Arg1Flags) & int(Arg2Flags) & int(Arg3Flags) & ( (StorageOrdersAgree ? LinearAccessBit : 0) | (functor_traits<TernaryOp>::PacketAccess && StorageOrdersAgree && SameType ? PacketAccessBit : 0) ) ) ), Flags = (Flags0 & ~RowMajorBit) | (Arg1Flags & RowMajorBit), Alignment = (((int)(((int)evaluator<Arg1>::Alignment <= (int)evaluator<Arg2>::Alignment) ? (int)evaluator<Arg1>::Alignment : (int)evaluator<Arg2>::Alignment) <= (int)evaluator<Arg3>::Alignment) ? (int)(((int)evaluator<Arg1>::Alignment <= (int)evaluator<Arg2>::Alignment) ? (int)evaluator<Arg1>::Alignment : (int)evaluator<Arg2>::Alignment) : (int)evaluator<Arg3>::Alignment) }; explicit ternary_evaluator(const XprType& xpr) : m_functor(xpr.functor()), m_arg1Impl(xpr.arg1()), m_arg2Impl(xpr.arg2()), m_arg3Impl(xpr.arg3()) { if (Eigen::internal::static_assertion<static_cast<bool>((functor_traits<TernaryOp>::Cost)>=0 && (functor_traits<TernaryOp>::Cost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } typedef typename XprType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index col) const { return m_functor(m_arg1Impl.coeff(row, col), m_arg2Impl.coeff(row, col), m_arg3Impl.coeff(row, col)); } inline CoeffReturnType coeff(Index index) const { return m_functor(m_arg1Impl.coeff(index), m_arg2Impl.coeff(index), m_arg3Impl.coeff(index)); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { return m_functor.packetOp(m_arg1Impl.template packet<LoadMode,PacketType>(row, col), m_arg2Impl.template packet<LoadMode,PacketType>(row, col), m_arg3Impl.template packet<LoadMode,PacketType>(row, col)); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { return m_functor.packetOp(m_arg1Impl.template packet<LoadMode,PacketType>(index), m_arg2Impl.template packet<LoadMode,PacketType>(index), m_arg3Impl.template packet<LoadMode,PacketType>(index)); } protected: const TernaryOp m_functor; evaluator<Arg1> m_arg1Impl; evaluator<Arg2> m_arg2Impl; evaluator<Arg3> m_arg3Impl; }; template<typename BinaryOp, typename Lhs, typename Rhs> struct evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> > : public binary_evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> > { typedef CwiseBinaryOp<BinaryOp, Lhs, Rhs> XprType; typedef binary_evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs> > Base; explicit evaluator(const XprType& xpr) : Base(xpr) {} }; template<typename BinaryOp, typename Lhs, typename Rhs> struct binary_evaluator<CwiseBinaryOp<BinaryOp, Lhs, Rhs>, IndexBased, IndexBased> : evaluator_base<CwiseBinaryOp<BinaryOp, Lhs, Rhs> > { typedef CwiseBinaryOp<BinaryOp, Lhs, Rhs> XprType; enum { CoeffReadCost = evaluator<Lhs>::CoeffReadCost + evaluator<Rhs>::CoeffReadCost + functor_traits<BinaryOp>::Cost, LhsFlags = evaluator<Lhs>::Flags, RhsFlags = evaluator<Rhs>::Flags, SameType = is_same<typename Lhs::Scalar,typename Rhs::Scalar>::value, StorageOrdersAgree = (int(LhsFlags)&RowMajorBit)==(int(RhsFlags)&RowMajorBit), Flags0 = (int(LhsFlags) | int(RhsFlags)) & ( HereditaryBits | (int(LhsFlags) & int(RhsFlags) & ( (StorageOrdersAgree ? LinearAccessBit : 0) | (functor_traits<BinaryOp>::PacketAccess && StorageOrdersAgree && SameType ? PacketAccessBit : 0) ) ) ), Flags = (Flags0 & ~RowMajorBit) | (LhsFlags & RowMajorBit), Alignment = (((int)evaluator<Lhs>::Alignment <= (int)evaluator<Rhs>::Alignment) ? (int)evaluator<Lhs>::Alignment : (int)evaluator<Rhs>::Alignment) }; explicit binary_evaluator(const XprType& xpr) : m_functor(xpr.functor()), m_lhsImpl(xpr.lhs()), m_rhsImpl(xpr.rhs()) { if (Eigen::internal::static_assertion<static_cast<bool>((functor_traits<BinaryOp>::Cost)>=0 && (functor_traits<BinaryOp>::Cost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } typedef typename XprType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index col) const { return m_functor(m_lhsImpl.coeff(row, col), m_rhsImpl.coeff(row, col)); } inline CoeffReturnType coeff(Index index) const { return m_functor(m_lhsImpl.coeff(index), m_rhsImpl.coeff(index)); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { return m_functor.packetOp(m_lhsImpl.template packet<LoadMode,PacketType>(row, col), m_rhsImpl.template packet<LoadMode,PacketType>(row, col)); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { return m_functor.packetOp(m_lhsImpl.template packet<LoadMode,PacketType>(index), m_rhsImpl.template packet<LoadMode,PacketType>(index)); } protected: const BinaryOp m_functor; evaluator<Lhs> m_lhsImpl; evaluator<Rhs> m_rhsImpl; }; template<typename UnaryOp, typename ArgType> struct unary_evaluator<CwiseUnaryView<UnaryOp, ArgType>, IndexBased> : evaluator_base<CwiseUnaryView<UnaryOp, ArgType> > { typedef CwiseUnaryView<UnaryOp, ArgType> XprType; enum { CoeffReadCost = evaluator<ArgType>::CoeffReadCost + functor_traits<UnaryOp>::Cost, Flags = (evaluator<ArgType>::Flags & (HereditaryBits | LinearAccessBit | DirectAccessBit)), Alignment = 0 }; explicit unary_evaluator(const XprType& op) : m_unaryOp(op.functor()), m_argImpl(op.nestedExpression()) { if (Eigen::internal::static_assertion<static_cast<bool>((functor_traits<UnaryOp>::Cost)>=0 && (functor_traits<UnaryOp>::Cost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index col) const { return m_unaryOp(m_argImpl.coeff(row, col)); } inline CoeffReturnType coeff(Index index) const { return m_unaryOp(m_argImpl.coeff(index)); } inline Scalar& coeffRef(Index row, Index col) { return m_unaryOp(m_argImpl.coeffRef(row, col)); } inline Scalar& coeffRef(Index index) { return m_unaryOp(m_argImpl.coeffRef(index)); } protected: const UnaryOp m_unaryOp; evaluator<ArgType> m_argImpl; }; template<typename Derived, typename PlainObjectType> struct mapbase_evaluator; template<typename Derived, typename PlainObjectType> struct mapbase_evaluator : evaluator_base<Derived> { typedef Derived XprType; typedef typename XprType::PointerType PointerType; typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; enum { IsRowMajor = XprType::RowsAtCompileTime, ColsAtCompileTime = XprType::ColsAtCompileTime, CoeffReadCost = NumTraits<Scalar>::ReadCost }; explicit mapbase_evaluator(const XprType& map) : m_data(const_cast<PointerType>(map.data())), m_innerStride(map.innerStride()), m_outerStride(map.outerStride()) { if (Eigen::internal::static_assertion<static_cast<bool>((!(evaluator<Derived>::Flags&PacketAccessBit) || (internal::inner_stride_at_compile_time<Derived>::ret==1)))>::PACKET_ACCESS_REQUIRES_TO_HAVE_INNER_STRIDE_FIXED_TO_1) {} ; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } inline CoeffReturnType coeff(Index row, Index col) const { return m_data[col * colStride() + row * rowStride()]; } inline CoeffReturnType coeff(Index index) const { return m_data[index * m_innerStride.value()]; } inline Scalar& coeffRef(Index row, Index col) { return m_data[col * colStride() + row * rowStride()]; } inline Scalar& coeffRef(Index index) { return m_data[index * m_innerStride.value()]; } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { PointerType ptr = m_data + row * rowStride() + col * colStride(); return internal::ploadt<PacketType, LoadMode>(ptr); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { return internal::ploadt<PacketType, LoadMode>(m_data + index * m_innerStride.value()); } template<int StoreMode, typename PacketType> inline void writePacket(Index row, Index col, const PacketType& x) { PointerType ptr = m_data + row * rowStride() + col * colStride(); return internal::pstoret<Scalar, PacketType, StoreMode>(ptr, x); } template<int StoreMode, typename PacketType> inline void writePacket(Index index, const PacketType& x) { internal::pstoret<Scalar, PacketType, StoreMode>(m_data + index * m_innerStride.value(), x); } protected: inline Index rowStride() const { return XprType::IsRowMajor ? m_outerStride.value() : m_innerStride.value(); } inline Index colStride() const { return XprType::IsRowMajor ? m_innerStride.value() : m_outerStride.value(); } PointerType m_data; const internal::variable_if_dynamic<Index, XprType::InnerStrideAtCompileTime> m_innerStride; const internal::variable_if_dynamic<Index, XprType::OuterStrideAtCompileTime> m_outerStride; }; template<typename PlainObjectType, int MapOptions, typename StrideType> struct evaluator<Map<PlainObjectType, MapOptions, StrideType> > : public mapbase_evaluator<Map<PlainObjectType, MapOptions, StrideType>, PlainObjectType> { typedef Map<PlainObjectType, MapOptions, StrideType> XprType; typedef typename XprType::Scalar Scalar; typedef typename packet_traits<Scalar>::type PacketScalar; enum { InnerStrideAtCompileTime = StrideType::InnerStrideAtCompileTime == 0 ? int(PlainObjectType::InnerStrideAtCompileTime) : int(StrideType::InnerStrideAtCompileTime), OuterStrideAtCompileTime = StrideType::OuterStrideAtCompileTime == 0 ? int(PlainObjectType::OuterStrideAtCompileTime) : int(StrideType::OuterStrideAtCompileTime), HasNoInnerStride = InnerStrideAtCompileTime == 1, HasNoOuterStride = StrideType::OuterStrideAtCompileTime == 0, HasNoStride = HasNoInnerStride && HasNoOuterStride, IsDynamicSize = PlainObjectType::SizeAtCompileTime==Dynamic, PacketAccessMask = bool(HasNoInnerStride) ? ~int(0) : ~int(PacketAccessBit), LinearAccessMask = bool(HasNoStride) || bool(PlainObjectType::IsVectorAtCompileTime) ? ~int(0) : ~int(LinearAccessBit), Flags = int( evaluator<PlainObjectType>::Flags) & (LinearAccessMask&PacketAccessMask), Alignment = int(MapOptions)&int(AlignedMask) }; explicit evaluator(const XprType& map) : mapbase_evaluator<XprType, PlainObjectType>(map) { } }; template<typename PlainObjectType, int RefOptions, typename StrideType> struct evaluator<Ref<PlainObjectType, RefOptions, StrideType> > : public mapbase_evaluator<Ref<PlainObjectType, RefOptions, StrideType>, PlainObjectType> { typedef Ref<PlainObjectType, RefOptions, StrideType> XprType; enum { Flags = evaluator<Map<PlainObjectType, RefOptions, StrideType> >::Flags, Alignment = evaluator<Map<PlainObjectType, RefOptions, StrideType> >::Alignment }; explicit evaluator(const XprType& ref) : mapbase_evaluator<XprType, PlainObjectType>(ref) { } }; template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess = internal::has_direct_access<ArgType>::ret> struct block_evaluator; template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel> struct evaluator<Block<ArgType, BlockRows, BlockCols, InnerPanel> > : block_evaluator<ArgType, BlockRows, BlockCols, InnerPanel> { typedef Block<ArgType, BlockRows, BlockCols, InnerPanel> XprType; typedef typename XprType::Scalar Scalar; typedef typename packet_traits<Scalar>::type PacketScalar; enum { CoeffReadCost = evaluator<ArgType>::CoeffReadCost, RowsAtCompileTime = traits<XprType>::RowsAtCompileTime, ColsAtCompileTime = traits<XprType>::ColsAtCompileTime, MaxRowsAtCompileTime = traits<XprType>::MaxRowsAtCompileTime, MaxColsAtCompileTime = traits<XprType>::MaxColsAtCompileTime, ArgTypeIsRowMajor = (int(evaluator<ArgType>::Flags)&RowMajorBit) != 0, IsRowMajor = (MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1) ? 1 : (MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1) ? 0 : ArgTypeIsRowMajor, HasSameStorageOrderAsArgType = (IsRowMajor == ArgTypeIsRowMajor), InnerSize = IsRowMajor ? int(ColsAtCompileTime) : int(RowsAtCompileTime), InnerStrideAtCompileTime = HasSameStorageOrderAsArgType ? int(inner_stride_at_compile_time<ArgType>::ret) : int(outer_stride_at_compile_time<ArgType>::ret), OuterStrideAtCompileTime = HasSameStorageOrderAsArgType ? int(outer_stride_at_compile_time<ArgType>::ret) : int(inner_stride_at_compile_time<ArgType>::ret), MaskPacketAccessBit = (InnerStrideAtCompileTime == 1 || HasSameStorageOrderAsArgType) ? PacketAccessBit : 0, FlagsLinearAccessBit = (RowsAtCompileTime == 1 || ColsAtCompileTime == 1 || (InnerPanel && (evaluator<ArgType>::Flags&LinearAccessBit))) ? LinearAccessBit : 0, FlagsRowMajorBit = XprType::Flags&RowMajorBit, Flags0 = evaluator<ArgType>::Flags & ( (HereditaryBits & ~RowMajorBit) | DirectAccessBit | MaskPacketAccessBit), Flags = Flags0 | FlagsLinearAccessBit | FlagsRowMajorBit, PacketAlignment = unpacket_traits<PacketScalar>::alignment, Alignment0 = (InnerPanel && (OuterStrideAtCompileTime!=Dynamic) && (OuterStrideAtCompileTime!=0) && (((OuterStrideAtCompileTime * int(sizeof(Scalar))) % int(PacketAlignment)) == 0)) ? int(PacketAlignment) : 0, Alignment = (((int)evaluator<ArgType>::Alignment <= (int)Alignment0) ? (int)evaluator<ArgType>::Alignment : (int)Alignment0) }; typedef block_evaluator<ArgType, BlockRows, BlockCols, InnerPanel> block_evaluator_type; explicit evaluator(const XprType& block) : block_evaluator_type(block) { if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } }; template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel> struct block_evaluator<ArgType, BlockRows, BlockCols, InnerPanel, false> : unary_evaluator<Block<ArgType, BlockRows, BlockCols, InnerPanel> > { typedef Block<ArgType, BlockRows, BlockCols, InnerPanel> XprType; explicit block_evaluator(const XprType& block) : unary_evaluator<XprType>(block) {} }; template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel> struct unary_evaluator<Block<ArgType, BlockRows, BlockCols, InnerPanel>, IndexBased> : evaluator_base<Block<ArgType, BlockRows, BlockCols, InnerPanel> > { typedef Block<ArgType, BlockRows, BlockCols, InnerPanel> XprType; explicit unary_evaluator(const XprType& block) : m_argImpl(block.nestedExpression()), m_startRow(block.startRow()), m_startCol(block.startCol()), m_linear_offset(InnerPanel?(XprType::IsRowMajor ? block.startRow()*block.cols() : block.startCol()*block.rows()):0) { } typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; enum { RowsAtCompileTime = XprType::RowsAtCompileTime, ForwardLinearAccess = InnerPanel && bool(evaluator<ArgType>::Flags&LinearAccessBit) }; inline CoeffReturnType coeff(Index row, Index col) const { return m_argImpl.coeff(m_startRow.value() + row, m_startCol.value() + col); } inline CoeffReturnType coeff(Index index) const { if (ForwardLinearAccess) return m_argImpl.coeff(m_linear_offset.value() + index); else return coeff(RowsAtCompileTime == 1 ? 0 : index, RowsAtCompileTime == 1 ? index : 0); } inline Scalar& coeffRef(Index row, Index col) { return m_argImpl.coeffRef(m_startRow.value() + row, m_startCol.value() + col); } inline Scalar& coeffRef(Index index) { if (ForwardLinearAccess) return m_argImpl.coeffRef(m_linear_offset.value() + index); else return coeffRef(RowsAtCompileTime == 1 ? 0 : index, RowsAtCompileTime == 1 ? index : 0); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { return m_argImpl.template packet<LoadMode,PacketType>(m_startRow.value() + row, m_startCol.value() + col); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { if (ForwardLinearAccess) return m_argImpl.template packet<LoadMode,PacketType>(m_linear_offset.value() + index); else return packet<LoadMode,PacketType>(RowsAtCompileTime == 1 ? 0 : index, RowsAtCompileTime == 1 ? index : 0); } template<int StoreMode, typename PacketType> inline void writePacket(Index row, Index col, const PacketType& x) { return m_argImpl.template writePacket<StoreMode,PacketType>(m_startRow.value() + row, m_startCol.value() + col, x); } template<int StoreMode, typename PacketType> inline void writePacket(Index index, const PacketType& x) { if (ForwardLinearAccess) return m_argImpl.template writePacket<StoreMode,PacketType>(m_linear_offset.value() + index, x); else return writePacket<StoreMode,PacketType>(RowsAtCompileTime == 1 ? 0 : index, RowsAtCompileTime == 1 ? index : 0, x); } protected: evaluator<ArgType> m_argImpl; const variable_if_dynamic<Index, (ArgType::RowsAtCompileTime == 1 && BlockRows==1) ? 0 : Dynamic> m_startRow; const variable_if_dynamic<Index, (ArgType::ColsAtCompileTime == 1 && BlockCols==1) ? 0 : Dynamic> m_startCol; const variable_if_dynamic<Index, InnerPanel ? Dynamic : 0> m_linear_offset; }; template<typename ArgType, int BlockRows, int BlockCols, bool InnerPanel> struct block_evaluator<ArgType, BlockRows, BlockCols, InnerPanel, true> : mapbase_evaluator<Block<ArgType, BlockRows, BlockCols, InnerPanel>, typename Block<ArgType, BlockRows, BlockCols, InnerPanel>::PlainObject> { typedef Block<ArgType, BlockRows, BlockCols, InnerPanel> XprType; typedef typename XprType::Scalar Scalar; explicit block_evaluator(const XprType& block) : mapbase_evaluator<XprType, typename XprType::PlainObject>(block) { ((((internal::UIntPtr(block.data()) % (((int)1 >= (int)evaluator<XprType>::Alignment) ? (int)1 : (int)evaluator<XprType>::Alignment)) == 0) && "data is not aligned") ? static_cast<void> (0) : __assert_fail ("((internal::UIntPtr(block.data()) % (((int)1 >= (int)evaluator<XprType>::Alignment) ? (int)1 : (int)evaluator<XprType>::Alignment)) == 0) && \"data is not aligned\"", "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h", 1124, __PRETTY_FUNCTION__)); } }; template<typename ConditionMatrixType, typename ThenMatrixType, typename ElseMatrixType> struct evaluator<Select<ConditionMatrixType, ThenMatrixType, ElseMatrixType> > : evaluator_base<Select<ConditionMatrixType, ThenMatrixType, ElseMatrixType> > { typedef Select<ConditionMatrixType, ThenMatrixType, ElseMatrixType> XprType; enum { CoeffReadCost = evaluator<ConditionMatrixType>::CoeffReadCost + (((int)evaluator<ThenMatrixType>::CoeffReadCost >= (int)evaluator<ElseMatrixType>::CoeffReadCost) ? (int)evaluator<ThenMatrixType>::CoeffReadCost : (int)evaluator<ElseMatrixType>::CoeffReadCost) , Flags = (unsigned int)evaluator<ThenMatrixType>::Flags & evaluator<ElseMatrixType>::Flags & HereditaryBits, Alignment = (((int)evaluator<ThenMatrixType>::Alignment <= (int)evaluator<ElseMatrixType>::Alignment) ? (int)evaluator<ThenMatrixType>::Alignment : (int)evaluator<ElseMatrixType>::Alignment) }; explicit evaluator(const XprType& select) : m_conditionImpl(select.conditionMatrix()), m_thenImpl(select.thenMatrix()), m_elseImpl(select.elseMatrix()) { if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } typedef typename XprType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index col) const { if (m_conditionImpl.coeff(row, col)) return m_thenImpl.coeff(row, col); else return m_elseImpl.coeff(row, col); } inline CoeffReturnType coeff(Index index) const { if (m_conditionImpl.coeff(index)) return m_thenImpl.coeff(index); else return m_elseImpl.coeff(index); } protected: evaluator<ConditionMatrixType> m_conditionImpl; evaluator<ThenMatrixType> m_thenImpl; evaluator<ElseMatrixType> m_elseImpl; }; template<typename ArgType, int RowFactor, int ColFactor> struct unary_evaluator<Replicate<ArgType, RowFactor, ColFactor> > : evaluator_base<Replicate<ArgType, RowFactor, ColFactor> > { typedef Replicate<ArgType, RowFactor, ColFactor> XprType; typedef typename XprType::CoeffReturnType CoeffReturnType; enum { Factor = (RowFactor==Dynamic || ColFactor==Dynamic) ? Dynamic : RowFactor*ColFactor }; typedef typename internal::nested_eval<ArgType,Factor>::type ArgTypeNested; typedef typename internal::remove_all<ArgTypeNested>::type ArgTypeNestedCleaned; enum { CoeffReadCost = evaluator<ArgTypeNestedCleaned>::CoeffReadCost, LinearAccessMask = XprType::IsVectorAtCompileTime ? LinearAccessBit : 0, Flags = (evaluator<ArgTypeNestedCleaned>::Flags & (HereditaryBits|LinearAccessMask) & ~RowMajorBit) | (traits<XprType>::Flags & RowMajorBit), Alignment = evaluator<ArgTypeNestedCleaned>::Alignment }; explicit unary_evaluator(const XprType& replicate) : m_arg(replicate.nestedExpression()), m_argImpl(m_arg), m_rows(replicate.nestedExpression().rows()), m_cols(replicate.nestedExpression().cols()) {} inline CoeffReturnType coeff(Index row, Index col) const { const Index actual_row = internal::traits<XprType>::RowsAtCompileTime==1 ? 0 : RowFactor==1 ? row : row % m_rows.value(); const Index actual_col = internal::traits<XprType>::ColsAtCompileTime==1 ? 0 : ColFactor==1 ? col : col % m_cols.value(); return m_argImpl.coeff(actual_row, actual_col); } inline CoeffReturnType coeff(Index index) const { const Index actual_index = internal::traits<XprType>::RowsAtCompileTime==1 ? (ColFactor==1 ? index : index%m_cols.value()) : (RowFactor==1 ? index : index%m_rows.value()); return m_argImpl.coeff(actual_index); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { const Index actual_row = internal::traits<XprType>::RowsAtCompileTime==1 ? 0 : RowFactor==1 ? row : row % m_rows.value(); const Index actual_col = internal::traits<XprType>::ColsAtCompileTime==1 ? 0 : ColFactor==1 ? col : col % m_cols.value(); return m_argImpl.template packet<LoadMode,PacketType>(actual_row, actual_col); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { const Index actual_index = internal::traits<XprType>::RowsAtCompileTime==1 ? (ColFactor==1 ? index : index%m_cols.value()) : (RowFactor==1 ? index : index%m_rows.value()); return m_argImpl.template packet<LoadMode,PacketType>(actual_index); } protected: const ArgTypeNested m_arg; evaluator<ArgTypeNestedCleaned> m_argImpl; const variable_if_dynamic<Index, ArgType::RowsAtCompileTime> m_rows; const variable_if_dynamic<Index, ArgType::ColsAtCompileTime> m_cols; }; template< typename ArgType, typename MemberOp, int Direction> struct evaluator<PartialReduxExpr<ArgType, MemberOp, Direction> > : evaluator_base<PartialReduxExpr<ArgType, MemberOp, Direction> > { typedef PartialReduxExpr<ArgType, MemberOp, Direction> XprType; typedef typename internal::nested_eval<ArgType,1>::type ArgTypeNested; typedef typename internal::remove_all<ArgTypeNested>::type ArgTypeNestedCleaned; typedef typename ArgType::Scalar InputScalar; typedef typename XprType::Scalar Scalar; enum { TraversalSize = Direction==int(Vertical) ? int(ArgType::RowsAtCompileTime) : int(ArgType::ColsAtCompileTime) }; typedef typename MemberOp::template Cost<InputScalar,int(TraversalSize)> CostOpType; enum { CoeffReadCost = TraversalSize==Dynamic ? HugeCost : TraversalSize * evaluator<ArgType>::CoeffReadCost + int(CostOpType::value), Flags = (traits<XprType>::Flags&RowMajorBit) | (evaluator<ArgType>::Flags&(HereditaryBits&(~RowMajorBit))) | LinearAccessBit, Alignment = 0 }; explicit evaluator(const XprType xpr) : m_arg(xpr.nestedExpression()), m_functor(xpr.functor()) { if (Eigen::internal::static_assertion<static_cast<bool>((TraversalSize==Dynamic ? HugeCost : int(CostOpType::value))>=0 && (TraversalSize==Dynamic ? HugeCost : int(CostOpType::value))<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } typedef typename XprType::CoeffReturnType CoeffReturnType; inline const Scalar coeff(Index i, Index j) const { if (Direction==Vertical) return m_functor(m_arg.col(j)); else return m_functor(m_arg.row(i)); } inline const Scalar coeff(Index index) const { if (Direction==Vertical) return m_functor(m_arg.col(index)); else return m_functor(m_arg.row(index)); } protected: typename internal::add_const_on_value_type<ArgTypeNested>::type m_arg; const MemberOp m_functor; }; template<typename XprType> struct evaluator_wrapper_base : evaluator_base<XprType> { typedef typename remove_all<typename XprType::NestedExpressionType>::type ArgType; enum { CoeffReadCost = evaluator<ArgType>::CoeffReadCost, Flags = evaluator<ArgType>::Flags, Alignment = evaluator<ArgType>::Alignment }; explicit evaluator_wrapper_base(const ArgType& arg) : m_argImpl(arg) {} typedef typename ArgType::Scalar Scalar; typedef typename ArgType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index col) const { return m_argImpl.coeff(row, col); } inline CoeffReturnType coeff(Index index) const { return m_argImpl.coeff(index); } inline Scalar& coeffRef(Index row, Index col) { return m_argImpl.coeffRef(row, col); } inline Scalar& coeffRef(Index index) { return m_argImpl.coeffRef(index); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { return m_argImpl.template packet<LoadMode,PacketType>(row, col); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { return m_argImpl.template packet<LoadMode,PacketType>(index); } template<int StoreMode, typename PacketType> inline void writePacket(Index row, Index col, const PacketType& x) { m_argImpl.template writePacket<StoreMode>(row, col, x); } template<int StoreMode, typename PacketType> inline void writePacket(Index index, const PacketType& x) { m_argImpl.template writePacket<StoreMode>(index, x); } protected: evaluator<ArgType> m_argImpl; }; template<typename TArgType> struct unary_evaluator<MatrixWrapper<TArgType> > : evaluator_wrapper_base<MatrixWrapper<TArgType> > { typedef MatrixWrapper<TArgType> XprType; explicit unary_evaluator(const XprType& wrapper) : evaluator_wrapper_base<MatrixWrapper<TArgType> >(wrapper.nestedExpression()) { } }; template<typename TArgType> struct unary_evaluator<ArrayWrapper<TArgType> > : evaluator_wrapper_base<ArrayWrapper<TArgType> > { typedef ArrayWrapper<TArgType> XprType; explicit unary_evaluator(const XprType& wrapper) : evaluator_wrapper_base<ArrayWrapper<TArgType> >(wrapper.nestedExpression()) { } }; template<typename PacketType, bool ReversePacket> struct reverse_packet_cond; template<typename ArgType, int Direction> struct unary_evaluator<Reverse<ArgType, Direction> > : evaluator_base<Reverse<ArgType, Direction> > { typedef Reverse<ArgType, Direction> XprType; typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; enum { IsRowMajor = XprType::IsRowMajor, IsColMajor = !IsRowMajor, ReverseRow = (Direction == Vertical) || (Direction == BothDirections), ReverseCol = (Direction == Horizontal) || (Direction == BothDirections), ReversePacket = (Direction == BothDirections) || ((Direction == Vertical) && IsColMajor) || ((Direction == Horizontal) && IsRowMajor), CoeffReadCost = evaluator<ArgType>::CoeffReadCost, Flags0 = evaluator<ArgType>::Flags, LinearAccess = ( (Direction==BothDirections) && (int(Flags0)&PacketAccessBit) ) || ((ReverseRow && XprType::ColsAtCompileTime==1) || (ReverseCol && XprType::RowsAtCompileTime==1)) ? LinearAccessBit : 0, Flags = int(Flags0) & (HereditaryBits | PacketAccessBit | LinearAccess), Alignment = 0 }; explicit unary_evaluator(const XprType& reverse) : m_argImpl(reverse.nestedExpression()), m_rows(ReverseRow ? reverse.nestedExpression().rows() : 1), m_cols(ReverseCol ? reverse.nestedExpression().cols() : 1) { } inline CoeffReturnType coeff(Index row, Index col) const { return m_argImpl.coeff(ReverseRow ? m_rows.value() - row - 1 : row, ReverseCol ? m_cols.value() - col - 1 : col); } inline CoeffReturnType coeff(Index index) const { return m_argImpl.coeff(m_rows.value() * m_cols.value() - index - 1); } inline Scalar& coeffRef(Index row, Index col) { return m_argImpl.coeffRef(ReverseRow ? m_rows.value() - row - 1 : row, ReverseCol ? m_cols.value() - col - 1 : col); } inline Scalar& coeffRef(Index index) { return m_argImpl.coeffRef(m_rows.value() * m_cols.value() - index - 1); } template<int LoadMode, typename PacketType> inline PacketType packet(Index row, Index col) const { enum { PacketSize = unpacket_traits<PacketType>::size, OffsetRow = ReverseRow && IsColMajor ? PacketSize : 1, OffsetCol = ReverseCol && IsRowMajor ? PacketSize : 1 }; typedef internal::reverse_packet_cond<PacketType,ReversePacket> reverse_packet; return reverse_packet::run(m_argImpl.template packet<LoadMode,PacketType>( ReverseRow ? m_rows.value() - row - OffsetRow : row, ReverseCol ? m_cols.value() - col - OffsetCol : col)); } template<int LoadMode, typename PacketType> inline PacketType packet(Index index) const { enum { PacketSize = unpacket_traits<PacketType>::size }; return preverse(m_argImpl.template packet<LoadMode,PacketType>(m_rows.value() * m_cols.value() - index - PacketSize)); } template<int LoadMode, typename PacketType> inline void writePacket(Index row, Index col, const PacketType& x) { enum { PacketSize = unpacket_traits<PacketType>::size, OffsetRow = ReverseRow && IsColMajor ? PacketSize : 1, OffsetCol = ReverseCol && IsRowMajor ? PacketSize : 1 }; typedef internal::reverse_packet_cond<PacketType,ReversePacket> reverse_packet; m_argImpl.template writePacket<LoadMode>( ReverseRow ? m_rows.value() - row - OffsetRow : row, ReverseCol ? m_cols.value() - col - OffsetCol : col, reverse_packet::run(x)); } template<int LoadMode, typename PacketType> inline void writePacket(Index index, const PacketType& x) { enum { PacketSize = unpacket_traits<PacketType>::size }; m_argImpl.template writePacket<LoadMode> (m_rows.value() * m_cols.value() - index - PacketSize, preverse(x)); } protected: evaluator<ArgType> m_argImpl; const variable_if_dynamic<Index, ReverseRow ? ArgType::RowsAtCompileTime : 1> m_rows; const variable_if_dynamic<Index, ReverseCol ? ArgType::ColsAtCompileTime : 1> m_cols; }; template<typename ArgType, int DiagIndex> struct evaluator<Diagonal<ArgType, DiagIndex> > : evaluator_base<Diagonal<ArgType, DiagIndex> > { typedef Diagonal<ArgType, DiagIndex> XprType; enum { CoeffReadCost = evaluator<ArgType>::CoeffReadCost, Flags = (unsigned int)(evaluator<ArgType>::Flags & (HereditaryBits | DirectAccessBit) & ~RowMajorBit) | LinearAccessBit, Alignment = 0 }; explicit evaluator(const XprType& diagonal) : m_argImpl(diagonal.nestedExpression()), m_index(diagonal.index()) { } typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; inline CoeffReturnType coeff(Index row, Index) const { return m_argImpl.coeff(row + rowOffset(), row + colOffset()); } inline CoeffReturnType coeff(Index index) const { return m_argImpl.coeff(index + rowOffset(), index + colOffset()); } inline Scalar& coeffRef(Index row, Index) { return m_argImpl.coeffRef(row + rowOffset(), row + colOffset()); } inline Scalar& coeffRef(Index index) { return m_argImpl.coeffRef(index + rowOffset(), index + colOffset()); } protected: evaluator<ArgType> m_argImpl; const internal::variable_if_dynamicindex<Index, XprType::DiagIndex> m_index; private: inline Index rowOffset() const { return m_index.value() > 0 ? 0 : -m_index.value(); } inline Index colOffset() const { return m_index.value() > 0 ? m_index.value() : 0; } }; # 1620 "eigen-3.3.7/Eigen/src/Core/CoreEvaluators.h" template<typename ArgType> class EvalToTemp; template<typename ArgType> struct traits<EvalToTemp<ArgType> > : public traits<ArgType> { }; template<typename ArgType> class EvalToTemp : public dense_xpr_base<EvalToTemp<ArgType> >::type { public: typedef typename dense_xpr_base<EvalToTemp>::type Base; typedef typename Eigen::internal::traits<EvalToTemp>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<EvalToTemp>::type Nested; typedef typename Eigen::internal::traits<EvalToTemp>::StorageKind StorageKind; typedef typename Eigen::internal::traits<EvalToTemp>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<EvalToTemp>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<EvalToTemp>::ColsAtCompileTime, Flags = Eigen::internal::traits<EvalToTemp>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; explicit EvalToTemp(const ArgType& arg) : m_arg(arg) { } const ArgType& arg() const { return m_arg; } Index rows() const { return m_arg.rows(); } Index cols() const { return m_arg.cols(); } private: const ArgType& m_arg; }; template<typename ArgType> struct evaluator<EvalToTemp<ArgType> > : public evaluator<typename ArgType::PlainObject> { typedef EvalToTemp<ArgType> XprType; typedef typename ArgType::PlainObject PlainObject; typedef evaluator<PlainObject> Base; explicit evaluator(const XprType& xpr) : m_result(xpr.arg()) { ::new (static_cast<Base*>(this)) Base(m_result); } evaluator(const ArgType& arg) : m_result(arg) { ::new (static_cast<Base*>(this)) Base(m_result); } protected: PlainObject m_result; }; } } # 441 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" 1 # 15 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" namespace Eigen { namespace internal { template <typename DstEvaluator, typename SrcEvaluator, typename AssignFunc> struct copy_using_evaluator_traits { typedef typename DstEvaluator::XprType Dst; typedef typename Dst::Scalar DstScalar; enum { DstFlags = DstEvaluator::Flags, SrcFlags = SrcEvaluator::Flags }; public: enum { DstAlignment = DstEvaluator::Alignment, SrcAlignment = SrcEvaluator::Alignment, DstHasDirectAccess = (DstFlags & DirectAccessBit) == DirectAccessBit, JointAlignment = (((int)DstAlignment <= (int)SrcAlignment) ? (int)DstAlignment : (int)SrcAlignment) }; private: enum { InnerSize = int(Dst::IsVectorAtCompileTime) ? int(Dst::SizeAtCompileTime) : int(DstFlags)&RowMajorBit ? int(Dst::ColsAtCompileTime) : int(Dst::RowsAtCompileTime), InnerMaxSize = int(Dst::IsVectorAtCompileTime) ? int(Dst::MaxSizeAtCompileTime) : int(DstFlags)&RowMajorBit ? int(Dst::MaxColsAtCompileTime) : int(Dst::MaxRowsAtCompileTime), OuterStride = int(outer_stride_at_compile_time<Dst>::ret), MaxSizeAtCompileTime = Dst::SizeAtCompileTime }; typedef typename find_best_packet<DstScalar,Dst::SizeAtCompileTime>::type LinearPacketType; typedef typename find_best_packet<DstScalar,InnerSize>::type InnerPacketType; enum { LinearPacketSize = unpacket_traits<LinearPacketType>::size, InnerPacketSize = unpacket_traits<InnerPacketType>::size }; public: enum { LinearRequiredAlignment = unpacket_traits<LinearPacketType>::alignment, InnerRequiredAlignment = unpacket_traits<InnerPacketType>::alignment }; private: enum { DstIsRowMajor = DstFlags&RowMajorBit, SrcIsRowMajor = SrcFlags&RowMajorBit, StorageOrdersAgree = (int(DstIsRowMajor) == int(SrcIsRowMajor)), MightVectorize = bool(StorageOrdersAgree) && (int(DstFlags) & int(SrcFlags) & ActualPacketAccessBit) && bool(functor_traits<AssignFunc>::PacketAccess), MayInnerVectorize = MightVectorize && int(InnerSize)!=Dynamic && int(InnerSize)%int(InnerPacketSize)==0 && int(OuterStride)!=Dynamic && int(OuterStride)%int(InnerPacketSize)==0 && (1 || int(JointAlignment)>=int(InnerRequiredAlignment)), MayLinearize = bool(StorageOrdersAgree) && (int(DstFlags) & int(SrcFlags) & LinearAccessBit), MayLinearVectorize = bool(MightVectorize) && bool(MayLinearize) && bool(DstHasDirectAccess) && (1 || (int(DstAlignment)>=int(LinearRequiredAlignment)) || MaxSizeAtCompileTime == Dynamic), MaySliceVectorize = bool(MightVectorize) && bool(DstHasDirectAccess) && (int(InnerMaxSize)==Dynamic || int(InnerMaxSize)>=(1?InnerPacketSize:(3*InnerPacketSize))) }; public: enum { Traversal = int(MayLinearVectorize) && (LinearPacketSize>InnerPacketSize) ? int(LinearVectorizedTraversal) : int(MayInnerVectorize) ? int(InnerVectorizedTraversal) : int(MayLinearVectorize) ? int(LinearVectorizedTraversal) : int(MaySliceVectorize) ? int(SliceVectorizedTraversal) : int(MayLinearize) ? int(LinearTraversal) : int(DefaultTraversal), Vectorized = int(Traversal) == InnerVectorizedTraversal || int(Traversal) == LinearVectorizedTraversal || int(Traversal) == SliceVectorizedTraversal }; typedef typename conditional<int(Traversal)==LinearVectorizedTraversal, LinearPacketType, InnerPacketType>::type PacketType; private: enum { ActualPacketSize = int(Traversal)==LinearVectorizedTraversal ? LinearPacketSize : Vectorized ? InnerPacketSize : 1, UnrollingLimit = 100 * ActualPacketSize, MayUnrollCompletely = int(Dst::SizeAtCompileTime) != Dynamic && int(Dst::SizeAtCompileTime) * (int(DstEvaluator::CoeffReadCost)+int(SrcEvaluator::CoeffReadCost)) <= int(UnrollingLimit), MayUnrollInner = int(InnerSize) != Dynamic && int(InnerSize) * (int(DstEvaluator::CoeffReadCost)+int(SrcEvaluator::CoeffReadCost)) <= int(UnrollingLimit) }; public: enum { Unrolling = (int(Traversal) == int(InnerVectorizedTraversal) || int(Traversal) == int(DefaultTraversal)) ? ( int(MayUnrollCompletely) ? int(CompleteUnrolling) : int(MayUnrollInner) ? int(InnerUnrolling) : int(NoUnrolling) ) : int(Traversal) == int(LinearVectorizedTraversal) ? ( bool(MayUnrollCompletely) && ( 1 || (int(DstAlignment)>=int(LinearRequiredAlignment))) ? int(CompleteUnrolling) : int(NoUnrolling) ) : int(Traversal) == int(LinearTraversal) ? ( bool(MayUnrollCompletely) ? int(CompleteUnrolling) : int(NoUnrolling) ) : int(Traversal) == int(SliceVectorizedTraversal) ? ( bool(MayUnrollInner) ? int(InnerUnrolling) : int(NoUnrolling) ) : int(NoUnrolling) }; # 182 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" }; # 192 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" template<typename Kernel, int Index, int Stop> struct copy_using_evaluator_DefaultTraversal_CompleteUnrolling { typedef typename Kernel::DstEvaluatorType DstEvaluatorType; typedef typename DstEvaluatorType::XprType DstXprType; enum { outer = Index / DstXprType::InnerSizeAtCompileTime, inner = Index % DstXprType::InnerSizeAtCompileTime }; static inline void run(Kernel &kernel) { kernel.assignCoeffByOuterInner(outer, inner); copy_using_evaluator_DefaultTraversal_CompleteUnrolling<Kernel, Index+1, Stop>::run(kernel); } }; template<typename Kernel, int Stop> struct copy_using_evaluator_DefaultTraversal_CompleteUnrolling<Kernel, Stop, Stop> { static inline void run(Kernel&) { } }; template<typename Kernel, int Index_, int Stop> struct copy_using_evaluator_DefaultTraversal_InnerUnrolling { static inline void run(Kernel &kernel, Index outer) { kernel.assignCoeffByOuterInner(outer, Index_); copy_using_evaluator_DefaultTraversal_InnerUnrolling<Kernel, Index_+1, Stop>::run(kernel, outer); } }; template<typename Kernel, int Stop> struct copy_using_evaluator_DefaultTraversal_InnerUnrolling<Kernel, Stop, Stop> { static inline void run(Kernel&, Index) { } }; template<typename Kernel, int Index, int Stop> struct copy_using_evaluator_LinearTraversal_CompleteUnrolling { static inline void run(Kernel& kernel) { kernel.assignCoeff(Index); copy_using_evaluator_LinearTraversal_CompleteUnrolling<Kernel, Index+1, Stop>::run(kernel); } }; template<typename Kernel, int Stop> struct copy_using_evaluator_LinearTraversal_CompleteUnrolling<Kernel, Stop, Stop> { static inline void run(Kernel&) { } }; template<typename Kernel, int Index, int Stop> struct copy_using_evaluator_innervec_CompleteUnrolling { typedef typename Kernel::DstEvaluatorType DstEvaluatorType; typedef typename DstEvaluatorType::XprType DstXprType; typedef typename Kernel::PacketType PacketType; enum { outer = Index / DstXprType::InnerSizeAtCompileTime, inner = Index % DstXprType::InnerSizeAtCompileTime, SrcAlignment = Kernel::AssignmentTraits::SrcAlignment, DstAlignment = Kernel::AssignmentTraits::DstAlignment }; static inline void run(Kernel &kernel) { kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner); enum { NextIndex = Index + unpacket_traits<PacketType>::size }; copy_using_evaluator_innervec_CompleteUnrolling<Kernel, NextIndex, Stop>::run(kernel); } }; template<typename Kernel, int Stop> struct copy_using_evaluator_innervec_CompleteUnrolling<Kernel, Stop, Stop> { static inline void run(Kernel&) { } }; template<typename Kernel, int Index_, int Stop, int SrcAlignment, int DstAlignment> struct copy_using_evaluator_innervec_InnerUnrolling { typedef typename Kernel::PacketType PacketType; static inline void run(Kernel &kernel, Index outer) { kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, Index_); enum { NextIndex = Index_ + unpacket_traits<PacketType>::size }; copy_using_evaluator_innervec_InnerUnrolling<Kernel, NextIndex, Stop, SrcAlignment, DstAlignment>::run(kernel, outer); } }; template<typename Kernel, int Stop, int SrcAlignment, int DstAlignment> struct copy_using_evaluator_innervec_InnerUnrolling<Kernel, Stop, Stop, SrcAlignment, DstAlignment> { static inline void run(Kernel &, Index) { } }; template<typename Kernel, int Traversal = Kernel::AssignmentTraits::Traversal, int Unrolling = Kernel::AssignmentTraits::Unrolling> struct dense_assignment_loop; template<typename Kernel> struct dense_assignment_loop<Kernel, DefaultTraversal, NoUnrolling> { static void inline run(Kernel &kernel) { for(Index outer = 0; outer < kernel.outerSize(); ++outer) { for(Index inner = 0; inner < kernel.innerSize(); ++inner) { kernel.assignCoeffByOuterInner(outer, inner); } } } }; template<typename Kernel> struct dense_assignment_loop<Kernel, DefaultTraversal, CompleteUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::DstEvaluatorType::XprType DstXprType; copy_using_evaluator_DefaultTraversal_CompleteUnrolling<Kernel, 0, DstXprType::SizeAtCompileTime>::run(kernel); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, DefaultTraversal, InnerUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::DstEvaluatorType::XprType DstXprType; const Index outerSize = kernel.outerSize(); for(Index outer = 0; outer < outerSize; ++outer) copy_using_evaluator_DefaultTraversal_InnerUnrolling<Kernel, 0, DstXprType::InnerSizeAtCompileTime>::run(kernel, outer); } }; # 363 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" template <bool IsAligned = false> struct unaligned_dense_assignment_loop { template <typename Kernel> static inline void run(Kernel&, Index, Index) {} }; template <> struct unaligned_dense_assignment_loop<false> { # 383 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" template <typename Kernel> static inline void run(Kernel &kernel, Index start, Index end) { for (Index index = start; index < end; ++index) kernel.assignCoeff(index); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, LinearVectorizedTraversal, NoUnrolling> { static inline void run(Kernel &kernel) { const Index size = kernel.size(); typedef typename Kernel::Scalar Scalar; typedef typename Kernel::PacketType PacketType; enum { requestedAlignment = Kernel::AssignmentTraits::LinearRequiredAlignment, packetSize = unpacket_traits<PacketType>::size, dstIsAligned = int(Kernel::AssignmentTraits::DstAlignment)>=int(requestedAlignment), dstAlignment = packet_traits<Scalar>::AlignedOnScalar ? int(requestedAlignment) : int(Kernel::AssignmentTraits::DstAlignment), srcAlignment = Kernel::AssignmentTraits::JointAlignment }; const Index alignedStart = dstIsAligned ? 0 : internal::first_aligned<requestedAlignment>(kernel.dstDataPtr(), size); const Index alignedEnd = alignedStart + ((size-alignedStart)/packetSize)*packetSize; unaligned_dense_assignment_loop<dstIsAligned!=0>::run(kernel, 0, alignedStart); for(Index index = alignedStart; index < alignedEnd; index += packetSize) kernel.template assignPacket<dstAlignment, srcAlignment, PacketType>(index); unaligned_dense_assignment_loop<>::run(kernel, alignedEnd, size); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, LinearVectorizedTraversal, CompleteUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::DstEvaluatorType::XprType DstXprType; typedef typename Kernel::PacketType PacketType; enum { size = DstXprType::SizeAtCompileTime, packetSize =unpacket_traits<PacketType>::size, alignedSize = (size/packetSize)*packetSize }; copy_using_evaluator_innervec_CompleteUnrolling<Kernel, 0, alignedSize>::run(kernel); copy_using_evaluator_DefaultTraversal_CompleteUnrolling<Kernel, alignedSize, size>::run(kernel); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, InnerVectorizedTraversal, NoUnrolling> { typedef typename Kernel::PacketType PacketType; enum { SrcAlignment = Kernel::AssignmentTraits::SrcAlignment, DstAlignment = Kernel::AssignmentTraits::DstAlignment }; static inline void run(Kernel &kernel) { const Index innerSize = kernel.innerSize(); const Index outerSize = kernel.outerSize(); const Index packetSize = unpacket_traits<PacketType>::size; for(Index outer = 0; outer < outerSize; ++outer) for(Index inner = 0; inner < innerSize; inner+=packetSize) kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, InnerVectorizedTraversal, CompleteUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::DstEvaluatorType::XprType DstXprType; copy_using_evaluator_innervec_CompleteUnrolling<Kernel, 0, DstXprType::SizeAtCompileTime>::run(kernel); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, InnerVectorizedTraversal, InnerUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::DstEvaluatorType::XprType DstXprType; typedef typename Kernel::AssignmentTraits Traits; const Index outerSize = kernel.outerSize(); for(Index outer = 0; outer < outerSize; ++outer) copy_using_evaluator_innervec_InnerUnrolling<Kernel, 0, DstXprType::InnerSizeAtCompileTime, Traits::SrcAlignment, Traits::DstAlignment>::run(kernel, outer); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, LinearTraversal, NoUnrolling> { static inline void run(Kernel &kernel) { const Index size = kernel.size(); for(Index i = 0; i < size; ++i) kernel.assignCoeff(i); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, LinearTraversal, CompleteUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::DstEvaluatorType::XprType DstXprType; copy_using_evaluator_LinearTraversal_CompleteUnrolling<Kernel, 0, DstXprType::SizeAtCompileTime>::run(kernel); } }; template<typename Kernel> struct dense_assignment_loop<Kernel, SliceVectorizedTraversal, NoUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::Scalar Scalar; typedef typename Kernel::PacketType PacketType; enum { packetSize = unpacket_traits<PacketType>::size, requestedAlignment = int(Kernel::AssignmentTraits::InnerRequiredAlignment), alignable = packet_traits<Scalar>::AlignedOnScalar || int(Kernel::AssignmentTraits::DstAlignment)>=sizeof(Scalar), dstIsAligned = int(Kernel::AssignmentTraits::DstAlignment)>=int(requestedAlignment), dstAlignment = alignable ? int(requestedAlignment) : int(Kernel::AssignmentTraits::DstAlignment) }; const Scalar *dst_ptr = kernel.dstDataPtr(); if((!bool(dstIsAligned)) && (UIntPtr(dst_ptr) % sizeof(Scalar))>0) { return dense_assignment_loop<Kernel,DefaultTraversal,NoUnrolling>::run(kernel); } const Index packetAlignedMask = packetSize - 1; const Index innerSize = kernel.innerSize(); const Index outerSize = kernel.outerSize(); const Index alignedStep = alignable ? (packetSize - kernel.outerStride() % packetSize) & packetAlignedMask : 0; Index alignedStart = ((!alignable) || bool(dstIsAligned)) ? 0 : internal::first_aligned<requestedAlignment>(dst_ptr, innerSize); for(Index outer = 0; outer < outerSize; ++outer) { const Index alignedEnd = alignedStart + ((innerSize-alignedStart) & ~packetAlignedMask); for(Index inner = 0; inner<alignedStart ; ++inner) kernel.assignCoeffByOuterInner(outer, inner); for(Index inner = alignedStart; inner<alignedEnd; inner+=packetSize) kernel.template assignPacketByOuterInner<dstAlignment, Unaligned, PacketType>(outer, inner); for(Index inner = alignedEnd; inner<innerSize ; ++inner) kernel.assignCoeffByOuterInner(outer, inner); alignedStart = numext::mini((alignedStart+alignedStep)%packetSize, innerSize); } } }; template<typename Kernel> struct dense_assignment_loop<Kernel, SliceVectorizedTraversal, InnerUnrolling> { static inline void run(Kernel &kernel) { typedef typename Kernel::DstEvaluatorType::XprType DstXprType; typedef typename Kernel::PacketType PacketType; enum { size = DstXprType::InnerSizeAtCompileTime, packetSize =unpacket_traits<PacketType>::size, vectorizableSize = (size/packetSize)*packetSize }; for(Index outer = 0; outer < kernel.outerSize(); ++outer) { copy_using_evaluator_innervec_InnerUnrolling<Kernel, 0, vectorizableSize, 0, 0>::run(kernel, outer); copy_using_evaluator_DefaultTraversal_InnerUnrolling<Kernel, vectorizableSize, size>::run(kernel, outer); } } }; # 595 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" template<typename DstEvaluatorTypeT, typename SrcEvaluatorTypeT, typename Functor, int Version = Specialized> class generic_dense_assignment_kernel { protected: typedef typename DstEvaluatorTypeT::XprType DstXprType; typedef typename SrcEvaluatorTypeT::XprType SrcXprType; public: typedef DstEvaluatorTypeT DstEvaluatorType; typedef SrcEvaluatorTypeT SrcEvaluatorType; typedef typename DstEvaluatorType::Scalar Scalar; typedef copy_using_evaluator_traits<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor> AssignmentTraits; typedef typename AssignmentTraits::PacketType PacketType; generic_dense_assignment_kernel(DstEvaluatorType &dst, const SrcEvaluatorType &src, const Functor &func, DstXprType& dstExpr) : m_dst(dst), m_src(src), m_functor(func), m_dstExpr(dstExpr) { } Index size() const { return m_dstExpr.size(); } Index innerSize() const { return m_dstExpr.innerSize(); } Index outerSize() const { return m_dstExpr.outerSize(); } Index rows() const { return m_dstExpr.rows(); } Index cols() const { return m_dstExpr.cols(); } Index outerStride() const { return m_dstExpr.outerStride(); } DstEvaluatorType& dstEvaluator() { return m_dst; } const SrcEvaluatorType& srcEvaluator() const { return m_src; } inline void assignCoeff(Index row, Index col) { m_functor.assignCoeff(m_dst.coeffRef(row,col), m_src.coeff(row,col)); } inline void assignCoeff(Index index) { m_functor.assignCoeff(m_dst.coeffRef(index), m_src.coeff(index)); } inline void assignCoeffByOuterInner(Index outer, Index inner) { Index row = rowIndexByOuterInner(outer, inner); Index col = colIndexByOuterInner(outer, inner); assignCoeff(row, col); } template<int StoreMode, int LoadMode, typename PacketType> inline void assignPacket(Index row, Index col) { m_functor.template assignPacket<StoreMode>(&m_dst.coeffRef(row,col), m_src.template packet<LoadMode,PacketType>(row,col)); } template<int StoreMode, int LoadMode, typename PacketType> inline void assignPacket(Index index) { m_functor.template assignPacket<StoreMode>(&m_dst.coeffRef(index), m_src.template packet<LoadMode,PacketType>(index)); } template<int StoreMode, int LoadMode, typename PacketType> inline void assignPacketByOuterInner(Index outer, Index inner) { Index row = rowIndexByOuterInner(outer, inner); Index col = colIndexByOuterInner(outer, inner); assignPacket<StoreMode,LoadMode,PacketType>(row, col); } static inline Index rowIndexByOuterInner(Index outer, Index inner) { typedef typename DstEvaluatorType::ExpressionTraits Traits; return int(Traits::RowsAtCompileTime) == 1 ? 0 : int(Traits::ColsAtCompileTime) == 1 ? inner : int(DstEvaluatorType::Flags)&RowMajorBit ? outer : inner; } static inline Index colIndexByOuterInner(Index outer, Index inner) { typedef typename DstEvaluatorType::ExpressionTraits Traits; return int(Traits::ColsAtCompileTime) == 1 ? 0 : int(Traits::RowsAtCompileTime) == 1 ? inner : int(DstEvaluatorType::Flags)&RowMajorBit ? inner : outer; } const Scalar* dstDataPtr() const { return m_dstExpr.data(); } protected: DstEvaluatorType& m_dst; const SrcEvaluatorType& m_src; const Functor &m_functor; DstXprType& m_dstExpr; }; template<typename DstXprType,typename SrcXprType, typename Functor> inline void resize_if_allowed(DstXprType &dst, const SrcXprType& src, const Functor & ) { ; ; ((dst.rows() == src.rows() && dst.cols() == src.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows() == src.rows() && dst.cols() == src.cols()", "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h", 710, __PRETTY_FUNCTION__)); } template<typename DstXprType,typename SrcXprType, typename T1, typename T2> inline void resize_if_allowed(DstXprType &dst, const SrcXprType& src, const internal::assign_op<T1,T2> & ) { Index dstRows = src.rows(); Index dstCols = src.cols(); if(((dst.rows()!=dstRows) || (dst.cols()!=dstCols))) dst.resize(dstRows, dstCols); ((dst.rows() == dstRows && dst.cols() == dstCols) ? static_cast<void> (0) : __assert_fail ("dst.rows() == dstRows && dst.cols() == dstCols", "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h", 721, __PRETTY_FUNCTION__)); } template<typename DstXprType, typename SrcXprType, typename Functor> inline void call_dense_assignment_loop(DstXprType& dst, const SrcXprType& src, const Functor &func) { typedef evaluator<DstXprType> DstEvaluatorType; typedef evaluator<SrcXprType> SrcEvaluatorType; SrcEvaluatorType srcEvaluator(src); resize_if_allowed(dst, src, func); DstEvaluatorType dstEvaluator(dst); typedef generic_dense_assignment_kernel<DstEvaluatorType,SrcEvaluatorType,Functor> Kernel; Kernel kernel(dstEvaluator, srcEvaluator, func, dst.const_cast_derived()); dense_assignment_loop<Kernel>::run(kernel); } template<typename DstXprType, typename SrcXprType> inline void call_dense_assignment_loop(DstXprType& dst, const SrcXprType& src) { call_dense_assignment_loop(dst, src, internal::assign_op<typename DstXprType::Scalar,typename SrcXprType::Scalar>()); } # 757 "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h" template<typename DstShape, typename SrcShape> struct AssignmentKind; struct Dense2Dense {}; struct EigenBase2EigenBase {}; template<typename,typename> struct AssignmentKind { typedef EigenBase2EigenBase Kind; }; template<> struct AssignmentKind<DenseShape,DenseShape> { typedef Dense2Dense Kind; }; template< typename DstXprType, typename SrcXprType, typename Functor, typename Kind = typename AssignmentKind< typename evaluator_traits<DstXprType>::Shape , typename evaluator_traits<SrcXprType>::Shape >::Kind, typename EnableIf = void> struct Assignment; template<typename Dst, typename Src> inline void call_assignment(Dst& dst, const Src& src) { call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>()); } template<typename Dst, typename Src> inline void call_assignment(const Dst& dst, const Src& src) { call_assignment(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>()); } template<typename Dst, typename Src, typename Func> inline void call_assignment(Dst& dst, const Src& src, const Func& func, typename enable_if< evaluator_assume_aliasing<Src>::value, void*>::type = 0) { typename plain_matrix_type<Src>::type tmp(src); call_assignment_no_alias(dst, tmp, func); } template<typename Dst, typename Src, typename Func> inline void call_assignment(Dst& dst, const Src& src, const Func& func, typename enable_if<!evaluator_assume_aliasing<Src>::value, void*>::type = 0) { call_assignment_no_alias(dst, src, func); } template<typename Dst, template <typename> class StorageBase, typename Src, typename Func> inline void call_assignment(NoAlias<Dst,StorageBase>& dst, const Src& src, const Func& func) { call_assignment_no_alias(dst.expression(), src, func); } template<typename Dst, typename Src, typename Func> inline void call_assignment_no_alias(Dst& dst, const Src& src, const Func& func) { enum { NeedToTranspose = ( (int(Dst::RowsAtCompileTime) == 1 && int(Src::ColsAtCompileTime) == 1) || (int(Dst::ColsAtCompileTime) == 1 && int(Src::RowsAtCompileTime) == 1) ) && int(Dst::SizeAtCompileTime) != 1 }; typedef typename internal::conditional<NeedToTranspose, Transpose<Dst>, Dst>::type ActualDstTypeCleaned; typedef typename internal::conditional<NeedToTranspose, Transpose<Dst>, Dst&>::type ActualDstType; ActualDstType actualDst(dst); if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<Dst>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} if (Eigen::internal::static_assertion<static_cast<bool>(( (int(Eigen::internal::size_of_xpr_at_compile_time<ActualDstTypeCleaned>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<Src>::ret)==0) || ( (int(ActualDstTypeCleaned::RowsAtCompileTime)==Eigen::Dynamic || int(Src::RowsAtCompileTime)==Eigen::Dynamic || int(ActualDstTypeCleaned::RowsAtCompileTime)==int(Src::RowsAtCompileTime)) && (int(ActualDstTypeCleaned::ColsAtCompileTime)==Eigen::Dynamic || int(Src::ColsAtCompileTime)==Eigen::Dynamic || int(ActualDstTypeCleaned::ColsAtCompileTime)==int(Src::ColsAtCompileTime)) ) ))>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::has_ReturnType<ScalarBinaryOpTraits<typename ActualDstTypeCleaned::Scalar, typename Src::Scalar,Func> >::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {}; Assignment<ActualDstTypeCleaned,Src,Func>::run(actualDst, src, func); } template<typename Dst, typename Src> inline void call_assignment_no_alias(Dst& dst, const Src& src) { call_assignment_no_alias(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>()); } template<typename Dst, typename Src, typename Func> inline void call_assignment_no_alias_no_transpose(Dst& dst, const Src& src, const Func& func) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<Dst>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} if (Eigen::internal::static_assertion<static_cast<bool>(( (int(Eigen::internal::size_of_xpr_at_compile_time<Dst>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<Src>::ret)==0) || ( (int(Dst::RowsAtCompileTime)==Eigen::Dynamic || int(Src::RowsAtCompileTime)==Eigen::Dynamic || int(Dst::RowsAtCompileTime)==int(Src::RowsAtCompileTime)) && (int(Dst::ColsAtCompileTime)==Eigen::Dynamic || int(Src::ColsAtCompileTime)==Eigen::Dynamic || int(Dst::ColsAtCompileTime)==int(Src::ColsAtCompileTime)) ) ))>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::has_ReturnType<ScalarBinaryOpTraits<typename Dst::Scalar, typename Src::Scalar,Func> >::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {}; Assignment<Dst,Src,Func>::run(dst, src, func); } template<typename Dst, typename Src> inline void call_assignment_no_alias_no_transpose(Dst& dst, const Src& src) { call_assignment_no_alias_no_transpose(dst, src, internal::assign_op<typename Dst::Scalar,typename Src::Scalar>()); } template<typename Dst, typename Src> void check_for_aliasing(const Dst &dst, const Src &src); template< typename DstXprType, typename SrcXprType, typename Functor, typename Weak> struct Assignment<DstXprType, SrcXprType, Functor, Dense2Dense, Weak> { static inline void run(DstXprType &dst, const SrcXprType &src, const Functor &func) { internal::check_for_aliasing(dst, src); call_dense_assignment_loop(dst, src, func); } }; template< typename DstXprType, typename SrcXprType, typename Functor, typename Weak> struct Assignment<DstXprType, SrcXprType, Functor, EigenBase2EigenBase, Weak> { static inline void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename SrcXprType::Scalar> & ) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); ((dst.rows() == src.rows() && dst.cols() == src.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows() == src.rows() && dst.cols() == src.cols()", "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h", 898, __PRETTY_FUNCTION__)); src.evalTo(dst); } template<typename SrcScalarType> static inline void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op<typename DstXprType::Scalar,SrcScalarType> & ) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); ((dst.rows() == src.rows() && dst.cols() == src.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows() == src.rows() && dst.cols() == src.cols()", "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h", 913, __PRETTY_FUNCTION__)); src.addTo(dst); } template<typename SrcScalarType> static inline void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op<typename DstXprType::Scalar,SrcScalarType> & ) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); ((dst.rows() == src.rows() && dst.cols() == src.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows() == src.rows() && dst.cols() == src.cols()", "eigen-3.3.7/Eigen/src/Core/AssignEvaluator.h", 926, __PRETTY_FUNCTION__)); src.subTo(dst); } }; } } # 442 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Assign.h" 1 # 15 "eigen-3.3.7/Eigen/src/Core/Assign.h" namespace Eigen { template<typename Derived> template<typename OtherDerived> inline Derived& DenseBase<Derived> ::lazyAssign(const DenseBase<OtherDerived>& other) { enum{ SameType = internal::is_same<typename Derived::Scalar,typename OtherDerived::Scalar>::value }; if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<Derived>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} if (Eigen::internal::static_assertion<static_cast<bool>(( (int(Eigen::internal::size_of_xpr_at_compile_time<Derived>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<OtherDerived>::ret)==0) || ( (int(Derived::RowsAtCompileTime)==Eigen::Dynamic || int(OtherDerived::RowsAtCompileTime)==Eigen::Dynamic || int(Derived::RowsAtCompileTime)==int(OtherDerived::RowsAtCompileTime)) && (int(Derived::ColsAtCompileTime)==Eigen::Dynamic || int(OtherDerived::ColsAtCompileTime)==Eigen::Dynamic || int(Derived::ColsAtCompileTime)==int(OtherDerived::ColsAtCompileTime)) ) ))>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {} if (Eigen::internal::static_assertion<static_cast<bool>(SameType)>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {} ((rows() == other.rows() && cols() == other.cols()) ? static_cast<void> (0) : __assert_fail ("rows() == other.rows() && cols() == other.cols()", "eigen-3.3.7/Eigen/src/Core/Assign.h", 30, __PRETTY_FUNCTION__)); internal::call_assignment_no_alias(derived(),other.derived()); return derived(); } template<typename Derived> template<typename OtherDerived> inline Derived& DenseBase<Derived>::operator=(const DenseBase<OtherDerived>& other) { internal::call_assignment(derived(), other.derived()); return derived(); } template<typename Derived> inline Derived& DenseBase<Derived>::operator=(const DenseBase& other) { internal::call_assignment(derived(), other.derived()); return derived(); } template<typename Derived> inline Derived& MatrixBase<Derived>::operator=(const MatrixBase& other) { internal::call_assignment(derived(), other.derived()); return derived(); } template<typename Derived> template <typename OtherDerived> inline Derived& MatrixBase<Derived>::operator=(const DenseBase<OtherDerived>& other) { internal::call_assignment(derived(), other.derived()); return derived(); } template<typename Derived> template <typename OtherDerived> inline Derived& MatrixBase<Derived>::operator=(const EigenBase<OtherDerived>& other) { internal::call_assignment(derived(), other.derived()); return derived(); } template<typename Derived> template<typename OtherDerived> inline Derived& MatrixBase<Derived>::operator=(const ReturnByValue<OtherDerived>& other) { other.derived().evalTo(derived()); return derived(); } } # 446 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" namespace Eigen { template<typename ExpressionType> class MatrixWrapper; # 39 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" template<typename Derived> class ArrayBase : public DenseBase<Derived> { public: typedef ArrayBase StorageBaseType; typedef ArrayBase Eigen_BaseClassForSpecializationOfGlobalMathFuncImpl; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename internal::packet_traits<Scalar>::type PacketScalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef DenseBase<Derived> Base; using Base::RowsAtCompileTime; using Base::ColsAtCompileTime; using Base::SizeAtCompileTime; using Base::MaxRowsAtCompileTime; using Base::MaxColsAtCompileTime; using Base::MaxSizeAtCompileTime; using Base::IsVectorAtCompileTime; using Base::Flags; using Base::derived; using Base::const_cast_derived; using Base::rows; using Base::cols; using Base::size; using Base::coeff; using Base::coeffRef; using Base::lazyAssign; using Base::operator=; using Base::operator+=; using Base::operator-=; using Base::operator*=; using Base::operator/=; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Base::PlainObject PlainObject; typedef CwiseNullaryOp<internal::scalar_constant_op<Scalar>,PlainObject> ConstantReturnType; # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" 1 # 16 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, const CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>, const Derived>, const Derived& >::type ConjugateReturnType; typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, const CwiseUnaryOp<internal::scalar_real_op<Scalar>, const Derived>, const Derived& >::type RealReturnType; typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, CwiseUnaryView<internal::scalar_real_ref_op<Scalar>, Derived>, Derived& >::type NonConstRealReturnType; typedef CwiseUnaryOp<internal::scalar_imag_op<Scalar>, const Derived> ImagReturnType; typedef CwiseUnaryView<internal::scalar_imag_ref_op<Scalar>, Derived> NonConstImagReturnType; typedef CwiseUnaryOp<internal::scalar_opposite_op<Scalar>, const Derived> NegativeReturnType; inline const NegativeReturnType operator-() const { return NegativeReturnType(derived()); } template<class NewType> struct CastXpr { typedef typename internal::cast_return_type<Derived,const CwiseUnaryOp<internal::scalar_cast_op<Scalar, NewType>, const Derived> >::type Type; }; template<typename NewType> typename CastXpr<NewType>::Type cast() const { return typename CastXpr<NewType>::Type(derived()); } inline ConjugateReturnType conjugate() const { return ConjugateReturnType(derived()); } inline RealReturnType real() const { return RealReturnType(derived()); } inline const ImagReturnType imag() const { return ImagReturnType(derived()); } # 114 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" template<typename CustomUnaryOp> inline const CwiseUnaryOp<CustomUnaryOp, const Derived> unaryExpr(const CustomUnaryOp& func = CustomUnaryOp()) const { return CwiseUnaryOp<CustomUnaryOp, const Derived>(derived(), func); } # 135 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseUnaryOps.h" template<typename CustomViewOp> inline const CwiseUnaryView<CustomViewOp, const Derived> unaryViewExpr(const CustomViewOp& func = CustomViewOp()) const { return CwiseUnaryView<CustomViewOp, const Derived>(derived(), func); } inline NonConstRealReturnType real() { return NonConstRealReturnType(derived()); } inline NonConstImagReturnType imag() { return NonConstImagReturnType(derived()); } # 92 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseUnaryOps.h" 1 # 15 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseUnaryOps.h" typedef CwiseUnaryOp<internal::scalar_abs_op<Scalar>, const Derived> CwiseAbsReturnType; typedef CwiseUnaryOp<internal::scalar_abs2_op<Scalar>, const Derived> CwiseAbs2ReturnType; typedef CwiseUnaryOp<internal::scalar_sqrt_op<Scalar>, const Derived> CwiseSqrtReturnType; typedef CwiseUnaryOp<internal::scalar_sign_op<Scalar>, const Derived> CwiseSignReturnType; typedef CwiseUnaryOp<internal::scalar_inverse_op<Scalar>, const Derived> CwiseInverseReturnType; inline const CwiseAbsReturnType cwiseAbs() const { return CwiseAbsReturnType(derived()); } inline const CwiseAbs2ReturnType cwiseAbs2() const { return CwiseAbs2ReturnType(derived()); } inline const CwiseSqrtReturnType cwiseSqrt() const { return CwiseSqrtReturnType(derived()); } inline const CwiseSignReturnType cwiseSign() const { return CwiseSignReturnType(derived()); } inline const CwiseInverseReturnType cwiseInverse() const { return CwiseInverseReturnType(derived()); } # 93 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" 1 typedef CwiseUnaryOp<internal::scalar_abs_op<Scalar>, const Derived> AbsReturnType; typedef CwiseUnaryOp<internal::scalar_arg_op<Scalar>, const Derived> ArgReturnType; typedef CwiseUnaryOp<internal::scalar_abs2_op<Scalar>, const Derived> Abs2ReturnType; typedef CwiseUnaryOp<internal::scalar_sqrt_op<Scalar>, const Derived> SqrtReturnType; typedef CwiseUnaryOp<internal::scalar_rsqrt_op<Scalar>, const Derived> RsqrtReturnType; typedef CwiseUnaryOp<internal::scalar_sign_op<Scalar>, const Derived> SignReturnType; typedef CwiseUnaryOp<internal::scalar_inverse_op<Scalar>, const Derived> InverseReturnType; typedef CwiseUnaryOp<internal::scalar_boolean_not_op<Scalar>, const Derived> BooleanNotReturnType; typedef CwiseUnaryOp<internal::scalar_exp_op<Scalar>, const Derived> ExpReturnType; typedef CwiseUnaryOp<internal::scalar_log_op<Scalar>, const Derived> LogReturnType; typedef CwiseUnaryOp<internal::scalar_log1p_op<Scalar>, const Derived> Log1pReturnType; typedef CwiseUnaryOp<internal::scalar_log10_op<Scalar>, const Derived> Log10ReturnType; typedef CwiseUnaryOp<internal::scalar_cos_op<Scalar>, const Derived> CosReturnType; typedef CwiseUnaryOp<internal::scalar_sin_op<Scalar>, const Derived> SinReturnType; typedef CwiseUnaryOp<internal::scalar_tan_op<Scalar>, const Derived> TanReturnType; typedef CwiseUnaryOp<internal::scalar_acos_op<Scalar>, const Derived> AcosReturnType; typedef CwiseUnaryOp<internal::scalar_asin_op<Scalar>, const Derived> AsinReturnType; typedef CwiseUnaryOp<internal::scalar_atan_op<Scalar>, const Derived> AtanReturnType; typedef CwiseUnaryOp<internal::scalar_tanh_op<Scalar>, const Derived> TanhReturnType; typedef CwiseUnaryOp<internal::scalar_sinh_op<Scalar>, const Derived> SinhReturnType; typedef CwiseUnaryOp<internal::scalar_cosh_op<Scalar>, const Derived> CoshReturnType; typedef CwiseUnaryOp<internal::scalar_square_op<Scalar>, const Derived> SquareReturnType; typedef CwiseUnaryOp<internal::scalar_cube_op<Scalar>, const Derived> CubeReturnType; typedef CwiseUnaryOp<internal::scalar_round_op<Scalar>, const Derived> RoundReturnType; typedef CwiseUnaryOp<internal::scalar_floor_op<Scalar>, const Derived> FloorReturnType; typedef CwiseUnaryOp<internal::scalar_ceil_op<Scalar>, const Derived> CeilReturnType; typedef CwiseUnaryOp<internal::scalar_isnan_op<Scalar>, const Derived> IsNaNReturnType; typedef CwiseUnaryOp<internal::scalar_isinf_op<Scalar>, const Derived> IsInfReturnType; typedef CwiseUnaryOp<internal::scalar_isfinite_op<Scalar>, const Derived> IsFiniteReturnType; # 41 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const AbsReturnType abs() const { return AbsReturnType(derived()); } # 55 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const ArgReturnType arg() const { return ArgReturnType(derived()); } # 69 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const Abs2ReturnType abs2() const { return Abs2ReturnType(derived()); } # 86 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const ExpReturnType exp() const { return ExpReturnType(derived()); } # 103 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const LogReturnType log() const { return LogReturnType(derived()); } # 117 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const Log1pReturnType log1p() const { return Log1pReturnType(derived()); } # 133 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const Log10ReturnType log10() const { return Log10ReturnType(derived()); } # 150 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const SqrtReturnType sqrt() const { return SqrtReturnType(derived()); } # 166 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const RsqrtReturnType rsqrt() const { return RsqrtReturnType(derived()); } # 182 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const SignReturnType sign() const { return SignReturnType(derived()); } # 200 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const CosReturnType cos() const { return CosReturnType(derived()); } # 218 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const SinReturnType sin() const { return SinReturnType(derived()); } # 232 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const TanReturnType tan() const { return TanReturnType(derived()); } # 246 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const AtanReturnType atan() const { return AtanReturnType(derived()); } # 260 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const AcosReturnType acos() const { return AcosReturnType(derived()); } # 274 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const AsinReturnType asin() const { return AsinReturnType(derived()); } # 288 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const TanhReturnType tanh() const { return TanhReturnType(derived()); } # 302 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const SinhReturnType sinh() const { return SinhReturnType(derived()); } # 316 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const CoshReturnType cosh() const { return CoshReturnType(derived()); } # 330 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const InverseReturnType inverse() const { return InverseReturnType(derived()); } # 344 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const SquareReturnType square() const { return SquareReturnType(derived()); } # 358 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const CubeReturnType cube() const { return CubeReturnType(derived()); } # 372 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const RoundReturnType round() const { return RoundReturnType(derived()); } # 386 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const FloorReturnType floor() const { return FloorReturnType(derived()); } # 400 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const CeilReturnType ceil() const { return CeilReturnType(derived()); } # 414 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const IsNaNReturnType isNaN() const { return IsNaNReturnType(derived()); } # 428 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const IsInfReturnType isInf() const { return IsInfReturnType(derived()); } # 442 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const IsFiniteReturnType isFinite() const { return IsFiniteReturnType(derived()); } # 458 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const BooleanNotReturnType operator!() const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<bool,Scalar>::value))>::THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL) {} ; return BooleanNotReturnType(derived()); } typedef CwiseUnaryOp<internal::scalar_lgamma_op<Scalar>, const Derived> LgammaReturnType; typedef CwiseUnaryOp<internal::scalar_digamma_op<Scalar>, const Derived> DigammaReturnType; typedef CwiseUnaryOp<internal::scalar_erf_op<Scalar>, const Derived> ErfReturnType; typedef CwiseUnaryOp<internal::scalar_erfc_op<Scalar>, const Derived> ErfcReturnType; # 488 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const LgammaReturnType lgamma() const { return LgammaReturnType(derived()); } # 505 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const DigammaReturnType digamma() const { return DigammaReturnType(derived()); } # 526 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const ErfReturnType erf() const { return ErfReturnType(derived()); } # 547 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseUnaryOps.h" inline const ErfcReturnType erfc() const { return ErfcReturnType(derived()); } # 94 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" 1 # 19 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_difference_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > (operator-)(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_difference_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_sum_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > (operator+)(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_sum_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } # 40 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename CustomBinaryOp, typename OtherDerived> inline const CwiseBinaryOp<CustomBinaryOp, const Derived, const OtherDerived> binaryExpr(const Eigen::ArrayBase<OtherDerived> &other, const CustomBinaryOp& func = CustomBinaryOp()) const { return CwiseBinaryOp<CustomBinaryOp, const Derived, const OtherDerived>(derived(), other.derived(), func); } template <typename T> inline friend typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_product_op<typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_product_op<T,Scalar> > >::value)>::type,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_product_op<T,Scalar> > >::value)>::type>::type, const Derived> >::type (operator*)(const T& scalar, const StorageBaseType& matrix) { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_product_op<T,Scalar> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_product_op<PromotedT,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,PromotedT>::type, const Derived>( typename internal::plain_constant_type<Derived,PromotedT>::type(matrix.derived().rows(), matrix.derived().cols(), internal::scalar_constant_op<PromotedT>(scalar)), matrix.derived()); } template <typename T> inline typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_product_op<typename internal::traits<Derived>::Scalar,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_product_op<Scalar,T> > >::value)>::type>, const Derived, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_product_op<Scalar,T> > >::value)>::type>::type> >::type (operator*)(const T& scalar) const { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_product_op<Scalar,T> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_product_op<typename internal::traits<Derived>::Scalar,PromotedT>, const Derived, const typename internal::plain_constant_type<Derived,PromotedT>::type>(derived(), typename internal::plain_constant_type<Derived,PromotedT>::type(derived().rows(), derived().cols(), internal::scalar_constant_op<PromotedT>(scalar))); } # 69 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template <typename T> inline typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_quotient_op<typename internal::traits<Derived>::Scalar,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_quotient_op<Scalar,T> > >::value)>::type>, const Derived, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_quotient_op<Scalar,T> > >::value)>::type>::type> >::type (operator/)(const T& scalar) const { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_quotient_op<Scalar,T> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_quotient_op<typename internal::traits<Derived>::Scalar,PromotedT>, const Derived, const typename internal::plain_constant_type<Derived,PromotedT>::type>(derived(), typename internal::plain_constant_type<Derived,PromotedT>::type(derived().rows(), derived().cols(), internal::scalar_constant_op<PromotedT>(scalar))); } # 88 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_boolean_and_op, const Derived, const OtherDerived> operator&&(const Eigen::ArrayBase<OtherDerived> &other) const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<bool,Scalar>::value && internal::is_same<bool,typename OtherDerived::Scalar>::value))>::THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL) {} ; return CwiseBinaryOp<internal::scalar_boolean_and_op, const Derived, const OtherDerived>(derived(),other.derived()); } # 107 "eigen-3.3.7/Eigen/src/Core/../plugins/CommonCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_boolean_or_op, const Derived, const OtherDerived> operator||(const Eigen::ArrayBase<OtherDerived> &other) const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<bool,Scalar>::value && internal::is_same<bool,typename OtherDerived::Scalar>::value))>::THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL) {} ; return CwiseBinaryOp<internal::scalar_boolean_or_op, const Derived, const OtherDerived>(derived(),other.derived()); } # 95 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" 1 # 20 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_product_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > cwiseProduct(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_product_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } # 40 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<std::equal_to<Scalar>, const Derived, const OtherDerived> cwiseEqual(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<std::equal_to<Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } # 60 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<std::not_equal_to<Scalar>, const Derived, const OtherDerived> cwiseNotEqual(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<std::not_equal_to<Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } # 75 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_min_op<Scalar,Scalar>, const Derived, const OtherDerived> cwiseMin(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_min_op<Scalar,Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } inline const CwiseBinaryOp<internal::scalar_min_op<Scalar,Scalar>, const Derived, const ConstantReturnType> cwiseMin(const Scalar &other) const { return cwiseMin(Derived::Constant(rows(), cols(), other)); } # 101 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_max_op<Scalar,Scalar>, const Derived, const OtherDerived> cwiseMax(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_max_op<Scalar,Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } inline const CwiseBinaryOp<internal::scalar_max_op<Scalar,Scalar>, const Derived, const ConstantReturnType> cwiseMax(const Scalar &other) const { return cwiseMax(Derived::Constant(rows(), cols(), other)); } # 128 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const Derived, const OtherDerived> cwiseQuotient(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar,internal::cmp_EQ>, const Derived, const ConstantReturnType> CwiseScalarEqualReturnType; # 147 "eigen-3.3.7/Eigen/src/Core/../plugins/MatrixCwiseBinaryOps.h" inline const CwiseScalarEqualReturnType cwiseEqual(const Scalar& s) const { return CwiseScalarEqualReturnType(derived(), Derived::Constant(rows(), cols(), s), internal::scalar_cmp_op<Scalar,Scalar,internal::cmp_EQ>()); } # 96 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" 2 # 1 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" 1 template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_product_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > operator*(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_product_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_quotient_op<Scalar,typename OtherDerived::Scalar>, const Derived, const OtherDerived> operator/(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_quotient_op<Scalar,typename OtherDerived::Scalar>, const Derived, const OtherDerived>(derived(), other.derived()); } # 33 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_min_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > (min)(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_min_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } inline const CwiseBinaryOp<internal::scalar_min_op<Scalar,Scalar>, const Derived, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> > (min) (const Scalar &other) const { return (min)(Derived::PlainObject::Constant(rows(), cols(), other)); } # 59 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_max_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > (max)(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_max_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } inline const CwiseBinaryOp<internal::scalar_max_op<Scalar,Scalar>, const Derived, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> > (max) (const Scalar &other) const { return (max)(Derived::PlainObject::Constant(rows(), cols(), other)); } # 85 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp< internal::scalar_pow_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived > (pow)(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp< internal::scalar_pow_op< typename internal::traits<Derived>::Scalar, typename internal::traits<OtherDerived>::Scalar >, const Derived, const OtherDerived >(derived(), other.derived()); } template <typename T> inline typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_pow_op<typename internal::traits<Derived>::Scalar,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_pow_op<Scalar,T> > >::value)>::type>, const Derived, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_pow_op<Scalar,T> > >::value)>::type>::type> >::type (pow)(const T& scalar) const { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_pow_op<Scalar,T> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_pow_op<typename internal::traits<Derived>::Scalar,PromotedT>, const Derived, const typename internal::plain_constant_type<Derived,PromotedT>::type>(derived(), typename internal::plain_constant_type<Derived,PromotedT>::type(derived().rows(), derived().cols(), internal::scalar_constant_op<PromotedT>(scalar))); } # 152 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_LT>, const Derived, const OtherDerived> operator<(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_LT>, const Derived, const OtherDerived>(derived(), other.derived()); }typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_LT>, const Derived, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> > CmpLTReturnType; typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_LT>, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject>, const Derived > RCmpLTReturnType; inline const CmpLTReturnType operator<(const Scalar& s) const { return this->operator<(Derived::PlainObject::Constant(rows(), cols(), s)); } friend inline const RCmpLTReturnType operator<(const Scalar& s, const Derived& d) { return Derived::PlainObject::Constant(d.rows(), d.cols(), s).operator<(d); } # 161 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_LE>, const Derived, const OtherDerived> operator<=(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_LE>, const Derived, const OtherDerived>(derived(), other.derived()); }typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_LE>, const Derived, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> > CmpLEReturnType; typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_LE>, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject>, const Derived > RCmpLEReturnType; inline const CmpLEReturnType operator<=(const Scalar& s) const { return this->operator<=(Derived::PlainObject::Constant(rows(), cols(), s)); } friend inline const RCmpLEReturnType operator<=(const Scalar& s, const Derived& d) { return Derived::PlainObject::Constant(d.rows(), d.cols(), s).operator<=(d); } # 170 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_cmp_op<typename OtherDerived::Scalar, Scalar, internal::cmp_LT>, const OtherDerived, const Derived> operator>(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_cmp_op<typename OtherDerived::Scalar, Scalar, internal::cmp_LT>, const OtherDerived, const Derived>(other.derived(), derived()); } inline const RCmpLTReturnType operator>(const Scalar& s) const { return Derived::PlainObject::Constant(rows(), cols(), s).operator<(*this); } friend inline const CmpLTReturnType operator>(const Scalar& s, const Derived& d) { return d.operator<(Derived::PlainObject::Constant(d.rows(), d.cols(), s)); } # 179 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_cmp_op<typename OtherDerived::Scalar, Scalar, internal::cmp_LE>, const OtherDerived, const Derived> operator>=(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_cmp_op<typename OtherDerived::Scalar, Scalar, internal::cmp_LE>, const OtherDerived, const Derived>(other.derived(), derived()); } inline const RCmpLEReturnType operator>=(const Scalar& s) const { return Derived::PlainObject::Constant(rows(), cols(), s).operator<=(*this); } friend inline const CmpLEReturnType operator>=(const Scalar& s, const Derived& d) { return d.operator<=(Derived::PlainObject::Constant(d.rows(), d.cols(), s)); } # 193 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_EQ>, const Derived, const OtherDerived> operator==(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_EQ>, const Derived, const OtherDerived>(derived(), other.derived()); }typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_EQ>, const Derived, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> > CmpEQReturnType; typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_EQ>, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject>, const Derived > RCmpEQReturnType; inline const CmpEQReturnType operator==(const Scalar& s) const { return this->operator==(Derived::PlainObject::Constant(rows(), cols(), s)); } friend inline const RCmpEQReturnType operator==(const Scalar& s, const Derived& d) { return Derived::PlainObject::Constant(d.rows(), d.cols(), s).operator==(d); } # 207 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_NEQ>, const Derived, const OtherDerived> operator!=(const Eigen::ArrayBase<OtherDerived> &other) const { return CwiseBinaryOp<internal::scalar_cmp_op<Scalar, typename OtherDerived::Scalar, internal::cmp_NEQ>, const Derived, const OtherDerived>(derived(), other.derived()); }typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_NEQ>, const Derived, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject> > CmpNEQReturnType; typedef CwiseBinaryOp<internal::scalar_cmp_op<Scalar,Scalar, internal::cmp_NEQ>, const CwiseNullaryOp<internal::scalar_constant_op<Scalar>, PlainObject>, const Derived > RCmpNEQReturnType; inline const CmpNEQReturnType operator!=(const Scalar& s) const { return this->operator!=(Derived::PlainObject::Constant(rows(), cols(), s)); } friend inline const RCmpNEQReturnType operator!=(const Scalar& s, const Derived& d) { return Derived::PlainObject::Constant(d.rows(), d.cols(), s).operator!=(d); } template <typename T> inline friend typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_sum_op<typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_sum_op<T,Scalar> > >::value)>::type,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_sum_op<T,Scalar> > >::value)>::type>::type, const Derived> >::type (operator+)(const T& scalar, const StorageBaseType& matrix) { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_sum_op<T,Scalar> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_sum_op<PromotedT,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,PromotedT>::type, const Derived>( typename internal::plain_constant_type<Derived,PromotedT>::type(matrix.derived().rows(), matrix.derived().cols(), internal::scalar_constant_op<PromotedT>(scalar)), matrix.derived()); } template <typename T> inline typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_sum_op<typename internal::traits<Derived>::Scalar,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_sum_op<Scalar,T> > >::value)>::type>, const Derived, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_sum_op<Scalar,T> > >::value)>::type>::type> >::type (operator+)(const T& scalar) const { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_sum_op<Scalar,T> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_sum_op<typename internal::traits<Derived>::Scalar,PromotedT>, const Derived, const typename internal::plain_constant_type<Derived,PromotedT>::type>(derived(), typename internal::plain_constant_type<Derived,PromotedT>::type(derived().rows(), derived().cols(), internal::scalar_constant_op<PromotedT>(scalar))); } # 237 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template <typename T> inline friend typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_difference_op<typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_difference_op<T,Scalar> > >::value)>::type,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_difference_op<T,Scalar> > >::value)>::type>::type, const Derived> >::type (operator-)(const T& scalar, const StorageBaseType& matrix) { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_difference_op<T,Scalar> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_difference_op<PromotedT,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,PromotedT>::type, const Derived>( typename internal::plain_constant_type<Derived,PromotedT>::type(matrix.derived().rows(), matrix.derived().cols(), internal::scalar_constant_op<PromotedT>(scalar)), matrix.derived()); } template <typename T> inline typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_difference_op<typename internal::traits<Derived>::Scalar,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_difference_op<Scalar,T> > >::value)>::type>, const Derived, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_difference_op<Scalar,T> > >::value)>::type>::type> >::type (operator-)(const T& scalar) const { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,T,Eigen::internal::scalar_difference_op<Scalar,T> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_difference_op<typename internal::traits<Derived>::Scalar,PromotedT>, const Derived, const typename internal::plain_constant_type<Derived,PromotedT>::type>(derived(), typename internal::plain_constant_type<Derived,PromotedT>::type(derived().rows(), derived().cols(), internal::scalar_constant_op<PromotedT>(scalar))); } # 260 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template <typename T> inline friend typename internal::enable_if<true,const CwiseBinaryOp<internal::scalar_quotient_op<typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_quotient_op<T,Scalar> > >::value)>::type,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,typename internal::promote_scalar_arg<Scalar , T , (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_quotient_op<T,Scalar> > >::value)>::type>::type, const Derived> >::type (operator/)(const T& scalar, const StorageBaseType& matrix) { typedef typename internal::promote_scalar_arg<Scalar,T,(Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<T,Scalar,Eigen::internal::scalar_quotient_op<T,Scalar> > >::value)>::type PromotedT; return CwiseBinaryOp<internal::scalar_quotient_op<PromotedT,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,PromotedT>::type, const Derived>( typename internal::plain_constant_type<Derived,PromotedT>::type(matrix.derived().rows(), matrix.derived().cols(), internal::scalar_constant_op<PromotedT>(scalar)), matrix.derived()); } # 281 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename OtherDerived> inline const CwiseBinaryOp<internal::scalar_boolean_xor_op, const Derived, const OtherDerived> operator^(const Eigen::ArrayBase<OtherDerived> &other) const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<bool,Scalar>::value && internal::is_same<bool,typename OtherDerived::Scalar>::value))>::THIS_METHOD_IS_ONLY_FOR_EXPRESSIONS_OF_BOOL) {} ; return CwiseBinaryOp<internal::scalar_boolean_xor_op, const Derived, const OtherDerived>(derived(),other.derived()); } # 327 "eigen-3.3.7/Eigen/src/Core/../plugins/ArrayCwiseBinaryOps.h" template<typename DerivedQ> inline const CwiseBinaryOp<internal::scalar_zeta_op<Scalar>, const Derived, const DerivedQ> zeta(const Eigen::ArrayBase<DerivedQ> &q) const { return CwiseBinaryOp<internal::scalar_zeta_op<Scalar>, const Derived, const DerivedQ>(this->derived(), q.derived()); } # 97 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" 2 # 106 "eigen-3.3.7/Eigen/src/Core/ArrayBase.h" inline Derived& operator=(const ArrayBase& other) { internal::call_assignment(derived(), other.derived()); return derived(); } inline Derived& operator=(const Scalar &value) { Base::setConstant(value); return derived(); } inline Derived& operator+=(const Scalar& scalar); inline Derived& operator-=(const Scalar& scalar); template<typename OtherDerived> inline Derived& operator+=(const ArrayBase<OtherDerived>& other); template<typename OtherDerived> inline Derived& operator-=(const ArrayBase<OtherDerived>& other); template<typename OtherDerived> inline Derived& operator*=(const ArrayBase<OtherDerived>& other); template<typename OtherDerived> inline Derived& operator/=(const ArrayBase<OtherDerived>& other); public: ArrayBase<Derived>& array() { return *this; } const ArrayBase<Derived>& array() const { return *this; } MatrixWrapper<Derived> matrix() { return MatrixWrapper<Derived>(derived()); } const MatrixWrapper<const Derived> matrix() const { return MatrixWrapper<const Derived>(derived()); } protected: ArrayBase() : Base() {} private: explicit ArrayBase(Index); ArrayBase(Index,Index); template<typename OtherDerived> explicit ArrayBase(const ArrayBase<OtherDerived>&); protected: template<typename OtherDerived> Derived& operator+=(const MatrixBase<OtherDerived>& ) {if (Eigen::internal::static_assertion<static_cast<bool>(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1)>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {}; return *this;} template<typename OtherDerived> Derived& operator-=(const MatrixBase<OtherDerived>& ) {if (Eigen::internal::static_assertion<static_cast<bool>(std::ptrdiff_t(sizeof(typename OtherDerived::Scalar))==-1)>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {}; return *this;} }; template<typename Derived> template<typename OtherDerived> inline Derived & ArrayBase<Derived>::operator-=(const ArrayBase<OtherDerived> &other) { call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } template<typename Derived> template<typename OtherDerived> inline Derived & ArrayBase<Derived>::operator+=(const ArrayBase<OtherDerived>& other) { call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } template<typename Derived> template<typename OtherDerived> inline Derived & ArrayBase<Derived>::operator*=(const ArrayBase<OtherDerived>& other) { call_assignment(derived(), other.derived(), internal::mul_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } template<typename Derived> template<typename OtherDerived> inline Derived & ArrayBase<Derived>::operator/=(const ArrayBase<OtherDerived>& other) { call_assignment(derived(), other.derived(), internal::div_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } } # 449 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/BlasUtil.h" 1 # 16 "eigen-3.3.7/Eigen/src/Core/util/BlasUtil.h" namespace Eigen { namespace internal { template<typename LhsScalar, typename RhsScalar, typename Index, typename DataMapper, int mr, int nr, bool ConjugateLhs=false, bool ConjugateRhs=false> struct gebp_kernel; template<typename Scalar, typename Index, typename DataMapper, int nr, int StorageOrder, bool Conjugate = false, bool PanelMode=false> struct gemm_pack_rhs; template<typename Scalar, typename Index, typename DataMapper, int Pack1, int Pack2, int StorageOrder, bool Conjugate = false, bool PanelMode = false> struct gemm_pack_lhs; template< typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int ResStorageOrder> struct general_matrix_matrix_product; template<typename Index, typename LhsScalar, typename LhsMapper, int LhsStorageOrder, bool ConjugateLhs, typename RhsScalar, typename RhsMapper, bool ConjugateRhs, int Version=Specialized> struct general_matrix_vector_product; template<bool Conjugate> struct conj_if; template<> struct conj_if<true> { template<typename T> inline T operator()(const T& x) const { return numext::conj(x); } template<typename T> inline T pconj(const T& x) const { return internal::pconj(x); } }; template<> struct conj_if<false> { template<typename T> inline const T& operator()(const T& x) const { return x; } template<typename T> inline const T& pconj(const T& x) const { return x; } }; template<typename LhsScalar, typename RhsScalar, bool ConjLhs, bool ConjRhs> struct conj_helper { typedef typename ScalarBinaryOpTraits<LhsScalar,RhsScalar>::ReturnType Scalar; inline Scalar pmadd(const LhsScalar& x, const RhsScalar& y, const Scalar& c) const { return padd(c, pmul(x,y)); } inline Scalar pmul(const LhsScalar& x, const RhsScalar& y) const { return conj_if<ConjLhs>()(x) * conj_if<ConjRhs>()(y); } }; template<typename Scalar> struct conj_helper<Scalar,Scalar,false,false> { inline Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const { return internal::pmadd(x,y,c); } inline Scalar pmul(const Scalar& x, const Scalar& y) const { return internal::pmul(x,y); } }; template<typename RealScalar> struct conj_helper<std::complex<RealScalar>, std::complex<RealScalar>, false,true> { typedef std::complex<RealScalar> Scalar; inline Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const { return c + pmul(x,y); } inline Scalar pmul(const Scalar& x, const Scalar& y) const { return Scalar(numext::real(x)*numext::real(y) + numext::imag(x)*numext::imag(y), numext::imag(x)*numext::real(y) - numext::real(x)*numext::imag(y)); } }; template<typename RealScalar> struct conj_helper<std::complex<RealScalar>, std::complex<RealScalar>, true,false> { typedef std::complex<RealScalar> Scalar; inline Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const { return c + pmul(x,y); } inline Scalar pmul(const Scalar& x, const Scalar& y) const { return Scalar(numext::real(x)*numext::real(y) + numext::imag(x)*numext::imag(y), numext::real(x)*numext::imag(y) - numext::imag(x)*numext::real(y)); } }; template<typename RealScalar> struct conj_helper<std::complex<RealScalar>, std::complex<RealScalar>, true,true> { typedef std::complex<RealScalar> Scalar; inline Scalar pmadd(const Scalar& x, const Scalar& y, const Scalar& c) const { return c + pmul(x,y); } inline Scalar pmul(const Scalar& x, const Scalar& y) const { return Scalar(numext::real(x)*numext::real(y) - numext::imag(x)*numext::imag(y), - numext::real(x)*numext::imag(y) - numext::imag(x)*numext::real(y)); } }; template<typename RealScalar,bool Conj> struct conj_helper<std::complex<RealScalar>, RealScalar, Conj,false> { typedef std::complex<RealScalar> Scalar; inline Scalar pmadd(const Scalar& x, const RealScalar& y, const Scalar& c) const { return padd(c, pmul(x,y)); } inline Scalar pmul(const Scalar& x, const RealScalar& y) const { return conj_if<Conj>()(x)*y; } }; template<typename RealScalar,bool Conj> struct conj_helper<RealScalar, std::complex<RealScalar>, false,Conj> { typedef std::complex<RealScalar> Scalar; inline Scalar pmadd(const RealScalar& x, const Scalar& y, const Scalar& c) const { return padd(c, pmul(x,y)); } inline Scalar pmul(const RealScalar& x, const Scalar& y) const { return x*conj_if<Conj>()(y); } }; template<typename From,typename To> struct get_factor { static inline To run(const From& x) { return To(x); } }; template<typename Scalar> struct get_factor<Scalar,typename NumTraits<Scalar>::Real> { static inline typename NumTraits<Scalar>::Real run(const Scalar& x) { return numext::real(x); } }; template<typename Scalar, typename Index> class BlasVectorMapper { public: __attribute__((always_inline)) inline BlasVectorMapper(Scalar *data) : m_data(data) {} __attribute__((always_inline)) inline Scalar operator()(Index i) const { return m_data[i]; } template <typename Packet, int AlignmentType> __attribute__((always_inline)) inline Packet load(Index i) const { return ploadt<Packet, AlignmentType>(m_data + i); } template <typename Packet> bool aligned(Index i) const { return (UIntPtr(m_data+i)%sizeof(Packet))==0; } protected: Scalar* m_data; }; template<typename Scalar, typename Index, int AlignmentType> class BlasLinearMapper { public: typedef typename packet_traits<Scalar>::type Packet; typedef typename packet_traits<Scalar>::half HalfPacket; __attribute__((always_inline)) inline BlasLinearMapper(Scalar *data) : m_data(data) {} __attribute__((always_inline)) inline void prefetch(int i) const { internal::prefetch(&operator()(i)); } __attribute__((always_inline)) inline Scalar& operator()(Index i) const { return m_data[i]; } __attribute__((always_inline)) inline Packet loadPacket(Index i) const { return ploadt<Packet, AlignmentType>(m_data + i); } __attribute__((always_inline)) inline HalfPacket loadHalfPacket(Index i) const { return ploadt<HalfPacket, AlignmentType>(m_data + i); } __attribute__((always_inline)) inline void storePacket(Index i, const Packet &p) const { pstoret<Scalar, Packet, AlignmentType>(m_data + i, p); } protected: Scalar *m_data; }; template<typename Scalar, typename Index, int StorageOrder, int AlignmentType = Unaligned> class blas_data_mapper { public: typedef typename packet_traits<Scalar>::type Packet; typedef typename packet_traits<Scalar>::half HalfPacket; typedef BlasLinearMapper<Scalar, Index, AlignmentType> LinearMapper; typedef BlasVectorMapper<Scalar, Index> VectorMapper; __attribute__((always_inline)) inline blas_data_mapper(Scalar* data, Index stride) : m_data(data), m_stride(stride) {} __attribute__((always_inline)) inline blas_data_mapper<Scalar, Index, StorageOrder, AlignmentType> getSubMapper(Index i, Index j) const { return blas_data_mapper<Scalar, Index, StorageOrder, AlignmentType>(&operator()(i, j), m_stride); } __attribute__((always_inline)) inline LinearMapper getLinearMapper(Index i, Index j) const { return LinearMapper(&operator()(i, j)); } __attribute__((always_inline)) inline VectorMapper getVectorMapper(Index i, Index j) const { return VectorMapper(&operator()(i, j)); } __attribute__((always_inline)) inline Scalar& operator()(Index i, Index j) const { return m_data[StorageOrder==RowMajor ? j + i*m_stride : i + j*m_stride]; } __attribute__((always_inline)) inline Packet loadPacket(Index i, Index j) const { return ploadt<Packet, AlignmentType>(&operator()(i, j)); } __attribute__((always_inline)) inline HalfPacket loadHalfPacket(Index i, Index j) const { return ploadt<HalfPacket, AlignmentType>(&operator()(i, j)); } template<typename SubPacket> __attribute__((always_inline)) inline void scatterPacket(Index i, Index j, const SubPacket &p) const { pscatter<Scalar, SubPacket>(&operator()(i, j), p, m_stride); } template<typename SubPacket> __attribute__((always_inline)) inline SubPacket gatherPacket(Index i, Index j) const { return pgather<Scalar, SubPacket>(&operator()(i, j), m_stride); } const Index stride() const { return m_stride; } const Scalar* data() const { return m_data; } Index firstAligned(Index size) const { if (UIntPtr(m_data)%sizeof(Scalar)) { return -1; } return internal::first_default_aligned(m_data, size); } protected: Scalar* __restrict m_data; const Index m_stride; }; template<typename Scalar, typename Index, int StorageOrder> class const_blas_data_mapper : public blas_data_mapper<const Scalar, Index, StorageOrder> { public: __attribute__((always_inline)) inline const_blas_data_mapper(const Scalar *data, Index stride) : blas_data_mapper<const Scalar, Index, StorageOrder>(data, stride) {} __attribute__((always_inline)) inline const_blas_data_mapper<Scalar, Index, StorageOrder> getSubMapper(Index i, Index j) const { return const_blas_data_mapper<Scalar, Index, StorageOrder>(&(this->operator()(i, j)), this->m_stride); } }; template<typename XprType> struct blas_traits { typedef typename traits<XprType>::Scalar Scalar; typedef const XprType& ExtractType; typedef XprType _ExtractType; enum { IsComplex = NumTraits<Scalar>::IsComplex, IsTransposed = false, NeedToConjugate = false, HasUsableDirectAccess = ( (int(XprType::Flags)&DirectAccessBit) && ( bool(XprType::IsVectorAtCompileTime) || int(inner_stride_at_compile_time<XprType>::ret) == 1) ) ? 1 : 0 }; typedef typename conditional<bool(HasUsableDirectAccess), ExtractType, typename _ExtractType::PlainObject >::type DirectLinearAccessType; static inline ExtractType extract(const XprType& x) { return x; } static inline const Scalar extractScalarFactor(const XprType&) { return Scalar(1); } }; template<typename Scalar, typename NestedXpr> struct blas_traits<CwiseUnaryOp<scalar_conjugate_op<Scalar>, NestedXpr> > : blas_traits<NestedXpr> { typedef blas_traits<NestedXpr> Base; typedef CwiseUnaryOp<scalar_conjugate_op<Scalar>, NestedXpr> XprType; typedef typename Base::ExtractType ExtractType; enum { IsComplex = NumTraits<Scalar>::IsComplex, NeedToConjugate = Base::NeedToConjugate ? 0 : IsComplex }; static inline ExtractType extract(const XprType& x) { return Base::extract(x.nestedExpression()); } static inline Scalar extractScalarFactor(const XprType& x) { return conj(Base::extractScalarFactor(x.nestedExpression())); } }; template<typename Scalar, typename NestedXpr, typename Plain> struct blas_traits<CwiseBinaryOp<scalar_product_op<Scalar>, const CwiseNullaryOp<scalar_constant_op<Scalar>,Plain>, NestedXpr> > : blas_traits<NestedXpr> { typedef blas_traits<NestedXpr> Base; typedef CwiseBinaryOp<scalar_product_op<Scalar>, const CwiseNullaryOp<scalar_constant_op<Scalar>,Plain>, NestedXpr> XprType; typedef typename Base::ExtractType ExtractType; static inline ExtractType extract(const XprType& x) { return Base::extract(x.rhs()); } static inline Scalar extractScalarFactor(const XprType& x) { return x.lhs().functor().m_other * Base::extractScalarFactor(x.rhs()); } }; template<typename Scalar, typename NestedXpr, typename Plain> struct blas_traits<CwiseBinaryOp<scalar_product_op<Scalar>, NestedXpr, const CwiseNullaryOp<scalar_constant_op<Scalar>,Plain> > > : blas_traits<NestedXpr> { typedef blas_traits<NestedXpr> Base; typedef CwiseBinaryOp<scalar_product_op<Scalar>, NestedXpr, const CwiseNullaryOp<scalar_constant_op<Scalar>,Plain> > XprType; typedef typename Base::ExtractType ExtractType; static inline ExtractType extract(const XprType& x) { return Base::extract(x.lhs()); } static inline Scalar extractScalarFactor(const XprType& x) { return Base::extractScalarFactor(x.lhs()) * x.rhs().functor().m_other; } }; template<typename Scalar, typename Plain1, typename Plain2> struct blas_traits<CwiseBinaryOp<scalar_product_op<Scalar>, const CwiseNullaryOp<scalar_constant_op<Scalar>,Plain1>, const CwiseNullaryOp<scalar_constant_op<Scalar>,Plain2> > > : blas_traits<CwiseNullaryOp<scalar_constant_op<Scalar>,Plain1> > {}; template<typename Scalar, typename NestedXpr> struct blas_traits<CwiseUnaryOp<scalar_opposite_op<Scalar>, NestedXpr> > : blas_traits<NestedXpr> { typedef blas_traits<NestedXpr> Base; typedef CwiseUnaryOp<scalar_opposite_op<Scalar>, NestedXpr> XprType; typedef typename Base::ExtractType ExtractType; static inline ExtractType extract(const XprType& x) { return Base::extract(x.nestedExpression()); } static inline Scalar extractScalarFactor(const XprType& x) { return - Base::extractScalarFactor(x.nestedExpression()); } }; template<typename NestedXpr> struct blas_traits<Transpose<NestedXpr> > : blas_traits<NestedXpr> { typedef typename NestedXpr::Scalar Scalar; typedef blas_traits<NestedXpr> Base; typedef Transpose<NestedXpr> XprType; typedef Transpose<const typename Base::_ExtractType> ExtractType; typedef Transpose<const typename Base::_ExtractType> _ExtractType; typedef typename conditional<bool(Base::HasUsableDirectAccess), ExtractType, typename ExtractType::PlainObject >::type DirectLinearAccessType; enum { IsTransposed = Base::IsTransposed ? 0 : 1 }; static inline ExtractType extract(const XprType& x) { return ExtractType(Base::extract(x.nestedExpression())); } static inline Scalar extractScalarFactor(const XprType& x) { return Base::extractScalarFactor(x.nestedExpression()); } }; template<typename T> struct blas_traits<const T> : blas_traits<T> {}; template<typename T, bool HasUsableDirectAccess=blas_traits<T>::HasUsableDirectAccess> struct extract_data_selector { static const typename T::Scalar* run(const T& m) { return blas_traits<T>::extract(m).data(); } }; template<typename T> struct extract_data_selector<T,false> { static typename T::Scalar* run(const T&) { return 0; } }; template<typename T> const typename T::Scalar* extract_data(const T& m) { return extract_data_selector<T>::run(m); } } } # 450 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/DenseStorage.h" 1 # 21 "eigen-3.3.7/Eigen/src/Core/DenseStorage.h" namespace Eigen { namespace internal { struct constructor_without_unaligned_array_assert {}; template<typename T, int Size> void check_static_allocation_size() { if (Eigen::internal::static_assertion<static_cast<bool>(Size * sizeof(T) <= 131072)>::OBJECT_ALLOCATED_ON_STACK_IS_TOO_BIG) {}; } template <typename T, int Size, int MatrixOrArrayOptions, int Alignment = (MatrixOrArrayOptions&DontAlign) ? 0 : compute_default_alignment<T,Size>::value > struct plain_array { T array[Size]; plain_array() { check_static_allocation_size<T,Size>(); } plain_array(constructor_without_unaligned_array_assert) { check_static_allocation_size<T,Size>(); } }; template<typename PtrType> __attribute__((always_inline)) inline PtrType eigen_unaligned_array_assert_workaround_gcc47(PtrType array) { return array; } # 82 "eigen-3.3.7/Eigen/src/Core/DenseStorage.h" template <typename T, int Size, int MatrixOrArrayOptions> struct plain_array<T, Size, MatrixOrArrayOptions, 8> { __attribute__((aligned(8))) T array[Size]; plain_array() { (((internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (7)) == 0 && "this assertion is explained here: " "http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html" " **** READ THIS WEB PAGE !!! ****") ? static_cast<void> (0) : __assert_fail ("(internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (7)) == 0 && \"this assertion is explained here: \" \"http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html\" \" **** READ THIS WEB PAGE !!! ****\"", "eigen-3.3.7/Eigen/src/Core/DenseStorage.h", 90, __PRETTY_FUNCTION__));; check_static_allocation_size<T,Size>(); } plain_array(constructor_without_unaligned_array_assert) { check_static_allocation_size<T,Size>(); } }; template <typename T, int Size, int MatrixOrArrayOptions> struct plain_array<T, Size, MatrixOrArrayOptions, 16> { __attribute__((aligned(16))) T array[Size]; plain_array() { (((internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (15)) == 0 && "this assertion is explained here: " "http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html" " **** READ THIS WEB PAGE !!! ****") ? static_cast<void> (0) : __assert_fail ("(internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (15)) == 0 && \"this assertion is explained here: \" \"http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html\" \" **** READ THIS WEB PAGE !!! ****\"", "eigen-3.3.7/Eigen/src/Core/DenseStorage.h", 109, __PRETTY_FUNCTION__));; check_static_allocation_size<T,Size>(); } plain_array(constructor_without_unaligned_array_assert) { check_static_allocation_size<T,Size>(); } }; template <typename T, int Size, int MatrixOrArrayOptions> struct plain_array<T, Size, MatrixOrArrayOptions, 32> { __attribute__((aligned(32))) T array[Size]; plain_array() { (((internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (31)) == 0 && "this assertion is explained here: " "http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html" " **** READ THIS WEB PAGE !!! ****") ? static_cast<void> (0) : __assert_fail ("(internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (31)) == 0 && \"this assertion is explained here: \" \"http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html\" \" **** READ THIS WEB PAGE !!! ****\"", "eigen-3.3.7/Eigen/src/Core/DenseStorage.h", 128, __PRETTY_FUNCTION__));; check_static_allocation_size<T,Size>(); } plain_array(constructor_without_unaligned_array_assert) { check_static_allocation_size<T,Size>(); } }; template <typename T, int Size, int MatrixOrArrayOptions> struct plain_array<T, Size, MatrixOrArrayOptions, 64> { __attribute__((aligned(64))) T array[Size]; plain_array() { (((internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (63)) == 0 && "this assertion is explained here: " "http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html" " **** READ THIS WEB PAGE !!! ****") ? static_cast<void> (0) : __assert_fail ("(internal::UIntPtr(eigen_unaligned_array_assert_workaround_gcc47(array)) & (63)) == 0 && \"this assertion is explained here: \" \"http://eigen.tuxfamily.org/dox-devel/group__TopicUnalignedArrayAssert.html\" \" **** READ THIS WEB PAGE !!! ****\"", "eigen-3.3.7/Eigen/src/Core/DenseStorage.h", 147, __PRETTY_FUNCTION__));; check_static_allocation_size<T,Size>(); } plain_array(constructor_without_unaligned_array_assert) { check_static_allocation_size<T,Size>(); } }; template <typename T, int MatrixOrArrayOptions, int Alignment> struct plain_array<T, 0, MatrixOrArrayOptions, Alignment> { T array[1]; plain_array() {} plain_array(constructor_without_unaligned_array_assert) {} }; } # 180 "eigen-3.3.7/Eigen/src/Core/DenseStorage.h" template<typename T, int Size, int _Rows, int _Cols, int _Options> class DenseStorage; template<typename T, int Size, int _Rows, int _Cols, int _Options> class DenseStorage { internal::plain_array<T,Size,_Options> m_data; public: DenseStorage() { } explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(internal::constructor_without_unaligned_array_assert()) {} DenseStorage(const DenseStorage& other) : m_data(other.m_data) { } DenseStorage& operator=(const DenseStorage& other) { if (this != &other) m_data = other.m_data; return *this; } DenseStorage(Index size, Index rows, Index cols) { ; Eigen::internal::ignore_unused_variable(size);; Eigen::internal::ignore_unused_variable(rows);; Eigen::internal::ignore_unused_variable(cols);; } void swap(DenseStorage& other) { std::swap(m_data,other.m_data); } static Index rows(void) {return _Rows;} static Index cols(void) {return _Cols;} void conservativeResize(Index,Index,Index) {} void resize(Index,Index,Index) {} const T *data() const { return m_data.array; } T *data() { return m_data.array; } }; template<typename T, int _Rows, int _Cols, int _Options> class DenseStorage<T, 0, _Rows, _Cols, _Options> { public: DenseStorage() {} explicit DenseStorage(internal::constructor_without_unaligned_array_assert) {} DenseStorage(const DenseStorage&) {} DenseStorage& operator=(const DenseStorage&) { return *this; } DenseStorage(Index,Index,Index) {} void swap(DenseStorage& ) {} static Index rows(void) {return _Rows;} static Index cols(void) {return _Cols;} void conservativeResize(Index,Index,Index) {} void resize(Index,Index,Index) {} const T *data() const { return 0; } T *data() { return 0; } }; template<typename T, int _Options> class DenseStorage<T, 0, Dynamic, Dynamic, _Options> : public DenseStorage<T, 0, 0, 0, _Options> { }; template<typename T, int _Rows, int _Options> class DenseStorage<T, 0, _Rows, Dynamic, _Options> : public DenseStorage<T, 0, 0, 0, _Options> { }; template<typename T, int _Cols, int _Options> class DenseStorage<T, 0, Dynamic, _Cols, _Options> : public DenseStorage<T, 0, 0, 0, _Options> { }; template<typename T, int Size, int _Options> class DenseStorage<T, Size, Dynamic, Dynamic, _Options> { internal::plain_array<T,Size,_Options> m_data; Index m_rows; Index m_cols; public: DenseStorage() : m_rows(0), m_cols(0) {} explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(internal::constructor_without_unaligned_array_assert()), m_rows(0), m_cols(0) {} DenseStorage(const DenseStorage& other) : m_data(other.m_data), m_rows(other.m_rows), m_cols(other.m_cols) {} DenseStorage& operator=(const DenseStorage& other) { if (this != &other) { m_data = other.m_data; m_rows = other.m_rows; m_cols = other.m_cols; } return *this; } DenseStorage(Index, Index rows, Index cols) : m_rows(rows), m_cols(cols) {} void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); std::swap(m_cols,other.m_cols); } Index rows() const {return m_rows;} Index cols() const {return m_cols;} void conservativeResize(Index, Index rows, Index cols) { m_rows = rows; m_cols = cols; } void resize(Index, Index rows, Index cols) { m_rows = rows; m_cols = cols; } const T *data() const { return m_data.array; } T *data() { return m_data.array; } }; template<typename T, int Size, int _Cols, int _Options> class DenseStorage<T, Size, Dynamic, _Cols, _Options> { internal::plain_array<T,Size,_Options> m_data; Index m_rows; public: DenseStorage() : m_rows(0) {} explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(internal::constructor_without_unaligned_array_assert()), m_rows(0) {} DenseStorage(const DenseStorage& other) : m_data(other.m_data), m_rows(other.m_rows) {} DenseStorage& operator=(const DenseStorage& other) { if (this != &other) { m_data = other.m_data; m_rows = other.m_rows; } return *this; } DenseStorage(Index, Index rows, Index) : m_rows(rows) {} void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); } Index rows(void) const {return m_rows;} Index cols(void) const {return _Cols;} void conservativeResize(Index, Index rows, Index) { m_rows = rows; } void resize(Index, Index rows, Index) { m_rows = rows; } const T *data() const { return m_data.array; } T *data() { return m_data.array; } }; template<typename T, int Size, int _Rows, int _Options> class DenseStorage<T, Size, _Rows, Dynamic, _Options> { internal::plain_array<T,Size,_Options> m_data; Index m_cols; public: DenseStorage() : m_cols(0) {} explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(internal::constructor_without_unaligned_array_assert()), m_cols(0) {} DenseStorage(const DenseStorage& other) : m_data(other.m_data), m_cols(other.m_cols) {} DenseStorage& operator=(const DenseStorage& other) { if (this != &other) { m_data = other.m_data; m_cols = other.m_cols; } return *this; } DenseStorage(Index, Index, Index cols) : m_cols(cols) {} void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_cols,other.m_cols); } Index rows(void) const {return _Rows;} Index cols(void) const {return m_cols;} void conservativeResize(Index, Index, Index cols) { m_cols = cols; } void resize(Index, Index, Index cols) { m_cols = cols; } const T *data() const { return m_data.array; } T *data() { return m_data.array; } }; template<typename T, int _Options> class DenseStorage<T, Dynamic, Dynamic, Dynamic, _Options> { T *m_data; Index m_rows; Index m_cols; public: DenseStorage() : m_data(0), m_rows(0), m_cols(0) {} explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(0), m_rows(0), m_cols(0) {} DenseStorage(Index size, Index rows, Index cols) : m_data(internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(size)), m_rows(rows), m_cols(cols) { ; } DenseStorage(const DenseStorage& other) : m_data(internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(other.m_rows*other.m_cols)) , m_rows(other.m_rows) , m_cols(other.m_cols) { internal::smart_copy(other.m_data, other.m_data+other.m_rows*other.m_cols, m_data); } DenseStorage& operator=(const DenseStorage& other) { if (this != &other) { DenseStorage tmp(other); this->swap(tmp); } return *this; } # 391 "eigen-3.3.7/Eigen/src/Core/DenseStorage.h" ~DenseStorage() { internal::conditional_aligned_delete_auto<T,(_Options&DontAlign)==0>(m_data, m_rows*m_cols); } void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); std::swap(m_cols,other.m_cols); } Index rows(void) const {return m_rows;} Index cols(void) const {return m_cols;} void conservativeResize(Index size, Index rows, Index cols) { m_data = internal::conditional_aligned_realloc_new_auto<T,(_Options&DontAlign)==0>(m_data, size, m_rows*m_cols); m_rows = rows; m_cols = cols; } void resize(Index size, Index rows, Index cols) { if(size != m_rows*m_cols) { internal::conditional_aligned_delete_auto<T,(_Options&DontAlign)==0>(m_data, m_rows*m_cols); if (size) m_data = internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(size); else m_data = 0; } m_rows = rows; m_cols = cols; } const T *data() const { return m_data; } T *data() { return m_data; } }; template<typename T, int _Rows, int _Options> class DenseStorage<T, Dynamic, _Rows, Dynamic, _Options> { T *m_data; Index m_cols; public: DenseStorage() : m_data(0), m_cols(0) {} explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(0), m_cols(0) {} DenseStorage(Index size, Index rows, Index cols) : m_data(internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(size)), m_cols(cols) { ; Eigen::internal::ignore_unused_variable(rows);; } DenseStorage(const DenseStorage& other) : m_data(internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(_Rows*other.m_cols)) , m_cols(other.m_cols) { internal::smart_copy(other.m_data, other.m_data+_Rows*m_cols, m_data); } DenseStorage& operator=(const DenseStorage& other) { if (this != &other) { DenseStorage tmp(other); this->swap(tmp); } return *this; } # 468 "eigen-3.3.7/Eigen/src/Core/DenseStorage.h" ~DenseStorage() { internal::conditional_aligned_delete_auto<T,(_Options&DontAlign)==0>(m_data, _Rows*m_cols); } void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_cols,other.m_cols); } static Index rows(void) {return _Rows;} Index cols(void) const {return m_cols;} void conservativeResize(Index size, Index, Index cols) { m_data = internal::conditional_aligned_realloc_new_auto<T,(_Options&DontAlign)==0>(m_data, size, _Rows*m_cols); m_cols = cols; } inline void resize(Index size, Index, Index cols) { if(size != _Rows*m_cols) { internal::conditional_aligned_delete_auto<T,(_Options&DontAlign)==0>(m_data, _Rows*m_cols); if (size) m_data = internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(size); else m_data = 0; } m_cols = cols; } const T *data() const { return m_data; } T *data() { return m_data; } }; template<typename T, int _Cols, int _Options> class DenseStorage<T, Dynamic, Dynamic, _Cols, _Options> { T *m_data; Index m_rows; public: DenseStorage() : m_data(0), m_rows(0) {} explicit DenseStorage(internal::constructor_without_unaligned_array_assert) : m_data(0), m_rows(0) {} DenseStorage(Index size, Index rows, Index cols) : m_data(internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(size)), m_rows(rows) { ; Eigen::internal::ignore_unused_variable(cols);; } DenseStorage(const DenseStorage& other) : m_data(internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(other.m_rows*_Cols)) , m_rows(other.m_rows) { internal::smart_copy(other.m_data, other.m_data+other.m_rows*_Cols, m_data); } DenseStorage& operator=(const DenseStorage& other) { if (this != &other) { DenseStorage tmp(other); this->swap(tmp); } return *this; } # 542 "eigen-3.3.7/Eigen/src/Core/DenseStorage.h" ~DenseStorage() { internal::conditional_aligned_delete_auto<T,(_Options&DontAlign)==0>(m_data, _Cols*m_rows); } void swap(DenseStorage& other) { std::swap(m_data,other.m_data); std::swap(m_rows,other.m_rows); } Index rows(void) const {return m_rows;} static Index cols(void) {return _Cols;} void conservativeResize(Index size, Index rows, Index) { m_data = internal::conditional_aligned_realloc_new_auto<T,(_Options&DontAlign)==0>(m_data, size, m_rows*_Cols); m_rows = rows; } inline void resize(Index size, Index rows, Index) { if(size != m_rows*_Cols) { internal::conditional_aligned_delete_auto<T,(_Options&DontAlign)==0>(m_data, _Cols*m_rows); if (size) m_data = internal::conditional_aligned_new_auto<T,(_Options&DontAlign)==0>(size); else m_data = 0; } m_rows = rows; } const T *data() const { return m_data; } T *data() { return m_data; } }; } # 451 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/NestByValue.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/NestByValue.h" namespace Eigen { namespace internal { template<typename ExpressionType> struct traits<NestByValue<ExpressionType> > : public traits<ExpressionType> {}; } # 34 "eigen-3.3.7/Eigen/src/Core/NestByValue.h" template<typename ExpressionType> class NestByValue : public internal::dense_xpr_base< NestByValue<ExpressionType> >::type { public: typedef typename internal::dense_xpr_base<NestByValue>::type Base; typedef typename Eigen::internal::traits<NestByValue>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<NestByValue>::type Nested; typedef typename Eigen::internal::traits<NestByValue>::StorageKind StorageKind; typedef typename Eigen::internal::traits<NestByValue>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<NestByValue>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<NestByValue>::ColsAtCompileTime, Flags = Eigen::internal::traits<NestByValue>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; explicit inline NestByValue(const ExpressionType& matrix) : m_expression(matrix) {} inline Index rows() const { return m_expression.rows(); } inline Index cols() const { return m_expression.cols(); } inline Index outerStride() const { return m_expression.outerStride(); } inline Index innerStride() const { return m_expression.innerStride(); } inline const CoeffReturnType coeff(Index row, Index col) const { return m_expression.coeff(row, col); } inline Scalar& coeffRef(Index row, Index col) { return m_expression.const_cast_derived().coeffRef(row, col); } inline const CoeffReturnType coeff(Index index) const { return m_expression.coeff(index); } inline Scalar& coeffRef(Index index) { return m_expression.const_cast_derived().coeffRef(index); } template<int LoadMode> inline const PacketScalar packet(Index row, Index col) const { return m_expression.template packet<LoadMode>(row, col); } template<int LoadMode> inline void writePacket(Index row, Index col, const PacketScalar& x) { m_expression.const_cast_derived().template writePacket<LoadMode>(row, col, x); } template<int LoadMode> inline const PacketScalar packet(Index index) const { return m_expression.template packet<LoadMode>(index); } template<int LoadMode> inline void writePacket(Index index, const PacketScalar& x) { m_expression.const_cast_derived().template writePacket<LoadMode>(index, x); } operator const ExpressionType&() const { return m_expression; } protected: const ExpressionType m_expression; }; template<typename Derived> inline const NestByValue<Derived> DenseBase<Derived>::nestByValue() const { return NestByValue<Derived>(derived()); } } # 452 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/ReturnByValue.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/ReturnByValue.h" namespace Eigen { namespace internal { template<typename Derived> struct traits<ReturnByValue<Derived> > : public traits<typename traits<Derived>::ReturnType> { enum { Flags = (traits<typename traits<Derived>::ReturnType>::Flags | EvalBeforeNestingBit) & ~DirectAccessBit }; }; # 38 "eigen-3.3.7/Eigen/src/Core/ReturnByValue.h" template<typename Derived,int n,typename PlainObject> struct nested_eval<ReturnByValue<Derived>, n, PlainObject> { typedef typename traits<Derived>::ReturnType type; }; } template<typename Derived> class ReturnByValue : public internal::dense_xpr_base< ReturnByValue<Derived> >::type, internal::no_assignment_operator { public: typedef typename internal::traits<Derived>::ReturnType ReturnType; typedef typename internal::dense_xpr_base<ReturnByValue>::type Base; typedef typename Eigen::internal::traits<ReturnByValue>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<ReturnByValue>::type Nested; typedef typename Eigen::internal::traits<ReturnByValue>::StorageKind StorageKind; typedef typename Eigen::internal::traits<ReturnByValue>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<ReturnByValue>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<ReturnByValue>::ColsAtCompileTime, Flags = Eigen::internal::traits<ReturnByValue>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; template<typename Dest> inline void evalTo(Dest& dst) const { static_cast<const Derived*>(this)->evalTo(dst); } inline Index rows() const { return static_cast<const Derived*>(this)->rows(); } inline Index cols() const { return static_cast<const Derived*>(this)->cols(); } class YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT{ YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT(const YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT&) {} YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT& operator=(const YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT&) {return *this;} }; const YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT& coeff(Index) const { return *reinterpret_cast<const YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT*>(this); } const YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT& coeff(Index,Index) const { return *reinterpret_cast<const YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT*>(this); } YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT& coeffRef(Index) { return *reinterpret_cast<YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT*>(this); } YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT& coeffRef(Index,Index) { return *reinterpret_cast<YOU_ARE_TRYING_TO_ACCESS_A_SINGLE_COEFFICIENT_IN_A_SPECIAL_EXPRESSION_WHERE_THAT_IS_NOT_ALLOWED_BECAUSE_THAT_WOULD_BE_INEFFICIENT*>(this); } }; template<typename Derived> template<typename OtherDerived> Derived& DenseBase<Derived>::operator=(const ReturnByValue<OtherDerived>& other) { other.evalTo(derived()); return derived(); } namespace internal { template<typename Derived> struct evaluator<ReturnByValue<Derived> > : public evaluator<typename internal::traits<Derived>::ReturnType> { typedef ReturnByValue<Derived> XprType; typedef typename internal::traits<Derived>::ReturnType PlainObject; typedef evaluator<PlainObject> Base; explicit evaluator(const XprType& xpr) : m_result(xpr.rows(), xpr.cols()) { ::new (static_cast<Base*>(this)) Base(m_result); xpr.evalTo(m_result); } protected: PlainObject m_result; }; } } # 456 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/NoAlias.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/NoAlias.h" namespace Eigen { # 30 "eigen-3.3.7/Eigen/src/Core/NoAlias.h" template<typename ExpressionType, template <typename> class StorageBase> class NoAlias { public: typedef typename ExpressionType::Scalar Scalar; explicit NoAlias(ExpressionType& expression) : m_expression(expression) {} template<typename OtherDerived> inline ExpressionType& operator=(const StorageBase<OtherDerived>& other) { call_assignment_no_alias(m_expression, other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>()); return m_expression; } template<typename OtherDerived> inline ExpressionType& operator+=(const StorageBase<OtherDerived>& other) { call_assignment_no_alias(m_expression, other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>()); return m_expression; } template<typename OtherDerived> inline ExpressionType& operator-=(const StorageBase<OtherDerived>& other) { call_assignment_no_alias(m_expression, other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>()); return m_expression; } ExpressionType& expression() const { return m_expression; } protected: ExpressionType& m_expression; }; # 100 "eigen-3.3.7/Eigen/src/Core/NoAlias.h" template<typename Derived> NoAlias<Derived,MatrixBase> MatrixBase<Derived>::noalias() { return NoAlias<Derived, Eigen::MatrixBase >(derived()); } } # 457 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" 1 # 25 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" namespace Eigen { namespace internal { template<int MaxSizeAtCompileTime> struct check_rows_cols_for_overflow { template<typename Index> static __attribute__((always_inline)) inline void run(Index, Index) { } }; template<> struct check_rows_cols_for_overflow<Dynamic> { template<typename Index> static __attribute__((always_inline)) inline void run(Index rows, Index cols) { Index max_index = (std::size_t(1) << (8 * sizeof(Index) - 1)) - 1; bool error = (rows == 0 || cols == 0) ? false : (rows > max_index / cols); if (error) throw_std_bad_alloc(); } }; template <typename Derived, typename OtherDerived = Derived, bool IsVector = bool(Derived::IsVectorAtCompileTime) && bool(OtherDerived::IsVectorAtCompileTime)> struct conservative_resize_like_impl; template<typename MatrixTypeA, typename MatrixTypeB, bool SwapPointers> struct matrix_swap_impl; } # 97 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" template<typename Derived> class PlainObjectBase : public internal::dense_xpr_base<Derived>::type { public: enum { Options = internal::traits<Derived>::Options }; typedef typename internal::dense_xpr_base<Derived>::type Base; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename internal::packet_traits<Scalar>::type PacketScalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef Derived DenseType; using Base::RowsAtCompileTime; using Base::ColsAtCompileTime; using Base::SizeAtCompileTime; using Base::MaxRowsAtCompileTime; using Base::MaxColsAtCompileTime; using Base::MaxSizeAtCompileTime; using Base::IsVectorAtCompileTime; using Base::Flags; template<typename PlainObjectType, int MapOptions, typename StrideType> friend class Eigen::Map; friend class Eigen::Map<Derived, Unaligned>; typedef Eigen::Map<Derived, Unaligned> MapType; friend class Eigen::Map<const Derived, Unaligned>; typedef const Eigen::Map<const Derived, Unaligned> ConstMapType; friend class Eigen::Map<Derived, AlignedMax>; friend class Eigen::Map<const Derived, AlignedMax>; typedef Eigen::Map<Derived, AlignedMax> AlignedMapType; typedef const Eigen::Map<const Derived, AlignedMax> ConstAlignedMapType; template<typename StrideType> struct StridedMapType { typedef Eigen::Map<Derived, Unaligned, StrideType> type; }; template<typename StrideType> struct StridedConstMapType { typedef Eigen::Map<const Derived, Unaligned, StrideType> type; }; template<typename StrideType> struct StridedAlignedMapType { typedef Eigen::Map<Derived, AlignedMax, StrideType> type; }; template<typename StrideType> struct StridedConstAlignedMapType { typedef Eigen::Map<const Derived, AlignedMax, StrideType> type; }; protected: DenseStorage<Scalar, Base::MaxSizeAtCompileTime, Base::RowsAtCompileTime, Base::ColsAtCompileTime, Options> m_storage; public: enum { NeedsToAlign = (SizeAtCompileTime != Dynamic) && (internal::traits<Derived>::Alignment>0) }; void *operator new(std::size_t size) { return Eigen::internal::conditional_aligned_malloc<NeedsToAlign>(size); } void *operator new[](std::size_t size) { return Eigen::internal::conditional_aligned_malloc<NeedsToAlign>(size); } void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); } void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); } void operator delete(void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); } void operator delete[](void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); } static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } void operator delete[](void * memory, void *ptr) throw() { return ::operator delete[](memory,ptr); } void* operator new(std::size_t size, const std::nothrow_t&) throw() { try { return Eigen::internal::conditional_aligned_malloc<NeedsToAlign>(size); } catch (...) { return 0; } } void operator delete(void *ptr, const std::nothrow_t&) throw() { Eigen::internal::conditional_aligned_free<NeedsToAlign>(ptr); } typedef void eigen_aligned_operator_new_marker_type; Base& base() { return *static_cast<Base*>(this); } const Base& base() const { return *static_cast<const Base*>(this); } inline Index rows() const { return m_storage.rows(); } inline Index cols() const { return m_storage.cols(); } inline const Scalar& coeff(Index rowId, Index colId) const { if(Flags & RowMajorBit) return m_storage.data()[colId + rowId * m_storage.cols()]; else return m_storage.data()[rowId + colId * m_storage.rows()]; } inline const Scalar& coeff(Index index) const { return m_storage.data()[index]; } inline Scalar& coeffRef(Index rowId, Index colId) { if(Flags & RowMajorBit) return m_storage.data()[colId + rowId * m_storage.cols()]; else return m_storage.data()[rowId + colId * m_storage.rows()]; } inline Scalar& coeffRef(Index index) { return m_storage.data()[index]; } inline const Scalar& coeffRef(Index rowId, Index colId) const { if(Flags & RowMajorBit) return m_storage.data()[colId + rowId * m_storage.cols()]; else return m_storage.data()[rowId + colId * m_storage.rows()]; } inline const Scalar& coeffRef(Index index) const { return m_storage.data()[index]; } template<int LoadMode> inline PacketScalar packet(Index rowId, Index colId) const { return internal::ploadt<PacketScalar, LoadMode> (m_storage.data() + (Flags & RowMajorBit ? colId + rowId * m_storage.cols() : rowId + colId * m_storage.rows())); } template<int LoadMode> inline PacketScalar packet(Index index) const { return internal::ploadt<PacketScalar, LoadMode>(m_storage.data() + index); } template<int StoreMode> inline void writePacket(Index rowId, Index colId, const PacketScalar& val) { internal::pstoret<Scalar, PacketScalar, StoreMode> (m_storage.data() + (Flags & RowMajorBit ? colId + rowId * m_storage.cols() : rowId + colId * m_storage.rows()), val); } template<int StoreMode> inline void writePacket(Index index, const PacketScalar& val) { internal::pstoret<Scalar, PacketScalar, StoreMode>(m_storage.data() + index, val); } inline const Scalar *data() const { return m_storage.data(); } inline Scalar *data() { return m_storage.data(); } # 278 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void resize(Index rows, Index cols) { (((!(RowsAtCompileTime!=Dynamic) || (rows==RowsAtCompileTime)) && (!(ColsAtCompileTime!=Dynamic) || (cols==ColsAtCompileTime)) && (!(RowsAtCompileTime==Dynamic && MaxRowsAtCompileTime!=Dynamic) || (rows<=MaxRowsAtCompileTime)) && (!(ColsAtCompileTime==Dynamic && MaxColsAtCompileTime!=Dynamic) || (cols<=MaxColsAtCompileTime)) && rows>=0 && cols>=0 && "Invalid sizes when resizing a matrix or array.") ? static_cast<void> (0) : __assert_fail ("(!(RowsAtCompileTime!=Dynamic) || (rows==RowsAtCompileTime)) && (!(ColsAtCompileTime!=Dynamic) || (cols==ColsAtCompileTime)) && (!(RowsAtCompileTime==Dynamic && MaxRowsAtCompileTime!=Dynamic) || (rows<=MaxRowsAtCompileTime)) && (!(ColsAtCompileTime==Dynamic && MaxColsAtCompileTime!=Dynamic) || (cols<=MaxColsAtCompileTime)) && rows>=0 && cols>=0 && \"Invalid sizes when resizing a matrix or array.\"", "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" # 281 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" , 285 # 281 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" , __PRETTY_FUNCTION__)) ; internal::check_rows_cols_for_overflow<MaxSizeAtCompileTime>::run(rows, cols); m_storage.resize(rows*cols, rows, cols); } # 308 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void resize(Index size) { if (Eigen::internal::static_assertion<static_cast<bool>(PlainObjectBase::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} ((((SizeAtCompileTime == Dynamic && (MaxSizeAtCompileTime==Dynamic || size<=MaxSizeAtCompileTime)) || SizeAtCompileTime == size) && size>=0) ? static_cast<void> (0) : __assert_fail ("((SizeAtCompileTime == Dynamic && (MaxSizeAtCompileTime==Dynamic || size<=MaxSizeAtCompileTime)) || SizeAtCompileTime == size) && size>=0", "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h", 312, __PRETTY_FUNCTION__)); if(RowsAtCompileTime == 1) m_storage.resize(size, 1, size); else m_storage.resize(size, size, 1); } # 333 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void resize(NoChange_t, Index cols) { resize(rows(), cols); } # 347 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void resize(Index rows, NoChange_t) { resize(rows, cols()); } # 360 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" template<typename OtherDerived> inline void resizeLike(const EigenBase<OtherDerived>& _other) { const OtherDerived& other = _other.derived(); internal::check_rows_cols_for_overflow<MaxSizeAtCompileTime>::run(other.rows(), other.cols()); const Index othersize = other.rows()*other.cols(); if(RowsAtCompileTime == 1) { ((other.rows() == 1 || other.cols() == 1) ? static_cast<void> (0) : __assert_fail ("other.rows() == 1 || other.cols() == 1", "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h", 369, __PRETTY_FUNCTION__)); resize(1, othersize); } else if(ColsAtCompileTime == 1) { ((other.rows() == 1 || other.cols() == 1) ? static_cast<void> (0) : __assert_fail ("other.rows() == 1 || other.cols() == 1", "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h", 374, __PRETTY_FUNCTION__)); resize(othersize, 1); } else resize(other.rows(), other.cols()); } # 389 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void conservativeResize(Index rows, Index cols) { internal::conservative_resize_like_impl<Derived>::run(*this, rows, cols); } # 402 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void conservativeResize(Index rows, NoChange_t) { conservativeResize(rows, cols()); } # 416 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void conservativeResize(NoChange_t, Index cols) { conservativeResize(rows(), cols); } # 431 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline void conservativeResize(Index size) { internal::conservative_resize_like_impl<Derived>::run(*this, size); } # 446 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" template<typename OtherDerived> inline void conservativeResizeLike(const DenseBase<OtherDerived>& other) { internal::conservative_resize_like_impl<Derived,OtherDerived>::run(*this, other); } inline Derived& operator=(const PlainObjectBase& other) { return _set(other); } template<typename OtherDerived> inline Derived& lazyAssign(const DenseBase<OtherDerived>& other) { _resize_to_match(other); return Base::lazyAssign(other.derived()); } template<typename OtherDerived> inline Derived& operator=(const ReturnByValue<OtherDerived>& func) { resize(func.rows(), func.cols()); return Base::operator=(func); } protected: inline PlainObjectBase() : m_storage() { } explicit PlainObjectBase(internal::constructor_without_unaligned_array_assert) : m_storage(internal::constructor_without_unaligned_array_assert()) { } # 518 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" inline PlainObjectBase(const PlainObjectBase& other) : Base(), m_storage(other.m_storage) { } inline PlainObjectBase(Index size, Index rows, Index cols) : m_storage(size, rows, cols) { } template<typename OtherDerived> inline PlainObjectBase(const DenseBase<OtherDerived> &other) : m_storage() { _check_template_params(); resizeLike(other); _set_noalias(other); } template<typename OtherDerived> inline PlainObjectBase(const EigenBase<OtherDerived> &other) : m_storage() { _check_template_params(); resizeLike(other); *this = other.derived(); } template<typename OtherDerived> inline PlainObjectBase(const ReturnByValue<OtherDerived>& other) { _check_template_params(); resize(other.rows(), other.cols()); other.evalTo(this->derived()); } public: template<typename OtherDerived> inline Derived& operator=(const EigenBase<OtherDerived> &other) { _resize_to_match(other); Base::operator=(other.derived()); return this->derived(); } # 587 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" static inline ConstMapType Map(const Scalar* data) { return ConstMapType(data); } static inline MapType Map(Scalar* data) { return MapType(data); } static inline ConstMapType Map(const Scalar* data, Index size) { return ConstMapType(data, size); } static inline MapType Map(Scalar* data, Index size) { return MapType(data, size); } static inline ConstMapType Map(const Scalar* data, Index rows, Index cols) { return ConstMapType(data, rows, cols); } static inline MapType Map(Scalar* data, Index rows, Index cols) { return MapType(data, rows, cols); } static inline ConstAlignedMapType MapAligned(const Scalar* data) { return ConstAlignedMapType(data); } static inline AlignedMapType MapAligned(Scalar* data) { return AlignedMapType(data); } static inline ConstAlignedMapType MapAligned(const Scalar* data, Index size) { return ConstAlignedMapType(data, size); } static inline AlignedMapType MapAligned(Scalar* data, Index size) { return AlignedMapType(data, size); } static inline ConstAlignedMapType MapAligned(const Scalar* data, Index rows, Index cols) { return ConstAlignedMapType(data, rows, cols); } static inline AlignedMapType MapAligned(Scalar* data, Index rows, Index cols) { return AlignedMapType(data, rows, cols); } template<int Outer, int Inner> static inline typename StridedConstMapType<Stride<Outer, Inner> >::type Map(const Scalar* data, const Stride<Outer, Inner>& stride) { return typename StridedConstMapType<Stride<Outer, Inner> >::type(data, stride); } template<int Outer, int Inner> static inline typename StridedMapType<Stride<Outer, Inner> >::type Map(Scalar* data, const Stride<Outer, Inner>& stride) { return typename StridedMapType<Stride<Outer, Inner> >::type(data, stride); } template<int Outer, int Inner> static inline typename StridedConstMapType<Stride<Outer, Inner> >::type Map(const Scalar* data, Index size, const Stride<Outer, Inner>& stride) { return typename StridedConstMapType<Stride<Outer, Inner> >::type(data, size, stride); } template<int Outer, int Inner> static inline typename StridedMapType<Stride<Outer, Inner> >::type Map(Scalar* data, Index size, const Stride<Outer, Inner>& stride) { return typename StridedMapType<Stride<Outer, Inner> >::type(data, size, stride); } template<int Outer, int Inner> static inline typename StridedConstMapType<Stride<Outer, Inner> >::type Map(const Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) { return typename StridedConstMapType<Stride<Outer, Inner> >::type(data, rows, cols, stride); } template<int Outer, int Inner> static inline typename StridedMapType<Stride<Outer, Inner> >::type Map(Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) { return typename StridedMapType<Stride<Outer, Inner> >::type(data, rows, cols, stride); } template<int Outer, int Inner> static inline typename StridedConstAlignedMapType<Stride<Outer, Inner> >::type MapAligned(const Scalar* data, const Stride<Outer, Inner>& stride) { return typename StridedConstAlignedMapType<Stride<Outer, Inner> >::type(data, stride); } template<int Outer, int Inner> static inline typename StridedAlignedMapType<Stride<Outer, Inner> >::type MapAligned(Scalar* data, const Stride<Outer, Inner>& stride) { return typename StridedAlignedMapType<Stride<Outer, Inner> >::type(data, stride); } template<int Outer, int Inner> static inline typename StridedConstAlignedMapType<Stride<Outer, Inner> >::type MapAligned(const Scalar* data, Index size, const Stride<Outer, Inner>& stride) { return typename StridedConstAlignedMapType<Stride<Outer, Inner> >::type(data, size, stride); } template<int Outer, int Inner> static inline typename StridedAlignedMapType<Stride<Outer, Inner> >::type MapAligned(Scalar* data, Index size, const Stride<Outer, Inner>& stride) { return typename StridedAlignedMapType<Stride<Outer, Inner> >::type(data, size, stride); } template<int Outer, int Inner> static inline typename StridedConstAlignedMapType<Stride<Outer, Inner> >::type MapAligned(const Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) { return typename StridedConstAlignedMapType<Stride<Outer, Inner> >::type(data, rows, cols, stride); } template<int Outer, int Inner> static inline typename StridedAlignedMapType<Stride<Outer, Inner> >::type MapAligned(Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) { return typename StridedAlignedMapType<Stride<Outer, Inner> >::type(data, rows, cols, stride); } using Base::setConstant; Derived& setConstant(Index size, const Scalar& val); Derived& setConstant(Index rows, Index cols, const Scalar& val); using Base::setZero; Derived& setZero(Index size); Derived& setZero(Index rows, Index cols); using Base::setOnes; Derived& setOnes(Index size); Derived& setOnes(Index rows, Index cols); using Base::setRandom; Derived& setRandom(Index size); Derived& setRandom(Index rows, Index cols); protected: template<typename OtherDerived> inline void _resize_to_match(const EigenBase<OtherDerived>& other) { resizeLike(other); } # 710 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" template<typename OtherDerived> inline Derived& _set(const DenseBase<OtherDerived>& other) { internal::call_assignment(this->derived(), other.derived()); return this->derived(); } template<typename OtherDerived> inline Derived& _set_noalias(const DenseBase<OtherDerived>& other) { internal::call_assignment_no_alias(this->derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>()); return this->derived(); } template<typename T0, typename T1> inline void _init2(Index rows, Index cols, typename internal::enable_if<Base::SizeAtCompileTime!=2,T0>::type* = 0) { if (Eigen::internal::static_assertion<static_cast<bool>(bool(NumTraits<T0>::IsInteger) && bool(NumTraits<T1>::IsInteger))>::FLOATING_POINT_ARGUMENT_PASSED__INTEGER_WAS_EXPECTED) {} resize(rows,cols); } template<typename T0, typename T1> inline void _init2(const T0& val0, const T1& val1, typename internal::enable_if<Base::SizeAtCompileTime==2,T0>::type* = 0) { if (Eigen::internal::static_assertion<static_cast<bool>(PlainObjectBase::IsVectorAtCompileTime && PlainObjectBase::SizeAtCompileTime==2)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = Scalar(val0); m_storage.data()[1] = Scalar(val1); } template<typename T0, typename T1> inline void _init2(const Index& val0, const Index& val1, typename internal::enable_if< (!internal::is_same<Index,Scalar>::value) && (internal::is_same<T0,Index>::value) && (internal::is_same<T1,Index>::value) && Base::SizeAtCompileTime==2,T1>::type* = 0) { if (Eigen::internal::static_assertion<static_cast<bool>(PlainObjectBase::IsVectorAtCompileTime && PlainObjectBase::SizeAtCompileTime==2)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = Scalar(val0); m_storage.data()[1] = Scalar(val1); } template<typename T> inline void _init1(Index size, typename internal::enable_if< (Base::SizeAtCompileTime!=1 || !internal::is_convertible<T, Scalar>::value) && ((!internal::is_same<typename internal::traits<Derived>::XprKind,ArrayXpr>::value || Base::SizeAtCompileTime==Dynamic)),T>::type* = 0) { const bool is_integer = NumTraits<T>::IsInteger; Eigen::internal::ignore_unused_variable(is_integer);; if (Eigen::internal::static_assertion<static_cast<bool>(is_integer)>::FLOATING_POINT_ARGUMENT_PASSED__INTEGER_WAS_EXPECTED) {} resize(size); } template<typename T> inline void _init1(const Scalar& val0, typename internal::enable_if<Base::SizeAtCompileTime==1 && internal::is_convertible<T, Scalar>::value,T>::type* = 0) { if (Eigen::internal::static_assertion<static_cast<bool>(PlainObjectBase::IsVectorAtCompileTime && PlainObjectBase::SizeAtCompileTime==1)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = val0; } template<typename T> inline void _init1(const Index& val0, typename internal::enable_if< (!internal::is_same<Index,Scalar>::value) && (internal::is_same<Index,T>::value) && Base::SizeAtCompileTime==1 && internal::is_convertible<T, Scalar>::value,T*>::type* = 0) { if (Eigen::internal::static_assertion<static_cast<bool>(PlainObjectBase::IsVectorAtCompileTime && PlainObjectBase::SizeAtCompileTime==1)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = Scalar(val0); } template<typename T> inline void _init1(const Scalar* data){ this->_set_noalias(ConstMapType(data)); } template<typename T, typename OtherDerived> inline void _init1(const DenseBase<OtherDerived>& other){ this->_set_noalias(other); } template<typename T> inline void _init1(const Derived& other){ this->_set_noalias(other); } template<typename T, typename OtherDerived> inline void _init1(const EigenBase<OtherDerived>& other){ this->derived() = other; } template<typename T, typename OtherDerived> inline void _init1(const ReturnByValue<OtherDerived>& other) { resize(other.rows(), other.cols()); other.evalTo(this->derived()); } template<typename T, typename OtherDerived, int ColsAtCompileTime> inline void _init1(const RotationBase<OtherDerived,ColsAtCompileTime>& r) { this->derived() = r; } template<typename T> inline void _init1(const Scalar& val0, typename internal::enable_if< Base::SizeAtCompileTime!=Dynamic && Base::SizeAtCompileTime!=1 && internal::is_convertible<T, Scalar>::value && internal::is_same<typename internal::traits<Derived>::XprKind,ArrayXpr>::value,T>::type* = 0) { Base::setConstant(val0); } template<typename T> inline void _init1(const Index& val0, typename internal::enable_if< (!internal::is_same<Index,Scalar>::value) && (internal::is_same<Index,T>::value) && Base::SizeAtCompileTime!=Dynamic && Base::SizeAtCompileTime!=1 && internal::is_convertible<T, Scalar>::value && internal::is_same<typename internal::traits<Derived>::XprKind,ArrayXpr>::value,T*>::type* = 0) { Base::setConstant(val0); } template<typename MatrixTypeA, typename MatrixTypeB, bool SwapPointers> friend struct internal::matrix_swap_impl; public: template<typename OtherDerived> void swap(DenseBase<OtherDerived> & other) { enum { SwapPointers = internal::is_same<Derived, OtherDerived>::value && Base::SizeAtCompileTime==Dynamic }; internal::matrix_swap_impl<Derived, OtherDerived, bool(SwapPointers)>::run(this->derived(), other.derived()); } template<typename OtherDerived> void swap(DenseBase<OtherDerived> const & other) { Base::swap(other.derived()); } static inline void _check_template_params() { if (Eigen::internal::static_assertion<static_cast<bool>(((!(MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1) || ((Options&RowMajor)==RowMajor)) && (!(MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1) || ((Options&RowMajor)==0)) && ((RowsAtCompileTime == Dynamic) || (RowsAtCompileTime >= 0)) && ((ColsAtCompileTime == Dynamic) || (ColsAtCompileTime >= 0)) && ((MaxRowsAtCompileTime == Dynamic) || (MaxRowsAtCompileTime >= 0)) && ((MaxColsAtCompileTime == Dynamic) || (MaxColsAtCompileTime >= 0)) && (MaxRowsAtCompileTime == RowsAtCompileTime || RowsAtCompileTime==Dynamic) && (MaxColsAtCompileTime == ColsAtCompileTime || ColsAtCompileTime==Dynamic) && (Options & (DontAlign|RowMajor)) == Options))>::INVALID_MATRIX_TEMPLATE_PARAMETERS) {} # 913 "eigen-3.3.7/Eigen/src/Core/PlainObjectBase.h" } enum { IsPlainObjectBase = 1 }; }; namespace internal { template <typename Derived, typename OtherDerived, bool IsVector> struct conservative_resize_like_impl { static void run(DenseBase<Derived>& _this, Index rows, Index cols) { if (_this.rows() == rows && _this.cols() == cols) return; if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==Eigen::Dynamic)>::YOU_CALLED_A_DYNAMIC_SIZE_METHOD_ON_A_FIXED_SIZE_MATRIX_OR_VECTOR) {} if ( ( Derived::IsRowMajor && _this.cols() == cols) || (!Derived::IsRowMajor && _this.rows() == rows) ) { internal::check_rows_cols_for_overflow<Derived::MaxSizeAtCompileTime>::run(rows, cols); _this.derived().m_storage.conservativeResize(rows*cols,rows,cols); } else { typename Derived::PlainObject tmp(rows,cols); const Index common_rows = numext::mini(rows, _this.rows()); const Index common_cols = numext::mini(cols, _this.cols()); tmp.block(0,0,common_rows,common_cols) = _this.block(0,0,common_rows,common_cols); _this.derived().swap(tmp); } } static void run(DenseBase<Derived>& _this, const DenseBase<OtherDerived>& other) { if (_this.rows() == other.rows() && _this.cols() == other.cols()) return; if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime==Eigen::Dynamic)>::YOU_CALLED_A_DYNAMIC_SIZE_METHOD_ON_A_FIXED_SIZE_MATRIX_OR_VECTOR) {} if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::SizeAtCompileTime==Eigen::Dynamic)>::YOU_CALLED_A_DYNAMIC_SIZE_METHOD_ON_A_FIXED_SIZE_MATRIX_OR_VECTOR) {} if ( ( Derived::IsRowMajor && _this.cols() == other.cols()) || (!Derived::IsRowMajor && _this.rows() == other.rows()) ) { const Index new_rows = other.rows() - _this.rows(); const Index new_cols = other.cols() - _this.cols(); _this.derived().m_storage.conservativeResize(other.size(),other.rows(),other.cols()); if (new_rows>0) _this.bottomRightCorner(new_rows, other.cols()) = other.bottomRows(new_rows); else if (new_cols>0) _this.bottomRightCorner(other.rows(), new_cols) = other.rightCols(new_cols); } else { typename Derived::PlainObject tmp(other); const Index common_rows = numext::mini(tmp.rows(), _this.rows()); const Index common_cols = numext::mini(tmp.cols(), _this.cols()); tmp.block(0,0,common_rows,common_cols) = _this.block(0,0,common_rows,common_cols); _this.derived().swap(tmp); } } }; template <typename Derived, typename OtherDerived> struct conservative_resize_like_impl<Derived,OtherDerived,true> : conservative_resize_like_impl<Derived,OtherDerived,false> { using conservative_resize_like_impl<Derived,OtherDerived,false>::run; static void run(DenseBase<Derived>& _this, Index size) { const Index new_rows = Derived::RowsAtCompileTime==1 ? 1 : size; const Index new_cols = Derived::RowsAtCompileTime==1 ? size : 1; _this.derived().m_storage.conservativeResize(size,new_rows,new_cols); } static void run(DenseBase<Derived>& _this, const DenseBase<OtherDerived>& other) { if (_this.rows() == other.rows() && _this.cols() == other.cols()) return; const Index num_new_elements = other.size() - _this.size(); const Index new_rows = Derived::RowsAtCompileTime==1 ? 1 : other.rows(); const Index new_cols = Derived::RowsAtCompileTime==1 ? other.cols() : 1; _this.derived().m_storage.conservativeResize(other.size(),new_rows,new_cols); if (num_new_elements > 0) _this.tail(num_new_elements) = other.tail(num_new_elements); } }; template<typename MatrixTypeA, typename MatrixTypeB, bool SwapPointers> struct matrix_swap_impl { static inline void run(MatrixTypeA& a, MatrixTypeB& b) { a.base().swap(b); } }; template<typename MatrixTypeA, typename MatrixTypeB> struct matrix_swap_impl<MatrixTypeA, MatrixTypeB, true> { static inline void run(MatrixTypeA& a, MatrixTypeB& b) { static_cast<typename MatrixTypeA::Base&>(a).m_storage.swap(static_cast<typename MatrixTypeB::Base&>(b).m_storage); } }; } } # 458 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Matrix.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/Matrix.h" namespace Eigen { namespace internal { template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols> struct traits<Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > { private: enum { size = internal::size_at_compile_time<_Rows,_Cols>::ret }; typedef typename find_best_packet<_Scalar,size>::type PacketScalar; enum { row_major_bit = _Options&RowMajor ? RowMajorBit : 0, is_dynamic_size_storage = _MaxRows==Dynamic || _MaxCols==Dynamic, max_size = is_dynamic_size_storage ? Dynamic : _MaxRows*_MaxCols, default_alignment = compute_default_alignment<_Scalar,max_size>::value, actual_alignment = ((_Options&DontAlign)==0) ? default_alignment : 0, required_alignment = unpacket_traits<PacketScalar>::alignment, packet_access_bit = (packet_traits<_Scalar>::Vectorizable && (1 || (actual_alignment>=required_alignment))) ? PacketAccessBit : 0 }; public: typedef _Scalar Scalar; typedef Dense StorageKind; typedef Eigen::Index StorageIndex; typedef MatrixXpr XprKind; enum { RowsAtCompileTime = _Rows, ColsAtCompileTime = _Cols, MaxRowsAtCompileTime = _MaxRows, MaxColsAtCompileTime = _MaxCols, Flags = compute_matrix_flags<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols>::ret, Options = _Options, InnerStrideAtCompileTime = 1, OuterStrideAtCompileTime = (Options&RowMajor) ? ColsAtCompileTime : RowsAtCompileTime, EvaluatorFlags = LinearAccessBit | DirectAccessBit | packet_access_bit | row_major_bit, Alignment = actual_alignment }; }; } # 177 "eigen-3.3.7/Eigen/src/Core/Matrix.h" template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols> class Matrix : public PlainObjectBase<Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > { public: typedef PlainObjectBase<Matrix> Base; enum { Options = _Options }; typedef typename Eigen::internal::traits<Matrix>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Matrix>::type Nested; typedef typename Eigen::internal::traits<Matrix>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Matrix>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Matrix>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Matrix>::ColsAtCompileTime, Flags = Eigen::internal::traits<Matrix>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; typedef typename Base::PlainObject PlainObject; using Base::base; using Base::coeffRef; # 205 "eigen-3.3.7/Eigen/src/Core/Matrix.h" inline Matrix& operator=(const Matrix& other) { return Base::_set(other); } # 221 "eigen-3.3.7/Eigen/src/Core/Matrix.h" template<typename OtherDerived> inline Matrix& operator=(const DenseBase<OtherDerived>& other) { return Base::_set(other); } template<typename OtherDerived> inline Matrix& operator=(const EigenBase<OtherDerived> &other) { return Base::operator=(other); } template<typename OtherDerived> inline Matrix& operator=(const ReturnByValue<OtherDerived>& func) { return Base::operator=(func); } # 258 "eigen-3.3.7/Eigen/src/Core/Matrix.h" inline Matrix() : Base() { Base::_check_template_params(); } explicit Matrix(internal::constructor_without_unaligned_array_assert) : Base(internal::constructor_without_unaligned_array_assert()) { Base::_check_template_params(); } # 289 "eigen-3.3.7/Eigen/src/Core/Matrix.h" template<typename T> inline explicit Matrix(const T& x) { Base::_check_template_params(); Base::template _init1<T>(x); } template<typename T0, typename T1> inline Matrix(const T0& x, const T1& y) { Base::_check_template_params(); Base::template _init2<T0,T1>(x, y); } # 344 "eigen-3.3.7/Eigen/src/Core/Matrix.h" inline Matrix(const Scalar& x, const Scalar& y, const Scalar& z) { Base::_check_template_params(); if (Eigen::internal::static_assertion<static_cast<bool>(Matrix::IsVectorAtCompileTime && Matrix::SizeAtCompileTime==3)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = x; m_storage.data()[1] = y; m_storage.data()[2] = z; } inline Matrix(const Scalar& x, const Scalar& y, const Scalar& z, const Scalar& w) { Base::_check_template_params(); if (Eigen::internal::static_assertion<static_cast<bool>(Matrix::IsVectorAtCompileTime && Matrix::SizeAtCompileTime==4)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = x; m_storage.data()[1] = y; m_storage.data()[2] = z; m_storage.data()[3] = w; } inline Matrix(const Matrix& other) : Base(other) { } template<typename OtherDerived> inline Matrix(const EigenBase<OtherDerived> &other) : Base(other.derived()) { } inline Index innerStride() const { return 1; } inline Index outerStride() const { return this->innerSize(); } template<typename OtherDerived> explicit Matrix(const RotationBase<OtherDerived,ColsAtCompileTime>& r); template<typename OtherDerived> Matrix& operator=(const RotationBase<OtherDerived,ColsAtCompileTime>& r); protected: template <typename Derived, typename OtherDerived, bool IsVector> friend struct internal::conservative_resize_like_impl; using Base::m_storage; }; # 447 "eigen-3.3.7/Eigen/src/Core/Matrix.h" typedef Matrix<int, 2, 2> Matrix2i; typedef Matrix<int, 2, 1> Vector2i; typedef Matrix<int, 1, 2> RowVector2i; typedef Matrix<int, 3, 3> Matrix3i; typedef Matrix<int, 3, 1> Vector3i; typedef Matrix<int, 1, 3> RowVector3i; typedef Matrix<int, 4, 4> Matrix4i; typedef Matrix<int, 4, 1> Vector4i; typedef Matrix<int, 1, 4> RowVector4i; typedef Matrix<int, Dynamic, Dynamic> MatrixXi; typedef Matrix<int, Dynamic, 1> VectorXi; typedef Matrix<int, 1, Dynamic> RowVectorXi; typedef Matrix<int, 2, Dynamic> Matrix2Xi; typedef Matrix<int, Dynamic, 2> MatrixX2i; typedef Matrix<int, 3, Dynamic> Matrix3Xi; typedef Matrix<int, Dynamic, 3> MatrixX3i; typedef Matrix<int, 4, Dynamic> Matrix4Xi; typedef Matrix<int, Dynamic, 4> MatrixX4i; typedef Matrix<float, 2, 2> Matrix2f; typedef Matrix<float, 2, 1> Vector2f; typedef Matrix<float, 1, 2> RowVector2f; typedef Matrix<float, 3, 3> Matrix3f; typedef Matrix<float, 3, 1> Vector3f; typedef Matrix<float, 1, 3> RowVector3f; typedef Matrix<float, 4, 4> Matrix4f; typedef Matrix<float, 4, 1> Vector4f; typedef Matrix<float, 1, 4> RowVector4f; typedef Matrix<float, Dynamic, Dynamic> MatrixXf; typedef Matrix<float, Dynamic, 1> VectorXf; typedef Matrix<float, 1, Dynamic> RowVectorXf; typedef Matrix<float, 2, Dynamic> Matrix2Xf; typedef Matrix<float, Dynamic, 2> MatrixX2f; typedef Matrix<float, 3, Dynamic> Matrix3Xf; typedef Matrix<float, Dynamic, 3> MatrixX3f; typedef Matrix<float, 4, Dynamic> Matrix4Xf; typedef Matrix<float, Dynamic, 4> MatrixX4f; typedef Matrix<double, 2, 2> Matrix2d; typedef Matrix<double, 2, 1> Vector2d; typedef Matrix<double, 1, 2> RowVector2d; typedef Matrix<double, 3, 3> Matrix3d; typedef Matrix<double, 3, 1> Vector3d; typedef Matrix<double, 1, 3> RowVector3d; typedef Matrix<double, 4, 4> Matrix4d; typedef Matrix<double, 4, 1> Vector4d; typedef Matrix<double, 1, 4> RowVector4d; typedef Matrix<double, Dynamic, Dynamic> MatrixXd; typedef Matrix<double, Dynamic, 1> VectorXd; typedef Matrix<double, 1, Dynamic> RowVectorXd; typedef Matrix<double, 2, Dynamic> Matrix2Xd; typedef Matrix<double, Dynamic, 2> MatrixX2d; typedef Matrix<double, 3, Dynamic> Matrix3Xd; typedef Matrix<double, Dynamic, 3> MatrixX3d; typedef Matrix<double, 4, Dynamic> Matrix4Xd; typedef Matrix<double, Dynamic, 4> MatrixX4d; typedef Matrix<std::complex<float>, 2, 2> Matrix2cf; typedef Matrix<std::complex<float>, 2, 1> Vector2cf; typedef Matrix<std::complex<float>, 1, 2> RowVector2cf; typedef Matrix<std::complex<float>, 3, 3> Matrix3cf; typedef Matrix<std::complex<float>, 3, 1> Vector3cf; typedef Matrix<std::complex<float>, 1, 3> RowVector3cf; typedef Matrix<std::complex<float>, 4, 4> Matrix4cf; typedef Matrix<std::complex<float>, 4, 1> Vector4cf; typedef Matrix<std::complex<float>, 1, 4> RowVector4cf; typedef Matrix<std::complex<float>, Dynamic, Dynamic> MatrixXcf; typedef Matrix<std::complex<float>, Dynamic, 1> VectorXcf; typedef Matrix<std::complex<float>, 1, Dynamic> RowVectorXcf; typedef Matrix<std::complex<float>, 2, Dynamic> Matrix2Xcf; typedef Matrix<std::complex<float>, Dynamic, 2> MatrixX2cf; typedef Matrix<std::complex<float>, 3, Dynamic> Matrix3Xcf; typedef Matrix<std::complex<float>, Dynamic, 3> MatrixX3cf; typedef Matrix<std::complex<float>, 4, Dynamic> Matrix4Xcf; typedef Matrix<std::complex<float>, Dynamic, 4> MatrixX4cf; typedef Matrix<std::complex<double>, 2, 2> Matrix2cd; typedef Matrix<std::complex<double>, 2, 1> Vector2cd; typedef Matrix<std::complex<double>, 1, 2> RowVector2cd; typedef Matrix<std::complex<double>, 3, 3> Matrix3cd; typedef Matrix<std::complex<double>, 3, 1> Vector3cd; typedef Matrix<std::complex<double>, 1, 3> RowVector3cd; typedef Matrix<std::complex<double>, 4, 4> Matrix4cd; typedef Matrix<std::complex<double>, 4, 1> Vector4cd; typedef Matrix<std::complex<double>, 1, 4> RowVector4cd; typedef Matrix<std::complex<double>, Dynamic, Dynamic> MatrixXcd; typedef Matrix<std::complex<double>, Dynamic, 1> VectorXcd; typedef Matrix<std::complex<double>, 1, Dynamic> RowVectorXcd; typedef Matrix<std::complex<double>, 2, Dynamic> Matrix2Xcd; typedef Matrix<std::complex<double>, Dynamic, 2> MatrixX2cd; typedef Matrix<std::complex<double>, 3, Dynamic> Matrix3Xcd; typedef Matrix<std::complex<double>, Dynamic, 3> MatrixX3cd; typedef Matrix<std::complex<double>, 4, Dynamic> Matrix4Xcd; typedef Matrix<std::complex<double>, Dynamic, 4> MatrixX4cd; } # 459 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Array.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Array.h" namespace Eigen { namespace internal { template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols> struct traits<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > : traits<Matrix<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > { typedef ArrayXpr XprKind; typedef ArrayBase<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > XprBase; }; } # 44 "eigen-3.3.7/Eigen/src/Core/Array.h" template<typename _Scalar, int _Rows, int _Cols, int _Options, int _MaxRows, int _MaxCols> class Array : public PlainObjectBase<Array<_Scalar, _Rows, _Cols, _Options, _MaxRows, _MaxCols> > { public: typedef PlainObjectBase<Array> Base; typedef typename Eigen::internal::traits<Array>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Array>::type Nested; typedef typename Eigen::internal::traits<Array>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Array>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Array>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Array>::ColsAtCompileTime, Flags = Eigen::internal::traits<Array>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; enum { Options = _Options }; typedef typename Base::PlainObject PlainObject; protected: template <typename Derived, typename OtherDerived, bool IsVector> friend struct internal::conservative_resize_like_impl; using Base::m_storage; public: using Base::base; using Base::coeff; using Base::coeffRef; template<typename OtherDerived> inline Array& operator=(const EigenBase<OtherDerived> &other) { return Base::operator=(other); } # 89 "eigen-3.3.7/Eigen/src/Core/Array.h" inline Array& operator=(const Scalar &value) { Base::setConstant(value); return *this; } # 105 "eigen-3.3.7/Eigen/src/Core/Array.h" template<typename OtherDerived> inline Array& operator=(const DenseBase<OtherDerived>& other) { return Base::_set(other); } inline Array& operator=(const Array& other) { return Base::_set(other); } # 131 "eigen-3.3.7/Eigen/src/Core/Array.h" inline Array() : Base() { Base::_check_template_params(); } Array(internal::constructor_without_unaligned_array_assert) : Base(internal::constructor_without_unaligned_array_assert()) { Base::_check_template_params(); } # 166 "eigen-3.3.7/Eigen/src/Core/Array.h" template<typename T> inline explicit Array(const T& x) { Base::_check_template_params(); Base::template _init1<T>(x); } template<typename T0, typename T1> inline Array(const T0& val0, const T1& val1) { Base::_check_template_params(); this->template _init2<T0,T1>(val0, val1); } # 205 "eigen-3.3.7/Eigen/src/Core/Array.h" inline Array(const Scalar& val0, const Scalar& val1, const Scalar& val2) { Base::_check_template_params(); if (Eigen::internal::static_assertion<static_cast<bool>(Array::IsVectorAtCompileTime && Array::SizeAtCompileTime==3)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = val0; m_storage.data()[1] = val1; m_storage.data()[2] = val2; } inline Array(const Scalar& val0, const Scalar& val1, const Scalar& val2, const Scalar& val3) { Base::_check_template_params(); if (Eigen::internal::static_assertion<static_cast<bool>(Array::IsVectorAtCompileTime && Array::SizeAtCompileTime==4)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} m_storage.data()[0] = val0; m_storage.data()[1] = val1; m_storage.data()[2] = val2; m_storage.data()[3] = val3; } inline Array(const Array& other) : Base(other) { } private: struct PrivateType {}; public: template<typename OtherDerived> inline Array(const EigenBase<OtherDerived> &other, typename internal::enable_if<internal::is_convertible<typename OtherDerived::Scalar,Scalar>::value, PrivateType>::type = PrivateType()) : Base(other.derived()) { } inline Index innerStride() const { return 1; } inline Index outerStride() const { return this->innerSize(); } private: template<typename MatrixType, typename OtherDerived, bool SwapPointers> friend struct internal::matrix_swap_impl; }; # 298 "eigen-3.3.7/Eigen/src/Core/Array.h" typedef Array<int, 2, 2> Array22i; typedef Array<int, 2, 1> Array2i; typedef Array<int, 3, 3> Array33i; typedef Array<int, 3, 1> Array3i; typedef Array<int, 4, 4> Array44i; typedef Array<int, 4, 1> Array4i; typedef Array<int, Dynamic, Dynamic> ArrayXXi; typedef Array<int, Dynamic, 1> ArrayXi; typedef Array<int, 2, Dynamic> Array2Xi; typedef Array<int, Dynamic, 2> ArrayX2i; typedef Array<int, 3, Dynamic> Array3Xi; typedef Array<int, Dynamic, 3> ArrayX3i; typedef Array<int, 4, Dynamic> Array4Xi; typedef Array<int, Dynamic, 4> ArrayX4i; typedef Array<float, 2, 2> Array22f; typedef Array<float, 2, 1> Array2f; typedef Array<float, 3, 3> Array33f; typedef Array<float, 3, 1> Array3f; typedef Array<float, 4, 4> Array44f; typedef Array<float, 4, 1> Array4f; typedef Array<float, Dynamic, Dynamic> ArrayXXf; typedef Array<float, Dynamic, 1> ArrayXf; typedef Array<float, 2, Dynamic> Array2Xf; typedef Array<float, Dynamic, 2> ArrayX2f; typedef Array<float, 3, Dynamic> Array3Xf; typedef Array<float, Dynamic, 3> ArrayX3f; typedef Array<float, 4, Dynamic> Array4Xf; typedef Array<float, Dynamic, 4> ArrayX4f; typedef Array<double, 2, 2> Array22d; typedef Array<double, 2, 1> Array2d; typedef Array<double, 3, 3> Array33d; typedef Array<double, 3, 1> Array3d; typedef Array<double, 4, 4> Array44d; typedef Array<double, 4, 1> Array4d; typedef Array<double, Dynamic, Dynamic> ArrayXXd; typedef Array<double, Dynamic, 1> ArrayXd; typedef Array<double, 2, Dynamic> Array2Xd; typedef Array<double, Dynamic, 2> ArrayX2d; typedef Array<double, 3, Dynamic> Array3Xd; typedef Array<double, Dynamic, 3> ArrayX3d; typedef Array<double, 4, Dynamic> Array4Xd; typedef Array<double, Dynamic, 4> ArrayX4d; typedef Array<std::complex<float>, 2, 2> Array22cf; typedef Array<std::complex<float>, 2, 1> Array2cf; typedef Array<std::complex<float>, 3, 3> Array33cf; typedef Array<std::complex<float>, 3, 1> Array3cf; typedef Array<std::complex<float>, 4, 4> Array44cf; typedef Array<std::complex<float>, 4, 1> Array4cf; typedef Array<std::complex<float>, Dynamic, Dynamic> ArrayXXcf; typedef Array<std::complex<float>, Dynamic, 1> ArrayXcf; typedef Array<std::complex<float>, 2, Dynamic> Array2Xcf; typedef Array<std::complex<float>, Dynamic, 2> ArrayX2cf; typedef Array<std::complex<float>, 3, Dynamic> Array3Xcf; typedef Array<std::complex<float>, Dynamic, 3> ArrayX3cf; typedef Array<std::complex<float>, 4, Dynamic> Array4Xcf; typedef Array<std::complex<float>, Dynamic, 4> ArrayX4cf; typedef Array<std::complex<double>, 2, 2> Array22cd; typedef Array<std::complex<double>, 2, 1> Array2cd; typedef Array<std::complex<double>, 3, 3> Array33cd; typedef Array<std::complex<double>, 3, 1> Array3cd; typedef Array<std::complex<double>, 4, 4> Array44cd; typedef Array<std::complex<double>, 4, 1> Array4cd; typedef Array<std::complex<double>, Dynamic, Dynamic> ArrayXXcd; typedef Array<std::complex<double>, Dynamic, 1> ArrayXcd; typedef Array<std::complex<double>, 2, Dynamic> Array2Xcd; typedef Array<std::complex<double>, Dynamic, 2> ArrayX2cd; typedef Array<std::complex<double>, 3, Dynamic> Array3Xcd; typedef Array<std::complex<double>, Dynamic, 3> ArrayX3cd; typedef Array<std::complex<double>, 4, Dynamic> Array4Xcd; typedef Array<std::complex<double>, Dynamic, 4> ArrayX4cd; # 327 "eigen-3.3.7/Eigen/src/Core/Array.h" } # 460 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CwiseTernaryOp.h" 1 # 15 "eigen-3.3.7/Eigen/src/Core/CwiseTernaryOp.h" namespace Eigen { namespace internal { template <typename TernaryOp, typename Arg1, typename Arg2, typename Arg3> struct traits<CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> > { typedef typename remove_all<Arg1>::type Ancestor; typedef typename traits<Ancestor>::XprKind XprKind; enum { RowsAtCompileTime = traits<Ancestor>::RowsAtCompileTime, ColsAtCompileTime = traits<Ancestor>::ColsAtCompileTime, MaxRowsAtCompileTime = traits<Ancestor>::MaxRowsAtCompileTime, MaxColsAtCompileTime = traits<Ancestor>::MaxColsAtCompileTime }; typedef typename result_of<TernaryOp( const typename Arg1::Scalar&, const typename Arg2::Scalar&, const typename Arg3::Scalar&)>::type Scalar; typedef typename internal::traits<Arg1>::StorageKind StorageKind; typedef typename internal::traits<Arg1>::StorageIndex StorageIndex; typedef typename Arg1::Nested Arg1Nested; typedef typename Arg2::Nested Arg2Nested; typedef typename Arg3::Nested Arg3Nested; typedef typename remove_reference<Arg1Nested>::type _Arg1Nested; typedef typename remove_reference<Arg2Nested>::type _Arg2Nested; typedef typename remove_reference<Arg3Nested>::type _Arg3Nested; enum { Flags = _Arg1Nested::Flags & RowMajorBit }; }; } template <typename TernaryOp, typename Arg1, typename Arg2, typename Arg3, typename StorageKind> class CwiseTernaryOpImpl; # 82 "eigen-3.3.7/Eigen/src/Core/CwiseTernaryOp.h" template <typename TernaryOp, typename Arg1Type, typename Arg2Type, typename Arg3Type> class CwiseTernaryOp : public CwiseTernaryOpImpl< TernaryOp, Arg1Type, Arg2Type, Arg3Type, typename internal::traits<Arg1Type>::StorageKind>, internal::no_assignment_operator { public: typedef typename internal::remove_all<Arg1Type>::type Arg1; typedef typename internal::remove_all<Arg2Type>::type Arg2; typedef typename internal::remove_all<Arg3Type>::type Arg3; typedef typename CwiseTernaryOpImpl< TernaryOp, Arg1Type, Arg2Type, Arg3Type, typename internal::traits<Arg1Type>::StorageKind>::Base Base; typedef typename Eigen::internal::traits<CwiseTernaryOp>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<CwiseTernaryOp>::type Nested; typedef typename Eigen::internal::traits<CwiseTernaryOp>::StorageKind StorageKind; typedef typename Eigen::internal::traits<CwiseTernaryOp>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<CwiseTernaryOp>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<CwiseTernaryOp>::ColsAtCompileTime, Flags = Eigen::internal::traits<CwiseTernaryOp>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename internal::ref_selector<Arg1Type>::type Arg1Nested; typedef typename internal::ref_selector<Arg2Type>::type Arg2Nested; typedef typename internal::ref_selector<Arg3Type>::type Arg3Nested; typedef typename internal::remove_reference<Arg1Nested>::type _Arg1Nested; typedef typename internal::remove_reference<Arg2Nested>::type _Arg2Nested; typedef typename internal::remove_reference<Arg3Nested>::type _Arg3Nested; inline CwiseTernaryOp(const Arg1& a1, const Arg2& a2, const Arg3& a3, const TernaryOp& func = TernaryOp()) : m_arg1(a1), m_arg2(a2), m_arg3(a3), m_functor(func) { if (Eigen::internal::static_assertion<static_cast<bool>(( (int(Eigen::internal::size_of_xpr_at_compile_time<Arg1>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<Arg2>::ret)==0) || ( (int(Arg1::RowsAtCompileTime)==Eigen::Dynamic || int(Arg2::RowsAtCompileTime)==Eigen::Dynamic || int(Arg1::RowsAtCompileTime)==int(Arg2::RowsAtCompileTime)) && (int(Arg1::ColsAtCompileTime)==Eigen::Dynamic || int(Arg2::ColsAtCompileTime)==Eigen::Dynamic || int(Arg1::ColsAtCompileTime)==int(Arg2::ColsAtCompileTime)) ) ))>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {} if (Eigen::internal::static_assertion<static_cast<bool>(( (int(Eigen::internal::size_of_xpr_at_compile_time<Arg1>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<Arg3>::ret)==0) || ( (int(Arg1::RowsAtCompileTime)==Eigen::Dynamic || int(Arg3::RowsAtCompileTime)==Eigen::Dynamic || int(Arg1::RowsAtCompileTime)==int(Arg3::RowsAtCompileTime)) && (int(Arg1::ColsAtCompileTime)==Eigen::Dynamic || int(Arg3::ColsAtCompileTime)==Eigen::Dynamic || int(Arg1::ColsAtCompileTime)==int(Arg3::ColsAtCompileTime)) ) ))>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {} if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same< typename internal::traits<Arg1Type>::StorageKind, typename internal::traits<Arg2Type>::StorageKind>::value))>::STORAGE_KIND_MUST_MATCH) {} if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same< typename internal::traits<Arg1Type>::StorageKind, typename internal::traits<Arg3Type>::StorageKind>::value))>::STORAGE_KIND_MUST_MATCH) {} ((a1.rows() == a2.rows() && a1.cols() == a2.cols() && a1.rows() == a3.rows() && a1.cols() == a3.cols()) ? static_cast<void> (0) : __assert_fail ("a1.rows() == a2.rows() && a1.cols() == a2.cols() && a1.rows() == a3.rows() && a1.cols() == a3.cols()", "eigen-3.3.7/Eigen/src/Core/CwiseTernaryOp.h" # 125 "eigen-3.3.7/Eigen/src/Core/CwiseTernaryOp.h" , 126 # 125 "eigen-3.3.7/Eigen/src/Core/CwiseTernaryOp.h" , __PRETTY_FUNCTION__)) ; } inline Index rows() const { if (internal::traits<typename internal::remove_all<Arg1Nested>::type>:: RowsAtCompileTime == Dynamic && internal::traits<typename internal::remove_all<Arg2Nested>::type>:: RowsAtCompileTime == Dynamic) return m_arg3.rows(); else if (internal::traits<typename internal::remove_all<Arg1Nested>::type>:: RowsAtCompileTime == Dynamic && internal::traits<typename internal::remove_all<Arg3Nested>::type>:: RowsAtCompileTime == Dynamic) return m_arg2.rows(); else return m_arg1.rows(); } inline Index cols() const { if (internal::traits<typename internal::remove_all<Arg1Nested>::type>:: ColsAtCompileTime == Dynamic && internal::traits<typename internal::remove_all<Arg2Nested>::type>:: ColsAtCompileTime == Dynamic) return m_arg3.cols(); else if (internal::traits<typename internal::remove_all<Arg1Nested>::type>:: ColsAtCompileTime == Dynamic && internal::traits<typename internal::remove_all<Arg3Nested>::type>:: ColsAtCompileTime == Dynamic) return m_arg2.cols(); else return m_arg1.cols(); } const _Arg1Nested& arg1() const { return m_arg1; } const _Arg2Nested& arg2() const { return m_arg2; } const _Arg3Nested& arg3() const { return m_arg3; } const TernaryOp& functor() const { return m_functor; } protected: Arg1Nested m_arg1; Arg2Nested m_arg2; Arg3Nested m_arg3; const TernaryOp m_functor; }; template <typename TernaryOp, typename Arg1, typename Arg2, typename Arg3, typename StorageKind> class CwiseTernaryOpImpl : public internal::generic_xpr_base< CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> >::type { public: typedef typename internal::generic_xpr_base< CwiseTernaryOp<TernaryOp, Arg1, Arg2, Arg3> >::type Base; }; } # 461 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CwiseBinaryOp.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/CwiseBinaryOp.h" namespace Eigen { namespace internal { template<typename BinaryOp, typename Lhs, typename Rhs> struct traits<CwiseBinaryOp<BinaryOp, Lhs, Rhs> > { typedef typename remove_all<Lhs>::type Ancestor; typedef typename traits<Ancestor>::XprKind XprKind; enum { RowsAtCompileTime = traits<Ancestor>::RowsAtCompileTime, ColsAtCompileTime = traits<Ancestor>::ColsAtCompileTime, MaxRowsAtCompileTime = traits<Ancestor>::MaxRowsAtCompileTime, MaxColsAtCompileTime = traits<Ancestor>::MaxColsAtCompileTime }; typedef typename result_of< BinaryOp( const typename Lhs::Scalar&, const typename Rhs::Scalar& ) >::type Scalar; typedef typename cwise_promote_storage_type<typename traits<Lhs>::StorageKind, typename traits<Rhs>::StorageKind, BinaryOp>::ret StorageKind; typedef typename promote_index_type<typename traits<Lhs>::StorageIndex, typename traits<Rhs>::StorageIndex>::type StorageIndex; typedef typename Lhs::Nested LhsNested; typedef typename Rhs::Nested RhsNested; typedef typename remove_reference<LhsNested>::type _LhsNested; typedef typename remove_reference<RhsNested>::type _RhsNested; enum { Flags = cwise_promote_storage_order<typename traits<Lhs>::StorageKind,typename traits<Rhs>::StorageKind,_LhsNested::Flags & RowMajorBit,_RhsNested::Flags & RowMajorBit>::value }; }; } template<typename BinaryOp, typename Lhs, typename Rhs, typename StorageKind> class CwiseBinaryOpImpl; # 76 "eigen-3.3.7/Eigen/src/Core/CwiseBinaryOp.h" template<typename BinaryOp, typename LhsType, typename RhsType> class CwiseBinaryOp : public CwiseBinaryOpImpl< BinaryOp, LhsType, RhsType, typename internal::cwise_promote_storage_type<typename internal::traits<LhsType>::StorageKind, typename internal::traits<RhsType>::StorageKind, BinaryOp>::ret>, internal::no_assignment_operator { public: typedef typename internal::remove_all<BinaryOp>::type Functor; typedef typename internal::remove_all<LhsType>::type Lhs; typedef typename internal::remove_all<RhsType>::type Rhs; typedef typename CwiseBinaryOpImpl< BinaryOp, LhsType, RhsType, typename internal::cwise_promote_storage_type<typename internal::traits<LhsType>::StorageKind, typename internal::traits<Rhs>::StorageKind, BinaryOp>::ret>::Base Base; typedef typename Eigen::internal::traits<CwiseBinaryOp>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<CwiseBinaryOp>::type Nested; typedef typename Eigen::internal::traits<CwiseBinaryOp>::StorageKind StorageKind; typedef typename Eigen::internal::traits<CwiseBinaryOp>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<CwiseBinaryOp>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<CwiseBinaryOp>::ColsAtCompileTime, Flags = Eigen::internal::traits<CwiseBinaryOp>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename internal::ref_selector<LhsType>::type LhsNested; typedef typename internal::ref_selector<RhsType>::type RhsNested; typedef typename internal::remove_reference<LhsNested>::type _LhsNested; typedef typename internal::remove_reference<RhsNested>::type _RhsNested; inline CwiseBinaryOp(const Lhs& aLhs, const Rhs& aRhs, const BinaryOp& func = BinaryOp()) : m_lhs(aLhs), m_rhs(aRhs), m_functor(func) { if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::has_ReturnType<ScalarBinaryOpTraits<typename Lhs::Scalar, typename Rhs::Scalar,BinaryOp> >::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {}; if (Eigen::internal::static_assertion<static_cast<bool>(( (int(Eigen::internal::size_of_xpr_at_compile_time<Lhs>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<Rhs>::ret)==0) || ( (int(Lhs::RowsAtCompileTime)==Eigen::Dynamic || int(Rhs::RowsAtCompileTime)==Eigen::Dynamic || int(Lhs::RowsAtCompileTime)==int(Rhs::RowsAtCompileTime)) && (int(Lhs::ColsAtCompileTime)==Eigen::Dynamic || int(Rhs::ColsAtCompileTime)==Eigen::Dynamic || int(Lhs::ColsAtCompileTime)==int(Rhs::ColsAtCompileTime)) ) ))>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {} ((aLhs.rows() == aRhs.rows() && aLhs.cols() == aRhs.cols()) ? static_cast<void> (0) : __assert_fail ("aLhs.rows() == aRhs.rows() && aLhs.cols() == aRhs.cols()", "eigen-3.3.7/Eigen/src/Core/CwiseBinaryOp.h", 110, __PRETTY_FUNCTION__)); } inline Index rows() const { if (internal::traits<typename internal::remove_all<LhsNested>::type>::RowsAtCompileTime==Dynamic) return m_rhs.rows(); else return m_lhs.rows(); } inline Index cols() const { if (internal::traits<typename internal::remove_all<LhsNested>::type>::ColsAtCompileTime==Dynamic) return m_rhs.cols(); else return m_lhs.cols(); } const _LhsNested& lhs() const { return m_lhs; } const _RhsNested& rhs() const { return m_rhs; } const BinaryOp& functor() const { return m_functor; } protected: LhsNested m_lhs; RhsNested m_rhs; const BinaryOp m_functor; }; template<typename BinaryOp, typename Lhs, typename Rhs, typename StorageKind> class CwiseBinaryOpImpl : public internal::generic_xpr_base<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >::type { public: typedef typename internal::generic_xpr_base<CwiseBinaryOp<BinaryOp, Lhs, Rhs> >::type Base; }; template<typename Derived> template<typename OtherDerived> inline Derived & MatrixBase<Derived>::operator-=(const MatrixBase<OtherDerived> &other) { call_assignment(derived(), other.derived(), internal::sub_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } template<typename Derived> template<typename OtherDerived> inline Derived & MatrixBase<Derived>::operator+=(const MatrixBase<OtherDerived>& other) { call_assignment(derived(), other.derived(), internal::add_assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } } # 462 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CwiseUnaryOp.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/CwiseUnaryOp.h" namespace Eigen { namespace internal { template<typename UnaryOp, typename XprType> struct traits<CwiseUnaryOp<UnaryOp, XprType> > : traits<XprType> { typedef typename result_of< UnaryOp(const typename XprType::Scalar&) >::type Scalar; typedef typename XprType::Nested XprTypeNested; typedef typename remove_reference<XprTypeNested>::type _XprTypeNested; enum { Flags = _XprTypeNested::Flags & RowMajorBit }; }; } template<typename UnaryOp, typename XprType, typename StorageKind> class CwiseUnaryOpImpl; # 54 "eigen-3.3.7/Eigen/src/Core/CwiseUnaryOp.h" template<typename UnaryOp, typename XprType> class CwiseUnaryOp : public CwiseUnaryOpImpl<UnaryOp, XprType, typename internal::traits<XprType>::StorageKind>, internal::no_assignment_operator { public: typedef typename CwiseUnaryOpImpl<UnaryOp, XprType,typename internal::traits<XprType>::StorageKind>::Base Base; typedef typename Eigen::internal::traits<CwiseUnaryOp>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<CwiseUnaryOp>::type Nested; typedef typename Eigen::internal::traits<CwiseUnaryOp>::StorageKind StorageKind; typedef typename Eigen::internal::traits<CwiseUnaryOp>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<CwiseUnaryOp>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<CwiseUnaryOp>::ColsAtCompileTime, Flags = Eigen::internal::traits<CwiseUnaryOp>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename internal::ref_selector<XprType>::type XprTypeNested; typedef typename internal::remove_all<XprType>::type NestedExpression; inline explicit CwiseUnaryOp(const XprType& xpr, const UnaryOp& func = UnaryOp()) : m_xpr(xpr), m_functor(func) {} inline Index rows() const { return m_xpr.rows(); } inline Index cols() const { return m_xpr.cols(); } inline const UnaryOp& functor() const { return m_functor; } inline const typename internal::remove_all<XprTypeNested>::type& nestedExpression() const { return m_xpr; } inline typename internal::remove_all<XprTypeNested>::type& nestedExpression() { return m_xpr; } protected: XprTypeNested m_xpr; const UnaryOp m_functor; }; template<typename UnaryOp, typename XprType, typename StorageKind> class CwiseUnaryOpImpl : public internal::generic_xpr_base<CwiseUnaryOp<UnaryOp, XprType> >::type { public: typedef typename internal::generic_xpr_base<CwiseUnaryOp<UnaryOp, XprType> >::type Base; }; } # 463 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" namespace Eigen { namespace internal { template<typename NullaryOp, typename PlainObjectType> struct traits<CwiseNullaryOp<NullaryOp, PlainObjectType> > : traits<PlainObjectType> { enum { Flags = traits<PlainObjectType>::Flags & RowMajorBit }; }; } # 59 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename NullaryOp, typename PlainObjectType> class CwiseNullaryOp : public internal::dense_xpr_base< CwiseNullaryOp<NullaryOp, PlainObjectType> >::type, internal::no_assignment_operator { public: typedef typename internal::dense_xpr_base<CwiseNullaryOp>::type Base; typedef typename Eigen::internal::traits<CwiseNullaryOp>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<CwiseNullaryOp>::type Nested; typedef typename Eigen::internal::traits<CwiseNullaryOp>::StorageKind StorageKind; typedef typename Eigen::internal::traits<CwiseNullaryOp>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<CwiseNullaryOp>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<CwiseNullaryOp>::ColsAtCompileTime, Flags = Eigen::internal::traits<CwiseNullaryOp>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; CwiseNullaryOp(Index rows, Index cols, const NullaryOp& func = NullaryOp()) : m_rows(rows), m_cols(cols), m_functor(func) { ((rows >= 0 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows) && cols >= 0 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols)) ? static_cast<void> (0) : __assert_fail ("rows >= 0 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows) && cols >= 0 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols)", "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" # 71 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" , 74 # 71 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" , __PRETTY_FUNCTION__)) ; } inline Index rows() const { return m_rows.value(); } inline Index cols() const { return m_cols.value(); } const NullaryOp& functor() const { return m_functor; } protected: const internal::variable_if_dynamic<Index, RowsAtCompileTime> m_rows; const internal::variable_if_dynamic<Index, ColsAtCompileTime> m_cols; const NullaryOp m_functor; }; # 106 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> template<typename CustomNullaryOp> inline const CwiseNullaryOp<CustomNullaryOp, typename DenseBase<Derived>::PlainObject> DenseBase<Derived>::NullaryExpr(Index rows, Index cols, const CustomNullaryOp& func) { return CwiseNullaryOp<CustomNullaryOp, PlainObject>(rows, cols, func); } # 132 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> template<typename CustomNullaryOp> inline const CwiseNullaryOp<CustomNullaryOp, typename DenseBase<Derived>::PlainObject> DenseBase<Derived>::NullaryExpr(Index size, const CustomNullaryOp& func) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if(RowsAtCompileTime == 1) return CwiseNullaryOp<CustomNullaryOp, PlainObject>(1, size, func); else return CwiseNullaryOp<CustomNullaryOp, PlainObject>(size, 1, func); } # 151 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> template<typename CustomNullaryOp> inline const CwiseNullaryOp<CustomNullaryOp, typename DenseBase<Derived>::PlainObject> DenseBase<Derived>::NullaryExpr(const CustomNullaryOp& func) { return CwiseNullaryOp<CustomNullaryOp, PlainObject>(RowsAtCompileTime, ColsAtCompileTime, func); } # 172 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Constant(Index rows, Index cols, const Scalar& value) { return DenseBase<Derived>::NullaryExpr(rows, cols, internal::scalar_constant_op<Scalar>(value)); } # 194 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Constant(Index size, const Scalar& value) { return DenseBase<Derived>::NullaryExpr(size, internal::scalar_constant_op<Scalar>(value)); } # 210 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Constant(const Scalar& value) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime!=Eigen::Dynamic)>::YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR) {} return DenseBase<Derived>::NullaryExpr(RowsAtCompileTime, ColsAtCompileTime, internal::scalar_constant_op<Scalar>(value)); } template<typename Derived> inline const typename DenseBase<Derived>::RandomAccessLinSpacedReturnType DenseBase<Derived>::LinSpaced(Sequential_t, Index size, const Scalar& low, const Scalar& high) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return DenseBase<Derived>::NullaryExpr(size, internal::linspaced_op<Scalar,PacketScalar>(low,high,size)); } template<typename Derived> inline const typename DenseBase<Derived>::RandomAccessLinSpacedReturnType DenseBase<Derived>::LinSpaced(Sequential_t, const Scalar& low, const Scalar& high) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime!=Eigen::Dynamic)>::YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR) {} return DenseBase<Derived>::NullaryExpr(Derived::SizeAtCompileTime, internal::linspaced_op<Scalar,PacketScalar>(low,high,Derived::SizeAtCompileTime)); } # 266 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::RandomAccessLinSpacedReturnType DenseBase<Derived>::LinSpaced(Index size, const Scalar& low, const Scalar& high) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return DenseBase<Derived>::NullaryExpr(size, internal::linspaced_op<Scalar,PacketScalar>(low,high,size)); } template<typename Derived> inline const typename DenseBase<Derived>::RandomAccessLinSpacedReturnType DenseBase<Derived>::LinSpaced(const Scalar& low, const Scalar& high) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime!=Eigen::Dynamic)>::YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR) {} return DenseBase<Derived>::NullaryExpr(Derived::SizeAtCompileTime, internal::linspaced_op<Scalar,PacketScalar>(low,high,Derived::SizeAtCompileTime)); } template<typename Derived> bool DenseBase<Derived>::isApproxToConstant (const Scalar& val, const RealScalar& prec) const { typename internal::nested_eval<Derived,1>::type self(derived()); for(Index j = 0; j < cols(); ++j) for(Index i = 0; i < rows(); ++i) if(!internal::isApprox(self.coeff(i, j), val, prec)) return false; return true; } template<typename Derived> bool DenseBase<Derived>::isConstant (const Scalar& val, const RealScalar& prec) const { return isApproxToConstant(val, prec); } template<typename Derived> inline void DenseBase<Derived>::fill(const Scalar& val) { setConstant(val); } template<typename Derived> inline Derived& DenseBase<Derived>::setConstant(const Scalar& val) { return derived() = Constant(rows(), cols(), val); } # 339 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setConstant(Index size, const Scalar& val) { resize(size); return setConstant(val); } # 358 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setConstant(Index rows, Index cols, const Scalar& val) { resize(rows, cols); return setConstant(val); } # 382 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& DenseBase<Derived>::setLinSpaced(Index newSize, const Scalar& low, const Scalar& high) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return derived() = Derived::NullaryExpr(newSize, internal::linspaced_op<Scalar,PacketScalar>(low,high,newSize)); } # 402 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& DenseBase<Derived>::setLinSpaced(const Scalar& low, const Scalar& high) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return setLinSpaced(size(), low, high); } # 425 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Zero(Index rows, Index cols) { return Constant(rows, cols, Scalar(0)); } # 448 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Zero(Index size) { return Constant(size, Scalar(0)); } # 465 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Zero() { return Constant(Scalar(0)); } # 480 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> bool DenseBase<Derived>::isZero(const RealScalar& prec) const { typename internal::nested_eval<Derived,1>::type self(derived()); for(Index j = 0; j < cols(); ++j) for(Index i = 0; i < rows(); ++i) if(!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false; return true; } # 498 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& DenseBase<Derived>::setZero() { return setConstant(Scalar(0)); } # 513 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setZero(Index newSize) { resize(newSize); return setConstant(Scalar(0)); } # 531 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setZero(Index rows, Index cols) { resize(rows, cols); return setConstant(Scalar(0)); } # 555 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Ones(Index rows, Index cols) { return Constant(rows, cols, Scalar(1)); } # 578 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Ones(Index newSize) { return Constant(newSize, Scalar(1)); } # 595 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename DenseBase<Derived>::ConstantReturnType DenseBase<Derived>::Ones() { return Constant(Scalar(1)); } # 610 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> bool DenseBase<Derived>::isOnes (const RealScalar& prec) const { return isApproxToConstant(Scalar(1), prec); } # 624 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& DenseBase<Derived>::setOnes() { return setConstant(Scalar(1)); } # 639 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setOnes(Index newSize) { resize(newSize); return setConstant(Scalar(1)); } # 657 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setOnes(Index rows, Index cols) { resize(rows, cols); return setConstant(Scalar(1)); } # 681 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename MatrixBase<Derived>::IdentityReturnType MatrixBase<Derived>::Identity(Index rows, Index cols) { return DenseBase<Derived>::NullaryExpr(rows, cols, internal::scalar_identity_op<Scalar>()); } # 698 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename MatrixBase<Derived>::IdentityReturnType MatrixBase<Derived>::Identity() { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime!=Eigen::Dynamic)>::YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR) {} return MatrixBase<Derived>::NullaryExpr(RowsAtCompileTime, ColsAtCompileTime, internal::scalar_identity_op<Scalar>()); } # 715 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> bool MatrixBase<Derived>::isIdentity (const RealScalar& prec) const { typename internal::nested_eval<Derived,1>::type self(derived()); for(Index j = 0; j < cols(); ++j) { for(Index i = 0; i < rows(); ++i) { if(i == j) { if(!internal::isApprox(self.coeff(i, j), static_cast<Scalar>(1), prec)) return false; } else { if(!internal::isMuchSmallerThan(self.coeff(i, j), static_cast<RealScalar>(1), prec)) return false; } } } return true; } namespace internal { template<typename Derived, bool Big = (Derived::SizeAtCompileTime>=16)> struct setIdentity_impl { static inline Derived& run(Derived& m) { return m = Derived::Identity(m.rows(), m.cols()); } }; template<typename Derived> struct setIdentity_impl<Derived, true> { static inline Derived& run(Derived& m) { m.setZero(); const Index size = numext::mini(m.rows(), m.cols()); for(Index i = 0; i < size; ++i) m.coeffRef(i,i) = typename Derived::Scalar(1); return m; } }; } # 773 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& MatrixBase<Derived>::setIdentity() { return internal::setIdentity_impl<Derived>::run(derived()); } # 789 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline Derived& MatrixBase<Derived>::setIdentity(Index rows, Index cols) { derived().resize(rows, cols); return setIdentity(); } template<typename Derived> inline const typename MatrixBase<Derived>::BasisReturnType MatrixBase<Derived>::Unit(Index newSize, Index i) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return BasisReturnType(SquareMatrixType::Identity(newSize,newSize), i); } # 817 "eigen-3.3.7/Eigen/src/Core/CwiseNullaryOp.h" template<typename Derived> inline const typename MatrixBase<Derived>::BasisReturnType MatrixBase<Derived>::Unit(Index i) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return BasisReturnType(SquareMatrixType::Identity(),i); } template<typename Derived> inline const typename MatrixBase<Derived>::BasisReturnType MatrixBase<Derived>::UnitX() { return Derived::Unit(0); } template<typename Derived> inline const typename MatrixBase<Derived>::BasisReturnType MatrixBase<Derived>::UnitY() { return Derived::Unit(1); } template<typename Derived> inline const typename MatrixBase<Derived>::BasisReturnType MatrixBase<Derived>::UnitZ() { return Derived::Unit(2); } template<typename Derived> inline const typename MatrixBase<Derived>::BasisReturnType MatrixBase<Derived>::UnitW() { return Derived::Unit(3); } } # 464 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CwiseUnaryView.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/CwiseUnaryView.h" namespace Eigen { namespace internal { template<typename ViewOp, typename MatrixType> struct traits<CwiseUnaryView<ViewOp, MatrixType> > : traits<MatrixType> { typedef typename result_of< ViewOp(const typename traits<MatrixType>::Scalar&) >::type Scalar; typedef typename MatrixType::Nested MatrixTypeNested; typedef typename remove_all<MatrixTypeNested>::type _MatrixTypeNested; enum { FlagsLvalueBit = is_lvalue<MatrixType>::value ? LvalueBit : 0, Flags = traits<_MatrixTypeNested>::Flags & (RowMajorBit | FlagsLvalueBit | DirectAccessBit), MatrixTypeInnerStride = inner_stride_at_compile_time<MatrixType>::ret, InnerStrideAtCompileTime = MatrixTypeInnerStride == Dynamic ? int(Dynamic) : int(MatrixTypeInnerStride) * int(sizeof(typename traits<MatrixType>::Scalar) / sizeof(Scalar)), OuterStrideAtCompileTime = outer_stride_at_compile_time<MatrixType>::ret == Dynamic ? int(Dynamic) : outer_stride_at_compile_time<MatrixType>::ret * int(sizeof(typename traits<MatrixType>::Scalar) / sizeof(Scalar)) }; }; } template<typename ViewOp, typename MatrixType, typename StorageKind> class CwiseUnaryViewImpl; # 57 "eigen-3.3.7/Eigen/src/Core/CwiseUnaryView.h" template<typename ViewOp, typename MatrixType> class CwiseUnaryView : public CwiseUnaryViewImpl<ViewOp, MatrixType, typename internal::traits<MatrixType>::StorageKind> { public: typedef typename CwiseUnaryViewImpl<ViewOp, MatrixType,typename internal::traits<MatrixType>::StorageKind>::Base Base; typedef typename Eigen::internal::traits<CwiseUnaryView>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<CwiseUnaryView>::type Nested; typedef typename Eigen::internal::traits<CwiseUnaryView>::StorageKind StorageKind; typedef typename Eigen::internal::traits<CwiseUnaryView>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<CwiseUnaryView>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<CwiseUnaryView>::ColsAtCompileTime, Flags = Eigen::internal::traits<CwiseUnaryView>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename internal::ref_selector<MatrixType>::non_const_type MatrixTypeNested; typedef typename internal::remove_all<MatrixType>::type NestedExpression; explicit inline CwiseUnaryView(MatrixType& mat, const ViewOp& func = ViewOp()) : m_matrix(mat), m_functor(func) {} using Base::operator =; inline CwiseUnaryView& operator=(const CwiseUnaryView& other) { Base::operator=(other); return *this; } inline Index rows() const { return m_matrix.rows(); } inline Index cols() const { return m_matrix.cols(); } const ViewOp& functor() const { return m_functor; } const typename internal::remove_all<MatrixTypeNested>::type& nestedExpression() const { return m_matrix; } typename internal::remove_reference<MatrixTypeNested>::type& nestedExpression() { return m_matrix.const_cast_derived(); } protected: MatrixTypeNested m_matrix; ViewOp m_functor; }; template<typename ViewOp, typename XprType, typename StorageKind> class CwiseUnaryViewImpl : public internal::generic_xpr_base<CwiseUnaryView<ViewOp, XprType> >::type { public: typedef typename internal::generic_xpr_base<CwiseUnaryView<ViewOp, XprType> >::type Base; }; template<typename ViewOp, typename MatrixType> class CwiseUnaryViewImpl<ViewOp,MatrixType,Dense> : public internal::dense_xpr_base< CwiseUnaryView<ViewOp, MatrixType> >::type { public: typedef CwiseUnaryView<ViewOp, MatrixType> Derived; typedef typename internal::dense_xpr_base< CwiseUnaryView<ViewOp, MatrixType> >::type Base; typedef typename Eigen::internal::traits<Derived>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Derived>::type Nested; typedef typename Eigen::internal::traits<Derived>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Derived>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Derived>::ColsAtCompileTime, Flags = Eigen::internal::traits<Derived>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; using Base::operator =; inline CwiseUnaryViewImpl& operator=(const CwiseUnaryViewImpl& other) { Base::operator=(other); return *this; } inline Scalar* data() { return &(this->coeffRef(0)); } inline const Scalar* data() const { return &(this->coeff(0)); } inline Index innerStride() const { return derived().nestedExpression().innerStride() * sizeof(typename internal::traits<MatrixType>::Scalar) / sizeof(Scalar); } inline Index outerStride() const { return derived().nestedExpression().outerStride() * sizeof(typename internal::traits<MatrixType>::Scalar) / sizeof(Scalar); } }; } # 465 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/SelfCwiseBinaryOp.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/SelfCwiseBinaryOp.h" namespace Eigen { template<typename Derived> inline Derived& DenseBase<Derived>::operator*=(const Scalar& other) { internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::mul_assign_op<Scalar,Scalar>()); return derived(); } template<typename Derived> inline Derived& ArrayBase<Derived>::operator+=(const Scalar& other) { internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::add_assign_op<Scalar,Scalar>()); return derived(); } template<typename Derived> inline Derived& ArrayBase<Derived>::operator-=(const Scalar& other) { internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::sub_assign_op<Scalar,Scalar>()); return derived(); } template<typename Derived> inline Derived& DenseBase<Derived>::operator/=(const Scalar& other) { internal::call_assignment(this->derived(), PlainObject::Constant(rows(),cols(),other), internal::div_assign_op<Scalar,Scalar>()); return derived(); } } # 466 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Dot.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Dot.h" namespace Eigen { namespace internal { template<typename T, typename U, bool NeedToTranspose = T::IsVectorAtCompileTime && U::IsVectorAtCompileTime && ((int(T::RowsAtCompileTime) == 1 && int(U::ColsAtCompileTime) == 1) | (int(T::ColsAtCompileTime) == 1 && int(U::RowsAtCompileTime) == 1)) > struct dot_nocheck { typedef scalar_conj_product_op<typename traits<T>::Scalar,typename traits<U>::Scalar> conj_prod; typedef typename conj_prod::result_type ResScalar; inline static ResScalar run(const MatrixBase<T>& a, const MatrixBase<U>& b) { return a.template binaryExpr<conj_prod>(b).sum(); } }; template<typename T, typename U> struct dot_nocheck<T, U, true> { typedef scalar_conj_product_op<typename traits<T>::Scalar,typename traits<U>::Scalar> conj_prod; typedef typename conj_prod::result_type ResScalar; inline static ResScalar run(const MatrixBase<T>& a, const MatrixBase<U>& b) { return a.transpose().template binaryExpr<conj_prod>(b).sum(); } }; } # 67 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> template<typename OtherDerived> inline typename ScalarBinaryOpTraits<typename internal::traits<Derived>::Scalar,typename internal::traits<OtherDerived>::Scalar>::ReturnType MatrixBase<Derived>::dot(const MatrixBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((int(Derived::SizeAtCompileTime)==Eigen::Dynamic || int(OtherDerived::SizeAtCompileTime)==Eigen::Dynamic || int(Derived::SizeAtCompileTime)==int(OtherDerived::SizeAtCompileTime)))>::YOU_MIXED_VECTORS_OF_DIFFERENT_SIZES) {} typedef internal::scalar_conj_product_op<Scalar,typename OtherDerived::Scalar> func; if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::has_ReturnType<ScalarBinaryOpTraits<Scalar, typename OtherDerived::Scalar,func> >::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {}; ((size() == other.size()) ? static_cast<void> (0) : __assert_fail ("size() == other.size()", "eigen-3.3.7/Eigen/src/Core/Dot.h", 82, __PRETTY_FUNCTION__)); return internal::dot_nocheck<Derived,OtherDerived>::run(*this, other); } # 95 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> inline typename NumTraits<typename internal::traits<Derived>::Scalar>::Real MatrixBase<Derived>::squaredNorm() const { return numext::real((*this).cwiseAbs2().sum()); } template<typename Derived> inline typename NumTraits<typename internal::traits<Derived>::Scalar>::Real MatrixBase<Derived>::norm() const { return numext::sqrt(squaredNorm()); } # 122 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> inline const typename MatrixBase<Derived>::PlainObject MatrixBase<Derived>::normalized() const { typedef typename internal::nested_eval<Derived,2>::type _Nested; _Nested n(derived()); RealScalar z = n.squaredNorm(); if(z>RealScalar(0)) return n / numext::sqrt(z); else return n; } # 144 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> inline void MatrixBase<Derived>::normalize() { RealScalar z = squaredNorm(); if(z>RealScalar(0)) derived() /= numext::sqrt(z); } # 165 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> inline const typename MatrixBase<Derived>::PlainObject MatrixBase<Derived>::stableNormalized() const { typedef typename internal::nested_eval<Derived,3>::type _Nested; _Nested n(derived()); RealScalar w = n.cwiseAbs().maxCoeff(); RealScalar z = (n/w).squaredNorm(); if(z>RealScalar(0)) return n / (numext::sqrt(z)*w); else return n; } # 190 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> inline void MatrixBase<Derived>::stableNormalize() { RealScalar w = cwiseAbs().maxCoeff(); RealScalar z = (derived()/w).squaredNorm(); if(z>RealScalar(0)) derived() /= numext::sqrt(z)*w; } namespace internal { template<typename Derived, int p> struct lpNorm_selector { typedef typename NumTraits<typename traits<Derived>::Scalar>::Real RealScalar; static inline RealScalar run(const MatrixBase<Derived>& m) { using std::pow; return pow(m.cwiseAbs().array().pow(p).sum(), RealScalar(1)/p); } }; template<typename Derived> struct lpNorm_selector<Derived, 1> { static inline typename NumTraits<typename traits<Derived>::Scalar>::Real run(const MatrixBase<Derived>& m) { return m.cwiseAbs().sum(); } }; template<typename Derived> struct lpNorm_selector<Derived, 2> { static inline typename NumTraits<typename traits<Derived>::Scalar>::Real run(const MatrixBase<Derived>& m) { return m.norm(); } }; template<typename Derived> struct lpNorm_selector<Derived, Infinity> { typedef typename NumTraits<typename traits<Derived>::Scalar>::Real RealScalar; static inline RealScalar run(const MatrixBase<Derived>& m) { if(Derived::SizeAtCompileTime==0 || (Derived::SizeAtCompileTime==Dynamic && m.size()==0)) return RealScalar(0); return m.cwiseAbs().maxCoeff(); } }; } # 260 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> template<int p> inline typename NumTraits<typename internal::traits<Derived>::Scalar>::Real MatrixBase<Derived>::lpNorm() const { return internal::lpNorm_selector<Derived, p>::run(*this); } # 280 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> template<typename OtherDerived> bool MatrixBase<Derived>::isOrthogonal (const MatrixBase<OtherDerived>& other, const RealScalar& prec) const { typename internal::nested_eval<Derived,2>::type nested(derived()); typename internal::nested_eval<OtherDerived,2>::type otherNested(other.derived()); return numext::abs2(nested.dot(otherNested)) <= prec * prec * nested.squaredNorm() * otherNested.squaredNorm(); } # 301 "eigen-3.3.7/Eigen/src/Core/Dot.h" template<typename Derived> bool MatrixBase<Derived>::isUnitary(const RealScalar& prec) const { typename internal::nested_eval<Derived,1>::type self(derived()); for(Index i = 0; i < cols(); ++i) { if(!internal::isApprox(self.col(i).squaredNorm(), static_cast<RealScalar>(1), prec)) return false; for(Index j = 0; j < i; ++j) if(!internal::isMuchSmallerThan(self.col(i).dot(self.col(j)), static_cast<Scalar>(1), prec)) return false; } return true; } } # 467 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/StableNorm.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/StableNorm.h" namespace Eigen { namespace internal { template<typename ExpressionType, typename Scalar> inline void stable_norm_kernel(const ExpressionType& bl, Scalar& ssq, Scalar& scale, Scalar& invScale) { Scalar maxCoeff = bl.cwiseAbs().maxCoeff(); if(maxCoeff>scale) { ssq = ssq * numext::abs2(scale/maxCoeff); Scalar tmp = Scalar(1)/maxCoeff; if(tmp > NumTraits<Scalar>::highest()) { invScale = NumTraits<Scalar>::highest(); scale = Scalar(1)/invScale; } else if(maxCoeff>NumTraits<Scalar>::highest()) { invScale = Scalar(1); scale = maxCoeff; } else { scale = maxCoeff; invScale = tmp; } } else if(maxCoeff!=maxCoeff) { scale = maxCoeff; } if(scale>Scalar(0)) ssq += (bl*invScale).squaredNorm(); } template<typename Derived> inline typename NumTraits<typename traits<Derived>::Scalar>::Real blueNorm_impl(const EigenBase<Derived>& _vec) { typedef typename Derived::RealScalar RealScalar; using std::pow; using std::sqrt; using std::abs; const Derived& vec(_vec.derived()); static bool initialized = false; static RealScalar b1, b2, s1m, s2m, rbig, relerr; if(!initialized) { int ibeta, it, iemin, iemax, iexp; RealScalar eps; # 76 "eigen-3.3.7/Eigen/src/Core/StableNorm.h" ibeta = std::numeric_limits<RealScalar>::radix; it = std::numeric_limits<RealScalar>::digits; iemin = std::numeric_limits<RealScalar>::min_exponent; iemax = std::numeric_limits<RealScalar>::max_exponent; rbig = (std::numeric_limits<RealScalar>::max)(); iexp = -((1-iemin)/2); b1 = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); iexp = (iemax + 1 - it)/2; b2 = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); iexp = (2-iemin)/2; s1m = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); iexp = - ((iemax+it)/2); s2m = RealScalar(pow(RealScalar(ibeta),RealScalar(iexp))); eps = RealScalar(pow(double(ibeta), 1-it)); relerr = sqrt(eps); initialized = true; } Index n = vec.size(); RealScalar ab2 = b2 / RealScalar(n); RealScalar asml = RealScalar(0); RealScalar amed = RealScalar(0); RealScalar abig = RealScalar(0); for(typename Derived::InnerIterator it(vec, 0); it; ++it) { RealScalar ax = abs(it.value()); if(ax > ab2) abig += numext::abs2(ax*s2m); else if(ax < b1) asml += numext::abs2(ax*s1m); else amed += numext::abs2(ax); } if(amed!=amed) return amed; if(abig > RealScalar(0)) { abig = sqrt(abig); if(abig > rbig) return abig; if(amed > RealScalar(0)) { abig = abig/s2m; amed = sqrt(amed); } else return abig/s2m; } else if(asml > RealScalar(0)) { if (amed > RealScalar(0)) { abig = sqrt(amed); amed = sqrt(asml) / s1m; } else return sqrt(asml)/s1m; } else return sqrt(amed); asml = numext::mini(abig, amed); abig = numext::maxi(abig, amed); if(asml <= abig*relerr) return abig; else return abig * sqrt(RealScalar(1) + numext::abs2(asml/abig)); } } # 155 "eigen-3.3.7/Eigen/src/Core/StableNorm.h" template<typename Derived> inline typename NumTraits<typename internal::traits<Derived>::Scalar>::Real MatrixBase<Derived>::stableNorm() const { using std::sqrt; using std::abs; const Index blockSize = 4096; RealScalar scale(0); RealScalar invScale(1); RealScalar ssq(0); typedef typename internal::nested_eval<Derived,2>::type DerivedCopy; typedef typename internal::remove_all<DerivedCopy>::type DerivedCopyClean; const DerivedCopy copy(derived()); enum { CanAlign = ( (int(DerivedCopyClean::Flags)&DirectAccessBit) || (int(internal::evaluator<DerivedCopyClean>::Alignment)>0) ) && (blockSize*sizeof(Scalar)*2<131072) && (16>0) }; typedef typename internal::conditional<CanAlign, Ref<const Matrix<Scalar,Dynamic,1,0,blockSize,1>, internal::evaluator<DerivedCopyClean>::Alignment>, typename DerivedCopyClean::ConstSegmentReturnType>::type SegmentWrapper; Index n = size(); if(n==1) return abs(this->coeff(0)); Index bi = internal::first_default_aligned(copy); if (bi>0) internal::stable_norm_kernel(copy.head(bi), ssq, scale, invScale); for (; bi<n; bi+=blockSize) internal::stable_norm_kernel(SegmentWrapper(copy.segment(bi,numext::mini(blockSize, n - bi))), ssq, scale, invScale); return scale * sqrt(ssq); } # 200 "eigen-3.3.7/Eigen/src/Core/StableNorm.h" template<typename Derived> inline typename NumTraits<typename internal::traits<Derived>::Scalar>::Real MatrixBase<Derived>::blueNorm() const { return internal::blueNorm_impl(*this); } template<typename Derived> inline typename NumTraits<typename internal::traits<Derived>::Scalar>::Real MatrixBase<Derived>::hypotNorm() const { return this->cwiseAbs().redux(internal::scalar_hypot_op<RealScalar>()); } } # 468 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Stride.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Stride.h" namespace Eigen { # 43 "eigen-3.3.7/Eigen/src/Core/Stride.h" template<int _OuterStrideAtCompileTime, int _InnerStrideAtCompileTime> class Stride { public: typedef Eigen::Index Index; enum { InnerStrideAtCompileTime = _InnerStrideAtCompileTime, OuterStrideAtCompileTime = _OuterStrideAtCompileTime }; Stride() : m_outer(OuterStrideAtCompileTime), m_inner(InnerStrideAtCompileTime) { ((InnerStrideAtCompileTime != Dynamic && OuterStrideAtCompileTime != Dynamic) ? static_cast<void> (0) : __assert_fail ("InnerStrideAtCompileTime != Dynamic && OuterStrideAtCompileTime != Dynamic", "eigen-3.3.7/Eigen/src/Core/Stride.h", 58, __PRETTY_FUNCTION__)); } Stride(Index outerStride, Index innerStride) : m_outer(outerStride), m_inner(innerStride) { ((innerStride>=0 && outerStride>=0) ? static_cast<void> (0) : __assert_fail ("innerStride>=0 && outerStride>=0", "eigen-3.3.7/Eigen/src/Core/Stride.h", 66, __PRETTY_FUNCTION__)); } Stride(const Stride& other) : m_outer(other.outer()), m_inner(other.inner()) {} inline Index outer() const { return m_outer.value(); } inline Index inner() const { return m_inner.value(); } protected: internal::variable_if_dynamic<Index, OuterStrideAtCompileTime> m_outer; internal::variable_if_dynamic<Index, InnerStrideAtCompileTime> m_inner; }; template<int Value> class InnerStride : public Stride<0, Value> { typedef Stride<0, Value> Base; public: InnerStride() : Base() {} InnerStride(Index v) : Base(0, v) {} }; template<int Value> class OuterStride : public Stride<Value, 0> { typedef Stride<Value, 0> Base; public: OuterStride() : Base() {} OuterStride(Index v) : Base(v,0) {} }; } # 469 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/MapBase.h" 1 # 18 "eigen-3.3.7/Eigen/src/Core/MapBase.h" namespace Eigen { # 37 "eigen-3.3.7/Eigen/src/Core/MapBase.h" template<typename Derived> class MapBase<Derived, ReadOnlyAccessors> : public internal::dense_xpr_base<Derived>::type { public: typedef typename internal::dense_xpr_base<Derived>::type Base; enum { RowsAtCompileTime = internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = internal::traits<Derived>::ColsAtCompileTime, InnerStrideAtCompileTime = internal::traits<Derived>::InnerStrideAtCompileTime, SizeAtCompileTime = Base::SizeAtCompileTime }; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename internal::packet_traits<Scalar>::type PacketScalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef typename internal::conditional< bool(internal::is_lvalue<Derived>::value), Scalar *, const Scalar *>::type PointerType; using Base::derived; using Base::MaxRowsAtCompileTime; using Base::MaxColsAtCompileTime; using Base::MaxSizeAtCompileTime; using Base::IsVectorAtCompileTime; using Base::Flags; using Base::IsRowMajor; using Base::rows; using Base::cols; using Base::size; using Base::coeff; using Base::coeffRef; using Base::lazyAssign; using Base::eval; using Base::innerStride; using Base::outerStride; using Base::rowStride; using Base::colStride; using Base::operator=; typedef typename Base::CoeffReturnType CoeffReturnType; inline Index rows() const { return m_rows.value(); } inline Index cols() const { return m_cols.value(); } inline const Scalar* data() const { return m_data; } inline const Scalar& coeff(Index rowId, Index colId) const { return m_data[colId * colStride() + rowId * rowStride()]; } inline const Scalar& coeff(Index index) const { if (Eigen::internal::static_assertion<static_cast<bool>((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime)>::YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT) {} return m_data[index * innerStride()]; } inline const Scalar& coeffRef(Index rowId, Index colId) const { return this->m_data[colId * colStride() + rowId * rowStride()]; } inline const Scalar& coeffRef(Index index) const { if (Eigen::internal::static_assertion<static_cast<bool>((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime)>::YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT) {} return this->m_data[index * innerStride()]; } template<int LoadMode> inline PacketScalar packet(Index rowId, Index colId) const { return internal::ploadt<PacketScalar, LoadMode> (m_data + (colId * colStride() + rowId * rowStride())); } template<int LoadMode> inline PacketScalar packet(Index index) const { if (Eigen::internal::static_assertion<static_cast<bool>((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime)>::YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT) {} return internal::ploadt<PacketScalar, LoadMode>(m_data + index * innerStride()); } explicit inline MapBase(PointerType dataPtr) : m_data(dataPtr), m_rows(RowsAtCompileTime), m_cols(ColsAtCompileTime) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::SizeAtCompileTime!=Eigen::Dynamic)>::YOU_CALLED_A_FIXED_SIZE_METHOD_ON_A_DYNAMIC_SIZE_MATRIX_OR_VECTOR) {} checkSanity<Derived>(); } inline MapBase(PointerType dataPtr, Index vecSize) : m_data(dataPtr), m_rows(RowsAtCompileTime == Dynamic ? vecSize : Index(RowsAtCompileTime)), m_cols(ColsAtCompileTime == Dynamic ? vecSize : Index(ColsAtCompileTime)) { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} ((vecSize >= 0) ? static_cast<void> (0) : __assert_fail ("vecSize >= 0", "eigen-3.3.7/Eigen/src/Core/MapBase.h", 164, __PRETTY_FUNCTION__)); ((dataPtr == 0 || SizeAtCompileTime == Dynamic || SizeAtCompileTime == vecSize) ? static_cast<void> (0) : __assert_fail ("dataPtr == 0 || SizeAtCompileTime == Dynamic || SizeAtCompileTime == vecSize", "eigen-3.3.7/Eigen/src/Core/MapBase.h", 165, __PRETTY_FUNCTION__)); checkSanity<Derived>(); } inline MapBase(PointerType dataPtr, Index rows, Index cols) : m_data(dataPtr), m_rows(rows), m_cols(cols) { (((dataPtr == 0) || ( rows >= 0 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows) && cols >= 0 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols))) ? static_cast<void> (0) : __assert_fail ("(dataPtr == 0) || ( rows >= 0 && (RowsAtCompileTime == Dynamic || RowsAtCompileTime == rows) && cols >= 0 && (ColsAtCompileTime == Dynamic || ColsAtCompileTime == cols))", "eigen-3.3.7/Eigen/src/Core/MapBase.h" # 174 "eigen-3.3.7/Eigen/src/Core/MapBase.h" , 176 # 174 "eigen-3.3.7/Eigen/src/Core/MapBase.h" , __PRETTY_FUNCTION__)) ; checkSanity<Derived>(); } protected: template<typename T> void checkSanity(typename internal::enable_if<(internal::traits<T>::Alignment>0),void*>::type = 0) const { const Index minInnerStride = InnerStrideAtCompileTime == Dynamic ? 1 : Index(InnerStrideAtCompileTime); ; ((( ((internal::UIntPtr(m_data) % internal::traits<Derived>::Alignment) == 0) || (cols() * rows() * minInnerStride * sizeof(Scalar)) < internal::traits<Derived>::Alignment ) && "data is not aligned") ? static_cast<void> (0) : __assert_fail ("( ((internal::UIntPtr(m_data) % internal::traits<Derived>::Alignment) == 0) || (cols() * rows() * minInnerStride * sizeof(Scalar)) < internal::traits<Derived>::Alignment ) && \"data is not aligned\"", "eigen-3.3.7/Eigen/src/Core/MapBase.h" # 194 "eigen-3.3.7/Eigen/src/Core/MapBase.h" , 195 # 194 "eigen-3.3.7/Eigen/src/Core/MapBase.h" , __PRETTY_FUNCTION__)) ; } template<typename T> void checkSanity(typename internal::enable_if<internal::traits<T>::Alignment==0,void*>::type = 0) const {} PointerType m_data; const internal::variable_if_dynamic<Index, RowsAtCompileTime> m_rows; const internal::variable_if_dynamic<Index, ColsAtCompileTime> m_cols; }; # 219 "eigen-3.3.7/Eigen/src/Core/MapBase.h" template<typename Derived> class MapBase<Derived, WriteAccessors> : public MapBase<Derived, ReadOnlyAccessors> { typedef MapBase<Derived, ReadOnlyAccessors> ReadOnlyMapBase; public: typedef MapBase<Derived, ReadOnlyAccessors> Base; typedef typename Base::Scalar Scalar; typedef typename Base::PacketScalar PacketScalar; typedef typename Base::StorageIndex StorageIndex; typedef typename Base::PointerType PointerType; using Base::derived; using Base::rows; using Base::cols; using Base::size; using Base::coeff; using Base::coeffRef; using Base::innerStride; using Base::outerStride; using Base::rowStride; using Base::colStride; typedef typename internal::conditional< internal::is_lvalue<Derived>::value, Scalar, const Scalar >::type ScalarWithConstIfNotLvalue; inline const Scalar* data() const { return this->m_data; } inline ScalarWithConstIfNotLvalue* data() { return this->m_data; } inline ScalarWithConstIfNotLvalue& coeffRef(Index row, Index col) { return this->m_data[col * colStride() + row * rowStride()]; } inline ScalarWithConstIfNotLvalue& coeffRef(Index index) { if (Eigen::internal::static_assertion<static_cast<bool>((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime)>::YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT) {} return this->m_data[index * innerStride()]; } template<int StoreMode> inline void writePacket(Index row, Index col, const PacketScalar& val) { internal::pstoret<Scalar, PacketScalar, StoreMode> (this->m_data + (col * colStride() + row * rowStride()), val); } template<int StoreMode> inline void writePacket(Index index, const PacketScalar& val) { if (Eigen::internal::static_assertion<static_cast<bool>((int(internal::evaluator<Derived>::Flags) & LinearAccessBit) || Derived::IsVectorAtCompileTime)>::YOU_ARE_TRYING_TO_USE_AN_INDEX_BASED_ACCESSOR_ON_AN_EXPRESSION_THAT_DOES_NOT_SUPPORT_THAT) {} internal::pstoret<Scalar, PacketScalar, StoreMode> (this->m_data + index * innerStride(), val); } explicit inline MapBase(PointerType dataPtr) : Base(dataPtr) {} inline MapBase(PointerType dataPtr, Index vecSize) : Base(dataPtr, vecSize) {} inline MapBase(PointerType dataPtr, Index rows, Index cols) : Base(dataPtr, rows, cols) {} Derived& operator=(const MapBase& other) { ReadOnlyMapBase::Base::operator=(other); return derived(); } using ReadOnlyMapBase::Base::operator=; }; } # 470 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Map.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/Map.h" namespace Eigen { namespace internal { template<typename PlainObjectType, int MapOptions, typename StrideType> struct traits<Map<PlainObjectType, MapOptions, StrideType> > : public traits<PlainObjectType> { typedef traits<PlainObjectType> TraitsBase; enum { PlainObjectTypeInnerSize = ((traits<PlainObjectType>::Flags&RowMajorBit)==RowMajorBit) ? PlainObjectType::ColsAtCompileTime : PlainObjectType::RowsAtCompileTime, InnerStrideAtCompileTime = StrideType::InnerStrideAtCompileTime == 0 ? int(PlainObjectType::InnerStrideAtCompileTime) : int(StrideType::InnerStrideAtCompileTime), OuterStrideAtCompileTime = StrideType::OuterStrideAtCompileTime == 0 ? (InnerStrideAtCompileTime==Dynamic || PlainObjectTypeInnerSize==Dynamic ? Dynamic : int(InnerStrideAtCompileTime) * int(PlainObjectTypeInnerSize)) : int(StrideType::OuterStrideAtCompileTime), Alignment = int(MapOptions)&int(AlignedMask), Flags0 = TraitsBase::Flags & (~NestByRefBit), Flags = is_lvalue<PlainObjectType>::value ? int(Flags0) : (int(Flags0) & ~LvalueBit) }; private: enum { Options }; }; } # 94 "eigen-3.3.7/Eigen/src/Core/Map.h" template<typename PlainObjectType, int MapOptions, typename StrideType> class Map : public MapBase<Map<PlainObjectType, MapOptions, StrideType> > { public: typedef MapBase<Map> Base; typedef typename Eigen::internal::traits<Map>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Map>::type Nested; typedef typename Eigen::internal::traits<Map>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Map>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Map>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Map>::ColsAtCompileTime, Flags = Eigen::internal::traits<Map>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; typedef typename Base::PointerType PointerType; typedef PointerType PointerArgType; inline PointerType cast_to_pointer_type(PointerArgType ptr) { return ptr; } inline Index innerStride() const { return StrideType::InnerStrideAtCompileTime != 0 ? m_stride.inner() : 1; } inline Index outerStride() const { return int(StrideType::OuterStrideAtCompileTime) != 0 ? m_stride.outer() : int(internal::traits<Map>::OuterStrideAtCompileTime) != Dynamic ? Index(internal::traits<Map>::OuterStrideAtCompileTime) : IsVectorAtCompileTime ? (this->size() * innerStride()) : (int(Flags)&RowMajorBit) ? (this->cols() * innerStride()) : (this->rows() * innerStride()); } explicit inline Map(PointerArgType dataPtr, const StrideType& stride = StrideType()) : Base(cast_to_pointer_type(dataPtr)), m_stride(stride) { PlainObjectType::Base::_check_template_params(); } inline Map(PointerArgType dataPtr, Index size, const StrideType& stride = StrideType()) : Base(cast_to_pointer_type(dataPtr), size), m_stride(stride) { PlainObjectType::Base::_check_template_params(); } # 155 "eigen-3.3.7/Eigen/src/Core/Map.h" inline Map(PointerArgType dataPtr, Index rows, Index cols, const StrideType& stride = StrideType()) : Base(cast_to_pointer_type(dataPtr), rows, cols), m_stride(stride) { PlainObjectType::Base::_check_template_params(); } using Base::operator =; inline Map& operator=(const Map& other) { Base::operator=(other); return *this; } protected: StrideType m_stride; }; } # 471 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Ref.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Ref.h" namespace Eigen { namespace internal { template<typename _PlainObjectType, int _Options, typename _StrideType> struct traits<Ref<_PlainObjectType, _Options, _StrideType> > : public traits<Map<_PlainObjectType, _Options, _StrideType> > { typedef _PlainObjectType PlainObjectType; typedef _StrideType StrideType; enum { Options = _Options, Flags = traits<Map<_PlainObjectType, _Options, _StrideType> >::Flags | NestByRefBit, Alignment = traits<Map<_PlainObjectType, _Options, _StrideType> >::Alignment }; template<typename Derived> struct match { enum { HasDirectAccess = internal::has_direct_access<Derived>::ret, StorageOrderMatch = PlainObjectType::IsVectorAtCompileTime || Derived::IsVectorAtCompileTime || ((PlainObjectType::Flags&RowMajorBit)==(Derived::Flags&RowMajorBit)), InnerStrideMatch = int(StrideType::InnerStrideAtCompileTime)==int(Dynamic) || int(StrideType::InnerStrideAtCompileTime)==int(Derived::InnerStrideAtCompileTime) || (int(StrideType::InnerStrideAtCompileTime)==0 && int(Derived::InnerStrideAtCompileTime)==1), OuterStrideMatch = Derived::IsVectorAtCompileTime || int(StrideType::OuterStrideAtCompileTime)==int(Dynamic) || int(StrideType::OuterStrideAtCompileTime)==int(Derived::OuterStrideAtCompileTime), DerivedAlignment = int(evaluator<Derived>::Alignment), AlignmentMatch = (int(traits<PlainObjectType>::Alignment)==int(Unaligned)) || (DerivedAlignment >= int(Alignment)), ScalarTypeMatch = internal::is_same<typename PlainObjectType::Scalar, typename Derived::Scalar>::value, MatchAtCompileTime = HasDirectAccess && StorageOrderMatch && InnerStrideMatch && OuterStrideMatch && AlignmentMatch && ScalarTypeMatch }; typedef typename internal::conditional<MatchAtCompileTime,internal::true_type,internal::false_type>::type type; }; }; template<typename Derived> struct traits<RefBase<Derived> > : public traits<Derived> {}; } template<typename Derived> class RefBase : public MapBase<Derived> { typedef typename internal::traits<Derived>::PlainObjectType PlainObjectType; typedef typename internal::traits<Derived>::StrideType StrideType; public: typedef MapBase<Derived> Base; typedef typename Eigen::internal::traits<RefBase>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<RefBase>::type Nested; typedef typename Eigen::internal::traits<RefBase>::StorageKind StorageKind; typedef typename Eigen::internal::traits<RefBase>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<RefBase>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<RefBase>::ColsAtCompileTime, Flags = Eigen::internal::traits<RefBase>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; inline Index innerStride() const { return StrideType::InnerStrideAtCompileTime != 0 ? m_stride.inner() : 1; } inline Index outerStride() const { return StrideType::OuterStrideAtCompileTime != 0 ? m_stride.outer() : IsVectorAtCompileTime ? this->size() : int(Flags)&RowMajorBit ? this->cols() : this->rows(); } RefBase() : Base(0,RowsAtCompileTime==Dynamic?0:RowsAtCompileTime,ColsAtCompileTime==Dynamic?0:ColsAtCompileTime), m_stride(StrideType::OuterStrideAtCompileTime==Dynamic?0:StrideType::OuterStrideAtCompileTime, StrideType::InnerStrideAtCompileTime==Dynamic?0:StrideType::InnerStrideAtCompileTime) {} using Base::operator =; inline RefBase& operator=(const RefBase& other) { Base::operator=(other); return *this; } protected: typedef Stride<StrideType::OuterStrideAtCompileTime,StrideType::InnerStrideAtCompileTime> StrideBase; template<typename Expression> void construct(Expression& expr) { if (Eigen::internal::static_assertion<static_cast<bool>(( (int(Eigen::internal::size_of_xpr_at_compile_time<PlainObjectType>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<Expression>::ret)==0) || ( (int(PlainObjectType::RowsAtCompileTime)==Eigen::Dynamic || int(Expression::RowsAtCompileTime)==Eigen::Dynamic || int(PlainObjectType::RowsAtCompileTime)==int(Expression::RowsAtCompileTime)) && (int(PlainObjectType::ColsAtCompileTime)==Eigen::Dynamic || int(Expression::ColsAtCompileTime)==Eigen::Dynamic || int(PlainObjectType::ColsAtCompileTime)==int(Expression::ColsAtCompileTime)) ) ))>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {}; if(PlainObjectType::RowsAtCompileTime==1) { ((expr.rows()==1 || expr.cols()==1) ? static_cast<void> (0) : __assert_fail ("expr.rows()==1 || expr.cols()==1", "eigen-3.3.7/Eigen/src/Core/Ref.h", 102, __PRETTY_FUNCTION__)); ::new (static_cast<Base*>(this)) Base(expr.data(), 1, expr.size()); } else if(PlainObjectType::ColsAtCompileTime==1) { ((expr.rows()==1 || expr.cols()==1) ? static_cast<void> (0) : __assert_fail ("expr.rows()==1 || expr.cols()==1", "eigen-3.3.7/Eigen/src/Core/Ref.h", 107, __PRETTY_FUNCTION__)); ::new (static_cast<Base*>(this)) Base(expr.data(), expr.size(), 1); } else ::new (static_cast<Base*>(this)) Base(expr.data(), expr.rows(), expr.cols()); if(Expression::IsVectorAtCompileTime && (!PlainObjectType::IsVectorAtCompileTime) && ((Expression::Flags&RowMajorBit)!=(PlainObjectType::Flags&RowMajorBit))) ::new (&m_stride) StrideBase(expr.innerStride(), StrideType::InnerStrideAtCompileTime==0?0:1); else ::new (&m_stride) StrideBase(StrideType::OuterStrideAtCompileTime==0?0:expr.outerStride(), StrideType::InnerStrideAtCompileTime==0?0:expr.innerStride()); } StrideBase m_stride; }; # 192 "eigen-3.3.7/Eigen/src/Core/Ref.h" template<typename PlainObjectType, int Options, typename StrideType> class Ref : public RefBase<Ref<PlainObjectType, Options, StrideType> > { private: typedef internal::traits<Ref> Traits; template<typename Derived> inline Ref(const PlainObjectBase<Derived>& expr, typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0); public: typedef RefBase<Ref> Base; typedef typename Eigen::internal::traits<Ref>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Ref>::type Nested; typedef typename Eigen::internal::traits<Ref>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Ref>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Ref>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Ref>::ColsAtCompileTime, Flags = Eigen::internal::traits<Ref>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; template<typename Derived> inline Ref(PlainObjectBase<Derived>& expr, typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0) { if (Eigen::internal::static_assertion<static_cast<bool>(bool(Traits::template match<Derived>::MatchAtCompileTime))>::STORAGE_LAYOUT_DOES_NOT_MATCH) {}; Base::construct(expr.derived()); } template<typename Derived> inline Ref(const DenseBase<Derived>& expr, typename internal::enable_if<bool(Traits::template match<Derived>::MatchAtCompileTime),Derived>::type* = 0) { if (Eigen::internal::static_assertion<static_cast<bool>(bool(internal::is_lvalue<Derived>::value))>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {}; if (Eigen::internal::static_assertion<static_cast<bool>(bool(Traits::template match<Derived>::MatchAtCompileTime))>::STORAGE_LAYOUT_DOES_NOT_MATCH) {}; if (Eigen::internal::static_assertion<static_cast<bool>(!Derived::IsPlainObjectBase)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {}; Base::construct(expr.const_cast_derived()); } using Base::operator =; inline Ref& operator=(const Ref& other) { Base::operator=(other); return *this; } }; template<typename TPlainObjectType, int Options, typename StrideType> class Ref<const TPlainObjectType, Options, StrideType> : public RefBase<Ref<const TPlainObjectType, Options, StrideType> > { typedef internal::traits<Ref> Traits; public: typedef RefBase<Ref> Base; typedef typename Eigen::internal::traits<Ref>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Ref>::type Nested; typedef typename Eigen::internal::traits<Ref>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Ref>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Ref>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Ref>::ColsAtCompileTime, Flags = Eigen::internal::traits<Ref>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; template<typename Derived> inline Ref(const DenseBase<Derived>& expr, typename internal::enable_if<bool(Traits::template match<Derived>::ScalarTypeMatch),Derived>::type* = 0) { construct(expr.derived(), typename Traits::template match<Derived>::type()); } inline Ref(const Ref& other) : Base(other) { } template<typename OtherRef> inline Ref(const RefBase<OtherRef>& other) { construct(other.derived(), typename Traits::template match<OtherRef>::type()); } protected: template<typename Expression> void construct(const Expression& expr,internal::true_type) { Base::construct(expr); } template<typename Expression> void construct(const Expression& expr, internal::false_type) { internal::call_assignment_no_alias(m_object,expr,internal::assign_op<Scalar,Scalar>()); Base::construct(m_object); } protected: TPlainObjectType m_object; }; } # 472 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Block.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/Block.h" namespace Eigen { namespace internal { template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> struct traits<Block<XprType, BlockRows, BlockCols, InnerPanel> > : traits<XprType> { typedef typename traits<XprType>::Scalar Scalar; typedef typename traits<XprType>::StorageKind StorageKind; typedef typename traits<XprType>::XprKind XprKind; typedef typename ref_selector<XprType>::type XprTypeNested; typedef typename remove_reference<XprTypeNested>::type _XprTypeNested; enum{ MatrixRows = traits<XprType>::RowsAtCompileTime, MatrixCols = traits<XprType>::ColsAtCompileTime, RowsAtCompileTime = MatrixRows == 0 ? 0 : BlockRows, ColsAtCompileTime = MatrixCols == 0 ? 0 : BlockCols, MaxRowsAtCompileTime = BlockRows==0 ? 0 : RowsAtCompileTime != Dynamic ? int(RowsAtCompileTime) : int(traits<XprType>::MaxRowsAtCompileTime), MaxColsAtCompileTime = BlockCols==0 ? 0 : ColsAtCompileTime != Dynamic ? int(ColsAtCompileTime) : int(traits<XprType>::MaxColsAtCompileTime), XprTypeIsRowMajor = (int(traits<XprType>::Flags)&RowMajorBit) != 0, IsRowMajor = (MaxRowsAtCompileTime==1&&MaxColsAtCompileTime!=1) ? 1 : (MaxColsAtCompileTime==1&&MaxRowsAtCompileTime!=1) ? 0 : XprTypeIsRowMajor, HasSameStorageOrderAsXprType = (IsRowMajor == XprTypeIsRowMajor), InnerSize = IsRowMajor ? int(ColsAtCompileTime) : int(RowsAtCompileTime), InnerStrideAtCompileTime = HasSameStorageOrderAsXprType ? int(inner_stride_at_compile_time<XprType>::ret) : int(outer_stride_at_compile_time<XprType>::ret), OuterStrideAtCompileTime = HasSameStorageOrderAsXprType ? int(outer_stride_at_compile_time<XprType>::ret) : int(inner_stride_at_compile_time<XprType>::ret), FlagsLvalueBit = is_lvalue<XprType>::value ? LvalueBit : 0, FlagsRowMajorBit = IsRowMajor ? RowMajorBit : 0, Flags = (traits<XprType>::Flags & (DirectAccessBit | (InnerPanel?CompressedAccessBit:0))) | FlagsLvalueBit | FlagsRowMajorBit, Alignment = 0 }; }; template<typename XprType, int BlockRows=Dynamic, int BlockCols=Dynamic, bool InnerPanel = false, bool HasDirectAccess = internal::has_direct_access<XprType>::ret> class BlockImpl_dense; } template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, typename StorageKind> class BlockImpl; # 103 "eigen-3.3.7/Eigen/src/Core/Block.h" template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class Block : public BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, typename internal::traits<XprType>::StorageKind> { typedef BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, typename internal::traits<XprType>::StorageKind> Impl; public: typedef Impl Base; typedef typename Eigen::internal::traits<Block>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Block>::type Nested; typedef typename Eigen::internal::traits<Block>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Block>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Block>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Block>::ColsAtCompileTime, Flags = Eigen::internal::traits<Block>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; using Base::operator =; inline Block& operator=(const Block& other) { Base::operator=(other); return *this; } typedef typename internal::remove_all<XprType>::type NestedExpression; inline Block(XprType& xpr, Index i) : Impl(xpr,i) { (((i>=0) && ( ((BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) && i<xpr.rows()) ||((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && i<xpr.cols()))) ? static_cast<void> (0) : __assert_fail ("(i>=0) && ( ((BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) && i<xpr.rows()) ||((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && i<xpr.cols()))", "eigen-3.3.7/Eigen/src/Core/Block.h" # 120 "eigen-3.3.7/Eigen/src/Core/Block.h" , 122 # 120 "eigen-3.3.7/Eigen/src/Core/Block.h" , __PRETTY_FUNCTION__)) ; } inline Block(XprType& xpr, Index startRow, Index startCol) : Impl(xpr, startRow, startCol) { if (Eigen::internal::static_assertion<static_cast<bool>(RowsAtCompileTime!=Dynamic && ColsAtCompileTime!=Dynamic)>::THIS_METHOD_IS_ONLY_FOR_FIXED_SIZE) {} ((startRow >= 0 && BlockRows >= 0 && startRow + BlockRows <= xpr.rows() && startCol >= 0 && BlockCols >= 0 && startCol + BlockCols <= xpr.cols()) ? static_cast<void> (0) : __assert_fail ("startRow >= 0 && BlockRows >= 0 && startRow + BlockRows <= xpr.rows() && startCol >= 0 && BlockCols >= 0 && startCol + BlockCols <= xpr.cols()", "eigen-3.3.7/Eigen/src/Core/Block.h" # 132 "eigen-3.3.7/Eigen/src/Core/Block.h" , 133 # 132 "eigen-3.3.7/Eigen/src/Core/Block.h" , __PRETTY_FUNCTION__)) ; } inline Block(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) : Impl(xpr, startRow, startCol, blockRows, blockCols) { (((RowsAtCompileTime==Dynamic || RowsAtCompileTime==blockRows) && (ColsAtCompileTime==Dynamic || ColsAtCompileTime==blockCols)) ? static_cast<void> (0) : __assert_fail ("(RowsAtCompileTime==Dynamic || RowsAtCompileTime==blockRows) && (ColsAtCompileTime==Dynamic || ColsAtCompileTime==blockCols)", "eigen-3.3.7/Eigen/src/Core/Block.h" # 144 "eigen-3.3.7/Eigen/src/Core/Block.h" , 145 # 144 "eigen-3.3.7/Eigen/src/Core/Block.h" , __PRETTY_FUNCTION__)) ; ((startRow >= 0 && blockRows >= 0 && startRow <= xpr.rows() - blockRows && startCol >= 0 && blockCols >= 0 && startCol <= xpr.cols() - blockCols) ? static_cast<void> (0) : __assert_fail ("startRow >= 0 && blockRows >= 0 && startRow <= xpr.rows() - blockRows && startCol >= 0 && blockCols >= 0 && startCol <= xpr.cols() - blockCols", "eigen-3.3.7/Eigen/src/Core/Block.h" # 146 "eigen-3.3.7/Eigen/src/Core/Block.h" , 147 # 146 "eigen-3.3.7/Eigen/src/Core/Block.h" , __PRETTY_FUNCTION__)) ; } }; template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class BlockImpl<XprType, BlockRows, BlockCols, InnerPanel, Dense> : public internal::BlockImpl_dense<XprType, BlockRows, BlockCols, InnerPanel> { typedef internal::BlockImpl_dense<XprType, BlockRows, BlockCols, InnerPanel> Impl; typedef typename XprType::StorageIndex StorageIndex; public: typedef Impl Base; using Base::operator =; inline BlockImpl& operator=(const BlockImpl& other) { Base::operator=(other); return *this; } inline BlockImpl(XprType& xpr, Index i) : Impl(xpr,i) {} inline BlockImpl(XprType& xpr, Index startRow, Index startCol) : Impl(xpr, startRow, startCol) {} inline BlockImpl(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) : Impl(xpr, startRow, startCol, blockRows, blockCols) {} }; namespace internal { template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel, bool HasDirectAccess> class BlockImpl_dense : public internal::dense_xpr_base<Block<XprType, BlockRows, BlockCols, InnerPanel> >::type { typedef Block<XprType, BlockRows, BlockCols, InnerPanel> BlockType; typedef typename internal::ref_selector<XprType>::non_const_type XprTypeNested; public: typedef typename internal::dense_xpr_base<BlockType>::type Base; typedef typename Eigen::internal::traits<BlockType>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<BlockType>::type Nested; typedef typename Eigen::internal::traits<BlockType>::StorageKind StorageKind; typedef typename Eigen::internal::traits<BlockType>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<BlockType>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<BlockType>::ColsAtCompileTime, Flags = Eigen::internal::traits<BlockType>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; using Base::operator =; inline BlockImpl_dense& operator=(const BlockImpl_dense& other) { Base::operator=(other); return *this; } inline BlockImpl_dense(XprType& xpr, Index i) : m_xpr(xpr), m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? i : 0), m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? i : 0), m_blockRows(BlockRows==1 ? 1 : xpr.rows()), m_blockCols(BlockCols==1 ? 1 : xpr.cols()) {} inline BlockImpl_dense(XprType& xpr, Index startRow, Index startCol) : m_xpr(xpr), m_startRow(startRow), m_startCol(startCol), m_blockRows(BlockRows), m_blockCols(BlockCols) {} inline BlockImpl_dense(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) : m_xpr(xpr), m_startRow(startRow), m_startCol(startCol), m_blockRows(blockRows), m_blockCols(blockCols) {} inline Index rows() const { return m_blockRows.value(); } inline Index cols() const { return m_blockCols.value(); } inline Scalar& coeffRef(Index rowId, Index colId) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<XprType>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} return m_xpr.coeffRef(rowId + m_startRow.value(), colId + m_startCol.value()); } inline const Scalar& coeffRef(Index rowId, Index colId) const { return m_xpr.derived().coeffRef(rowId + m_startRow.value(), colId + m_startCol.value()); } inline const CoeffReturnType coeff(Index rowId, Index colId) const { return m_xpr.coeff(rowId + m_startRow.value(), colId + m_startCol.value()); } inline Scalar& coeffRef(Index index) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<XprType>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} return m_xpr.coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); } inline const Scalar& coeffRef(Index index) const { return m_xpr.coeffRef(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); } inline const CoeffReturnType coeff(Index index) const { return m_xpr.coeff(m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); } template<int LoadMode> inline PacketScalar packet(Index rowId, Index colId) const { return m_xpr.template packet<Unaligned>(rowId + m_startRow.value(), colId + m_startCol.value()); } template<int LoadMode> inline void writePacket(Index rowId, Index colId, const PacketScalar& val) { m_xpr.template writePacket<Unaligned>(rowId + m_startRow.value(), colId + m_startCol.value(), val); } template<int LoadMode> inline PacketScalar packet(Index index) const { return m_xpr.template packet<Unaligned> (m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0)); } template<int LoadMode> inline void writePacket(Index index, const PacketScalar& val) { m_xpr.template writePacket<Unaligned> (m_startRow.value() + (RowsAtCompileTime == 1 ? 0 : index), m_startCol.value() + (RowsAtCompileTime == 1 ? index : 0), val); } # 297 "eigen-3.3.7/Eigen/src/Core/Block.h" const typename internal::remove_all<XprTypeNested>::type& nestedExpression() const { return m_xpr; } XprType& nestedExpression() { return m_xpr; } StorageIndex startRow() const { return m_startRow.value(); } StorageIndex startCol() const { return m_startCol.value(); } protected: XprTypeNested m_xpr; const internal::variable_if_dynamic<StorageIndex, (XprType::RowsAtCompileTime == 1 && BlockRows==1) ? 0 : Dynamic> m_startRow; const internal::variable_if_dynamic<StorageIndex, (XprType::ColsAtCompileTime == 1 && BlockCols==1) ? 0 : Dynamic> m_startCol; const internal::variable_if_dynamic<StorageIndex, RowsAtCompileTime> m_blockRows; const internal::variable_if_dynamic<StorageIndex, ColsAtCompileTime> m_blockCols; }; template<typename XprType, int BlockRows, int BlockCols, bool InnerPanel> class BlockImpl_dense<XprType,BlockRows,BlockCols, InnerPanel,true> : public MapBase<Block<XprType, BlockRows, BlockCols, InnerPanel> > { typedef Block<XprType, BlockRows, BlockCols, InnerPanel> BlockType; typedef typename internal::ref_selector<XprType>::non_const_type XprTypeNested; enum { XprTypeIsRowMajor = (int(traits<XprType>::Flags)&RowMajorBit) != 0 }; public: typedef MapBase<BlockType> Base; typedef typename Eigen::internal::traits<BlockType>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<BlockType>::type Nested; typedef typename Eigen::internal::traits<BlockType>::StorageKind StorageKind; typedef typename Eigen::internal::traits<BlockType>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<BlockType>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<BlockType>::ColsAtCompileTime, Flags = Eigen::internal::traits<BlockType>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; using Base::operator =; inline BlockImpl_dense& operator=(const BlockImpl_dense& other) { Base::operator=(other); return *this; } inline BlockImpl_dense(XprType& xpr, Index i) : Base(xpr.data() + i * ( ((BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) && (!XprTypeIsRowMajor)) || ((BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) && ( XprTypeIsRowMajor)) ? xpr.innerStride() : xpr.outerStride()), BlockRows==1 ? 1 : xpr.rows(), BlockCols==1 ? 1 : xpr.cols()), m_xpr(xpr), m_startRow( (BlockRows==1) && (BlockCols==XprType::ColsAtCompileTime) ? i : 0), m_startCol( (BlockRows==XprType::RowsAtCompileTime) && (BlockCols==1) ? i : 0) { init(); } inline BlockImpl_dense(XprType& xpr, Index startRow, Index startCol) : Base(xpr.data()+xpr.innerStride()*(XprTypeIsRowMajor?startCol:startRow) + xpr.outerStride()*(XprTypeIsRowMajor?startRow:startCol)), m_xpr(xpr), m_startRow(startRow), m_startCol(startCol) { init(); } inline BlockImpl_dense(XprType& xpr, Index startRow, Index startCol, Index blockRows, Index blockCols) : Base(xpr.data()+xpr.innerStride()*(XprTypeIsRowMajor?startCol:startRow) + xpr.outerStride()*(XprTypeIsRowMajor?startRow:startCol), blockRows, blockCols), m_xpr(xpr), m_startRow(startRow), m_startCol(startCol) { init(); } const typename internal::remove_all<XprTypeNested>::type& nestedExpression() const { return m_xpr; } XprType& nestedExpression() { return m_xpr; } inline Index innerStride() const { return internal::traits<BlockType>::HasSameStorageOrderAsXprType ? m_xpr.innerStride() : m_xpr.outerStride(); } inline Index outerStride() const { return m_outerStride; } StorageIndex startRow() const { return m_startRow.value(); } StorageIndex startCol() const { return m_startCol.value(); } protected: inline BlockImpl_dense(XprType& xpr, const Scalar* data, Index blockRows, Index blockCols) : Base(data, blockRows, blockCols), m_xpr(xpr) { init(); } protected: void init() { m_outerStride = internal::traits<BlockType>::HasSameStorageOrderAsXprType ? m_xpr.outerStride() : m_xpr.innerStride(); } XprTypeNested m_xpr; const internal::variable_if_dynamic<StorageIndex, (XprType::RowsAtCompileTime == 1 && BlockRows==1) ? 0 : Dynamic> m_startRow; const internal::variable_if_dynamic<StorageIndex, (XprType::ColsAtCompileTime == 1 && BlockCols==1) ? 0 : Dynamic> m_startCol; Index m_outerStride; }; } } # 473 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/VectorBlock.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/VectorBlock.h" namespace Eigen { namespace internal { template<typename VectorType, int Size> struct traits<VectorBlock<VectorType, Size> > : public traits<Block<VectorType, traits<VectorType>::Flags & RowMajorBit ? 1 : Size, traits<VectorType>::Flags & RowMajorBit ? Size : 1> > { }; } # 56 "eigen-3.3.7/Eigen/src/Core/VectorBlock.h" template<typename VectorType, int Size> class VectorBlock : public Block<VectorType, internal::traits<VectorType>::Flags & RowMajorBit ? 1 : Size, internal::traits<VectorType>::Flags & RowMajorBit ? Size : 1> { typedef Block<VectorType, internal::traits<VectorType>::Flags & RowMajorBit ? 1 : Size, internal::traits<VectorType>::Flags & RowMajorBit ? Size : 1> Base; enum { IsColVector = !(internal::traits<VectorType>::Flags & RowMajorBit) }; public: typedef typename Eigen::internal::traits<VectorBlock>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<VectorBlock>::type Nested; typedef typename Eigen::internal::traits<VectorBlock>::StorageKind StorageKind; typedef typename Eigen::internal::traits<VectorBlock>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<VectorBlock>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<VectorBlock>::ColsAtCompileTime, Flags = Eigen::internal::traits<VectorBlock>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; using Base::operator=; inline VectorBlock(VectorType& vector, Index start, Index size) : Base(vector, IsColVector ? start : 0, IsColVector ? 0 : start, IsColVector ? size : 1, IsColVector ? 1 : size) { if (Eigen::internal::static_assertion<static_cast<bool>(VectorBlock::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {}; } inline VectorBlock(VectorType& vector, Index start) : Base(vector, IsColVector ? start : 0, IsColVector ? 0 : start) { if (Eigen::internal::static_assertion<static_cast<bool>(VectorBlock::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {}; } }; } # 474 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Transpose.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/Transpose.h" namespace Eigen { namespace internal { template<typename MatrixType> struct traits<Transpose<MatrixType> > : public traits<MatrixType> { typedef typename ref_selector<MatrixType>::type MatrixTypeNested; typedef typename remove_reference<MatrixTypeNested>::type MatrixTypeNestedPlain; enum { RowsAtCompileTime = MatrixType::ColsAtCompileTime, ColsAtCompileTime = MatrixType::RowsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxColsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxRowsAtCompileTime, FlagsLvalueBit = is_lvalue<MatrixType>::value ? LvalueBit : 0, Flags0 = traits<MatrixTypeNestedPlain>::Flags & ~(LvalueBit | NestByRefBit), Flags1 = Flags0 | FlagsLvalueBit, Flags = Flags1 ^ RowMajorBit, InnerStrideAtCompileTime = inner_stride_at_compile_time<MatrixType>::ret, OuterStrideAtCompileTime = outer_stride_at_compile_time<MatrixType>::ret }; }; } template<typename MatrixType, typename StorageKind> class TransposeImpl; # 52 "eigen-3.3.7/Eigen/src/Core/Transpose.h" template<typename MatrixType> class Transpose : public TransposeImpl<MatrixType,typename internal::traits<MatrixType>::StorageKind> { public: typedef typename internal::ref_selector<MatrixType>::non_const_type MatrixTypeNested; typedef typename TransposeImpl<MatrixType,typename internal::traits<MatrixType>::StorageKind>::Base Base; typedef typename Eigen::internal::traits<Transpose>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Transpose>::type Nested; typedef typename Eigen::internal::traits<Transpose>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Transpose>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Transpose>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Transpose>::ColsAtCompileTime, Flags = Eigen::internal::traits<Transpose>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename internal::remove_all<MatrixType>::type NestedExpression; explicit inline Transpose(MatrixType& matrix) : m_matrix(matrix) {} using Base::operator =; inline Transpose& operator=(const Transpose& other) { Base::operator=(other); return *this; } inline Index rows() const { return m_matrix.cols(); } inline Index cols() const { return m_matrix.rows(); } const typename internal::remove_all<MatrixTypeNested>::type& nestedExpression() const { return m_matrix; } typename internal::remove_reference<MatrixTypeNested>::type& nestedExpression() { return m_matrix; } void resize(Index nrows, Index ncols) { m_matrix.resize(ncols,nrows); } protected: typename internal::ref_selector<MatrixType>::non_const_type m_matrix; }; namespace internal { template<typename MatrixType, bool HasDirectAccess = has_direct_access<MatrixType>::ret> struct TransposeImpl_base { typedef typename dense_xpr_base<Transpose<MatrixType> >::type type; }; template<typename MatrixType> struct TransposeImpl_base<MatrixType, false> { typedef typename dense_xpr_base<Transpose<MatrixType> >::type type; }; } template<typename XprType, typename StorageKind> class TransposeImpl : public internal::generic_xpr_base<Transpose<XprType> >::type { public: typedef typename internal::generic_xpr_base<Transpose<XprType> >::type Base; }; template<typename MatrixType> class TransposeImpl<MatrixType,Dense> : public internal::TransposeImpl_base<MatrixType>::type { public: typedef typename internal::TransposeImpl_base<MatrixType>::type Base; using Base::coeffRef; typedef typename Eigen::internal::traits<Transpose<MatrixType> >::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Transpose<MatrixType> >::type Nested; typedef typename Eigen::internal::traits<Transpose<MatrixType> >::StorageKind StorageKind; typedef typename Eigen::internal::traits<Transpose<MatrixType> >::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Transpose<MatrixType> >::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Transpose<MatrixType> >::ColsAtCompileTime, Flags = Eigen::internal::traits<Transpose<MatrixType> >::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; using Base::operator =; inline TransposeImpl& operator=(const TransposeImpl& other) { Base::operator=(other); return *this; } inline Index innerStride() const { return derived().nestedExpression().innerStride(); } inline Index outerStride() const { return derived().nestedExpression().outerStride(); } typedef typename internal::conditional< internal::is_lvalue<MatrixType>::value, Scalar, const Scalar >::type ScalarWithConstIfNotLvalue; inline ScalarWithConstIfNotLvalue* data() { return derived().nestedExpression().data(); } inline const Scalar* data() const { return derived().nestedExpression().data(); } inline const Scalar& coeffRef(Index rowId, Index colId) const { return derived().nestedExpression().coeffRef(colId, rowId); } inline const Scalar& coeffRef(Index index) const { return derived().nestedExpression().coeffRef(index); } }; # 170 "eigen-3.3.7/Eigen/src/Core/Transpose.h" template<typename Derived> inline Transpose<Derived> DenseBase<Derived>::transpose() { return TransposeReturnType(derived()); } template<typename Derived> inline typename DenseBase<Derived>::ConstTransposeReturnType DenseBase<Derived>::transpose() const { return ConstTransposeReturnType(derived()); } # 208 "eigen-3.3.7/Eigen/src/Core/Transpose.h" template<typename Derived> inline const typename MatrixBase<Derived>::AdjointReturnType MatrixBase<Derived>::adjoint() const { return AdjointReturnType(this->transpose()); } namespace internal { template<typename MatrixType, bool IsSquare = (MatrixType::RowsAtCompileTime == MatrixType::ColsAtCompileTime) && MatrixType::RowsAtCompileTime!=Dynamic, bool MatchPacketSize = (int(MatrixType::RowsAtCompileTime) == int(internal::packet_traits<typename MatrixType::Scalar>::size)) && (internal::evaluator<MatrixType>::Flags&PacketAccessBit) > struct inplace_transpose_selector; template<typename MatrixType> struct inplace_transpose_selector<MatrixType,true,false> { static void run(MatrixType& m) { m.matrix().template triangularView<StrictlyUpper>().swap(m.matrix().transpose()); } }; template<typename MatrixType> struct inplace_transpose_selector<MatrixType,true,true> { static void run(MatrixType& m) { typedef typename MatrixType::Scalar Scalar; typedef typename internal::packet_traits<typename MatrixType::Scalar>::type Packet; const Index PacketSize = internal::packet_traits<Scalar>::size; const Index Alignment = internal::evaluator<MatrixType>::Alignment; PacketBlock<Packet> A; for (Index i=0; i<PacketSize; ++i) A.packet[i] = m.template packetByOuterInner<Alignment>(i,0); internal::ptranspose(A); for (Index i=0; i<PacketSize; ++i) m.template writePacket<Alignment>(m.rowIndexByOuterInner(i,0), m.colIndexByOuterInner(i,0), A.packet[i]); } }; template<typename MatrixType,bool MatchPacketSize> struct inplace_transpose_selector<MatrixType,false,MatchPacketSize> { static void run(MatrixType& m) { if (m.rows()==m.cols()) m.matrix().template triangularView<StrictlyUpper>().swap(m.matrix().transpose()); else m = m.transpose().eval(); } }; } # 283 "eigen-3.3.7/Eigen/src/Core/Transpose.h" template<typename Derived> inline void DenseBase<Derived>::transposeInPlace() { (((rows() == cols() || (RowsAtCompileTime == Dynamic && ColsAtCompileTime == Dynamic)) && "transposeInPlace() called on a non-square non-resizable matrix") ? static_cast<void> (0) : __assert_fail ("(rows() == cols() || (RowsAtCompileTime == Dynamic && ColsAtCompileTime == Dynamic)) && \"transposeInPlace() called on a non-square non-resizable matrix\"", "eigen-3.3.7/Eigen/src/Core/Transpose.h" # 286 "eigen-3.3.7/Eigen/src/Core/Transpose.h" , 287 # 286 "eigen-3.3.7/Eigen/src/Core/Transpose.h" , __PRETTY_FUNCTION__)) ; internal::inplace_transpose_selector<Derived>::run(derived()); } # 314 "eigen-3.3.7/Eigen/src/Core/Transpose.h" template<typename Derived> inline void MatrixBase<Derived>::adjointInPlace() { derived() = adjoint().eval(); } namespace internal { template<bool DestIsTransposed, typename OtherDerived> struct check_transpose_aliasing_compile_time_selector { enum { ret = bool(blas_traits<OtherDerived>::IsTransposed) != DestIsTransposed }; }; template<bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB> struct check_transpose_aliasing_compile_time_selector<DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> > { enum { ret = bool(blas_traits<DerivedA>::IsTransposed) != DestIsTransposed || bool(blas_traits<DerivedB>::IsTransposed) != DestIsTransposed }; }; template<typename Scalar, bool DestIsTransposed, typename OtherDerived> struct check_transpose_aliasing_run_time_selector { static bool run(const Scalar* dest, const OtherDerived& src) { return (bool(blas_traits<OtherDerived>::IsTransposed) != DestIsTransposed) && (dest!=0 && dest==(const Scalar*)extract_data(src)); } }; template<typename Scalar, bool DestIsTransposed, typename BinOp, typename DerivedA, typename DerivedB> struct check_transpose_aliasing_run_time_selector<Scalar,DestIsTransposed,CwiseBinaryOp<BinOp,DerivedA,DerivedB> > { static bool run(const Scalar* dest, const CwiseBinaryOp<BinOp,DerivedA,DerivedB>& src) { return ((blas_traits<DerivedA>::IsTransposed != DestIsTransposed) && (dest!=0 && dest==(const Scalar*)extract_data(src.lhs()))) || ((blas_traits<DerivedB>::IsTransposed != DestIsTransposed) && (dest!=0 && dest==(const Scalar*)extract_data(src.rhs()))); } }; template<typename Derived, typename OtherDerived, bool MightHaveTransposeAliasing = check_transpose_aliasing_compile_time_selector <blas_traits<Derived>::IsTransposed,OtherDerived>::ret > struct checkTransposeAliasing_impl { static void run(const Derived& dst, const OtherDerived& other) { (((!check_transpose_aliasing_run_time_selector <typename Derived::Scalar,blas_traits<Derived>::IsTransposed,OtherDerived> ::run(extract_data(dst), other)) && "aliasing detected during transposition, use transposeInPlace() " "or evaluate the rhs into a temporary using .eval()") ? static_cast<void> (0) : __assert_fail ("(!check_transpose_aliasing_run_time_selector <typename Derived::Scalar,blas_traits<Derived>::IsTransposed,OtherDerived> ::run(extract_data(dst), other)) && \"aliasing detected during transposition, use transposeInPlace() \" \"or evaluate the rhs into a temporary using .eval()\"", "eigen-3.3.7/Eigen/src/Core/Transpose.h" # 374 "eigen-3.3.7/Eigen/src/Core/Transpose.h" , 378 # 374 "eigen-3.3.7/Eigen/src/Core/Transpose.h" , __PRETTY_FUNCTION__)) ; } }; template<typename Derived, typename OtherDerived> struct checkTransposeAliasing_impl<Derived, OtherDerived, false> { static void run(const Derived&, const OtherDerived&) { } }; template<typename Dst, typename Src> void check_for_aliasing(const Dst &dst, const Src &src) { internal::checkTransposeAliasing_impl<Dst, Src>::run(dst, src); } } } # 475 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/DiagonalMatrix.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/DiagonalMatrix.h" namespace Eigen { template<typename Derived> class DiagonalBase : public EigenBase<Derived> { public: typedef typename internal::traits<Derived>::DiagonalVectorType DiagonalVectorType; typedef typename DiagonalVectorType::Scalar Scalar; typedef typename DiagonalVectorType::RealScalar RealScalar; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::StorageIndex StorageIndex; enum { RowsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, ColsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, MaxRowsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, MaxColsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, IsVectorAtCompileTime = 0, Flags = NoPreferredStorageOrderBit }; typedef Matrix<Scalar, RowsAtCompileTime, ColsAtCompileTime, 0, MaxRowsAtCompileTime, MaxColsAtCompileTime> DenseMatrixType; typedef DenseMatrixType DenseType; typedef DiagonalMatrix<Scalar,DiagonalVectorType::SizeAtCompileTime,DiagonalVectorType::MaxSizeAtCompileTime> PlainObject; inline const Derived& derived() const { return *static_cast<const Derived*>(this); } inline Derived& derived() { return *static_cast<Derived*>(this); } DenseMatrixType toDenseMatrix() const { return derived(); } inline const DiagonalVectorType& diagonal() const { return derived().diagonal(); } inline DiagonalVectorType& diagonal() { return derived().diagonal(); } inline Index rows() const { return diagonal().size(); } inline Index cols() const { return diagonal().size(); } template<typename MatrixDerived> const Product<Derived,MatrixDerived,LazyProduct> operator*(const MatrixBase<MatrixDerived> &matrix) const { return Product<Derived, MatrixDerived, LazyProduct>(derived(),matrix.derived()); } typedef DiagonalWrapper<const CwiseUnaryOp<internal::scalar_inverse_op<Scalar>, const DiagonalVectorType> > InverseReturnType; inline const InverseReturnType inverse() const { return InverseReturnType(diagonal().cwiseInverse()); } inline const DiagonalWrapper<const CwiseBinaryOp<internal::scalar_product_op<typename internal::traits<DiagonalVectorType>::Scalar,Scalar>, const DiagonalVectorType, const typename internal::plain_constant_type<DiagonalVectorType,Scalar>::type> > operator*(const Scalar& scalar) const { return DiagonalWrapper<const CwiseBinaryOp<internal::scalar_product_op<typename internal::traits<DiagonalVectorType>::Scalar,Scalar>, const DiagonalVectorType, const typename internal::plain_constant_type<DiagonalVectorType,Scalar>::type> >(diagonal() * scalar); } friend inline const DiagonalWrapper<const CwiseBinaryOp<internal::scalar_product_op<Scalar,typename internal::traits<DiagonalVectorType>::Scalar>, const typename internal::plain_constant_type<DiagonalVectorType,Scalar>::type, const DiagonalVectorType> > operator*(const Scalar& scalar, const DiagonalBase& other) { return DiagonalWrapper<const CwiseBinaryOp<internal::scalar_product_op<Scalar,typename internal::traits<DiagonalVectorType>::Scalar>, const typename internal::plain_constant_type<DiagonalVectorType,Scalar>::type, const DiagonalVectorType> >(scalar * other.diagonal()); } }; # 103 "eigen-3.3.7/Eigen/src/Core/DiagonalMatrix.h" namespace internal { template<typename _Scalar, int SizeAtCompileTime, int MaxSizeAtCompileTime> struct traits<DiagonalMatrix<_Scalar,SizeAtCompileTime,MaxSizeAtCompileTime> > : traits<Matrix<_Scalar,SizeAtCompileTime,SizeAtCompileTime,0,MaxSizeAtCompileTime,MaxSizeAtCompileTime> > { typedef Matrix<_Scalar,SizeAtCompileTime,1,0,MaxSizeAtCompileTime,1> DiagonalVectorType; typedef DiagonalShape StorageKind; enum { Flags = LvalueBit | NoPreferredStorageOrderBit }; }; } template<typename _Scalar, int SizeAtCompileTime, int MaxSizeAtCompileTime> class DiagonalMatrix : public DiagonalBase<DiagonalMatrix<_Scalar,SizeAtCompileTime,MaxSizeAtCompileTime> > { public: typedef typename internal::traits<DiagonalMatrix>::DiagonalVectorType DiagonalVectorType; typedef const DiagonalMatrix& Nested; typedef _Scalar Scalar; typedef typename internal::traits<DiagonalMatrix>::StorageKind StorageKind; typedef typename internal::traits<DiagonalMatrix>::StorageIndex StorageIndex; protected: DiagonalVectorType m_diagonal; public: inline const DiagonalVectorType& diagonal() const { return m_diagonal; } inline DiagonalVectorType& diagonal() { return m_diagonal; } inline DiagonalMatrix() {} explicit inline DiagonalMatrix(Index dim) : m_diagonal(dim) {} inline DiagonalMatrix(const Scalar& x, const Scalar& y) : m_diagonal(x,y) {} inline DiagonalMatrix(const Scalar& x, const Scalar& y, const Scalar& z) : m_diagonal(x,y,z) {} template<typename OtherDerived> inline DiagonalMatrix(const DiagonalBase<OtherDerived>& other) : m_diagonal(other.diagonal()) {} inline DiagonalMatrix(const DiagonalMatrix& other) : m_diagonal(other.diagonal()) {} template<typename OtherDerived> explicit inline DiagonalMatrix(const MatrixBase<OtherDerived>& other) : m_diagonal(other) {} template<typename OtherDerived> DiagonalMatrix& operator=(const DiagonalBase<OtherDerived>& other) { m_diagonal = other.diagonal(); return *this; } DiagonalMatrix& operator=(const DiagonalMatrix& other) { m_diagonal = other.diagonal(); return *this; } inline void resize(Index size) { m_diagonal.resize(size); } inline void setZero() { m_diagonal.setZero(); } inline void setZero(Index size) { m_diagonal.setZero(size); } inline void setIdentity() { m_diagonal.setOnes(); } inline void setIdentity(Index size) { m_diagonal.setOnes(size); } }; # 225 "eigen-3.3.7/Eigen/src/Core/DiagonalMatrix.h" namespace internal { template<typename _DiagonalVectorType> struct traits<DiagonalWrapper<_DiagonalVectorType> > { typedef _DiagonalVectorType DiagonalVectorType; typedef typename DiagonalVectorType::Scalar Scalar; typedef typename DiagonalVectorType::StorageIndex StorageIndex; typedef DiagonalShape StorageKind; typedef typename traits<DiagonalVectorType>::XprKind XprKind; enum { RowsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, ColsAtCompileTime = DiagonalVectorType::SizeAtCompileTime, MaxRowsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, MaxColsAtCompileTime = DiagonalVectorType::MaxSizeAtCompileTime, Flags = (traits<DiagonalVectorType>::Flags & LvalueBit) | NoPreferredStorageOrderBit }; }; } template<typename _DiagonalVectorType> class DiagonalWrapper : public DiagonalBase<DiagonalWrapper<_DiagonalVectorType> >, internal::no_assignment_operator { public: typedef _DiagonalVectorType DiagonalVectorType; typedef DiagonalWrapper Nested; explicit inline DiagonalWrapper(DiagonalVectorType& a_diagonal) : m_diagonal(a_diagonal) {} const DiagonalVectorType& diagonal() const { return m_diagonal; } protected: typename DiagonalVectorType::Nested m_diagonal; }; # 275 "eigen-3.3.7/Eigen/src/Core/DiagonalMatrix.h" template<typename Derived> inline const DiagonalWrapper<const Derived> MatrixBase<Derived>::asDiagonal() const { return DiagonalWrapper<const Derived>(derived()); } # 290 "eigen-3.3.7/Eigen/src/Core/DiagonalMatrix.h" template<typename Derived> bool MatrixBase<Derived>::isDiagonal(const RealScalar& prec) const { if(cols() != rows()) return false; RealScalar maxAbsOnDiagonal = static_cast<RealScalar>(-1); for(Index j = 0; j < cols(); ++j) { RealScalar absOnDiagonal = numext::abs(coeff(j,j)); if(absOnDiagonal > maxAbsOnDiagonal) maxAbsOnDiagonal = absOnDiagonal; } for(Index j = 0; j < cols(); ++j) for(Index i = 0; i < j; ++i) { if(!internal::isMuchSmallerThan(coeff(i, j), maxAbsOnDiagonal, prec)) return false; if(!internal::isMuchSmallerThan(coeff(j, i), maxAbsOnDiagonal, prec)) return false; } return true; } namespace internal { template<> struct storage_kind_to_shape<DiagonalShape> { typedef DiagonalShape Shape; }; struct Diagonal2Dense {}; template<> struct AssignmentKind<DenseShape,DiagonalShape> { typedef Diagonal2Dense Kind; }; template< typename DstXprType, typename SrcXprType, typename Functor> struct Assignment<DstXprType, SrcXprType, Functor, Diagonal2Dense> { static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename SrcXprType::Scalar> & ) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); dst.setZero(); dst.diagonal() = src.diagonal(); } static void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op<typename DstXprType::Scalar,typename SrcXprType::Scalar> & ) { dst.diagonal() += src.diagonal(); } static void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op<typename DstXprType::Scalar,typename SrcXprType::Scalar> & ) { dst.diagonal() -= src.diagonal(); } }; } } # 476 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Diagonal.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/Diagonal.h" namespace Eigen { # 35 "eigen-3.3.7/Eigen/src/Core/Diagonal.h" namespace internal { template<typename MatrixType, int DiagIndex> struct traits<Diagonal<MatrixType,DiagIndex> > : traits<MatrixType> { typedef typename ref_selector<MatrixType>::type MatrixTypeNested; typedef typename remove_reference<MatrixTypeNested>::type _MatrixTypeNested; typedef typename MatrixType::StorageKind StorageKind; enum { RowsAtCompileTime = (int(DiagIndex) == DynamicIndex || int(MatrixType::SizeAtCompileTime) == Dynamic) ? Dynamic : ((((int)MatrixType::RowsAtCompileTime - (((int)-DiagIndex >= (int)0) ? (int)-DiagIndex : (int)0) <= (int)MatrixType::ColsAtCompileTime - (((int)DiagIndex >= (int)0) ? (int)DiagIndex : (int)0)) ? (int)MatrixType::RowsAtCompileTime - (((int)-DiagIndex >= (int)0) ? (int)-DiagIndex : (int)0) : (int)MatrixType::ColsAtCompileTime - (((int)DiagIndex >= (int)0) ? (int)DiagIndex : (int)0)) ), ColsAtCompileTime = 1, MaxRowsAtCompileTime = int(MatrixType::MaxSizeAtCompileTime) == Dynamic ? Dynamic : DiagIndex == DynamicIndex ? (((int)MatrixType::MaxRowsAtCompileTime == 0 || (int)MatrixType::MaxColsAtCompileTime == 0) ? 0 : ((int)MatrixType::MaxRowsAtCompileTime == 1 || (int)MatrixType::MaxColsAtCompileTime == 1) ? 1 : ((int)MatrixType::MaxRowsAtCompileTime == Dynamic && (int)MatrixType::MaxColsAtCompileTime == Dynamic) ? Dynamic : ((int)MatrixType::MaxRowsAtCompileTime == Dynamic) ? (int)MatrixType::MaxColsAtCompileTime : ((int)MatrixType::MaxColsAtCompileTime == Dynamic) ? (int)MatrixType::MaxRowsAtCompileTime : ((int)MatrixType::MaxRowsAtCompileTime <= (int)MatrixType::MaxColsAtCompileTime) ? (int)MatrixType::MaxRowsAtCompileTime : (int)MatrixType::MaxColsAtCompileTime) : ((((int)MatrixType::MaxRowsAtCompileTime - (((int)-DiagIndex >= (int)0) ? (int)-DiagIndex : (int)0) <= (int)MatrixType::MaxColsAtCompileTime - (((int)DiagIndex >= (int)0) ? (int)DiagIndex : (int)0)) ? (int)MatrixType::MaxRowsAtCompileTime - (((int)-DiagIndex >= (int)0) ? (int)-DiagIndex : (int)0) : (int)MatrixType::MaxColsAtCompileTime - (((int)DiagIndex >= (int)0) ? (int)DiagIndex : (int)0)) ), MaxColsAtCompileTime = 1, MaskLvalueBit = is_lvalue<MatrixType>::value ? LvalueBit : 0, Flags = (unsigned int)_MatrixTypeNested::Flags & (RowMajorBit | MaskLvalueBit | DirectAccessBit) & ~RowMajorBit, MatrixTypeOuterStride = outer_stride_at_compile_time<MatrixType>::ret, InnerStrideAtCompileTime = MatrixTypeOuterStride == Dynamic ? Dynamic : MatrixTypeOuterStride+1, OuterStrideAtCompileTime = 0 }; }; } template<typename MatrixType, int _DiagIndex> class Diagonal : public internal::dense_xpr_base< Diagonal<MatrixType,_DiagIndex> >::type { public: enum { DiagIndex = _DiagIndex }; typedef typename internal::dense_xpr_base<Diagonal>::type Base; typedef typename Eigen::internal::traits<Diagonal>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Diagonal>::type Nested; typedef typename Eigen::internal::traits<Diagonal>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Diagonal>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Diagonal>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Diagonal>::ColsAtCompileTime, Flags = Eigen::internal::traits<Diagonal>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; explicit inline Diagonal(MatrixType& matrix, Index a_index = DiagIndex) : m_matrix(matrix), m_index(a_index) { ((a_index <= m_matrix.cols() && -a_index <= m_matrix.rows()) ? static_cast<void> (0) : __assert_fail ("a_index <= m_matrix.cols() && -a_index <= m_matrix.rows()", "eigen-3.3.7/Eigen/src/Core/Diagonal.h", 75, __PRETTY_FUNCTION__)); } using Base::operator =; inline Diagonal& operator=(const Diagonal& other) { Base::operator=(other); return *this; } inline Index rows() const { return m_index.value()<0 ? numext::mini<Index>(m_matrix.cols(),m_matrix.rows()+m_index.value()) : numext::mini<Index>(m_matrix.rows(),m_matrix.cols()-m_index.value()); } inline Index cols() const { return 1; } inline Index innerStride() const { return m_matrix.outerStride() + 1; } inline Index outerStride() const { return 0; } typedef typename internal::conditional< internal::is_lvalue<MatrixType>::value, Scalar, const Scalar >::type ScalarWithConstIfNotLvalue; inline ScalarWithConstIfNotLvalue* data() { return &(m_matrix.coeffRef(rowOffset(), colOffset())); } inline const Scalar* data() const { return &(m_matrix.coeffRef(rowOffset(), colOffset())); } inline Scalar& coeffRef(Index row, Index) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<MatrixType>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} return m_matrix.coeffRef(row+rowOffset(), row+colOffset()); } inline const Scalar& coeffRef(Index row, Index) const { return m_matrix.coeffRef(row+rowOffset(), row+colOffset()); } inline CoeffReturnType coeff(Index row, Index) const { return m_matrix.coeff(row+rowOffset(), row+colOffset()); } inline Scalar& coeffRef(Index idx) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<MatrixType>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} return m_matrix.coeffRef(idx+rowOffset(), idx+colOffset()); } inline const Scalar& coeffRef(Index idx) const { return m_matrix.coeffRef(idx+rowOffset(), idx+colOffset()); } inline CoeffReturnType coeff(Index idx) const { return m_matrix.coeff(idx+rowOffset(), idx+colOffset()); } inline const typename internal::remove_all<typename MatrixType::Nested>::type& nestedExpression() const { return m_matrix; } inline Index index() const { return m_index.value(); } protected: typename internal::ref_selector<MatrixType>::non_const_type m_matrix; const internal::variable_if_dynamicindex<Index, DiagIndex> m_index; private: inline Index absDiagIndex() const { return m_index.value()>0 ? m_index.value() : -m_index.value(); } inline Index rowOffset() const { return m_index.value()>0 ? 0 : -m_index.value(); } inline Index colOffset() const { return m_index.value()>0 ? m_index.value() : 0; } template<int LoadMode> typename MatrixType::PacketReturnType packet(Index) const; template<int LoadMode> typename MatrixType::PacketReturnType packet(Index,Index) const; }; # 189 "eigen-3.3.7/Eigen/src/Core/Diagonal.h" template<typename Derived> inline typename MatrixBase<Derived>::DiagonalReturnType MatrixBase<Derived>::diagonal() { return DiagonalReturnType(derived()); } template<typename Derived> inline typename MatrixBase<Derived>::ConstDiagonalReturnType MatrixBase<Derived>::diagonal() const { return ConstDiagonalReturnType(derived()); } # 215 "eigen-3.3.7/Eigen/src/Core/Diagonal.h" template<typename Derived> inline typename MatrixBase<Derived>::DiagonalDynamicIndexReturnType MatrixBase<Derived>::diagonal(Index index) { return DiagonalDynamicIndexReturnType(derived(), index); } template<typename Derived> inline typename MatrixBase<Derived>::ConstDiagonalDynamicIndexReturnType MatrixBase<Derived>::diagonal(Index index) const { return ConstDiagonalDynamicIndexReturnType(derived(), index); } # 241 "eigen-3.3.7/Eigen/src/Core/Diagonal.h" template<typename Derived> template<int Index_> inline typename MatrixBase<Derived>::template DiagonalIndexReturnType<Index_>::Type MatrixBase<Derived>::diagonal() { return typename DiagonalIndexReturnType<Index_>::Type(derived()); } template<typename Derived> template<int Index_> inline typename MatrixBase<Derived>::template ConstDiagonalIndexReturnType<Index_>::Type MatrixBase<Derived>::diagonal() const { return typename ConstDiagonalIndexReturnType<Index_>::Type(derived()); } } # 477 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/DiagonalProduct.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/DiagonalProduct.h" namespace Eigen { template<typename Derived> template<typename DiagonalDerived> inline const Product<Derived, DiagonalDerived, LazyProduct> MatrixBase<Derived>::operator*(const DiagonalBase<DiagonalDerived> &a_diagonal) const { return Product<Derived, DiagonalDerived, LazyProduct>(derived(),a_diagonal.derived()); } } # 478 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Redux.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/Redux.h" namespace Eigen { namespace internal { # 26 "eigen-3.3.7/Eigen/src/Core/Redux.h" template<typename Func, typename Derived> struct redux_traits { public: typedef typename find_best_packet<typename Derived::Scalar,Derived::SizeAtCompileTime>::type PacketType; enum { PacketSize = unpacket_traits<PacketType>::size, InnerMaxSize = int(Derived::IsRowMajor) ? Derived::MaxColsAtCompileTime : Derived::MaxRowsAtCompileTime }; enum { MightVectorize = (int(Derived::Flags)&ActualPacketAccessBit) && (functor_traits<Func>::PacketAccess), MayLinearVectorize = bool(MightVectorize) && (int(Derived::Flags)&LinearAccessBit), MaySliceVectorize = bool(MightVectorize) && int(InnerMaxSize)>=3*PacketSize }; public: enum { Traversal = int(MayLinearVectorize) ? int(LinearVectorizedTraversal) : int(MaySliceVectorize) ? int(SliceVectorizedTraversal) : int(DefaultTraversal) }; public: enum { Cost = Derived::SizeAtCompileTime == Dynamic ? HugeCost : Derived::SizeAtCompileTime * Derived::CoeffReadCost + (Derived::SizeAtCompileTime-1) * functor_traits<Func>::Cost, UnrollingLimit = 100 * (int(Traversal) == int(DefaultTraversal) ? 1 : int(PacketSize)) }; public: enum { Unrolling = Cost <= UnrollingLimit ? CompleteUnrolling : NoUnrolling }; # 82 "eigen-3.3.7/Eigen/src/Core/Redux.h" }; template<typename Func, typename Derived, int Start, int Length> struct redux_novec_unroller { enum { HalfLength = Length/2 }; typedef typename Derived::Scalar Scalar; static inline Scalar run(const Derived &mat, const Func& func) { return func(redux_novec_unroller<Func, Derived, Start, HalfLength>::run(mat,func), redux_novec_unroller<Func, Derived, Start+HalfLength, Length-HalfLength>::run(mat,func)); } }; template<typename Func, typename Derived, int Start> struct redux_novec_unroller<Func, Derived, Start, 1> { enum { outer = Start / Derived::InnerSizeAtCompileTime, inner = Start % Derived::InnerSizeAtCompileTime }; typedef typename Derived::Scalar Scalar; static inline Scalar run(const Derived &mat, const Func&) { return mat.coeffByOuterInner(outer, inner); } }; template<typename Func, typename Derived, int Start> struct redux_novec_unroller<Func, Derived, Start, 0> { typedef typename Derived::Scalar Scalar; static inline Scalar run(const Derived&, const Func&) { return Scalar(); } }; template<typename Func, typename Derived, int Start, int Length> struct redux_vec_unroller { enum { PacketSize = redux_traits<Func, Derived>::PacketSize, HalfLength = Length/2 }; typedef typename Derived::Scalar Scalar; typedef typename redux_traits<Func, Derived>::PacketType PacketScalar; static inline PacketScalar run(const Derived &mat, const Func& func) { return func.packetOp( redux_vec_unroller<Func, Derived, Start, HalfLength>::run(mat,func), redux_vec_unroller<Func, Derived, Start+HalfLength, Length-HalfLength>::run(mat,func) ); } }; template<typename Func, typename Derived, int Start> struct redux_vec_unroller<Func, Derived, Start, 1> { enum { index = Start * redux_traits<Func, Derived>::PacketSize, outer = index / int(Derived::InnerSizeAtCompileTime), inner = index % int(Derived::InnerSizeAtCompileTime), alignment = Derived::Alignment }; typedef typename Derived::Scalar Scalar; typedef typename redux_traits<Func, Derived>::PacketType PacketScalar; static inline PacketScalar run(const Derived &mat, const Func&) { return mat.template packetByOuterInner<alignment,PacketScalar>(outer, inner); } }; template<typename Func, typename Derived, int Traversal = redux_traits<Func, Derived>::Traversal, int Unrolling = redux_traits<Func, Derived>::Unrolling > struct redux_impl; template<typename Func, typename Derived> struct redux_impl<Func, Derived, DefaultTraversal, NoUnrolling> { typedef typename Derived::Scalar Scalar; static inline Scalar run(const Derived &mat, const Func& func) { ((mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix") ? static_cast<void> (0) : __assert_fail ("mat.rows()>0 && mat.cols()>0 && \"you are using an empty matrix\"", "eigen-3.3.7/Eigen/src/Core/Redux.h", 192, __PRETTY_FUNCTION__)); Scalar res; res = mat.coeffByOuterInner(0, 0); for(Index i = 1; i < mat.innerSize(); ++i) res = func(res, mat.coeffByOuterInner(0, i)); for(Index i = 1; i < mat.outerSize(); ++i) for(Index j = 0; j < mat.innerSize(); ++j) res = func(res, mat.coeffByOuterInner(i, j)); return res; } }; template<typename Func, typename Derived> struct redux_impl<Func,Derived, DefaultTraversal, CompleteUnrolling> : public redux_novec_unroller<Func,Derived, 0, Derived::SizeAtCompileTime> {}; template<typename Func, typename Derived> struct redux_impl<Func, Derived, LinearVectorizedTraversal, NoUnrolling> { typedef typename Derived::Scalar Scalar; typedef typename redux_traits<Func, Derived>::PacketType PacketScalar; static Scalar run(const Derived &mat, const Func& func) { const Index size = mat.size(); const Index packetSize = redux_traits<Func, Derived>::PacketSize; const int packetAlignment = unpacket_traits<PacketScalar>::alignment; enum { alignment0 = (bool(Derived::Flags & DirectAccessBit) && bool(packet_traits<Scalar>::AlignedOnScalar)) ? int(packetAlignment) : int(Unaligned), alignment = (((int)alignment0 >= (int)Derived::Alignment) ? (int)alignment0 : (int)Derived::Alignment) }; const Index alignedStart = internal::first_default_aligned(mat.nestedExpression()); const Index alignedSize2 = ((size-alignedStart)/(2*packetSize))*(2*packetSize); const Index alignedSize = ((size-alignedStart)/(packetSize))*(packetSize); const Index alignedEnd2 = alignedStart + alignedSize2; const Index alignedEnd = alignedStart + alignedSize; Scalar res; if(alignedSize) { PacketScalar packet_res0 = mat.template packet<alignment,PacketScalar>(alignedStart); if(alignedSize>packetSize) { PacketScalar packet_res1 = mat.template packet<alignment,PacketScalar>(alignedStart+packetSize); for(Index index = alignedStart + 2*packetSize; index < alignedEnd2; index += 2*packetSize) { packet_res0 = func.packetOp(packet_res0, mat.template packet<alignment,PacketScalar>(index)); packet_res1 = func.packetOp(packet_res1, mat.template packet<alignment,PacketScalar>(index+packetSize)); } packet_res0 = func.packetOp(packet_res0,packet_res1); if(alignedEnd>alignedEnd2) packet_res0 = func.packetOp(packet_res0, mat.template packet<alignment,PacketScalar>(alignedEnd2)); } res = func.predux(packet_res0); for(Index index = 0; index < alignedStart; ++index) res = func(res,mat.coeff(index)); for(Index index = alignedEnd; index < size; ++index) res = func(res,mat.coeff(index)); } else { res = mat.coeff(0); for(Index index = 1; index < size; ++index) res = func(res,mat.coeff(index)); } return res; } }; template<typename Func, typename Derived, int Unrolling> struct redux_impl<Func, Derived, SliceVectorizedTraversal, Unrolling> { typedef typename Derived::Scalar Scalar; typedef typename redux_traits<Func, Derived>::PacketType PacketType; static Scalar run(const Derived &mat, const Func& func) { ((mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix") ? static_cast<void> (0) : __assert_fail ("mat.rows()>0 && mat.cols()>0 && \"you are using an empty matrix\"", "eigen-3.3.7/Eigen/src/Core/Redux.h", 276, __PRETTY_FUNCTION__)); const Index innerSize = mat.innerSize(); const Index outerSize = mat.outerSize(); enum { packetSize = redux_traits<Func, Derived>::PacketSize }; const Index packetedInnerSize = ((innerSize)/packetSize)*packetSize; Scalar res; if(packetedInnerSize) { PacketType packet_res = mat.template packet<Unaligned,PacketType>(0,0); for(Index j=0; j<outerSize; ++j) for(Index i=(j==0?packetSize:0); i<packetedInnerSize; i+=Index(packetSize)) packet_res = func.packetOp(packet_res, mat.template packetByOuterInner<Unaligned,PacketType>(j,i)); res = func.predux(packet_res); for(Index j=0; j<outerSize; ++j) for(Index i=packetedInnerSize; i<innerSize; ++i) res = func(res, mat.coeffByOuterInner(j,i)); } else { res = redux_impl<Func, Derived, DefaultTraversal, NoUnrolling>::run(mat, func); } return res; } }; template<typename Func, typename Derived> struct redux_impl<Func, Derived, LinearVectorizedTraversal, CompleteUnrolling> { typedef typename Derived::Scalar Scalar; typedef typename redux_traits<Func, Derived>::PacketType PacketScalar; enum { PacketSize = redux_traits<Func, Derived>::PacketSize, Size = Derived::SizeAtCompileTime, VectorizedSize = (Size / PacketSize) * PacketSize }; static inline Scalar run(const Derived &mat, const Func& func) { ((mat.rows()>0 && mat.cols()>0 && "you are using an empty matrix") ? static_cast<void> (0) : __assert_fail ("mat.rows()>0 && mat.cols()>0 && \"you are using an empty matrix\"", "eigen-3.3.7/Eigen/src/Core/Redux.h", 319, __PRETTY_FUNCTION__)); if (VectorizedSize > 0) { Scalar res = func.predux(redux_vec_unroller<Func, Derived, 0, Size / PacketSize>::run(mat,func)); if (VectorizedSize != Size) res = func(res,redux_novec_unroller<Func, Derived, VectorizedSize, Size-VectorizedSize>::run(mat,func)); return res; } else { return redux_novec_unroller<Func, Derived, 0, Size>::run(mat,func); } } }; template<typename _XprType> class redux_evaluator { public: typedef _XprType XprType; explicit redux_evaluator(const XprType &xpr) : m_evaluator(xpr), m_xpr(xpr) {} typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; typedef typename XprType::PacketScalar PacketScalar; typedef typename XprType::PacketReturnType PacketReturnType; enum { MaxRowsAtCompileTime = XprType::MaxRowsAtCompileTime, MaxColsAtCompileTime = XprType::MaxColsAtCompileTime, Flags = evaluator<XprType>::Flags & ~DirectAccessBit, IsRowMajor = XprType::IsRowMajor, SizeAtCompileTime = XprType::SizeAtCompileTime, InnerSizeAtCompileTime = XprType::InnerSizeAtCompileTime, CoeffReadCost = evaluator<XprType>::CoeffReadCost, Alignment = evaluator<XprType>::Alignment }; Index rows() const { return m_xpr.rows(); } Index cols() const { return m_xpr.cols(); } Index size() const { return m_xpr.size(); } Index innerSize() const { return m_xpr.innerSize(); } Index outerSize() const { return m_xpr.outerSize(); } CoeffReturnType coeff(Index row, Index col) const { return m_evaluator.coeff(row, col); } CoeffReturnType coeff(Index index) const { return m_evaluator.coeff(index); } template<int LoadMode, typename PacketType> PacketType packet(Index row, Index col) const { return m_evaluator.template packet<LoadMode,PacketType>(row, col); } template<int LoadMode, typename PacketType> PacketType packet(Index index) const { return m_evaluator.template packet<LoadMode,PacketType>(index); } CoeffReturnType coeffByOuterInner(Index outer, Index inner) const { return m_evaluator.coeff(IsRowMajor ? outer : inner, IsRowMajor ? inner : outer); } template<int LoadMode, typename PacketType> PacketType packetByOuterInner(Index outer, Index inner) const { return m_evaluator.template packet<LoadMode,PacketType>(IsRowMajor ? outer : inner, IsRowMajor ? inner : outer); } const XprType & nestedExpression() const { return m_xpr; } protected: internal::evaluator<XprType> m_evaluator; const XprType &m_xpr; }; } # 408 "eigen-3.3.7/Eigen/src/Core/Redux.h" template<typename Derived> template<typename Func> inline typename internal::traits<Derived>::Scalar DenseBase<Derived>::redux(const Func& func) const { ((this->rows()>0 && this->cols()>0 && "you are using an empty matrix") ? static_cast<void> (0) : __assert_fail ("this->rows()>0 && this->cols()>0 && \"you are using an empty matrix\"", "eigen-3.3.7/Eigen/src/Core/Redux.h", 413, __PRETTY_FUNCTION__)); typedef typename internal::redux_evaluator<Derived> ThisEvaluator; ThisEvaluator thisEval(derived()); return internal::redux_impl<Func, ThisEvaluator>::run(thisEval, func); } template<typename Derived> inline typename internal::traits<Derived>::Scalar DenseBase<Derived>::minCoeff() const { return derived().redux(Eigen::internal::scalar_min_op<Scalar,Scalar>()); } template<typename Derived> inline typename internal::traits<Derived>::Scalar DenseBase<Derived>::maxCoeff() const { return derived().redux(Eigen::internal::scalar_max_op<Scalar,Scalar>()); } template<typename Derived> inline typename internal::traits<Derived>::Scalar DenseBase<Derived>::sum() const { if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0)) return Scalar(0); return derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>()); } template<typename Derived> inline typename internal::traits<Derived>::Scalar DenseBase<Derived>::mean() const { return Scalar(derived().redux(Eigen::internal::scalar_sum_op<Scalar,Scalar>())) / Scalar(this->size()); } # 481 "eigen-3.3.7/Eigen/src/Core/Redux.h" template<typename Derived> inline typename internal::traits<Derived>::Scalar DenseBase<Derived>::prod() const { if(SizeAtCompileTime==0 || (SizeAtCompileTime==Dynamic && size()==0)) return Scalar(1); return derived().redux(Eigen::internal::scalar_product_op<Scalar>()); } template<typename Derived> inline typename internal::traits<Derived>::Scalar MatrixBase<Derived>::trace() const { return derived().diagonal().sum(); } } # 479 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Visitor.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Visitor.h" namespace Eigen { namespace internal { template<typename Visitor, typename Derived, int UnrollCount> struct visitor_impl { enum { col = (UnrollCount-1) / Derived::RowsAtCompileTime, row = (UnrollCount-1) % Derived::RowsAtCompileTime }; static inline void run(const Derived &mat, Visitor& visitor) { visitor_impl<Visitor, Derived, UnrollCount-1>::run(mat, visitor); visitor(mat.coeff(row, col), row, col); } }; template<typename Visitor, typename Derived> struct visitor_impl<Visitor, Derived, 1> { static inline void run(const Derived &mat, Visitor& visitor) { return visitor.init(mat.coeff(0, 0), 0, 0); } }; template<typename Visitor, typename Derived> struct visitor_impl<Visitor, Derived, Dynamic> { static inline void run(const Derived& mat, Visitor& visitor) { visitor.init(mat.coeff(0,0), 0, 0); for(Index i = 1; i < mat.rows(); ++i) visitor(mat.coeff(i, 0), i, 0); for(Index j = 1; j < mat.cols(); ++j) for(Index i = 0; i < mat.rows(); ++i) visitor(mat.coeff(i, j), i, j); } }; template<typename XprType> class visitor_evaluator { public: explicit visitor_evaluator(const XprType &xpr) : m_evaluator(xpr), m_xpr(xpr) {} typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; enum { RowsAtCompileTime = XprType::RowsAtCompileTime, CoeffReadCost = internal::evaluator<XprType>::CoeffReadCost }; Index rows() const { return m_xpr.rows(); } Index cols() const { return m_xpr.cols(); } Index size() const { return m_xpr.size(); } CoeffReturnType coeff(Index row, Index col) const { return m_evaluator.coeff(row, col); } protected: internal::evaluator<XprType> m_evaluator; const XprType &m_xpr; }; } # 104 "eigen-3.3.7/Eigen/src/Core/Visitor.h" template<typename Derived> template<typename Visitor> void DenseBase<Derived>::visit(Visitor& visitor) const { typedef typename internal::visitor_evaluator<Derived> ThisEvaluator; ThisEvaluator thisEval(derived()); enum { unroll = SizeAtCompileTime != Dynamic && SizeAtCompileTime * ThisEvaluator::CoeffReadCost + (SizeAtCompileTime-1) * internal::functor_traits<Visitor>::Cost <= 100 }; return internal::visitor_impl<Visitor, ThisEvaluator, unroll ? int(SizeAtCompileTime) : Dynamic>::run(thisEval, visitor); } namespace internal { template <typename Derived> struct coeff_visitor { typedef typename Derived::Scalar Scalar; Index row, col; Scalar res; inline void init(const Scalar& value, Index i, Index j) { res = value; row = i; col = j; } }; template <typename Derived> struct min_coeff_visitor : coeff_visitor<Derived> { typedef typename Derived::Scalar Scalar; void operator() (const Scalar& value, Index i, Index j) { if(value < this->res) { this->res = value; this->row = i; this->col = j; } } }; template<typename Scalar> struct functor_traits<min_coeff_visitor<Scalar> > { enum { Cost = NumTraits<Scalar>::AddCost }; }; template <typename Derived> struct max_coeff_visitor : coeff_visitor<Derived> { typedef typename Derived::Scalar Scalar; void operator() (const Scalar& value, Index i, Index j) { if(value > this->res) { this->res = value; this->row = i; this->col = j; } } }; template<typename Scalar> struct functor_traits<max_coeff_visitor<Scalar> > { enum { Cost = NumTraits<Scalar>::AddCost }; }; } template<typename Derived> template<typename IndexType> typename internal::traits<Derived>::Scalar DenseBase<Derived>::minCoeff(IndexType* rowId, IndexType* colId) const { internal::min_coeff_visitor<Derived> minVisitor; this->visit(minVisitor); *rowId = minVisitor.row; if (colId) *colId = minVisitor.col; return minVisitor.res; } template<typename Derived> template<typename IndexType> typename internal::traits<Derived>::Scalar DenseBase<Derived>::minCoeff(IndexType* index) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} internal::min_coeff_visitor<Derived> minVisitor; this->visit(minVisitor); *index = IndexType((RowsAtCompileTime==1) ? minVisitor.col : minVisitor.row); return minVisitor.res; } template<typename Derived> template<typename IndexType> typename internal::traits<Derived>::Scalar DenseBase<Derived>::maxCoeff(IndexType* rowPtr, IndexType* colPtr) const { internal::max_coeff_visitor<Derived> maxVisitor; this->visit(maxVisitor); *rowPtr = maxVisitor.row; if (colPtr) *colPtr = maxVisitor.col; return maxVisitor.res; } template<typename Derived> template<typename IndexType> typename internal::traits<Derived>::Scalar DenseBase<Derived>::maxCoeff(IndexType* index) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} internal::max_coeff_visitor<Derived> maxVisitor; this->visit(maxVisitor); *index = (RowsAtCompileTime==1) ? maxVisitor.col : maxVisitor.row; return maxVisitor.res; } } # 480 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Fuzzy.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/Fuzzy.h" namespace Eigen { namespace internal { template<typename Derived, typename OtherDerived, bool is_integer = NumTraits<typename Derived::Scalar>::IsInteger> struct isApprox_selector { static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar& prec) { typename internal::nested_eval<Derived,2>::type nested(x); typename internal::nested_eval<OtherDerived,2>::type otherNested(y); return (nested - otherNested).cwiseAbs2().sum() <= prec * prec * numext::mini(nested.cwiseAbs2().sum(), otherNested.cwiseAbs2().sum()); } }; template<typename Derived, typename OtherDerived> struct isApprox_selector<Derived, OtherDerived, true> { static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar&) { return x.matrix() == y.matrix(); } }; template<typename Derived, typename OtherDerived, bool is_integer = NumTraits<typename Derived::Scalar>::IsInteger> struct isMuchSmallerThan_object_selector { static bool run(const Derived& x, const OtherDerived& y, const typename Derived::RealScalar& prec) { return x.cwiseAbs2().sum() <= numext::abs2(prec) * y.cwiseAbs2().sum(); } }; template<typename Derived, typename OtherDerived> struct isMuchSmallerThan_object_selector<Derived, OtherDerived, true> { static bool run(const Derived& x, const OtherDerived&, const typename Derived::RealScalar&) { return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix(); } }; template<typename Derived, bool is_integer = NumTraits<typename Derived::Scalar>::IsInteger> struct isMuchSmallerThan_scalar_selector { static bool run(const Derived& x, const typename Derived::RealScalar& y, const typename Derived::RealScalar& prec) { return x.cwiseAbs2().sum() <= numext::abs2(prec * y); } }; template<typename Derived> struct isMuchSmallerThan_scalar_selector<Derived, true> { static bool run(const Derived& x, const typename Derived::RealScalar&, const typename Derived::RealScalar&) { return x.matrix() == Derived::Zero(x.rows(), x.cols()).matrix(); } }; } # 101 "eigen-3.3.7/Eigen/src/Core/Fuzzy.h" template<typename Derived> template<typename OtherDerived> bool DenseBase<Derived>::isApprox( const DenseBase<OtherDerived>& other, const RealScalar& prec ) const { return internal::isApprox_selector<Derived, OtherDerived>::run(derived(), other.derived(), prec); } # 124 "eigen-3.3.7/Eigen/src/Core/Fuzzy.h" template<typename Derived> bool DenseBase<Derived>::isMuchSmallerThan( const typename NumTraits<Scalar>::Real& other, const RealScalar& prec ) const { return internal::isMuchSmallerThan_scalar_selector<Derived>::run(derived(), other, prec); } # 143 "eigen-3.3.7/Eigen/src/Core/Fuzzy.h" template<typename Derived> template<typename OtherDerived> bool DenseBase<Derived>::isMuchSmallerThan( const DenseBase<OtherDerived>& other, const RealScalar& prec ) const { return internal::isMuchSmallerThan_object_selector<Derived, OtherDerived>::run(derived(), other.derived(), prec); } } # 481 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Swap.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Swap.h" namespace Eigen { namespace internal { template<typename DstEvaluatorTypeT, typename SrcEvaluatorTypeT> class generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, swap_assign_op<typename DstEvaluatorTypeT::Scalar>, Specialized> : public generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, swap_assign_op<typename DstEvaluatorTypeT::Scalar>, BuiltIn> { protected: typedef generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, swap_assign_op<typename DstEvaluatorTypeT::Scalar>, BuiltIn> Base; using Base::m_dst; using Base::m_src; using Base::m_functor; public: typedef typename Base::Scalar Scalar; typedef typename Base::DstXprType DstXprType; typedef swap_assign_op<Scalar> Functor; generic_dense_assignment_kernel(DstEvaluatorTypeT &dst, const SrcEvaluatorTypeT &src, const Functor &func, DstXprType& dstExpr) : Base(dst, src, func, dstExpr) {} template<int StoreMode, int LoadMode, typename PacketType> void assignPacket(Index row, Index col) { PacketType tmp = m_src.template packet<LoadMode,PacketType>(row,col); const_cast<SrcEvaluatorTypeT&>(m_src).template writePacket<LoadMode>(row,col, m_dst.template packet<StoreMode,PacketType>(row,col)); m_dst.template writePacket<StoreMode>(row,col,tmp); } template<int StoreMode, int LoadMode, typename PacketType> void assignPacket(Index index) { PacketType tmp = m_src.template packet<LoadMode,PacketType>(index); const_cast<SrcEvaluatorTypeT&>(m_src).template writePacket<LoadMode>(index, m_dst.template packet<StoreMode,PacketType>(index)); m_dst.template writePacket<StoreMode>(index,tmp); } template<int StoreMode, int LoadMode, typename PacketType> void assignPacketByOuterInner(Index outer, Index inner) { Index row = Base::rowIndexByOuterInner(outer, inner); Index col = Base::colIndexByOuterInner(outer, inner); assignPacket<StoreMode,LoadMode,PacketType>(row, col); } }; } } # 482 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" namespace Eigen { # 27 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" template<typename XprType> struct CommaInitializer { typedef typename XprType::Scalar Scalar; inline CommaInitializer(XprType& xpr, const Scalar& s) : m_xpr(xpr), m_row(0), m_col(1), m_currentBlockRows(1) { m_xpr.coeffRef(0,0) = s; } template<typename OtherDerived> inline CommaInitializer(XprType& xpr, const DenseBase<OtherDerived>& other) : m_xpr(xpr), m_row(0), m_col(other.cols()), m_currentBlockRows(other.rows()) { m_xpr.block(0, 0, other.rows(), other.cols()) = other; } inline CommaInitializer(const CommaInitializer& o) : m_xpr(o.m_xpr), m_row(o.m_row), m_col(o.m_col), m_currentBlockRows(o.m_currentBlockRows) { const_cast<CommaInitializer&>(o).m_row = m_xpr.rows(); const_cast<CommaInitializer&>(o).m_col = m_xpr.cols(); const_cast<CommaInitializer&>(o).m_currentBlockRows = 0; } CommaInitializer& operator,(const Scalar& s) { if (m_col==m_xpr.cols()) { m_row+=m_currentBlockRows; m_col = 0; m_currentBlockRows = 1; ((m_row<m_xpr.rows() && "Too many rows passed to comma initializer (operator<<)") ? static_cast<void> (0) : __assert_fail ("m_row<m_xpr.rows() && \"Too many rows passed to comma initializer (operator<<)\"", "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" # 68 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , 69 # 68 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , __PRETTY_FUNCTION__)) ; } ((m_col<m_xpr.cols() && "Too many coefficients passed to comma initializer (operator<<)") ? static_cast<void> (0) : __assert_fail ("m_col<m_xpr.cols() && \"Too many coefficients passed to comma initializer (operator<<)\"", "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" # 71 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , 72 # 71 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , __PRETTY_FUNCTION__)) ; ((m_currentBlockRows==1) ? static_cast<void> (0) : __assert_fail ("m_currentBlockRows==1", "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h", 73, __PRETTY_FUNCTION__)); m_xpr.coeffRef(m_row, m_col++) = s; return *this; } template<typename OtherDerived> CommaInitializer& operator,(const DenseBase<OtherDerived>& other) { if (m_col==m_xpr.cols() && (other.cols()!=0 || other.rows()!=m_currentBlockRows)) { m_row+=m_currentBlockRows; m_col = 0; m_currentBlockRows = other.rows(); ((m_row+m_currentBlockRows<=m_xpr.rows() && "Too many rows passed to comma initializer (operator<<)") ? static_cast<void> (0) : __assert_fail ("m_row+m_currentBlockRows<=m_xpr.rows() && \"Too many rows passed to comma initializer (operator<<)\"", "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" # 88 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , 89 # 88 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , __PRETTY_FUNCTION__)) ; } (((m_col + other.cols() <= m_xpr.cols()) && "Too many coefficients passed to comma initializer (operator<<)") ? static_cast<void> (0) : __assert_fail ("(m_col + other.cols() <= m_xpr.cols()) && \"Too many coefficients passed to comma initializer (operator<<)\"", "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" # 91 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , 92 # 91 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , __PRETTY_FUNCTION__)) ; ((m_currentBlockRows==other.rows()) ? static_cast<void> (0) : __assert_fail ("m_currentBlockRows==other.rows()", "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h", 93, __PRETTY_FUNCTION__)); m_xpr.template block<OtherDerived::RowsAtCompileTime, OtherDerived::ColsAtCompileTime> (m_row, m_col, other.rows(), other.cols()) = other; m_col += other.cols(); return *this; } inline ~CommaInitializer() { finished(); } # 116 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" inline XprType& finished() { ((((m_row+m_currentBlockRows) == m_xpr.rows() || m_xpr.cols() == 0) && m_col == m_xpr.cols() && "Too few coefficients passed to comma initializer (operator<<)") ? static_cast<void> (0) : __assert_fail ("((m_row+m_currentBlockRows) == m_xpr.rows() || m_xpr.cols() == 0) && m_col == m_xpr.cols() && \"Too few coefficients passed to comma initializer (operator<<)\"", "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" # 118 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , 120 # 118 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" , __PRETTY_FUNCTION__)) ; return m_xpr; } XprType& m_xpr; Index m_row; Index m_col; Index m_currentBlockRows; }; # 143 "eigen-3.3.7/Eigen/src/Core/CommaInitializer.h" template<typename Derived> inline CommaInitializer<Derived> DenseBase<Derived>::operator<< (const Scalar& s) { return CommaInitializer<Derived>(*static_cast<Derived*>(this), s); } template<typename Derived> template<typename OtherDerived> inline CommaInitializer<Derived> DenseBase<Derived>::operator<<(const DenseBase<OtherDerived>& other) { return CommaInitializer<Derived>(*static_cast<Derived *>(this), other); } } # 483 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" namespace Eigen { enum { Large = 2, Small = 3 }; namespace internal { template<int Rows, int Cols, int Depth> struct product_type_selector; template<int Size, int MaxSize> struct product_size_category { enum { is_large = MaxSize == Dynamic || Size >= 8 || (Size==Dynamic && MaxSize>=8), value = is_large ? Large : Size == 1 ? 1 : Small }; }; template<typename Lhs, typename Rhs> struct product_type { typedef typename remove_all<Lhs>::type _Lhs; typedef typename remove_all<Rhs>::type _Rhs; enum { MaxRows = traits<_Lhs>::MaxRowsAtCompileTime, Rows = traits<_Lhs>::RowsAtCompileTime, MaxCols = traits<_Rhs>::MaxColsAtCompileTime, Cols = traits<_Rhs>::ColsAtCompileTime, MaxDepth = (((int)traits<_Lhs>::MaxColsAtCompileTime == 0 || (int)traits<_Rhs>::MaxRowsAtCompileTime == 0) ? 0 : ((int)traits<_Lhs>::MaxColsAtCompileTime == 1 || (int)traits<_Rhs>::MaxRowsAtCompileTime == 1) ? 1 : ((int)traits<_Lhs>::MaxColsAtCompileTime == Dynamic && (int)traits<_Rhs>::MaxRowsAtCompileTime == Dynamic) ? Dynamic : ((int)traits<_Lhs>::MaxColsAtCompileTime == Dynamic) ? (int)traits<_Rhs>::MaxRowsAtCompileTime : ((int)traits<_Rhs>::MaxRowsAtCompileTime == Dynamic) ? (int)traits<_Lhs>::MaxColsAtCompileTime : ((int)traits<_Lhs>::MaxColsAtCompileTime <= (int)traits<_Rhs>::MaxRowsAtCompileTime) ? (int)traits<_Lhs>::MaxColsAtCompileTime : (int)traits<_Rhs>::MaxRowsAtCompileTime) , Depth = (((int)traits<_Lhs>::ColsAtCompileTime == 0 || (int)traits<_Rhs>::RowsAtCompileTime == 0) ? 0 : ((int)traits<_Lhs>::ColsAtCompileTime == 1 || (int)traits<_Rhs>::RowsAtCompileTime == 1) ? 1 : ((int)traits<_Lhs>::ColsAtCompileTime == Dynamic && (int)traits<_Rhs>::RowsAtCompileTime == Dynamic) ? Dynamic : ((int)traits<_Lhs>::ColsAtCompileTime == Dynamic) ? (int)traits<_Rhs>::RowsAtCompileTime : ((int)traits<_Rhs>::RowsAtCompileTime == Dynamic) ? (int)traits<_Lhs>::ColsAtCompileTime : ((int)traits<_Lhs>::ColsAtCompileTime <= (int)traits<_Rhs>::RowsAtCompileTime) ? (int)traits<_Lhs>::ColsAtCompileTime : (int)traits<_Rhs>::RowsAtCompileTime) }; private: enum { rows_select = product_size_category<Rows,MaxRows>::value, cols_select = product_size_category<Cols,MaxCols>::value, depth_select = product_size_category<Depth,MaxDepth>::value }; typedef product_type_selector<rows_select, cols_select, depth_select> selector; public: enum { value = selector::ret, ret = selector::ret }; # 83 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" }; template<int M, int N> struct product_type_selector<M,N,1> { enum { ret = OuterProduct }; }; template<int M> struct product_type_selector<M, 1, 1> { enum { ret = LazyCoeffBasedProductMode }; }; template<int N> struct product_type_selector<1, N, 1> { enum { ret = LazyCoeffBasedProductMode }; }; template<int Depth> struct product_type_selector<1, 1, Depth> { enum { ret = InnerProduct }; }; template<> struct product_type_selector<1, 1, 1> { enum { ret = InnerProduct }; }; template<> struct product_type_selector<Small,1, Small> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<1, Small,Small> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<Small,Small,Small> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<Small, Small, 1> { enum { ret = LazyCoeffBasedProductMode }; }; template<> struct product_type_selector<Small, Large, 1> { enum { ret = LazyCoeffBasedProductMode }; }; template<> struct product_type_selector<Large, Small, 1> { enum { ret = LazyCoeffBasedProductMode }; }; template<> struct product_type_selector<1, Large,Small> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<1, Large,Large> { enum { ret = GemvProduct }; }; template<> struct product_type_selector<1, Small,Large> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<Large,1, Small> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<Large,1, Large> { enum { ret = GemvProduct }; }; template<> struct product_type_selector<Small,1, Large> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<Small,Small,Large> { enum { ret = GemmProduct }; }; template<> struct product_type_selector<Large,Small,Large> { enum { ret = GemmProduct }; }; template<> struct product_type_selector<Small,Large,Large> { enum { ret = GemmProduct }; }; template<> struct product_type_selector<Large,Large,Large> { enum { ret = GemmProduct }; }; template<> struct product_type_selector<Large,Small,Small> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<Small,Large,Small> { enum { ret = CoeffBasedProductMode }; }; template<> struct product_type_selector<Large,Large,Small> { enum { ret = GemmProduct }; }; } # 142 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" namespace internal { template<int Side, int StorageOrder, bool BlasCompatible> struct gemv_dense_selector; } namespace internal { template<typename Scalar,int Size,int MaxSize,bool Cond> struct gemv_static_vector_if; template<typename Scalar,int Size,int MaxSize> struct gemv_static_vector_if<Scalar,Size,MaxSize,false> { inline Scalar* data() { ; return 0; } }; template<typename Scalar,int Size> struct gemv_static_vector_if<Scalar,Size,Dynamic,true> { inline Scalar* data() { return 0; } }; template<typename Scalar,int Size,int MaxSize> struct gemv_static_vector_if<Scalar,Size,MaxSize,true> { enum { ForceAlignment = internal::packet_traits<Scalar>::Vectorizable, PacketSize = internal::packet_traits<Scalar>::size }; internal::plain_array<Scalar,(((int)Size == 0 || (int)MaxSize == 0) ? 0 : ((int)Size == 1 || (int)MaxSize == 1) ? 1 : ((int)Size == Dynamic && (int)MaxSize == Dynamic) ? Dynamic : ((int)Size == Dynamic) ? (int)MaxSize : ((int)MaxSize == Dynamic) ? (int)Size : ((int)Size <= (int)MaxSize) ? (int)Size : (int)MaxSize),0,(((int)AlignedMax <= (int)PacketSize) ? (int)AlignedMax : (int)PacketSize)> m_data; inline Scalar* data() { return m_data.array; } # 185 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" }; template<int StorageOrder, bool BlasCompatible> struct gemv_dense_selector<OnTheLeft,StorageOrder,BlasCompatible> { template<typename Lhs, typename Rhs, typename Dest> static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) { Transpose<Dest> destT(dest); enum { OtherStorageOrder = StorageOrder == RowMajor ? ColMajor : RowMajor }; gemv_dense_selector<OnTheRight,OtherStorageOrder,BlasCompatible> ::run(rhs.transpose(), lhs.transpose(), destT, alpha); } }; template<> struct gemv_dense_selector<OnTheRight,ColMajor,true> { template<typename Lhs, typename Rhs, typename Dest> static inline void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) { typedef typename Lhs::Scalar LhsScalar; typedef typename Rhs::Scalar RhsScalar; typedef typename Dest::Scalar ResScalar; typedef typename Dest::RealScalar RealScalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; typedef Map<Matrix<ResScalar,Dynamic,1>, (((int)AlignedMax <= (int)internal::packet_traits<ResScalar>::size) ? (int)AlignedMax : (int)internal::packet_traits<ResScalar>::size)> MappedDest; ActualLhsType actualLhs = LhsBlasTraits::extract(lhs); ActualRhsType actualRhs = RhsBlasTraits::extract(rhs); ResScalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(lhs) * RhsBlasTraits::extractScalarFactor(rhs); typedef typename conditional<Dest::IsVectorAtCompileTime, Dest, typename Dest::ColXpr>::type ActualDest; enum { EvalToDestAtCompileTime = (ActualDest::InnerStrideAtCompileTime==1), ComplexByReal = (NumTraits<LhsScalar>::IsComplex) && (!NumTraits<RhsScalar>::IsComplex), MightCannotUseDest = (!EvalToDestAtCompileTime) || ComplexByReal }; typedef const_blas_data_mapper<LhsScalar,Index,ColMajor> LhsMapper; typedef const_blas_data_mapper<RhsScalar,Index,RowMajor> RhsMapper; RhsScalar compatibleAlpha = get_factor<ResScalar,RhsScalar>::run(actualAlpha); if(!MightCannotUseDest) { general_matrix_vector_product <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run( actualLhs.rows(), actualLhs.cols(), LhsMapper(actualLhs.data(), actualLhs.outerStride()), RhsMapper(actualRhs.data(), actualRhs.innerStride()), dest.data(), 1, compatibleAlpha); } else { gemv_static_vector_if<ResScalar,ActualDest::SizeAtCompileTime,ActualDest::MaxSizeAtCompileTime,MightCannotUseDest> static_dest; const bool alphaIsCompatible = (!ComplexByReal) || (numext::imag(actualAlpha)==RealScalar(0)); const bool evalToDest = EvalToDestAtCompileTime && alphaIsCompatible; Eigen::internal::check_size_for_overflow<ResScalar>(dest.size()); ResScalar* actualDestPtr = (evalToDest ? dest.data() : static_dest.data())!=0 ? (evalToDest ? dest.data() : static_dest.data()) : reinterpret_cast<ResScalar*>( (sizeof(ResScalar)*dest.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(ResScalar)*dest.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(ResScalar)*dest.size()) ); Eigen::internal::aligned_stack_memory_handler<ResScalar> actualDestPtr_stack_memory_destructor # 258 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" ((evalToDest ? dest.data() : static_dest.data())==0 ? actualDestPtr : 0,dest.size(),sizeof(ResScalar)*dest.size()>131072) ; if(!evalToDest) { if(!alphaIsCompatible) { MappedDest(actualDestPtr, dest.size()).setZero(); compatibleAlpha = RhsScalar(1); } else MappedDest(actualDestPtr, dest.size()) = dest; } general_matrix_vector_product <Index,LhsScalar,LhsMapper,ColMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run( actualLhs.rows(), actualLhs.cols(), LhsMapper(actualLhs.data(), actualLhs.outerStride()), RhsMapper(actualRhs.data(), actualRhs.innerStride()), actualDestPtr, 1, compatibleAlpha); if (!evalToDest) { if(!alphaIsCompatible) dest.matrix() += actualAlpha * MappedDest(actualDestPtr, dest.size()); else dest = MappedDest(actualDestPtr, dest.size()); } } } }; template<> struct gemv_dense_selector<OnTheRight,RowMajor,true> { template<typename Lhs, typename Rhs, typename Dest> static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) { typedef typename Lhs::Scalar LhsScalar; typedef typename Rhs::Scalar RhsScalar; typedef typename Dest::Scalar ResScalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; typedef typename internal::remove_all<ActualRhsType>::type ActualRhsTypeCleaned; typename add_const<ActualLhsType>::type actualLhs = LhsBlasTraits::extract(lhs); typename add_const<ActualRhsType>::type actualRhs = RhsBlasTraits::extract(rhs); ResScalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(lhs) * RhsBlasTraits::extractScalarFactor(rhs); enum { DirectlyUseRhs = ActualRhsTypeCleaned::InnerStrideAtCompileTime==1 }; gemv_static_vector_if<RhsScalar,ActualRhsTypeCleaned::SizeAtCompileTime,ActualRhsTypeCleaned::MaxSizeAtCompileTime,!DirectlyUseRhs> static_rhs; Eigen::internal::check_size_for_overflow<RhsScalar>(actualRhs.size()); RhsScalar* actualRhsPtr = (DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data())!=0 ? (DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data()) : reinterpret_cast<RhsScalar*>( (sizeof(RhsScalar)*actualRhs.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(RhsScalar)*actualRhs.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(RhsScalar)*actualRhs.size()) ); Eigen::internal::aligned_stack_memory_handler<RhsScalar> actualRhsPtr_stack_memory_destructor # 324 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" ((DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data())==0 ? actualRhsPtr : 0,actualRhs.size(),sizeof(RhsScalar)*actualRhs.size()>131072) ; if(!DirectlyUseRhs) { Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, actualRhs.size()) = actualRhs; } typedef const_blas_data_mapper<LhsScalar,Index,RowMajor> LhsMapper; typedef const_blas_data_mapper<RhsScalar,Index,ColMajor> RhsMapper; general_matrix_vector_product <Index,LhsScalar,LhsMapper,RowMajor,LhsBlasTraits::NeedToConjugate,RhsScalar,RhsMapper,RhsBlasTraits::NeedToConjugate>::run( actualLhs.rows(), actualLhs.cols(), LhsMapper(actualLhs.data(), actualLhs.outerStride()), RhsMapper(actualRhsPtr, 1), dest.data(), dest.col(0).innerStride(), actualAlpha); } }; template<> struct gemv_dense_selector<OnTheRight,ColMajor,false> { template<typename Lhs, typename Rhs, typename Dest> static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) { if (Eigen::internal::static_assertion<static_cast<bool>((!nested_eval<Lhs,1>::Evaluate))>::EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE) {}; typename nested_eval<Rhs,1>::type actual_rhs(rhs); const Index size = rhs.rows(); for(Index k=0; k<size; ++k) dest += (alpha*actual_rhs.coeff(k)) * lhs.col(k); } }; template<> struct gemv_dense_selector<OnTheRight,RowMajor,false> { template<typename Lhs, typename Rhs, typename Dest> static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) { if (Eigen::internal::static_assertion<static_cast<bool>((!nested_eval<Lhs,1>::Evaluate))>::EIGEN_INTERNAL_COMPILATION_ERROR_OR_YOU_MADE_A_PROGRAMMING_MISTAKE) {}; typename nested_eval<Rhs,Lhs::RowsAtCompileTime>::type actual_rhs(rhs); const Index rows = dest.rows(); for(Index i=0; i<rows; ++i) dest.coeffRef(i) += alpha * (lhs.row(i).cwiseProduct(actual_rhs.transpose())).sum(); } }; } # 387 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" template<typename Derived> template<typename OtherDerived> inline const Product<Derived, OtherDerived> MatrixBase<Derived>::operator*(const MatrixBase<OtherDerived> &other) const { enum { ProductIsValid = Derived::ColsAtCompileTime==Dynamic || OtherDerived::RowsAtCompileTime==Dynamic || int(Derived::ColsAtCompileTime)==int(OtherDerived::RowsAtCompileTime), AreVectors = Derived::IsVectorAtCompileTime && OtherDerived::IsVectorAtCompileTime, SameSizes = ( (int(Eigen::internal::size_of_xpr_at_compile_time<Derived>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<OtherDerived>::ret)==0) || ( (int(Derived::RowsAtCompileTime)==Eigen::Dynamic || int(OtherDerived::RowsAtCompileTime)==Eigen::Dynamic || int(Derived::RowsAtCompileTime)==int(OtherDerived::RowsAtCompileTime)) && (int(Derived::ColsAtCompileTime)==Eigen::Dynamic || int(OtherDerived::ColsAtCompileTime)==Eigen::Dynamic || int(Derived::ColsAtCompileTime)==int(OtherDerived::ColsAtCompileTime)) ) ) }; if (Eigen::internal::static_assertion<static_cast<bool>(ProductIsValid || !(AreVectors && SameSizes))>::INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS) {} if (Eigen::internal::static_assertion<static_cast<bool>(ProductIsValid || !(SameSizes && !AreVectors))>::INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION) {} if (Eigen::internal::static_assertion<static_cast<bool>(ProductIsValid || SameSizes)>::INVALID_MATRIX_PRODUCT) {} return Product<Derived, OtherDerived>(derived(), other.derived()); } # 429 "eigen-3.3.7/Eigen/src/Core/GeneralProduct.h" template<typename Derived> template<typename OtherDerived> const Product<Derived,OtherDerived,LazyProduct> MatrixBase<Derived>::lazyProduct(const MatrixBase<OtherDerived> &other) const { enum { ProductIsValid = Derived::ColsAtCompileTime==Dynamic || OtherDerived::RowsAtCompileTime==Dynamic || int(Derived::ColsAtCompileTime)==int(OtherDerived::RowsAtCompileTime), AreVectors = Derived::IsVectorAtCompileTime && OtherDerived::IsVectorAtCompileTime, SameSizes = ( (int(Eigen::internal::size_of_xpr_at_compile_time<Derived>::ret)==0 && int(Eigen::internal::size_of_xpr_at_compile_time<OtherDerived>::ret)==0) || ( (int(Derived::RowsAtCompileTime)==Eigen::Dynamic || int(OtherDerived::RowsAtCompileTime)==Eigen::Dynamic || int(Derived::RowsAtCompileTime)==int(OtherDerived::RowsAtCompileTime)) && (int(Derived::ColsAtCompileTime)==Eigen::Dynamic || int(OtherDerived::ColsAtCompileTime)==Eigen::Dynamic || int(Derived::ColsAtCompileTime)==int(OtherDerived::ColsAtCompileTime)) ) ) }; if (Eigen::internal::static_assertion<static_cast<bool>(ProductIsValid || !(AreVectors && SameSizes))>::INVALID_VECTOR_VECTOR_PRODUCT__IF_YOU_WANTED_A_DOT_OR_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTIONS) {} if (Eigen::internal::static_assertion<static_cast<bool>(ProductIsValid || !(SameSizes && !AreVectors))>::INVALID_MATRIX_PRODUCT__IF_YOU_WANTED_A_COEFF_WISE_PRODUCT_YOU_MUST_USE_THE_EXPLICIT_FUNCTION) {} if (Eigen::internal::static_assertion<static_cast<bool>(ProductIsValid || SameSizes)>::INVALID_MATRIX_PRODUCT) {} return Product<Derived,OtherDerived,LazyProduct>(derived(), other.derived()); } } # 484 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Solve.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Solve.h" namespace Eigen { template<typename Decomposition, typename RhsType, typename StorageKind> class SolveImpl; # 29 "eigen-3.3.7/Eigen/src/Core/Solve.h" namespace internal { template<typename Decomposition, typename RhsType,typename StorageKind> struct solve_traits; template<typename Decomposition, typename RhsType> struct solve_traits<Decomposition,RhsType,Dense> { typedef typename make_proper_matrix_type<typename RhsType::Scalar, Decomposition::ColsAtCompileTime, RhsType::ColsAtCompileTime, RhsType::PlainObject::Options, Decomposition::MaxColsAtCompileTime, RhsType::MaxColsAtCompileTime>::type PlainObject; }; template<typename Decomposition, typename RhsType> struct traits<Solve<Decomposition, RhsType> > : traits<typename solve_traits<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>::PlainObject> { typedef typename solve_traits<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind>::PlainObject PlainObject; typedef typename promote_index_type<typename Decomposition::StorageIndex, typename RhsType::StorageIndex>::type StorageIndex; typedef traits<PlainObject> BaseTraits; enum { Flags = BaseTraits::Flags & RowMajorBit, CoeffReadCost = HugeCost }; }; } template<typename Decomposition, typename RhsType> class Solve : public SolveImpl<Decomposition,RhsType,typename internal::traits<RhsType>::StorageKind> { public: typedef typename internal::traits<Solve>::PlainObject PlainObject; typedef typename internal::traits<Solve>::StorageIndex StorageIndex; Solve(const Decomposition &dec, const RhsType &rhs) : m_dec(dec), m_rhs(rhs) {} Index rows() const { return m_dec.cols(); } Index cols() const { return m_rhs.cols(); } const Decomposition& dec() const { return m_dec; } const RhsType& rhs() const { return m_rhs; } protected: const Decomposition &m_dec; const RhsType &m_rhs; }; template<typename Decomposition, typename RhsType> class SolveImpl<Decomposition,RhsType,Dense> : public MatrixBase<Solve<Decomposition,RhsType> > { typedef Solve<Decomposition,RhsType> Derived; public: typedef MatrixBase<Solve<Decomposition,RhsType> > Base; typedef typename Eigen::internal::traits<Derived>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Derived>::type Nested; typedef typename Eigen::internal::traits<Derived>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Derived>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Derived>::ColsAtCompileTime, Flags = Eigen::internal::traits<Derived>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; private: Scalar coeff(Index row, Index col) const; Scalar coeff(Index i) const; }; template<typename Decomposition, typename RhsType, typename StorageKind> class SolveImpl : public internal::generic_xpr_base<Solve<Decomposition,RhsType>, MatrixXpr, StorageKind>::type { public: typedef typename internal::generic_xpr_base<Solve<Decomposition,RhsType>, MatrixXpr, StorageKind>::type Base; }; namespace internal { template<typename Decomposition, typename RhsType> struct evaluator<Solve<Decomposition,RhsType> > : public evaluator<typename Solve<Decomposition,RhsType>::PlainObject> { typedef Solve<Decomposition,RhsType> SolveType; typedef typename SolveType::PlainObject PlainObject; typedef evaluator<PlainObject> Base; enum { Flags = Base::Flags | EvalBeforeNestingBit }; explicit evaluator(const SolveType& solve) : m_result(solve.rows(), solve.cols()) { ::new (static_cast<Base*>(this)) Base(m_result); solve.dec()._solve_impl(solve.rhs(), m_result); } protected: PlainObject m_result; }; template<typename DstXprType, typename DecType, typename RhsType, typename Scalar> struct Assignment<DstXprType, Solve<DecType,RhsType>, internal::assign_op<Scalar,Scalar>, Dense2Dense> { typedef Solve<DecType,RhsType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<Scalar,Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); src.dec()._solve_impl(src.rhs(), dst); } }; template<typename DstXprType, typename DecType, typename RhsType, typename Scalar> struct Assignment<DstXprType, Solve<Transpose<const DecType>,RhsType>, internal::assign_op<Scalar,Scalar>, Dense2Dense> { typedef Solve<Transpose<const DecType>,RhsType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<Scalar,Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); src.dec().nestedExpression().template _solve_impl_transposed<false>(src.rhs(), dst); } }; template<typename DstXprType, typename DecType, typename RhsType, typename Scalar> struct Assignment<DstXprType, Solve<CwiseUnaryOp<internal::scalar_conjugate_op<typename DecType::Scalar>, const Transpose<const DecType> >,RhsType>, internal::assign_op<Scalar,Scalar>, Dense2Dense> { typedef Solve<CwiseUnaryOp<internal::scalar_conjugate_op<typename DecType::Scalar>, const Transpose<const DecType> >,RhsType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<Scalar,Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); src.dec().nestedExpression().nestedExpression().template _solve_impl_transposed<true>(src.rhs(), dst); } }; } } # 485 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Inverse.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Inverse.h" namespace Eigen { template<typename XprType,typename StorageKind> class InverseImpl; namespace internal { template<typename XprType> struct traits<Inverse<XprType> > : traits<typename XprType::PlainObject> { typedef typename XprType::PlainObject PlainObject; typedef traits<PlainObject> BaseTraits; enum { Flags = BaseTraits::Flags & RowMajorBit }; }; } # 42 "eigen-3.3.7/Eigen/src/Core/Inverse.h" template<typename XprType> class Inverse : public InverseImpl<XprType,typename internal::traits<XprType>::StorageKind> { public: typedef typename XprType::StorageIndex StorageIndex; typedef typename XprType::PlainObject PlainObject; typedef typename XprType::Scalar Scalar; typedef typename internal::ref_selector<XprType>::type XprTypeNested; typedef typename internal::remove_all<XprTypeNested>::type XprTypeNestedCleaned; typedef typename internal::ref_selector<Inverse>::type Nested; typedef typename internal::remove_all<XprType>::type NestedExpression; explicit Inverse(const XprType &xpr) : m_xpr(xpr) {} Index rows() const { return m_xpr.rows(); } Index cols() const { return m_xpr.cols(); } const XprTypeNestedCleaned& nestedExpression() const { return m_xpr; } protected: XprTypeNested m_xpr; }; template<typename XprType, typename StorageKind> class InverseImpl : public internal::generic_xpr_base<Inverse<XprType> >::type { public: typedef typename internal::generic_xpr_base<Inverse<XprType> >::type Base; typedef typename XprType::Scalar Scalar; private: Scalar coeff(Index row, Index col) const; Scalar coeff(Index i) const; }; namespace internal { # 93 "eigen-3.3.7/Eigen/src/Core/Inverse.h" template<typename ArgType> struct unary_evaluator<Inverse<ArgType> > : public evaluator<typename Inverse<ArgType>::PlainObject> { typedef Inverse<ArgType> InverseType; typedef typename InverseType::PlainObject PlainObject; typedef evaluator<PlainObject> Base; enum { Flags = Base::Flags | EvalBeforeNestingBit }; unary_evaluator(const InverseType& inv_xpr) : m_result(inv_xpr.rows(), inv_xpr.cols()) { ::new (static_cast<Base*>(this)) Base(m_result); internal::call_assignment_no_alias(m_result, inv_xpr); } protected: PlainObject m_result; }; } } # 486 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/SolverBase.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/SolverBase.h" namespace Eigen { namespace internal { } # 40 "eigen-3.3.7/Eigen/src/Core/SolverBase.h" template<typename Derived> class SolverBase : public EigenBase<Derived> { public: typedef EigenBase<Derived> Base; typedef typename internal::traits<Derived>::Scalar Scalar; typedef Scalar CoeffReturnType; enum { RowsAtCompileTime = internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = internal::traits<Derived>::ColsAtCompileTime, SizeAtCompileTime = (internal::size_at_compile_time<internal::traits<Derived>::RowsAtCompileTime, internal::traits<Derived>::ColsAtCompileTime>::ret), MaxRowsAtCompileTime = internal::traits<Derived>::MaxRowsAtCompileTime, MaxColsAtCompileTime = internal::traits<Derived>::MaxColsAtCompileTime, MaxSizeAtCompileTime = (internal::size_at_compile_time<internal::traits<Derived>::MaxRowsAtCompileTime, internal::traits<Derived>::MaxColsAtCompileTime>::ret), IsVectorAtCompileTime = internal::traits<Derived>::MaxRowsAtCompileTime == 1 || internal::traits<Derived>::MaxColsAtCompileTime == 1 }; SolverBase() {} ~SolverBase() {} using Base::derived; template<typename Rhs> inline const Solve<Derived, Rhs> solve(const MatrixBase<Rhs>& b) const { ((derived().rows()==b.rows() && "solve(): invalid number of rows of the right hand side matrix b") ? static_cast<void> (0) : __assert_fail ("derived().rows()==b.rows() && \"solve(): invalid number of rows of the right hand side matrix b\"", "eigen-3.3.7/Eigen/src/Core/SolverBase.h", 77, __PRETTY_FUNCTION__)); return Solve<Derived, Rhs>(derived(), b.derived()); } typedef typename internal::add_const<Transpose<const Derived> >::type ConstTransposeReturnType; inline ConstTransposeReturnType transpose() const { return ConstTransposeReturnType(derived()); } typedef typename internal::conditional<NumTraits<Scalar>::IsComplex, CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>, ConstTransposeReturnType>, ConstTransposeReturnType >::type AdjointReturnType; # 109 "eigen-3.3.7/Eigen/src/Core/SolverBase.h" inline AdjointReturnType adjoint() const { return AdjointReturnType(derived().transpose()); } protected: }; namespace internal { template<typename Derived> struct generic_xpr_base<Derived, MatrixXpr, SolverStorage> { typedef SolverBase<Derived> type; }; } } # 487 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" namespace Eigen { namespace internal { enum PermPermProduct_t {PermPermProduct}; } # 45 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" template<typename Derived> class PermutationBase : public EigenBase<Derived> { typedef internal::traits<Derived> Traits; typedef EigenBase<Derived> Base; public: typedef typename Traits::IndicesType IndicesType; enum { Flags = Traits::Flags, RowsAtCompileTime = Traits::RowsAtCompileTime, ColsAtCompileTime = Traits::ColsAtCompileTime, MaxRowsAtCompileTime = Traits::MaxRowsAtCompileTime, MaxColsAtCompileTime = Traits::MaxColsAtCompileTime }; typedef typename Traits::StorageIndex StorageIndex; typedef Matrix<StorageIndex,RowsAtCompileTime,ColsAtCompileTime,0,MaxRowsAtCompileTime,MaxColsAtCompileTime> DenseMatrixType; typedef PermutationMatrix<IndicesType::SizeAtCompileTime,IndicesType::MaxSizeAtCompileTime,StorageIndex> PlainPermutationType; typedef PlainPermutationType PlainObject; using Base::derived; typedef Inverse<Derived> InverseReturnType; typedef void Scalar; template<typename OtherDerived> Derived& operator=(const PermutationBase<OtherDerived>& other) { indices() = other.indices(); return derived(); } template<typename OtherDerived> Derived& operator=(const TranspositionsBase<OtherDerived>& tr) { setIdentity(tr.size()); for(Index k=size()-1; k>=0; --k) applyTranspositionOnTheRight(k,tr.coeff(k)); return derived(); } Derived& operator=(const PermutationBase& other) { indices() = other.indices(); return derived(); } inline Index rows() const { return Index(indices().size()); } inline Index cols() const { return Index(indices().size()); } inline Index size() const { return Index(indices().size()); } template<typename DenseDerived> void evalTo(MatrixBase<DenseDerived>& other) const { other.setZero(); for (Index i=0; i<rows(); ++i) other.coeffRef(indices().coeff(i),i) = typename DenseDerived::Scalar(1); } DenseMatrixType toDenseMatrix() const { return derived(); } const IndicesType& indices() const { return derived().indices(); } IndicesType& indices() { return derived().indices(); } inline void resize(Index newSize) { indices().resize(newSize); } void setIdentity() { StorageIndex n = StorageIndex(size()); for(StorageIndex i = 0; i < n; ++i) indices().coeffRef(i) = i; } void setIdentity(Index newSize) { resize(newSize); setIdentity(); } # 166 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" Derived& applyTranspositionOnTheLeft(Index i, Index j) { ((i>=0 && j>=0 && i<size() && j<size()) ? static_cast<void> (0) : __assert_fail ("i>=0 && j>=0 && i<size() && j<size()", "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h", 168, __PRETTY_FUNCTION__)); for(Index k = 0; k < size(); ++k) { if(indices().coeff(k) == i) indices().coeffRef(k) = StorageIndex(j); else if(indices().coeff(k) == j) indices().coeffRef(k) = StorageIndex(i); } return derived(); } # 185 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" Derived& applyTranspositionOnTheRight(Index i, Index j) { ((i>=0 && j>=0 && i<size() && j<size()) ? static_cast<void> (0) : __assert_fail ("i>=0 && j>=0 && i<size() && j<size()", "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h", 187, __PRETTY_FUNCTION__)); std::swap(indices().coeffRef(i), indices().coeffRef(j)); return derived(); } inline InverseReturnType inverse() const { return InverseReturnType(derived()); } inline InverseReturnType transpose() const { return InverseReturnType(derived()); } protected: template<typename OtherDerived> void assignTranspose(const PermutationBase<OtherDerived>& other) { for (Index i=0; i<rows();++i) indices().coeffRef(other.indices().coeff(i)) = i; } template<typename Lhs,typename Rhs> void assignProduct(const Lhs& lhs, const Rhs& rhs) { ((lhs.cols() == rhs.rows()) ? static_cast<void> (0) : __assert_fail ("lhs.cols() == rhs.rows()", "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h", 218, __PRETTY_FUNCTION__)); for (Index i=0; i<rows();++i) indices().coeffRef(i) = lhs.indices().coeff(rhs.indices().coeff(i)); } public: template<typename Other> inline PlainPermutationType operator*(const PermutationBase<Other>& other) const { return PlainPermutationType(internal::PermPermProduct, derived(), other.derived()); } template<typename Other> inline PlainPermutationType operator*(const InverseImpl<Other,PermutationStorage>& other) const { return PlainPermutationType(internal::PermPermProduct, *this, other.eval()); } template<typename Other> friend inline PlainPermutationType operator*(const InverseImpl<Other, PermutationStorage>& other, const PermutationBase& perm) { return PlainPermutationType(internal::PermPermProduct, other.eval(), perm); } Index determinant() const { Index res = 1; Index n = size(); Matrix<bool,RowsAtCompileTime,1,0,MaxRowsAtCompileTime> mask(n); mask.fill(false); Index r = 0; while(r < n) { while(r<n && mask[r]) r++; if(r>=n) break; Index k0 = r++; mask.coeffRef(k0) = true; for(Index k=indices().coeff(k0); k!=k0; k=indices().coeff(k)) { mask.coeffRef(k) = true; res = -res; } } return res; } protected: }; namespace internal { template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex> struct traits<PermutationMatrix<SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex> > : traits<Matrix<_StorageIndex,SizeAtCompileTime,SizeAtCompileTime,0,MaxSizeAtCompileTime,MaxSizeAtCompileTime> > { typedef PermutationStorage StorageKind; typedef Matrix<_StorageIndex, SizeAtCompileTime, 1, 0, MaxSizeAtCompileTime, 1> IndicesType; typedef _StorageIndex StorageIndex; typedef void Scalar; }; } # 307 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex> class PermutationMatrix : public PermutationBase<PermutationMatrix<SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex> > { typedef PermutationBase<PermutationMatrix> Base; typedef internal::traits<PermutationMatrix> Traits; public: typedef const PermutationMatrix& Nested; typedef typename Traits::IndicesType IndicesType; typedef typename Traits::StorageIndex StorageIndex; inline PermutationMatrix() {} explicit inline PermutationMatrix(Index size) : m_indices(size) { ; } template<typename OtherDerived> inline PermutationMatrix(const PermutationBase<OtherDerived>& other) : m_indices(other.indices()) {} inline PermutationMatrix(const PermutationMatrix& other) : m_indices(other.indices()) {} # 349 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" template<typename Other> explicit inline PermutationMatrix(const MatrixBase<Other>& indices) : m_indices(indices) {} template<typename Other> explicit PermutationMatrix(const TranspositionsBase<Other>& tr) : m_indices(tr.size()) { *this = tr; } template<typename Other> PermutationMatrix& operator=(const PermutationBase<Other>& other) { m_indices = other.indices(); return *this; } template<typename Other> PermutationMatrix& operator=(const TranspositionsBase<Other>& tr) { return Base::operator=(tr.derived()); } PermutationMatrix& operator=(const PermutationMatrix& other) { m_indices = other.m_indices; return *this; } const IndicesType& indices() const { return m_indices; } IndicesType& indices() { return m_indices; } template<typename Other> PermutationMatrix(const InverseImpl<Other,PermutationStorage>& other) : m_indices(other.derived().nestedExpression().size()) { ; StorageIndex end = StorageIndex(m_indices.size()); for (StorageIndex i=0; i<end;++i) m_indices.coeffRef(other.derived().nestedExpression().indices().coeff(i)) = i; } template<typename Lhs,typename Rhs> PermutationMatrix(internal::PermPermProduct_t, const Lhs& lhs, const Rhs& rhs) : m_indices(lhs.indices().size()) { Base::assignProduct(lhs,rhs); } protected: IndicesType m_indices; }; namespace internal { template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex, int _PacketAccess> struct traits<Map<PermutationMatrix<SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex>,_PacketAccess> > : traits<Matrix<_StorageIndex,SizeAtCompileTime,SizeAtCompileTime,0,MaxSizeAtCompileTime,MaxSizeAtCompileTime> > { typedef PermutationStorage StorageKind; typedef Map<const Matrix<_StorageIndex, SizeAtCompileTime, 1, 0, MaxSizeAtCompileTime, 1>, _PacketAccess> IndicesType; typedef _StorageIndex StorageIndex; typedef void Scalar; }; } template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex, int _PacketAccess> class Map<PermutationMatrix<SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex>,_PacketAccess> : public PermutationBase<Map<PermutationMatrix<SizeAtCompileTime, MaxSizeAtCompileTime, _StorageIndex>,_PacketAccess> > { typedef PermutationBase<Map> Base; typedef internal::traits<Map> Traits; public: typedef typename Traits::IndicesType IndicesType; typedef typename IndicesType::Scalar StorageIndex; inline Map(const StorageIndex* indicesPtr) : m_indices(indicesPtr) {} inline Map(const StorageIndex* indicesPtr, Index size) : m_indices(indicesPtr,size) {} template<typename Other> Map& operator=(const PermutationBase<Other>& other) { return Base::operator=(other.derived()); } template<typename Other> Map& operator=(const TranspositionsBase<Other>& tr) { return Base::operator=(tr.derived()); } Map& operator=(const Map& other) { m_indices = other.m_indices; return *this; } const IndicesType& indices() const { return m_indices; } IndicesType& indices() { return m_indices; } protected: IndicesType m_indices; }; template<typename _IndicesType> class TranspositionsWrapper; namespace internal { template<typename _IndicesType> struct traits<PermutationWrapper<_IndicesType> > { typedef PermutationStorage StorageKind; typedef void Scalar; typedef typename _IndicesType::Scalar StorageIndex; typedef _IndicesType IndicesType; enum { RowsAtCompileTime = _IndicesType::SizeAtCompileTime, ColsAtCompileTime = _IndicesType::SizeAtCompileTime, MaxRowsAtCompileTime = IndicesType::MaxSizeAtCompileTime, MaxColsAtCompileTime = IndicesType::MaxSizeAtCompileTime, Flags = 0 }; }; } # 513 "eigen-3.3.7/Eigen/src/Core/PermutationMatrix.h" template<typename _IndicesType> class PermutationWrapper : public PermutationBase<PermutationWrapper<_IndicesType> > { typedef PermutationBase<PermutationWrapper> Base; typedef internal::traits<PermutationWrapper> Traits; public: typedef typename Traits::IndicesType IndicesType; inline PermutationWrapper(const IndicesType& indices) : m_indices(indices) {} const typename internal::remove_all<typename IndicesType::Nested>::type& indices() const { return m_indices; } protected: typename IndicesType::Nested m_indices; }; template<typename MatrixDerived, typename PermutationDerived> const Product<MatrixDerived, PermutationDerived, AliasFreeProduct> operator*(const MatrixBase<MatrixDerived> &matrix, const PermutationBase<PermutationDerived>& permutation) { return Product<MatrixDerived, PermutationDerived, AliasFreeProduct> (matrix.derived(), permutation.derived()); } template<typename PermutationDerived, typename MatrixDerived> const Product<PermutationDerived, MatrixDerived, AliasFreeProduct> operator*(const PermutationBase<PermutationDerived> &permutation, const MatrixBase<MatrixDerived>& matrix) { return Product<PermutationDerived, MatrixDerived, AliasFreeProduct> (permutation.derived(), matrix.derived()); } template<typename PermutationType> class InverseImpl<PermutationType, PermutationStorage> : public EigenBase<Inverse<PermutationType> > { typedef typename PermutationType::PlainPermutationType PlainPermutationType; typedef internal::traits<PermutationType> PermTraits; protected: InverseImpl() {} public: typedef Inverse<PermutationType> InverseType; using EigenBase<Inverse<PermutationType> >::derived; typedef typename PermutationType::DenseMatrixType DenseMatrixType; enum { RowsAtCompileTime = PermTraits::RowsAtCompileTime, ColsAtCompileTime = PermTraits::ColsAtCompileTime, MaxRowsAtCompileTime = PermTraits::MaxRowsAtCompileTime, MaxColsAtCompileTime = PermTraits::MaxColsAtCompileTime }; template<typename DenseDerived> void evalTo(MatrixBase<DenseDerived>& other) const { other.setZero(); for (Index i=0; i<derived().rows();++i) other.coeffRef(i, derived().nestedExpression().indices().coeff(i)) = typename DenseDerived::Scalar(1); } PlainPermutationType eval() const { return derived(); } DenseMatrixType toDenseMatrix() const { return derived(); } template<typename OtherDerived> friend const Product<OtherDerived, InverseType, AliasFreeProduct> operator*(const MatrixBase<OtherDerived>& matrix, const InverseType& trPerm) { return Product<OtherDerived, InverseType, AliasFreeProduct>(matrix.derived(), trPerm.derived()); } template<typename OtherDerived> const Product<InverseType, OtherDerived, AliasFreeProduct> operator*(const MatrixBase<OtherDerived>& matrix) const { return Product<InverseType, OtherDerived, AliasFreeProduct>(derived(), matrix.derived()); } }; template<typename Derived> const PermutationWrapper<const Derived> MatrixBase<Derived>::asPermutation() const { return derived(); } namespace internal { template<> struct AssignmentKind<DenseShape,PermutationShape> { typedef EigenBase2EigenBase Kind; }; } } # 488 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Transpositions.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Transpositions.h" namespace Eigen { template<typename Derived> class TranspositionsBase { typedef internal::traits<Derived> Traits; public: typedef typename Traits::IndicesType IndicesType; typedef typename IndicesType::Scalar StorageIndex; typedef Eigen::Index Index; Derived& derived() { return *static_cast<Derived*>(this); } const Derived& derived() const { return *static_cast<const Derived*>(this); } template<typename OtherDerived> Derived& operator=(const TranspositionsBase<OtherDerived>& other) { indices() = other.indices(); return derived(); } Derived& operator=(const TranspositionsBase& other) { indices() = other.indices(); return derived(); } Index size() const { return indices().size(); } Index rows() const { return indices().size(); } Index cols() const { return indices().size(); } inline const StorageIndex& coeff(Index i) const { return indices().coeff(i); } inline StorageIndex& coeffRef(Index i) { return indices().coeffRef(i); } inline const StorageIndex& operator()(Index i) const { return indices()(i); } inline StorageIndex& operator()(Index i) { return indices()(i); } inline const StorageIndex& operator[](Index i) const { return indices()(i); } inline StorageIndex& operator[](Index i) { return indices()(i); } const IndicesType& indices() const { return derived().indices(); } IndicesType& indices() { return derived().indices(); } inline void resize(Index newSize) { indices().resize(newSize); } void setIdentity() { for(StorageIndex i = 0; i < indices().size(); ++i) coeffRef(i) = i; } # 108 "eigen-3.3.7/Eigen/src/Core/Transpositions.h" inline Transpose<TranspositionsBase> inverse() const { return Transpose<TranspositionsBase>(derived()); } inline Transpose<TranspositionsBase> transpose() const { return Transpose<TranspositionsBase>(derived()); } protected: }; namespace internal { template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex> struct traits<Transpositions<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex> > : traits<PermutationMatrix<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex> > { typedef Matrix<_StorageIndex, SizeAtCompileTime, 1, 0, MaxSizeAtCompileTime, 1> IndicesType; typedef TranspositionsStorage StorageKind; }; } # 157 "eigen-3.3.7/Eigen/src/Core/Transpositions.h" template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex> class Transpositions : public TranspositionsBase<Transpositions<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex> > { typedef internal::traits<Transpositions> Traits; public: typedef TranspositionsBase<Transpositions> Base; typedef typename Traits::IndicesType IndicesType; typedef typename IndicesType::Scalar StorageIndex; inline Transpositions() {} template<typename OtherDerived> inline Transpositions(const TranspositionsBase<OtherDerived>& other) : m_indices(other.indices()) {} inline Transpositions(const Transpositions& other) : m_indices(other.indices()) {} template<typename Other> explicit inline Transpositions(const MatrixBase<Other>& indices) : m_indices(indices) {} template<typename OtherDerived> Transpositions& operator=(const TranspositionsBase<OtherDerived>& other) { return Base::operator=(other); } Transpositions& operator=(const Transpositions& other) { m_indices = other.m_indices; return *this; } inline Transpositions(Index size) : m_indices(size) {} const IndicesType& indices() const { return m_indices; } IndicesType& indices() { return m_indices; } protected: IndicesType m_indices; }; namespace internal { template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex, int _PacketAccess> struct traits<Map<Transpositions<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex>,_PacketAccess> > : traits<PermutationMatrix<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex> > { typedef Map<const Matrix<_StorageIndex,SizeAtCompileTime,1,0,MaxSizeAtCompileTime,1>, _PacketAccess> IndicesType; typedef _StorageIndex StorageIndex; typedef TranspositionsStorage StorageKind; }; } template<int SizeAtCompileTime, int MaxSizeAtCompileTime, typename _StorageIndex, int PacketAccess> class Map<Transpositions<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex>,PacketAccess> : public TranspositionsBase<Map<Transpositions<SizeAtCompileTime,MaxSizeAtCompileTime,_StorageIndex>,PacketAccess> > { typedef internal::traits<Map> Traits; public: typedef TranspositionsBase<Map> Base; typedef typename Traits::IndicesType IndicesType; typedef typename IndicesType::Scalar StorageIndex; explicit inline Map(const StorageIndex* indicesPtr) : m_indices(indicesPtr) {} inline Map(const StorageIndex* indicesPtr, Index size) : m_indices(indicesPtr,size) {} template<typename OtherDerived> Map& operator=(const TranspositionsBase<OtherDerived>& other) { return Base::operator=(other); } Map& operator=(const Map& other) { m_indices = other.m_indices; return *this; } const IndicesType& indices() const { return m_indices; } IndicesType& indices() { return m_indices; } protected: IndicesType m_indices; }; namespace internal { template<typename _IndicesType> struct traits<TranspositionsWrapper<_IndicesType> > : traits<PermutationWrapper<_IndicesType> > { typedef TranspositionsStorage StorageKind; }; } template<typename _IndicesType> class TranspositionsWrapper : public TranspositionsBase<TranspositionsWrapper<_IndicesType> > { typedef internal::traits<TranspositionsWrapper> Traits; public: typedef TranspositionsBase<TranspositionsWrapper> Base; typedef typename Traits::IndicesType IndicesType; typedef typename IndicesType::Scalar StorageIndex; explicit inline TranspositionsWrapper(IndicesType& indices) : m_indices(indices) {} template<typename OtherDerived> TranspositionsWrapper& operator=(const TranspositionsBase<OtherDerived>& other) { return Base::operator=(other); } TranspositionsWrapper& operator=(const TranspositionsWrapper& other) { m_indices = other.m_indices; return *this; } const IndicesType& indices() const { return m_indices; } IndicesType& indices() { return m_indices; } protected: typename IndicesType::Nested m_indices; }; template<typename MatrixDerived, typename TranspositionsDerived> const Product<MatrixDerived, TranspositionsDerived, AliasFreeProduct> operator*(const MatrixBase<MatrixDerived> &matrix, const TranspositionsBase<TranspositionsDerived>& transpositions) { return Product<MatrixDerived, TranspositionsDerived, AliasFreeProduct> (matrix.derived(), transpositions.derived()); } template<typename TranspositionsDerived, typename MatrixDerived> const Product<TranspositionsDerived, MatrixDerived, AliasFreeProduct> operator*(const TranspositionsBase<TranspositionsDerived> &transpositions, const MatrixBase<MatrixDerived>& matrix) { return Product<TranspositionsDerived, MatrixDerived, AliasFreeProduct> (transpositions.derived(), matrix.derived()); } namespace internal { template<typename Derived> struct traits<Transpose<TranspositionsBase<Derived> > > : traits<Derived> {}; } template<typename TranspositionsDerived> class Transpose<TranspositionsBase<TranspositionsDerived> > { typedef TranspositionsDerived TranspositionType; typedef typename TranspositionType::IndicesType IndicesType; public: explicit Transpose(const TranspositionType& t) : m_transpositions(t) {} Index size() const { return m_transpositions.size(); } Index rows() const { return m_transpositions.size(); } Index cols() const { return m_transpositions.size(); } template<typename OtherDerived> friend const Product<OtherDerived, Transpose, AliasFreeProduct> operator*(const MatrixBase<OtherDerived>& matrix, const Transpose& trt) { return Product<OtherDerived, Transpose, AliasFreeProduct>(matrix.derived(), trt); } template<typename OtherDerived> const Product<Transpose, OtherDerived, AliasFreeProduct> operator*(const MatrixBase<OtherDerived>& matrix) const { return Product<Transpose, OtherDerived, AliasFreeProduct>(*this, matrix.derived()); } const TranspositionType& nestedExpression() const { return m_transpositions; } protected: const TranspositionType& m_transpositions; }; } # 489 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" namespace Eigen { namespace internal { template<int Side, typename TriangularType, typename Rhs> struct triangular_solve_retval; } template<typename Derived> class TriangularBase : public EigenBase<Derived> { public: enum { Mode = internal::traits<Derived>::Mode, RowsAtCompileTime = internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = internal::traits<Derived>::ColsAtCompileTime, MaxRowsAtCompileTime = internal::traits<Derived>::MaxRowsAtCompileTime, MaxColsAtCompileTime = internal::traits<Derived>::MaxColsAtCompileTime, SizeAtCompileTime = (internal::size_at_compile_time<internal::traits<Derived>::RowsAtCompileTime, internal::traits<Derived>::ColsAtCompileTime>::ret), MaxSizeAtCompileTime = (internal::size_at_compile_time<internal::traits<Derived>::MaxRowsAtCompileTime, internal::traits<Derived>::MaxColsAtCompileTime>::ret) }; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename internal::traits<Derived>::StorageKind StorageKind; typedef typename internal::traits<Derived>::StorageIndex StorageIndex; typedef typename internal::traits<Derived>::FullMatrixType DenseMatrixType; typedef DenseMatrixType DenseType; typedef Derived const& Nested; inline TriangularBase() { ((!((Mode&UnitDiag) && (Mode&ZeroDiag))) ? static_cast<void> (0) : __assert_fail ("!((Mode&UnitDiag) && (Mode&ZeroDiag))", "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h", 56, __PRETTY_FUNCTION__)); } inline Index rows() const { return derived().rows(); } inline Index cols() const { return derived().cols(); } inline Index outerStride() const { return derived().outerStride(); } inline Index innerStride() const { return derived().innerStride(); } void resize(Index rows, Index cols) { Eigen::internal::ignore_unused_variable(rows);; Eigen::internal::ignore_unused_variable(cols);; ((rows==this->rows() && cols==this->cols()) ? static_cast<void> (0) : __assert_fail ("rows==this->rows() && cols==this->cols()", "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h", 72, __PRETTY_FUNCTION__)); } inline Scalar coeff(Index row, Index col) const { return derived().coeff(row,col); } inline Scalar& coeffRef(Index row, Index col) { return derived().coeffRef(row,col); } template<typename Other> inline void copyCoeff(Index row, Index col, Other& other) { derived().coeffRef(row, col) = other.coeff(row, col); } inline Scalar operator()(Index row, Index col) const { check_coordinates(row, col); return coeff(row,col); } inline Scalar& operator()(Index row, Index col) { check_coordinates(row, col); return coeffRef(row,col); } inline const Derived& derived() const { return *static_cast<const Derived*>(this); } inline Derived& derived() { return *static_cast<Derived*>(this); } template<typename DenseDerived> void evalTo(MatrixBase<DenseDerived> &other) const; template<typename DenseDerived> void evalToLazy(MatrixBase<DenseDerived> &other) const; DenseMatrixType toDenseMatrix() const { DenseMatrixType res(rows(), cols()); evalToLazy(res); return res; } protected: void check_coordinates(Index row, Index col) const { ; ; ((col>=0 && col<cols() && row>=0 && row<rows()) ? static_cast<void> (0) : __assert_fail ("col>=0 && col<cols() && row>=0 && row<rows()", "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h", 130, __PRETTY_FUNCTION__)); const int mode = int(Mode) & ~SelfAdjoint; ; (((mode==Upper && col>=row) || (mode==Lower && col<=row) || ((mode==StrictlyUpper || mode==UnitUpper) && col>row) || ((mode==StrictlyLower || mode==UnitLower) && col<row)) ? static_cast<void> (0) : __assert_fail ("(mode==Upper && col>=row) || (mode==Lower && col<=row) || ((mode==StrictlyUpper || mode==UnitUpper) && col>row) || ((mode==StrictlyLower || mode==UnitLower) && col<row)", "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" # 133 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" , 136 # 133 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" , __PRETTY_FUNCTION__)) ; } void check_coordinates_internal(Index , Index ) const {} }; # 167 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" namespace internal { template<typename MatrixType, unsigned int _Mode> struct traits<TriangularView<MatrixType, _Mode> > : traits<MatrixType> { typedef typename ref_selector<MatrixType>::non_const_type MatrixTypeNested; typedef typename remove_reference<MatrixTypeNested>::type MatrixTypeNestedNonRef; typedef typename remove_all<MatrixTypeNested>::type MatrixTypeNestedCleaned; typedef typename MatrixType::PlainObject FullMatrixType; typedef MatrixType ExpressionType; enum { Mode = _Mode, FlagsLvalueBit = is_lvalue<MatrixType>::value ? LvalueBit : 0, Flags = (MatrixTypeNestedCleaned::Flags & (HereditaryBits | FlagsLvalueBit) & (~(PacketAccessBit | DirectAccessBit | LinearAccessBit))) }; }; } template<typename _MatrixType, unsigned int _Mode, typename StorageKind> class TriangularViewImpl; template<typename _MatrixType, unsigned int _Mode> class TriangularView : public TriangularViewImpl<_MatrixType, _Mode, typename internal::traits<_MatrixType>::StorageKind > { public: typedef TriangularViewImpl<_MatrixType, _Mode, typename internal::traits<_MatrixType>::StorageKind > Base; typedef typename internal::traits<TriangularView>::Scalar Scalar; typedef _MatrixType MatrixType; protected: typedef typename internal::traits<TriangularView>::MatrixTypeNested MatrixTypeNested; typedef typename internal::traits<TriangularView>::MatrixTypeNestedNonRef MatrixTypeNestedNonRef; typedef typename internal::remove_all<typename MatrixType::ConjugateReturnType>::type MatrixConjugateReturnType; public: typedef typename internal::traits<TriangularView>::StorageKind StorageKind; typedef typename internal::traits<TriangularView>::MatrixTypeNestedCleaned NestedExpression; enum { Mode = _Mode, Flags = internal::traits<TriangularView>::Flags, TransposeMode = (Mode & Upper ? Lower : 0) | (Mode & Lower ? Upper : 0) | (Mode & (UnitDiag)) | (Mode & (ZeroDiag)), IsVectorAtCompileTime = false }; explicit inline TriangularView(MatrixType& matrix) : m_matrix(matrix) {} using Base::operator=; TriangularView& operator=(const TriangularView &other) { return Base::operator=(other); } inline Index rows() const { return m_matrix.rows(); } inline Index cols() const { return m_matrix.cols(); } const NestedExpression& nestedExpression() const { return m_matrix; } NestedExpression& nestedExpression() { return m_matrix; } typedef TriangularView<const MatrixConjugateReturnType,Mode> ConjugateReturnType; inline const ConjugateReturnType conjugate() const { return ConjugateReturnType(m_matrix.conjugate()); } typedef TriangularView<const typename MatrixType::AdjointReturnType,TransposeMode> AdjointReturnType; inline const AdjointReturnType adjoint() const { return AdjointReturnType(m_matrix.adjoint()); } typedef TriangularView<typename MatrixType::TransposeReturnType,TransposeMode> TransposeReturnType; inline TransposeReturnType transpose() { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<MatrixType>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} typename MatrixType::TransposeReturnType tmp(m_matrix); return TransposeReturnType(tmp); } typedef TriangularView<const typename MatrixType::ConstTransposeReturnType,TransposeMode> ConstTransposeReturnType; inline const ConstTransposeReturnType transpose() const { return ConstTransposeReturnType(m_matrix.transpose()); } template<typename Other> inline const Solve<TriangularView, Other> solve(const MatrixBase<Other>& other) const { return Solve<TriangularView, Other>(*this, other.derived()); } # 283 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" using Base::solve; SelfAdjointView<MatrixTypeNestedNonRef,Mode> selfadjointView() { if (Eigen::internal::static_assertion<static_cast<bool>((Mode&(UnitDiag|ZeroDiag))==0)>::PROGRAMMING_ERROR) {}; return SelfAdjointView<MatrixTypeNestedNonRef,Mode>(m_matrix); } const SelfAdjointView<MatrixTypeNestedNonRef,Mode> selfadjointView() const { if (Eigen::internal::static_assertion<static_cast<bool>((Mode&(UnitDiag|ZeroDiag))==0)>::PROGRAMMING_ERROR) {}; return SelfAdjointView<MatrixTypeNestedNonRef,Mode>(m_matrix); } Scalar determinant() const { if (Mode & UnitDiag) return 1; else if (Mode & ZeroDiag) return 0; else return m_matrix.diagonal().prod(); } protected: MatrixTypeNested m_matrix; }; # 333 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" template<typename _MatrixType, unsigned int _Mode> class TriangularViewImpl<_MatrixType,_Mode,Dense> : public TriangularBase<TriangularView<_MatrixType, _Mode> > { public: typedef TriangularView<_MatrixType, _Mode> TriangularViewType; typedef TriangularBase<TriangularViewType> Base; typedef typename internal::traits<TriangularViewType>::Scalar Scalar; typedef _MatrixType MatrixType; typedef typename MatrixType::PlainObject DenseMatrixType; typedef DenseMatrixType PlainObject; public: using Base::evalToLazy; using Base::derived; typedef typename internal::traits<TriangularViewType>::StorageKind StorageKind; enum { Mode = _Mode, Flags = internal::traits<TriangularViewType>::Flags }; inline Index outerStride() const { return derived().nestedExpression().outerStride(); } inline Index innerStride() const { return derived().nestedExpression().innerStride(); } template<typename Other> TriangularViewType& operator+=(const DenseBase<Other>& other) { internal::call_assignment_no_alias(derived(), other.derived(), internal::add_assign_op<Scalar,typename Other::Scalar>()); return derived(); } template<typename Other> TriangularViewType& operator-=(const DenseBase<Other>& other) { internal::call_assignment_no_alias(derived(), other.derived(), internal::sub_assign_op<Scalar,typename Other::Scalar>()); return derived(); } TriangularViewType& operator*=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() * other; } TriangularViewType& operator/=(const typename internal::traits<MatrixType>::Scalar& other) { return *this = derived().nestedExpression() / other; } void fill(const Scalar& value) { setConstant(value); } TriangularViewType& setConstant(const Scalar& value) { return *this = MatrixType::Constant(derived().rows(), derived().cols(), value); } TriangularViewType& setZero() { return setConstant(Scalar(0)); } TriangularViewType& setOnes() { return setConstant(Scalar(1)); } inline Scalar coeff(Index row, Index col) const { Base::check_coordinates_internal(row, col); return derived().nestedExpression().coeff(row, col); } inline Scalar& coeffRef(Index row, Index col) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<TriangularViewType>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {}; Base::check_coordinates_internal(row, col); return derived().nestedExpression().coeffRef(row, col); } template<typename OtherDerived> TriangularViewType& operator=(const TriangularBase<OtherDerived>& other); template<typename OtherDerived> TriangularViewType& operator=(const MatrixBase<OtherDerived>& other); TriangularViewType& operator=(const TriangularViewImpl& other) { return *this = other.derived().nestedExpression(); } template<typename OtherDerived> void lazyAssign(const TriangularBase<OtherDerived>& other); template<typename OtherDerived> void lazyAssign(const MatrixBase<OtherDerived>& other); template<typename OtherDerived> const Product<TriangularViewType,OtherDerived> operator*(const MatrixBase<OtherDerived>& rhs) const { return Product<TriangularViewType,OtherDerived>(derived(), rhs.derived()); } template<typename OtherDerived> friend const Product<OtherDerived,TriangularViewType> operator*(const MatrixBase<OtherDerived>& lhs, const TriangularViewImpl& rhs) { return Product<OtherDerived,TriangularViewType>(lhs.derived(),rhs.derived()); } # 490 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" template<int Side, typename Other> inline const internal::triangular_solve_retval<Side,TriangularViewType, Other> solve(const MatrixBase<Other>& other) const; # 504 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" template<int Side, typename OtherDerived> void solveInPlace(const MatrixBase<OtherDerived>& other) const; template<typename OtherDerived> void solveInPlace(const MatrixBase<OtherDerived>& other) const { return solveInPlace<OnTheLeft>(other); } template<typename OtherDerived> void swap(TriangularBase<OtherDerived> const & other) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<OtherDerived>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {}; call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op<Scalar>()); } template<typename OtherDerived> void swap(MatrixBase<OtherDerived> const & other) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<OtherDerived>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {}; call_assignment(derived(), other.const_cast_derived(), internal::swap_assign_op<Scalar>()); } template<typename RhsType, typename DstType> inline void _solve_impl(const RhsType &rhs, DstType &dst) const { if(!internal::is_same_dense(dst,rhs)) dst = rhs; this->solveInPlace(dst); } template<typename ProductType> inline TriangularViewType& _assignProduct(const ProductType& prod, const Scalar& alpha, bool beta); }; template<typename MatrixType, unsigned int Mode> template<typename OtherDerived> inline TriangularView<MatrixType, Mode>& TriangularViewImpl<MatrixType, Mode, Dense>::operator=(const MatrixBase<OtherDerived>& other) { internal::call_assignment_no_alias(derived(), other.derived(), internal::assign_op<Scalar,typename OtherDerived::Scalar>()); return derived(); } template<typename MatrixType, unsigned int Mode> template<typename OtherDerived> void TriangularViewImpl<MatrixType, Mode, Dense>::lazyAssign(const MatrixBase<OtherDerived>& other) { internal::call_assignment_no_alias(derived(), other.template triangularView<Mode>()); } template<typename MatrixType, unsigned int Mode> template<typename OtherDerived> inline TriangularView<MatrixType, Mode>& TriangularViewImpl<MatrixType, Mode, Dense>::operator=(const TriangularBase<OtherDerived>& other) { ((Mode == int(OtherDerived::Mode)) ? static_cast<void> (0) : __assert_fail ("Mode == int(OtherDerived::Mode)", "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h", 579, __PRETTY_FUNCTION__)); internal::call_assignment(derived(), other.derived()); return derived(); } template<typename MatrixType, unsigned int Mode> template<typename OtherDerived> void TriangularViewImpl<MatrixType, Mode, Dense>::lazyAssign(const TriangularBase<OtherDerived>& other) { ((Mode == int(OtherDerived::Mode)) ? static_cast<void> (0) : __assert_fail ("Mode == int(OtherDerived::Mode)", "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h", 588, __PRETTY_FUNCTION__)); internal::call_assignment_no_alias(derived(), other.derived()); } # 599 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" template<typename Derived> template<typename DenseDerived> void TriangularBase<Derived>::evalTo(MatrixBase<DenseDerived> &other) const { evalToLazy(other.derived()); } # 625 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" template<typename Derived> template<unsigned int Mode> typename MatrixBase<Derived>::template TriangularViewReturnType<Mode>::Type MatrixBase<Derived>::triangularView() { return typename TriangularViewReturnType<Mode>::Type(derived()); } template<typename Derived> template<unsigned int Mode> typename MatrixBase<Derived>::template ConstTriangularViewReturnType<Mode>::Type MatrixBase<Derived>::triangularView() const { return typename ConstTriangularViewReturnType<Mode>::Type(derived()); } template<typename Derived> bool MatrixBase<Derived>::isUpperTriangular(const RealScalar& prec) const { RealScalar maxAbsOnUpperPart = static_cast<RealScalar>(-1); for(Index j = 0; j < cols(); ++j) { Index maxi = numext::mini(j, rows()-1); for(Index i = 0; i <= maxi; ++i) { RealScalar absValue = numext::abs(coeff(i,j)); if(absValue > maxAbsOnUpperPart) maxAbsOnUpperPart = absValue; } } RealScalar threshold = maxAbsOnUpperPart * prec; for(Index j = 0; j < cols(); ++j) for(Index i = j+1; i < rows(); ++i) if(numext::abs(coeff(i, j)) > threshold) return false; return true; } template<typename Derived> bool MatrixBase<Derived>::isLowerTriangular(const RealScalar& prec) const { RealScalar maxAbsOnLowerPart = static_cast<RealScalar>(-1); for(Index j = 0; j < cols(); ++j) for(Index i = j; i < rows(); ++i) { RealScalar absValue = numext::abs(coeff(i,j)); if(absValue > maxAbsOnLowerPart) maxAbsOnLowerPart = absValue; } RealScalar threshold = maxAbsOnLowerPart * prec; for(Index j = 1; j < cols(); ++j) { Index maxi = numext::mini(j, rows()-1); for(Index i = 0; i < maxi; ++i) if(numext::abs(coeff(i, j)) > threshold) return false; } return true; } # 699 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" namespace internal { template<typename MatrixType, unsigned int Mode> struct evaluator_traits<TriangularView<MatrixType,Mode> > { typedef typename storage_kind_to_evaluator_kind<typename MatrixType::StorageKind>::Kind Kind; typedef typename glue_shapes<typename evaluator_traits<MatrixType>::Shape, TriangularShape>::type Shape; }; template<typename MatrixType, unsigned int Mode> struct unary_evaluator<TriangularView<MatrixType,Mode>, IndexBased> : evaluator<typename internal::remove_all<MatrixType>::type> { typedef TriangularView<MatrixType,Mode> XprType; typedef evaluator<typename internal::remove_all<MatrixType>::type> Base; unary_evaluator(const XprType &xpr) : Base(xpr.nestedExpression()) {} }; struct Triangular2Triangular {}; struct Triangular2Dense {}; struct Dense2Triangular {}; template<typename Kernel, unsigned int Mode, int UnrollCount, bool ClearOpposite> struct triangular_assignment_loop; template<int UpLo, int Mode, int SetOpposite, typename DstEvaluatorTypeT, typename SrcEvaluatorTypeT, typename Functor, int Version = Specialized> class triangular_dense_assignment_kernel : public generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version> { protected: typedef generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version> Base; typedef typename Base::DstXprType DstXprType; typedef typename Base::SrcXprType SrcXprType; using Base::m_dst; using Base::m_src; using Base::m_functor; public: typedef typename Base::DstEvaluatorType DstEvaluatorType; typedef typename Base::SrcEvaluatorType SrcEvaluatorType; typedef typename Base::Scalar Scalar; typedef typename Base::AssignmentTraits AssignmentTraits; triangular_dense_assignment_kernel(DstEvaluatorType &dst, const SrcEvaluatorType &src, const Functor &func, DstXprType& dstExpr) : Base(dst, src, func, dstExpr) {} # 764 "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h" using Base::assignCoeff; void assignDiagonalCoeff(Index id) { if(Mode==UnitDiag && SetOpposite) m_functor.assignCoeff(m_dst.coeffRef(id,id), Scalar(1)); else if(Mode==ZeroDiag && SetOpposite) m_functor.assignCoeff(m_dst.coeffRef(id,id), Scalar(0)); else if(Mode==0) Base::assignCoeff(id,id); } void assignOppositeCoeff(Index row, Index col) { ; if(SetOpposite) m_functor.assignCoeff(m_dst.coeffRef(row,col), Scalar(0)); } }; template<int Mode, bool SetOpposite, typename DstXprType, typename SrcXprType, typename Functor> inline void call_triangular_assignment_loop(DstXprType& dst, const SrcXprType& src, const Functor &func) { typedef evaluator<DstXprType> DstEvaluatorType; typedef evaluator<SrcXprType> SrcEvaluatorType; SrcEvaluatorType srcEvaluator(src); Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); DstEvaluatorType dstEvaluator(dst); typedef triangular_dense_assignment_kernel< Mode&(Lower|Upper),Mode&(UnitDiag|ZeroDiag|SelfAdjoint),SetOpposite, DstEvaluatorType,SrcEvaluatorType,Functor> Kernel; Kernel kernel(dstEvaluator, srcEvaluator, func, dst.const_cast_derived()); enum { unroll = DstXprType::SizeAtCompileTime != Dynamic && SrcEvaluatorType::CoeffReadCost < HugeCost && DstXprType::SizeAtCompileTime * (DstEvaluatorType::CoeffReadCost+SrcEvaluatorType::CoeffReadCost) / 2 <= 100 }; triangular_assignment_loop<Kernel, Mode, unroll ? int(DstXprType::SizeAtCompileTime) : Dynamic, SetOpposite>::run(kernel); } template<int Mode, bool SetOpposite, typename DstXprType, typename SrcXprType> inline void call_triangular_assignment_loop(DstXprType& dst, const SrcXprType& src) { call_triangular_assignment_loop<Mode,SetOpposite>(dst, src, internal::assign_op<typename DstXprType::Scalar,typename SrcXprType::Scalar>()); } template<> struct AssignmentKind<TriangularShape,TriangularShape> { typedef Triangular2Triangular Kind; }; template<> struct AssignmentKind<DenseShape,TriangularShape> { typedef Triangular2Dense Kind; }; template<> struct AssignmentKind<TriangularShape,DenseShape> { typedef Dense2Triangular Kind; }; template< typename DstXprType, typename SrcXprType, typename Functor> struct Assignment<DstXprType, SrcXprType, Functor, Triangular2Triangular> { static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) { ((int(DstXprType::Mode) == int(SrcXprType::Mode)) ? static_cast<void> (0) : __assert_fail ("int(DstXprType::Mode) == int(SrcXprType::Mode)", "eigen-3.3.7/Eigen/src/Core/TriangularMatrix.h", 827, __PRETTY_FUNCTION__)); call_triangular_assignment_loop<DstXprType::Mode, false>(dst, src, func); } }; template< typename DstXprType, typename SrcXprType, typename Functor> struct Assignment<DstXprType, SrcXprType, Functor, Triangular2Dense> { static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) { call_triangular_assignment_loop<SrcXprType::Mode, (SrcXprType::Mode&SelfAdjoint)==0>(dst, src, func); } }; template< typename DstXprType, typename SrcXprType, typename Functor> struct Assignment<DstXprType, SrcXprType, Functor, Dense2Triangular> { static void run(DstXprType &dst, const SrcXprType &src, const Functor &func) { call_triangular_assignment_loop<DstXprType::Mode, false>(dst, src, func); } }; template<typename Kernel, unsigned int Mode, int UnrollCount, bool SetOpposite> struct triangular_assignment_loop { typedef typename Kernel::DstEvaluatorType DstEvaluatorType; typedef typename DstEvaluatorType::XprType DstXprType; enum { col = (UnrollCount-1) / DstXprType::RowsAtCompileTime, row = (UnrollCount-1) % DstXprType::RowsAtCompileTime }; typedef typename Kernel::Scalar Scalar; static inline void run(Kernel &kernel) { triangular_assignment_loop<Kernel, Mode, UnrollCount-1, SetOpposite>::run(kernel); if(row==col) kernel.assignDiagonalCoeff(row); else if( ((Mode&Lower) && row>col) || ((Mode&Upper) && row<col) ) kernel.assignCoeff(row,col); else if(SetOpposite) kernel.assignOppositeCoeff(row,col); } }; template<typename Kernel, unsigned int Mode, bool SetOpposite> struct triangular_assignment_loop<Kernel, Mode, 0, SetOpposite> { static inline void run(Kernel &) {} }; template<typename Kernel, unsigned int Mode, bool SetOpposite> struct triangular_assignment_loop<Kernel, Mode, Dynamic, SetOpposite> { typedef typename Kernel::Scalar Scalar; static inline void run(Kernel &kernel) { for(Index j = 0; j < kernel.cols(); ++j) { Index maxi = numext::mini(j, kernel.rows()); Index i = 0; if (((Mode&Lower) && SetOpposite) || (Mode&Upper)) { for(; i < maxi; ++i) if(Mode&Upper) kernel.assignCoeff(i, j); else kernel.assignOppositeCoeff(i, j); } else i = maxi; if(i<kernel.rows()) kernel.assignDiagonalCoeff(i++); if (((Mode&Upper) && SetOpposite) || (Mode&Lower)) { for(; i < kernel.rows(); ++i) if(Mode&Lower) kernel.assignCoeff(i, j); else kernel.assignOppositeCoeff(i, j); } } } }; } template<typename Derived> template<typename DenseDerived> void TriangularBase<Derived>::evalToLazy(MatrixBase<DenseDerived> &other) const { other.derived().resize(this->rows(), this->cols()); internal::call_triangular_assignment_loop<Derived::Mode,(Derived::Mode&SelfAdjoint)==0 >(other.derived(), derived().nestedExpression()); } namespace internal { template< typename DstXprType, typename Lhs, typename Rhs, typename Scalar> struct Assignment<DstXprType, Product<Lhs,Rhs,DefaultProduct>, internal::assign_op<Scalar,typename Product<Lhs,Rhs,DefaultProduct>::Scalar>, Dense2Triangular> { typedef Product<Lhs,Rhs,DefaultProduct> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<Scalar,typename SrcXprType::Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); dst._assignProduct(src, 1, 0); } }; template< typename DstXprType, typename Lhs, typename Rhs, typename Scalar> struct Assignment<DstXprType, Product<Lhs,Rhs,DefaultProduct>, internal::add_assign_op<Scalar,typename Product<Lhs,Rhs,DefaultProduct>::Scalar>, Dense2Triangular> { typedef Product<Lhs,Rhs,DefaultProduct> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op<Scalar,typename SrcXprType::Scalar> &) { dst._assignProduct(src, 1, 1); } }; template< typename DstXprType, typename Lhs, typename Rhs, typename Scalar> struct Assignment<DstXprType, Product<Lhs,Rhs,DefaultProduct>, internal::sub_assign_op<Scalar,typename Product<Lhs,Rhs,DefaultProduct>::Scalar>, Dense2Triangular> { typedef Product<Lhs,Rhs,DefaultProduct> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op<Scalar,typename SrcXprType::Scalar> &) { dst._assignProduct(src, -1, 1); } }; } } # 490 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" namespace Eigen { # 31 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" namespace internal { template<typename MatrixType, unsigned int UpLo> struct traits<SelfAdjointView<MatrixType, UpLo> > : traits<MatrixType> { typedef typename ref_selector<MatrixType>::non_const_type MatrixTypeNested; typedef typename remove_all<MatrixTypeNested>::type MatrixTypeNestedCleaned; typedef MatrixType ExpressionType; typedef typename MatrixType::PlainObject FullMatrixType; enum { Mode = UpLo | SelfAdjoint, FlagsLvalueBit = is_lvalue<MatrixType>::value ? LvalueBit : 0, Flags = MatrixTypeNestedCleaned::Flags & (HereditaryBits|FlagsLvalueBit) & (~(PacketAccessBit | DirectAccessBit | LinearAccessBit)) }; }; } template<typename _MatrixType, unsigned int UpLo> class SelfAdjointView : public TriangularBase<SelfAdjointView<_MatrixType, UpLo> > { public: typedef _MatrixType MatrixType; typedef TriangularBase<SelfAdjointView> Base; typedef typename internal::traits<SelfAdjointView>::MatrixTypeNested MatrixTypeNested; typedef typename internal::traits<SelfAdjointView>::MatrixTypeNestedCleaned MatrixTypeNestedCleaned; typedef MatrixTypeNestedCleaned NestedExpression; typedef typename internal::traits<SelfAdjointView>::Scalar Scalar; typedef typename MatrixType::StorageIndex StorageIndex; typedef typename internal::remove_all<typename MatrixType::ConjugateReturnType>::type MatrixConjugateReturnType; enum { Mode = internal::traits<SelfAdjointView>::Mode, Flags = internal::traits<SelfAdjointView>::Flags, TransposeMode = ((Mode & Upper) ? Lower : 0) | ((Mode & Lower) ? Upper : 0) }; typedef typename MatrixType::PlainObject PlainObject; explicit inline SelfAdjointView(MatrixType& matrix) : m_matrix(matrix) { if (Eigen::internal::static_assertion<static_cast<bool>(UpLo==Lower || UpLo==Upper)>::SELFADJOINTVIEW_ACCEPTS_UPPER_AND_LOWER_MODE_ONLY) {}; } inline Index rows() const { return m_matrix.rows(); } inline Index cols() const { return m_matrix.cols(); } inline Index outerStride() const { return m_matrix.outerStride(); } inline Index innerStride() const { return m_matrix.innerStride(); } inline Scalar coeff(Index row, Index col) const { Base::check_coordinates_internal(row, col); return m_matrix.coeff(row, col); } inline Scalar& coeffRef(Index row, Index col) { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<SelfAdjointView>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {}; Base::check_coordinates_internal(row, col); return m_matrix.coeffRef(row, col); } const MatrixTypeNestedCleaned& _expression() const { return m_matrix; } const MatrixTypeNestedCleaned& nestedExpression() const { return m_matrix; } MatrixTypeNestedCleaned& nestedExpression() { return m_matrix; } template<typename OtherDerived> const Product<SelfAdjointView,OtherDerived> operator*(const MatrixBase<OtherDerived>& rhs) const { return Product<SelfAdjointView,OtherDerived>(*this, rhs.derived()); } template<typename OtherDerived> friend const Product<OtherDerived,SelfAdjointView> operator*(const MatrixBase<OtherDerived>& lhs, const SelfAdjointView& rhs) { return Product<OtherDerived,SelfAdjointView>(lhs.derived(),rhs); } friend const SelfAdjointView<const CwiseBinaryOp<internal::scalar_product_op<Scalar,typename internal::traits<MatrixType>::Scalar>, const typename internal::plain_constant_type<MatrixType,Scalar>::type, const MatrixType>,UpLo> operator*(const Scalar& s, const SelfAdjointView& mat) { return (s*mat.nestedExpression()).template selfadjointView<UpLo>(); } # 152 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" template<typename DerivedU, typename DerivedV> SelfAdjointView& rankUpdate(const MatrixBase<DerivedU>& u, const MatrixBase<DerivedV>& v, const Scalar& alpha = Scalar(1)); # 166 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" template<typename DerivedU> SelfAdjointView& rankUpdate(const MatrixBase<DerivedU>& u, const Scalar& alpha = Scalar(1)); # 180 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" template<unsigned int TriMode> typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), TriangularView<MatrixType,TriMode>, TriangularView<typename MatrixType::AdjointReturnType,TriMode> >::type triangularView() const { typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), MatrixType&, typename MatrixType::ConstTransposeReturnType>::type tmp1(m_matrix); typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), MatrixType&, typename MatrixType::AdjointReturnType>::type tmp2(tmp1); return typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), TriangularView<MatrixType,TriMode>, TriangularView<typename MatrixType::AdjointReturnType,TriMode> >::type(tmp2); } typedef SelfAdjointView<const MatrixConjugateReturnType,UpLo> ConjugateReturnType; inline const ConjugateReturnType conjugate() const { return ConjugateReturnType(m_matrix.conjugate()); } typedef SelfAdjointView<const typename MatrixType::AdjointReturnType,TransposeMode> AdjointReturnType; inline const AdjointReturnType adjoint() const { return AdjointReturnType(m_matrix.adjoint()); } typedef SelfAdjointView<typename MatrixType::TransposeReturnType,TransposeMode> TransposeReturnType; inline TransposeReturnType transpose() { if (Eigen::internal::static_assertion<static_cast<bool>(Eigen::internal::is_lvalue<MatrixType>::value)>::THIS_EXPRESSION_IS_NOT_A_LVALUE__IT_IS_READ_ONLY) {} typename MatrixType::TransposeReturnType tmp(m_matrix); return TransposeReturnType(tmp); } typedef SelfAdjointView<const typename MatrixType::ConstTransposeReturnType,TransposeMode> ConstTransposeReturnType; inline const ConstTransposeReturnType transpose() const { return ConstTransposeReturnType(m_matrix.transpose()); } typename MatrixType::ConstDiagonalReturnType diagonal() const { return typename MatrixType::ConstDiagonalReturnType(m_matrix); } const LLT<PlainObject, UpLo> llt() const; const LDLT<PlainObject, UpLo> ldlt() const; typedef typename NumTraits<Scalar>::Real RealScalar; typedef Matrix<RealScalar, internal::traits<MatrixType>::ColsAtCompileTime, 1> EigenvaluesReturnType; EigenvaluesReturnType eigenvalues() const; RealScalar operatorNorm() const; protected: MatrixTypeNested m_matrix; }; # 266 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" namespace internal { template<typename MatrixType, unsigned int Mode> struct evaluator_traits<SelfAdjointView<MatrixType,Mode> > { typedef typename storage_kind_to_evaluator_kind<typename MatrixType::StorageKind>::Kind Kind; typedef SelfAdjointShape Shape; }; template<int UpLo, int SetOpposite, typename DstEvaluatorTypeT, typename SrcEvaluatorTypeT, typename Functor, int Version> class triangular_dense_assignment_kernel<UpLo,SelfAdjoint,SetOpposite,DstEvaluatorTypeT,SrcEvaluatorTypeT,Functor,Version> : public generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version> { protected: typedef generic_dense_assignment_kernel<DstEvaluatorTypeT, SrcEvaluatorTypeT, Functor, Version> Base; typedef typename Base::DstXprType DstXprType; typedef typename Base::SrcXprType SrcXprType; using Base::m_dst; using Base::m_src; using Base::m_functor; public: typedef typename Base::DstEvaluatorType DstEvaluatorType; typedef typename Base::SrcEvaluatorType SrcEvaluatorType; typedef typename Base::Scalar Scalar; typedef typename Base::AssignmentTraits AssignmentTraits; triangular_dense_assignment_kernel(DstEvaluatorType &dst, const SrcEvaluatorType &src, const Functor &func, DstXprType& dstExpr) : Base(dst, src, func, dstExpr) {} void assignCoeff(Index row, Index col) { ; Scalar tmp = m_src.coeff(row,col); m_functor.assignCoeff(m_dst.coeffRef(row,col), tmp); m_functor.assignCoeff(m_dst.coeffRef(col,row), numext::conj(tmp)); } void assignDiagonalCoeff(Index id) { Base::assignCoeff(id,id); } void assignOppositeCoeff(Index, Index) { ; } }; } template<typename Derived> template<unsigned int UpLo> typename MatrixBase<Derived>::template ConstSelfAdjointViewReturnType<UpLo>::Type MatrixBase<Derived>::selfadjointView() const { return typename ConstSelfAdjointViewReturnType<UpLo>::Type(derived()); } # 342 "eigen-3.3.7/Eigen/src/Core/SelfAdjointView.h" template<typename Derived> template<unsigned int UpLo> typename MatrixBase<Derived>::template SelfAdjointViewReturnType<UpLo>::Type MatrixBase<Derived>::selfadjointView() { return typename SelfAdjointViewReturnType<UpLo>::Type(derived()); } } # 491 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" namespace Eigen { namespace internal { template<typename _LhsScalar, typename _RhsScalar, bool _ConjLhs=false, bool _ConjRhs=false> class gebp_traits; inline std::ptrdiff_t manage_caching_sizes_helper(std::ptrdiff_t a, std::ptrdiff_t b) { return a<=0 ? b : a; } const std::ptrdiff_t defaultL1CacheSize = 32*1024; const std::ptrdiff_t defaultL2CacheSize = 256*1024; const std::ptrdiff_t defaultL3CacheSize = 2*1024*1024; struct CacheSizes { CacheSizes(): m_l1(-1),m_l2(-1),m_l3(-1) { int l1CacheSize, l2CacheSize, l3CacheSize; queryCacheSizes(l1CacheSize, l2CacheSize, l3CacheSize); m_l1 = manage_caching_sizes_helper(l1CacheSize, defaultL1CacheSize); m_l2 = manage_caching_sizes_helper(l2CacheSize, defaultL2CacheSize); m_l3 = manage_caching_sizes_helper(l3CacheSize, defaultL3CacheSize); } std::ptrdiff_t m_l1; std::ptrdiff_t m_l2; std::ptrdiff_t m_l3; }; inline void manage_caching_sizes(Action action, std::ptrdiff_t* l1, std::ptrdiff_t* l2, std::ptrdiff_t* l3) { static CacheSizes m_cacheSizes; if(action==SetAction) { ; m_cacheSizes.m_l1 = *l1; m_cacheSizes.m_l2 = *l2; m_cacheSizes.m_l3 = *l3; } else if(action==GetAction) { ; *l1 = m_cacheSizes.m_l1; *l2 = m_cacheSizes.m_l2; *l3 = m_cacheSizes.m_l3; } else { ; } } # 92 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" template<typename LhsScalar, typename RhsScalar, int KcFactor, typename Index> void evaluateProductBlockingSizesHeuristic(Index& k, Index& m, Index& n, Index num_threads = 1) { typedef gebp_traits<LhsScalar,RhsScalar> Traits; std::ptrdiff_t l1, l2, l3; manage_caching_sizes(GetAction, &l1, &l2, &l3); if (num_threads > 1) { typedef typename Traits::ResScalar ResScalar; enum { kdiv = KcFactor * (Traits::mr * sizeof(LhsScalar) + Traits::nr * sizeof(RhsScalar)), ksub = Traits::mr * Traits::nr * sizeof(ResScalar), kr = 8, mr = Traits::mr, nr = Traits::nr }; const Index k_cache = (numext::mini<Index>)((l1-ksub)/kdiv, 320); if (k_cache < k) { k = k_cache - (k_cache % kr); ; } const Index n_cache = (l2-l1) / (nr * sizeof(RhsScalar) * k); const Index n_per_thread = numext::div_ceil(n, num_threads); if (n_cache <= n_per_thread) { ; n = n_cache - (n_cache % nr); ; } else { n = (numext::mini<Index>)(n, (n_per_thread + nr - 1) - ((n_per_thread + nr - 1) % nr)); } if (l3 > l2) { const Index m_cache = (l3-l2) / (sizeof(LhsScalar) * k * num_threads); const Index m_per_thread = numext::div_ceil(m, num_threads); if(m_cache < m_per_thread && m_cache >= static_cast<Index>(mr)) { m = m_cache - (m_cache % mr); ; } else { m = (numext::mini<Index>)(m, (m_per_thread + mr - 1) - ((m_per_thread + mr - 1) % mr)); } } } else { # 160 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" if((numext::maxi)(k,(numext::maxi)(m,n))<48) return; typedef typename Traits::ResScalar ResScalar; enum { k_peeling = 8, k_div = KcFactor * (Traits::mr * sizeof(LhsScalar) + Traits::nr * sizeof(RhsScalar)), k_sub = Traits::mr * Traits::nr * sizeof(ResScalar) }; # 177 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" const Index max_kc = numext::maxi<Index>(((l1-k_sub)/k_div) & (~(k_peeling-1)),1); const Index old_k = k; if(k>max_kc) { k = (k%max_kc)==0 ? max_kc : max_kc - k_peeling * ((max_kc-1-(k%max_kc))/(k_peeling*(k/max_kc+1))); ; } # 199 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" const Index actual_l2 = 1572864; # 208 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" Index max_nc; const Index lhs_bytes = m * k * sizeof(LhsScalar); const Index remaining_l1 = l1- k_sub - lhs_bytes; if(remaining_l1 >= Index(Traits::nr*sizeof(RhsScalar))*k) { max_nc = remaining_l1 / (k*sizeof(RhsScalar)); } else { max_nc = (3*actual_l2)/(2*2*max_kc*sizeof(RhsScalar)); } Index nc = numext::mini<Index>(actual_l2/(2*k*sizeof(RhsScalar)), max_nc) & (~(Traits::nr-1)); if(n>nc) { n = (n%nc)==0 ? nc : (nc - Traits::nr * ((nc -(n%nc))/(Traits::nr*(n/nc+1)))); } else if(old_k==k) { Index problem_size = k*n*sizeof(LhsScalar); Index actual_lm = actual_l2; Index max_mc = m; if(problem_size<=1024) { actual_lm = l1; } else if(l3!=0 && problem_size<=32768) { actual_lm = l2; max_mc = (numext::mini<Index>)(576,max_mc); } Index mc = (numext::mini<Index>)(actual_lm/(3*k*sizeof(LhsScalar)), max_mc); if (mc > Traits::mr) mc -= mc % Traits::mr; else if (mc==0) return; m = (m%mc)==0 ? mc : (mc - Traits::mr * ((mc -(m%mc))/(Traits::mr*(m/mc+1)))); } } } template <typename Index> inline bool useSpecificBlockingSizes(Index& k, Index& m, Index& n) { # 273 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" Eigen::internal::ignore_unused_variable(k); Eigen::internal::ignore_unused_variable(m); Eigen::internal::ignore_unused_variable(n); return false; } # 296 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" template<typename LhsScalar, typename RhsScalar, int KcFactor, typename Index> void computeProductBlockingSizes(Index& k, Index& m, Index& n, Index num_threads = 1) { if (!useSpecificBlockingSizes(k, m, n)) { evaluateProductBlockingSizesHeuristic<LhsScalar, RhsScalar, KcFactor, Index>(k, m, n, num_threads); } } template<typename LhsScalar, typename RhsScalar, typename Index> inline void computeProductBlockingSizes(Index& k, Index& m, Index& n, Index num_threads = 1) { computeProductBlockingSizes<LhsScalar,RhsScalar,1,Index>(k, m, n, num_threads); } template<typename CJ, typename A, typename B, typename C, typename T> struct gebp_madd_selector { __attribute__((always_inline)) inline static void run(const CJ& cj, A& a, B& b, C& c, T& ) { c = cj.pmadd(a,b,c); } }; template<typename CJ, typename T> struct gebp_madd_selector<CJ,T,T,T,T> { __attribute__((always_inline)) inline static void run(const CJ& cj, T& a, T& b, T& c, T& t) { t = b; t = cj.pmul(a,t); c = padd(c,t); } }; template<typename CJ, typename A, typename B, typename C, typename T> inline void gebp_madd(const CJ& cj, A& a, B& b, C& c, T& t) { gebp_madd_selector<CJ,A,B,C,T>::run(cj,a,b,c,t); } # 350 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" template<typename _LhsScalar, typename _RhsScalar, bool _ConjLhs, bool _ConjRhs> class gebp_traits { public: typedef _LhsScalar LhsScalar; typedef _RhsScalar RhsScalar; typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; enum { ConjLhs = _ConjLhs, ConjRhs = _ConjRhs, Vectorizable = packet_traits<LhsScalar>::Vectorizable && packet_traits<RhsScalar>::Vectorizable, LhsPacketSize = Vectorizable ? packet_traits<LhsScalar>::size : 1, RhsPacketSize = Vectorizable ? packet_traits<RhsScalar>::size : 1, ResPacketSize = Vectorizable ? packet_traits<ResScalar>::size : 1, NumberOfRegisters = 8, nr = 4, default_mr = ((((int)16 <= (int)NumberOfRegisters) ? (int)16 : (int)NumberOfRegisters)/2/nr)*LhsPacketSize, mr = default_mr, LhsProgress = LhsPacketSize, RhsProgress = 1 }; typedef typename packet_traits<LhsScalar>::type _LhsPacket; typedef typename packet_traits<RhsScalar>::type _RhsPacket; typedef typename packet_traits<ResScalar>::type _ResPacket; typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket; typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket; typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket; typedef ResPacket AccPacket; inline void initAcc(AccPacket& p) { p = pset1<ResPacket>(ResScalar(0)); } inline void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) { pbroadcast4(b, b0, b1, b2, b3); } template<typename RhsPacketType> inline void loadRhs(const RhsScalar* b, RhsPacketType& dest) const { dest = pset1<RhsPacketType>(*b); } inline void loadRhsQuad(const RhsScalar* b, RhsPacket& dest) const { dest = ploadquad<RhsPacket>(b); } template<typename LhsPacketType> inline void loadLhs(const LhsScalar* a, LhsPacketType& dest) const { dest = pload<LhsPacketType>(a); } template<typename LhsPacketType> inline void loadLhsUnaligned(const LhsScalar* a, LhsPacketType& dest) const { dest = ploadu<LhsPacketType>(a); } template<typename LhsPacketType, typename RhsPacketType, typename AccPacketType> inline void madd(const LhsPacketType& a, const RhsPacketType& b, AccPacketType& c, AccPacketType& tmp) const { conj_helper<LhsPacketType,RhsPacketType,ConjLhs,ConjRhs> cj; # 446 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" tmp = b; tmp = cj.pmul(a,tmp); c = padd(c,tmp); } inline void acc(const AccPacket& c, const ResPacket& alpha, ResPacket& r) const { r = pmadd(c,alpha,r); } template<typename ResPacketHalf> inline void acc(const ResPacketHalf& c, const ResPacketHalf& alpha, ResPacketHalf& r) const { r = pmadd(c,alpha,r); } }; template<typename RealScalar, bool _ConjLhs> class gebp_traits<std::complex<RealScalar>, RealScalar, _ConjLhs, false> { public: typedef std::complex<RealScalar> LhsScalar; typedef RealScalar RhsScalar; typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; enum { ConjLhs = _ConjLhs, ConjRhs = false, Vectorizable = packet_traits<LhsScalar>::Vectorizable && packet_traits<RhsScalar>::Vectorizable, LhsPacketSize = Vectorizable ? packet_traits<LhsScalar>::size : 1, RhsPacketSize = Vectorizable ? packet_traits<RhsScalar>::size : 1, ResPacketSize = Vectorizable ? packet_traits<ResScalar>::size : 1, NumberOfRegisters = 8, nr = 4, mr = ((((int)16 <= (int)NumberOfRegisters) ? (int)16 : (int)NumberOfRegisters)/2/nr)*LhsPacketSize, LhsProgress = LhsPacketSize, RhsProgress = 1 }; typedef typename packet_traits<LhsScalar>::type _LhsPacket; typedef typename packet_traits<RhsScalar>::type _RhsPacket; typedef typename packet_traits<ResScalar>::type _ResPacket; typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket; typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket; typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket; typedef ResPacket AccPacket; inline void initAcc(AccPacket& p) { p = pset1<ResPacket>(ResScalar(0)); } inline void loadRhs(const RhsScalar* b, RhsPacket& dest) const { dest = pset1<RhsPacket>(*b); } inline void loadRhsQuad(const RhsScalar* b, RhsPacket& dest) const { dest = pset1<RhsPacket>(*b); } inline void loadLhs(const LhsScalar* a, LhsPacket& dest) const { dest = pload<LhsPacket>(a); } inline void loadLhsUnaligned(const LhsScalar* a, LhsPacket& dest) const { dest = ploadu<LhsPacket>(a); } inline void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) { pbroadcast4(b, b0, b1, b2, b3); } inline void madd(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp) const { madd_impl(a, b, c, tmp, typename conditional<Vectorizable,true_type,false_type>::type()); } inline void madd_impl(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp, const true_type&) const { tmp = b; tmp = pmul(a.v,tmp); c.v = padd(c.v,tmp); } inline void madd_impl(const LhsScalar& a, const RhsScalar& b, ResScalar& c, RhsScalar& , const false_type&) const { c += a * b; } inline void acc(const AccPacket& c, const ResPacket& alpha, ResPacket& r) const { r = cj.pmadd(c,alpha,r); } protected: conj_helper<ResPacket,ResPacket,ConjLhs,false> cj; }; template<typename Packet> struct DoublePacket { Packet first; Packet second; }; template<typename Packet> DoublePacket<Packet> padd(const DoublePacket<Packet> &a, const DoublePacket<Packet> &b) { DoublePacket<Packet> res; res.first = padd(a.first, b.first); res.second = padd(a.second,b.second); return res; } template<typename Packet> const DoublePacket<Packet>& predux_downto4(const DoublePacket<Packet> &a) { return a; } template<typename Packet> struct unpacket_traits<DoublePacket<Packet> > { typedef DoublePacket<Packet> half; }; # 598 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" template<typename RealScalar, bool _ConjLhs, bool _ConjRhs> class gebp_traits<std::complex<RealScalar>, std::complex<RealScalar>, _ConjLhs, _ConjRhs > { public: typedef std::complex<RealScalar> Scalar; typedef std::complex<RealScalar> LhsScalar; typedef std::complex<RealScalar> RhsScalar; typedef std::complex<RealScalar> ResScalar; enum { ConjLhs = _ConjLhs, ConjRhs = _ConjRhs, Vectorizable = packet_traits<RealScalar>::Vectorizable && packet_traits<Scalar>::Vectorizable, RealPacketSize = Vectorizable ? packet_traits<RealScalar>::size : 1, ResPacketSize = Vectorizable ? packet_traits<ResScalar>::size : 1, LhsPacketSize = Vectorizable ? packet_traits<LhsScalar>::size : 1, RhsPacketSize = Vectorizable ? packet_traits<RhsScalar>::size : 1, nr = 4, mr = ResPacketSize, LhsProgress = ResPacketSize, RhsProgress = 1 }; typedef typename packet_traits<RealScalar>::type RealPacket; typedef typename packet_traits<Scalar>::type ScalarPacket; typedef DoublePacket<RealPacket> DoublePacketType; typedef typename conditional<Vectorizable,RealPacket, Scalar>::type LhsPacket; typedef typename conditional<Vectorizable,DoublePacketType,Scalar>::type RhsPacket; typedef typename conditional<Vectorizable,ScalarPacket,Scalar>::type ResPacket; typedef typename conditional<Vectorizable,DoublePacketType,Scalar>::type AccPacket; inline void initAcc(Scalar& p) { p = Scalar(0); } inline void initAcc(DoublePacketType& p) { p.first = pset1<RealPacket>(RealScalar(0)); p.second = pset1<RealPacket>(RealScalar(0)); } inline void loadRhs(const RhsScalar* b, ResPacket& dest) const { dest = pset1<ResPacket>(*b); } inline void loadRhs(const RhsScalar* b, DoublePacketType& dest) const { dest.first = pset1<RealPacket>(real(*b)); dest.second = pset1<RealPacket>(imag(*b)); } inline void loadRhsQuad(const RhsScalar* b, ResPacket& dest) const { loadRhs(b,dest); } inline void loadRhsQuad(const RhsScalar* b, DoublePacketType& dest) const { ; loadRhs(b,dest); } inline void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) { loadRhs(b+0, b0); loadRhs(b+1, b1); loadRhs(b+2, b2); loadRhs(b+3, b3); } inline void broadcastRhs(const RhsScalar* b, DoublePacketType& b0, DoublePacketType& b1) { loadRhs(b+0, b0); loadRhs(b+1, b1); } inline void broadcastRhs(const RhsScalar* b, RhsScalar& b0, RhsScalar& b1) { loadRhs(b+0, b0); loadRhs(b+1, b1); } inline void loadLhs(const LhsScalar* a, LhsPacket& dest) const { dest = pload<LhsPacket>((const typename unpacket_traits<LhsPacket>::type*)(a)); } inline void loadLhsUnaligned(const LhsScalar* a, LhsPacket& dest) const { dest = ploadu<LhsPacket>((const typename unpacket_traits<LhsPacket>::type*)(a)); } inline void madd(const LhsPacket& a, const RhsPacket& b, DoublePacketType& c, RhsPacket& ) const { c.first = padd(pmul(a,b.first), c.first); c.second = padd(pmul(a,b.second),c.second); } inline void madd(const LhsPacket& a, const RhsPacket& b, ResPacket& c, RhsPacket& ) const { c = cj.pmadd(a,b,c); } inline void acc(const Scalar& c, const Scalar& alpha, Scalar& r) const { r += alpha * c; } inline void acc(const DoublePacketType& c, const ResPacket& alpha, ResPacket& r) const { ResPacket tmp; if((!ConjLhs)&&(!ConjRhs)) { tmp = pcplxflip(pconj(ResPacket(c.second))); tmp = padd(ResPacket(c.first),tmp); } else if((!ConjLhs)&&(ConjRhs)) { tmp = pconj(pcplxflip(ResPacket(c.second))); tmp = padd(ResPacket(c.first),tmp); } else if((ConjLhs)&&(!ConjRhs)) { tmp = pcplxflip(ResPacket(c.second)); tmp = padd(pconj(ResPacket(c.first)),tmp); } else if((ConjLhs)&&(ConjRhs)) { tmp = pcplxflip(ResPacket(c.second)); tmp = psub(pconj(ResPacket(c.first)),tmp); } r = pmadd(tmp,alpha,r); } protected: conj_helper<LhsScalar,RhsScalar,ConjLhs,ConjRhs> cj; }; template<typename RealScalar, bool _ConjRhs> class gebp_traits<RealScalar, std::complex<RealScalar>, false, _ConjRhs > { public: typedef std::complex<RealScalar> Scalar; typedef RealScalar LhsScalar; typedef Scalar RhsScalar; typedef Scalar ResScalar; enum { ConjLhs = false, ConjRhs = _ConjRhs, Vectorizable = packet_traits<RealScalar>::Vectorizable && packet_traits<Scalar>::Vectorizable, LhsPacketSize = Vectorizable ? packet_traits<LhsScalar>::size : 1, RhsPacketSize = Vectorizable ? packet_traits<RhsScalar>::size : 1, ResPacketSize = Vectorizable ? packet_traits<ResScalar>::size : 1, NumberOfRegisters = 8, nr = 4, mr = ((((int)16 <= (int)NumberOfRegisters) ? (int)16 : (int)NumberOfRegisters)/2/nr)*ResPacketSize, LhsProgress = ResPacketSize, RhsProgress = 1 }; typedef typename packet_traits<LhsScalar>::type _LhsPacket; typedef typename packet_traits<RhsScalar>::type _RhsPacket; typedef typename packet_traits<ResScalar>::type _ResPacket; typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket; typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket; typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket; typedef ResPacket AccPacket; inline void initAcc(AccPacket& p) { p = pset1<ResPacket>(ResScalar(0)); } inline void loadRhs(const RhsScalar* b, RhsPacket& dest) const { dest = pset1<RhsPacket>(*b); } void broadcastRhs(const RhsScalar* b, RhsPacket& b0, RhsPacket& b1, RhsPacket& b2, RhsPacket& b3) { pbroadcast4(b, b0, b1, b2, b3); } # 805 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" inline void loadLhs(const LhsScalar* a, LhsPacket& dest) const { dest = ploaddup<LhsPacket>(a); } inline void loadRhsQuad(const RhsScalar* b, RhsPacket& dest) const { ; loadRhs(b,dest); } inline void loadLhsUnaligned(const LhsScalar* a, LhsPacket& dest) const { dest = ploaddup<LhsPacket>(a); } inline void madd(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp) const { madd_impl(a, b, c, tmp, typename conditional<Vectorizable,true_type,false_type>::type()); } inline void madd_impl(const LhsPacket& a, const RhsPacket& b, AccPacket& c, RhsPacket& tmp, const true_type&) const { tmp = b; tmp.v = pmul(a,tmp.v); c = padd(c,tmp); } inline void madd_impl(const LhsScalar& a, const RhsScalar& b, ResScalar& c, RhsScalar& , const false_type&) const { c += a * b; } inline void acc(const AccPacket& c, const ResPacket& alpha, ResPacket& r) const { r = cj.pmadd(alpha,c,r); } protected: conj_helper<ResPacket,ResPacket,false,ConjRhs> cj; }; # 858 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" template<typename LhsScalar, typename RhsScalar, typename Index, typename DataMapper, int mr, int nr, bool ConjugateLhs, bool ConjugateRhs> struct gebp_kernel { typedef gebp_traits<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> Traits; typedef typename Traits::ResScalar ResScalar; typedef typename Traits::LhsPacket LhsPacket; typedef typename Traits::RhsPacket RhsPacket; typedef typename Traits::ResPacket ResPacket; typedef typename Traits::AccPacket AccPacket; typedef gebp_traits<RhsScalar,LhsScalar,ConjugateRhs,ConjugateLhs> SwappedTraits; typedef typename SwappedTraits::ResScalar SResScalar; typedef typename SwappedTraits::LhsPacket SLhsPacket; typedef typename SwappedTraits::RhsPacket SRhsPacket; typedef typename SwappedTraits::ResPacket SResPacket; typedef typename SwappedTraits::AccPacket SAccPacket; typedef typename DataMapper::LinearMapper LinearMapper; enum { Vectorizable = Traits::Vectorizable, LhsProgress = Traits::LhsProgress, RhsProgress = Traits::RhsProgress, ResPacketSize = Traits::ResPacketSize }; __attribute__((noinline)) void operator()(const DataMapper& res, const LhsScalar* blockA, const RhsScalar* blockB, Index rows, Index depth, Index cols, ResScalar alpha, Index strideA=-1, Index strideB=-1, Index offsetA=0, Index offsetB=0); }; template<typename LhsScalar, typename RhsScalar, typename Index, typename DataMapper, int mr, int nr, bool ConjugateLhs, bool ConjugateRhs> __attribute__((noinline)) void gebp_kernel<LhsScalar,RhsScalar,Index,DataMapper,mr,nr,ConjugateLhs,ConjugateRhs> ::operator()(const DataMapper& res, const LhsScalar* blockA, const RhsScalar* blockB, Index rows, Index depth, Index cols, ResScalar alpha, Index strideA, Index strideB, Index offsetA, Index offsetB) { Traits traits; SwappedTraits straits; if(strideA==-1) strideA = depth; if(strideB==-1) strideB = depth; conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj; Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; const Index peeled_mc3 = mr>=3*Traits::LhsProgress ? (rows/(3*LhsProgress))*(3*LhsProgress) : 0; const Index peeled_mc2 = mr>=2*Traits::LhsProgress ? peeled_mc3+((rows-peeled_mc3)/(2*LhsProgress))*(2*LhsProgress) : 0; const Index peeled_mc1 = mr>=1*Traits::LhsProgress ? (rows/(1*LhsProgress))*(1*LhsProgress) : 0; enum { pk = 8 }; const Index peeled_kc = depth & ~(pk-1); const Index prefetch_res_offset = 32/sizeof(ResScalar); if(mr>=3*Traits::LhsProgress) { const Index l1 = defaultL1CacheSize; const Index actual_panel_rows = (3*LhsProgress) * std::max<Index>(1,( (l1 - sizeof(ResScalar)*mr*nr - depth*nr*sizeof(RhsScalar)) / (depth * sizeof(LhsScalar) * 3*LhsProgress) )); for(Index i1=0; i1<peeled_mc3; i1+=actual_panel_rows) { const Index actual_panel_end = (std::min)(i1+actual_panel_rows, peeled_mc3); for(Index j2=0; j2<packet_cols4; j2+=nr) { for(Index i=i1; i<actual_panel_end; i+=3*LhsProgress) { const LhsScalar* blA = &blockA[i*strideA+offsetA*(3*LhsProgress)]; prefetch(&blA[0]); AccPacket C0, C1, C2, C3, C4, C5, C6, C7, C8, C9, C10, C11; traits.initAcc(C0); traits.initAcc(C1); traits.initAcc(C2); traits.initAcc(C3); traits.initAcc(C4); traits.initAcc(C5); traits.initAcc(C6); traits.initAcc(C7); traits.initAcc(C8); traits.initAcc(C9); traits.initAcc(C10); traits.initAcc(C11); LinearMapper r0 = res.getLinearMapper(i, j2 + 0); LinearMapper r1 = res.getLinearMapper(i, j2 + 1); LinearMapper r2 = res.getLinearMapper(i, j2 + 2); LinearMapper r3 = res.getLinearMapper(i, j2 + 3); r0.prefetch(0); r1.prefetch(0); r2.prefetch(0); r3.prefetch(0); const RhsScalar* blB = &blockB[j2*strideB+offsetB*nr]; prefetch(&blB[0]); LhsPacket A0, A1; for(Index k=0; k<peeled_kc; k+=pk) { __asm__("#" "begin gebp micro kernel 3pX4"); RhsPacket B_0, T0; LhsPacket A2; # 998 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" internal::prefetch(blB); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*0 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*0 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*0)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*0)*LhsProgress], A2); traits.loadRhs(blB + (0+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*1 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*1 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*1)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*1)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*1)*LhsProgress], A2); traits.loadRhs(blB + (0+4*1)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*1)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*1)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*1)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*2 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*2 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*2)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*2)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*2)*LhsProgress], A2); traits.loadRhs(blB + (0+4*2)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*2)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*2)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*2)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*3 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*3 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*3)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*3)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*3)*LhsProgress], A2); traits.loadRhs(blB + (0+4*3)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*3)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*3)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*3)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*4 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*4 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*4)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*4)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*4)*LhsProgress], A2); traits.loadRhs(blB + (0+4*4)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*4)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*4)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*4)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*5 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*5 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*5)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*5)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*5)*LhsProgress], A2); traits.loadRhs(blB + (0+4*5)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*5)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*5)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*5)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*6 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*6 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*6)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*6)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*6)*LhsProgress], A2); traits.loadRhs(blB + (0+4*6)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*6)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*6)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*6)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*7 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*7 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*7)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*7)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*7)*LhsProgress], A2); traits.loadRhs(blB + (0+4*7)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*7)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*7)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*7)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); blB += pk*4*RhsProgress; blA += pk*3*Traits::LhsProgress; __asm__("#" "end gebp micro kernel 3pX4"); } for(Index k=peeled_kc; k<depth; k++) { RhsPacket B_0, T0; LhsPacket A2; do { __asm__("#" "begin step of gebp micro kernel 3pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); internal::prefetch(blA+(3*0 +16)*LhsProgress); if (0) { internal::prefetch(blB+(4*0 +16)*RhsProgress); } traits.loadLhs(&blA[(0+3*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*0)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*0)*LhsProgress], A2); traits.loadRhs(blB + (0+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, T0); traits.madd(A2, B_0, C8, B_0); traits.loadRhs(blB + (1+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C1, T0); traits.madd(A1, B_0, C5, T0); traits.madd(A2, B_0, C9, B_0); traits.loadRhs(blB + (2+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C2, T0); traits.madd(A1, B_0, C6, T0); traits.madd(A2, B_0, C10, B_0); traits.loadRhs(blB + (3+4*0)*Traits::RhsProgress, B_0); traits.madd(A0, B_0, C3 , T0); traits.madd(A1, B_0, C7, T0); traits.madd(A2, B_0, C11, B_0); __asm__("#" "end step of gebp micro kernel 3pX4"); } while(false); blB += 4*RhsProgress; blA += 3*Traits::LhsProgress; } ResPacket R0, R1, R2; ResPacket alphav = pset1<ResPacket>(alpha); R0 = r0.loadPacket(0 * Traits::ResPacketSize); R1 = r0.loadPacket(1 * Traits::ResPacketSize); R2 = r0.loadPacket(2 * Traits::ResPacketSize); traits.acc(C0, alphav, R0); traits.acc(C4, alphav, R1); traits.acc(C8, alphav, R2); r0.storePacket(0 * Traits::ResPacketSize, R0); r0.storePacket(1 * Traits::ResPacketSize, R1); r0.storePacket(2 * Traits::ResPacketSize, R2); R0 = r1.loadPacket(0 * Traits::ResPacketSize); R1 = r1.loadPacket(1 * Traits::ResPacketSize); R2 = r1.loadPacket(2 * Traits::ResPacketSize); traits.acc(C1, alphav, R0); traits.acc(C5, alphav, R1); traits.acc(C9, alphav, R2); r1.storePacket(0 * Traits::ResPacketSize, R0); r1.storePacket(1 * Traits::ResPacketSize, R1); r1.storePacket(2 * Traits::ResPacketSize, R2); R0 = r2.loadPacket(0 * Traits::ResPacketSize); R1 = r2.loadPacket(1 * Traits::ResPacketSize); R2 = r2.loadPacket(2 * Traits::ResPacketSize); traits.acc(C2, alphav, R0); traits.acc(C6, alphav, R1); traits.acc(C10, alphav, R2); r2.storePacket(0 * Traits::ResPacketSize, R0); r2.storePacket(1 * Traits::ResPacketSize, R1); r2.storePacket(2 * Traits::ResPacketSize, R2); R0 = r3.loadPacket(0 * Traits::ResPacketSize); R1 = r3.loadPacket(1 * Traits::ResPacketSize); R2 = r3.loadPacket(2 * Traits::ResPacketSize); traits.acc(C3, alphav, R0); traits.acc(C7, alphav, R1); traits.acc(C11, alphav, R2); r3.storePacket(0 * Traits::ResPacketSize, R0); r3.storePacket(1 * Traits::ResPacketSize, R1); r3.storePacket(2 * Traits::ResPacketSize, R2); } } for(Index j2=packet_cols4; j2<cols; j2++) { for(Index i=i1; i<actual_panel_end; i+=3*LhsProgress) { const LhsScalar* blA = &blockA[i*strideA+offsetA*(3*Traits::LhsProgress)]; prefetch(&blA[0]); AccPacket C0, C4, C8; traits.initAcc(C0); traits.initAcc(C4); traits.initAcc(C8); LinearMapper r0 = res.getLinearMapper(i, j2); r0.prefetch(0); const RhsScalar* blB = &blockB[j2*strideB+offsetB]; LhsPacket A0, A1, A2; for(Index k=0; k<peeled_kc; k+=pk) { __asm__("#" "begin gebp micro kernel 3pX1"); RhsPacket B_0; # 1110 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*0)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*0)*LhsProgress], A2); traits.loadRhs(&blB[(0+0)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*1)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*1)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*1)*LhsProgress], A2); traits.loadRhs(&blB[(0+1)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*2)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*2)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*2)*LhsProgress], A2); traits.loadRhs(&blB[(0+2)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*3)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*3)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*3)*LhsProgress], A2); traits.loadRhs(&blB[(0+3)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*4)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*4)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*4)*LhsProgress], A2); traits.loadRhs(&blB[(0+4)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*5)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*5)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*5)*LhsProgress], A2); traits.loadRhs(&blB[(0+5)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*6)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*6)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*6)*LhsProgress], A2); traits.loadRhs(&blB[(0+6)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*7)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*7)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*7)*LhsProgress], A2); traits.loadRhs(&blB[(0+7)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); blB += pk*RhsProgress; blA += pk*3*Traits::LhsProgress; __asm__("#" "end gebp micro kernel 3pX1"); } for(Index k=peeled_kc; k<depth; k++) { RhsPacket B_0; do { __asm__("#" "begin step of gebp micro kernel 3pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+3*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+3*0)*LhsProgress], A1); traits.loadLhs(&blA[(2+3*0)*LhsProgress], A2); traits.loadRhs(&blB[(0+0)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); traits.madd(A1, B_0, C4, B_0); traits.madd(A2, B_0, C8, B_0); __asm__("#" "end step of gebp micro kernel 3pX1"); } while(false); blB += RhsProgress; blA += 3*Traits::LhsProgress; } ResPacket R0, R1, R2; ResPacket alphav = pset1<ResPacket>(alpha); R0 = r0.loadPacket(0 * Traits::ResPacketSize); R1 = r0.loadPacket(1 * Traits::ResPacketSize); R2 = r0.loadPacket(2 * Traits::ResPacketSize); traits.acc(C0, alphav, R0); traits.acc(C4, alphav, R1); traits.acc(C8, alphav, R2); r0.storePacket(0 * Traits::ResPacketSize, R0); r0.storePacket(1 * Traits::ResPacketSize, R1); r0.storePacket(2 * Traits::ResPacketSize, R2); } } } } if(mr>=2*Traits::LhsProgress) { const Index l1 = defaultL1CacheSize; Index actual_panel_rows = (2*LhsProgress) * std::max<Index>(1,( (l1 - sizeof(ResScalar)*mr*nr - depth*nr*sizeof(RhsScalar)) / (depth * sizeof(LhsScalar) * 2*LhsProgress) )); for(Index i1=peeled_mc3; i1<peeled_mc2; i1+=actual_panel_rows) { Index actual_panel_end = (std::min)(i1+actual_panel_rows, peeled_mc2); for(Index j2=0; j2<packet_cols4; j2+=nr) { for(Index i=i1; i<actual_panel_end; i+=2*LhsProgress) { const LhsScalar* blA = &blockA[i*strideA+offsetA*(2*Traits::LhsProgress)]; prefetch(&blA[0]); AccPacket C0, C1, C2, C3, C4, C5, C6, C7; traits.initAcc(C0); traits.initAcc(C1); traits.initAcc(C2); traits.initAcc(C3); traits.initAcc(C4); traits.initAcc(C5); traits.initAcc(C6); traits.initAcc(C7); LinearMapper r0 = res.getLinearMapper(i, j2 + 0); LinearMapper r1 = res.getLinearMapper(i, j2 + 1); LinearMapper r2 = res.getLinearMapper(i, j2 + 2); LinearMapper r3 = res.getLinearMapper(i, j2 + 3); r0.prefetch(prefetch_res_offset); r1.prefetch(prefetch_res_offset); r2.prefetch(prefetch_res_offset); r3.prefetch(prefetch_res_offset); const RhsScalar* blB = &blockB[j2*strideB+offsetB*nr]; prefetch(&blB[0]); LhsPacket A0, A1; for(Index k=0; k<peeled_kc; k+=pk) { __asm__("#" "begin gebp micro kernel 2pX4"); RhsPacket B_0, B1, B2, B3, T0; # 1225 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" internal::prefetch(blB+(48+0)); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*0)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*0)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*1)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*1)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*1)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*2)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*2)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*2)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*3)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*3)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*3)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); internal::prefetch(blB+(48+16)); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*4)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*4)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*4)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*5)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*5)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*5)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*6)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*6)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*6)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*7)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*7)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*7)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); blB += pk*4*RhsProgress; blA += pk*(2*Traits::LhsProgress); __asm__("#" "end gebp micro kernel 2pX4"); } for(Index k=peeled_kc; k<depth; k++) { RhsPacket B_0, B1, B2, B3, T0; do { __asm__("#" "begin step of gebp micro kernel 2pX4"); traits.loadLhs(&blA[(0+2*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*0)*LhsProgress], A1); traits.broadcastRhs(&blB[(0+4*0)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, T0); traits.madd(A1, B_0, C4, B_0); traits.madd(A0, B1, C1, T0); traits.madd(A1, B1, C5, B1); traits.madd(A0, B2, C2, T0); traits.madd(A1, B2, C6, B2); traits.madd(A0, B3, C3, T0); traits.madd(A1, B3, C7, B3); __asm__("#" "end step of gebp micro kernel 2pX4"); } while(false); blB += 4*RhsProgress; blA += 2*Traits::LhsProgress; } ResPacket R0, R1, R2, R3; ResPacket alphav = pset1<ResPacket>(alpha); R0 = r0.loadPacket(0 * Traits::ResPacketSize); R1 = r0.loadPacket(1 * Traits::ResPacketSize); R2 = r1.loadPacket(0 * Traits::ResPacketSize); R3 = r1.loadPacket(1 * Traits::ResPacketSize); traits.acc(C0, alphav, R0); traits.acc(C4, alphav, R1); traits.acc(C1, alphav, R2); traits.acc(C5, alphav, R3); r0.storePacket(0 * Traits::ResPacketSize, R0); r0.storePacket(1 * Traits::ResPacketSize, R1); r1.storePacket(0 * Traits::ResPacketSize, R2); r1.storePacket(1 * Traits::ResPacketSize, R3); R0 = r2.loadPacket(0 * Traits::ResPacketSize); R1 = r2.loadPacket(1 * Traits::ResPacketSize); R2 = r3.loadPacket(0 * Traits::ResPacketSize); R3 = r3.loadPacket(1 * Traits::ResPacketSize); traits.acc(C2, alphav, R0); traits.acc(C6, alphav, R1); traits.acc(C3, alphav, R2); traits.acc(C7, alphav, R3); r2.storePacket(0 * Traits::ResPacketSize, R0); r2.storePacket(1 * Traits::ResPacketSize, R1); r3.storePacket(0 * Traits::ResPacketSize, R2); r3.storePacket(1 * Traits::ResPacketSize, R3); } } for(Index j2=packet_cols4; j2<cols; j2++) { for(Index i=i1; i<actual_panel_end; i+=2*LhsProgress) { const LhsScalar* blA = &blockA[i*strideA+offsetA*(2*Traits::LhsProgress)]; prefetch(&blA[0]); AccPacket C0, C4; traits.initAcc(C0); traits.initAcc(C4); LinearMapper r0 = res.getLinearMapper(i, j2); r0.prefetch(prefetch_res_offset); const RhsScalar* blB = &blockB[j2*strideB+offsetB]; LhsPacket A0, A1; for(Index k=0; k<peeled_kc; k+=pk) { __asm__("#" "begin gebp micro kernel 2pX1"); RhsPacket B_0, B1; # 1320 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*0)*LhsProgress], A1); traits.loadRhs(&blB[(0+0)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*1)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*1)*LhsProgress], A1); traits.loadRhs(&blB[(0+1)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*2)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*2)*LhsProgress], A1); traits.loadRhs(&blB[(0+2)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*3)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*3)*LhsProgress], A1); traits.loadRhs(&blB[(0+3)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*4)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*4)*LhsProgress], A1); traits.loadRhs(&blB[(0+4)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*5)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*5)*LhsProgress], A1); traits.loadRhs(&blB[(0+5)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*6)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*6)*LhsProgress], A1); traits.loadRhs(&blB[(0+6)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*7)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*7)*LhsProgress], A1); traits.loadRhs(&blB[(0+7)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); blB += pk*RhsProgress; blA += pk*2*Traits::LhsProgress; __asm__("#" "end gebp micro kernel 2pX1"); } for(Index k=peeled_kc; k<depth; k++) { RhsPacket B_0, B1; do { __asm__("#" "begin step of gebp micro kernel 2pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+2*0)*LhsProgress], A0); traits.loadLhs(&blA[(1+2*0)*LhsProgress], A1); traits.loadRhs(&blB[(0+0)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B1); traits.madd(A1, B_0, C4, B_0); __asm__("#" "end step of gebp micro kernel 2pX1"); } while(false); blB += RhsProgress; blA += 2*Traits::LhsProgress; } ResPacket R0, R1; ResPacket alphav = pset1<ResPacket>(alpha); R0 = r0.loadPacket(0 * Traits::ResPacketSize); R1 = r0.loadPacket(1 * Traits::ResPacketSize); traits.acc(C0, alphav, R0); traits.acc(C4, alphav, R1); r0.storePacket(0 * Traits::ResPacketSize, R0); r0.storePacket(1 * Traits::ResPacketSize, R1); } } } } if(mr>=1*Traits::LhsProgress) { for(Index i=peeled_mc2; i<peeled_mc1; i+=1*LhsProgress) { for(Index j2=0; j2<packet_cols4; j2+=nr) { const LhsScalar* blA = &blockA[i*strideA+offsetA*(1*Traits::LhsProgress)]; prefetch(&blA[0]); AccPacket C0, C1, C2, C3; traits.initAcc(C0); traits.initAcc(C1); traits.initAcc(C2); traits.initAcc(C3); LinearMapper r0 = res.getLinearMapper(i, j2 + 0); LinearMapper r1 = res.getLinearMapper(i, j2 + 1); LinearMapper r2 = res.getLinearMapper(i, j2 + 2); LinearMapper r3 = res.getLinearMapper(i, j2 + 3); r0.prefetch(prefetch_res_offset); r1.prefetch(prefetch_res_offset); r2.prefetch(prefetch_res_offset); r3.prefetch(prefetch_res_offset); const RhsScalar* blB = &blockB[j2*strideB+offsetB*nr]; prefetch(&blB[0]); LhsPacket A0; for(Index k=0; k<peeled_kc; k+=pk) { __asm__("#" "begin gebp micro kernel 1pX4"); RhsPacket B_0, B1, B2, B3; # 1412 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" internal::prefetch(blB+(48+0)); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*0)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*0)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*1)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*1)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*2)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*2)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*3)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*3)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); internal::prefetch(blB+(48+16)); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*4)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*4)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*5)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*5)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*6)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*6)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*7)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*7)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); blB += pk*4*RhsProgress; blA += pk*1*LhsProgress; __asm__("#" "end gebp micro kernel 1pX4"); } for(Index k=peeled_kc; k<depth; k++) { RhsPacket B_0, B1, B2, B3; do { __asm__("#" "begin step of gebp micro kernel 1pX4"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*0)*LhsProgress], A0); traits.broadcastRhs(&blB[(0+4*0)*RhsProgress], B_0, B1, B2, B3); traits.madd(A0, B_0, C0, B_0); traits.madd(A0, B1, C1, B1); traits.madd(A0, B2, C2, B2); traits.madd(A0, B3, C3, B3); __asm__("#" "end step of gebp micro kernel 1pX4"); } while(false); blB += 4*RhsProgress; blA += 1*LhsProgress; } ResPacket R0, R1; ResPacket alphav = pset1<ResPacket>(alpha); R0 = r0.loadPacket(0 * Traits::ResPacketSize); R1 = r1.loadPacket(0 * Traits::ResPacketSize); traits.acc(C0, alphav, R0); traits.acc(C1, alphav, R1); r0.storePacket(0 * Traits::ResPacketSize, R0); r1.storePacket(0 * Traits::ResPacketSize, R1); R0 = r2.loadPacket(0 * Traits::ResPacketSize); R1 = r3.loadPacket(0 * Traits::ResPacketSize); traits.acc(C2, alphav, R0); traits.acc(C3, alphav, R1); r2.storePacket(0 * Traits::ResPacketSize, R0); r3.storePacket(0 * Traits::ResPacketSize, R1); } for(Index j2=packet_cols4; j2<cols; j2++) { const LhsScalar* blA = &blockA[i*strideA+offsetA*(1*Traits::LhsProgress)]; prefetch(&blA[0]); AccPacket C0; traits.initAcc(C0); LinearMapper r0 = res.getLinearMapper(i, j2); const RhsScalar* blB = &blockB[j2*strideB+offsetB]; LhsPacket A0; for(Index k=0; k<peeled_kc; k+=pk) { __asm__("#" "begin gebp micro kernel 1pX1"); RhsPacket B_0; # 1488 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*0)*LhsProgress], A0); traits.loadRhs(&blB[(0+0)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*1)*LhsProgress], A0); traits.loadRhs(&blB[(0+1)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*2)*LhsProgress], A0); traits.loadRhs(&blB[(0+2)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*3)*LhsProgress], A0); traits.loadRhs(&blB[(0+3)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*4)*LhsProgress], A0); traits.loadRhs(&blB[(0+4)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*5)*LhsProgress], A0); traits.loadRhs(&blB[(0+5)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*6)*LhsProgress], A0); traits.loadRhs(&blB[(0+6)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*7)*LhsProgress], A0); traits.loadRhs(&blB[(0+7)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; blB += pk*RhsProgress; blA += pk*1*Traits::LhsProgress; __asm__("#" "end gebp micro kernel 1pX1"); } for(Index k=peeled_kc; k<depth; k++) { RhsPacket B_0; do { __asm__("#" "begin step of gebp micro kernel 1pX1"); __asm__("#" "Note: these asm comments work around bug 935!"); traits.loadLhs(&blA[(0+1*0)*LhsProgress], A0); traits.loadRhs(&blB[(0+0)*RhsProgress], B_0); traits.madd(A0, B_0, C0, B_0); __asm__("#" "end step of gebp micro kernel 1pX1"); } while(false);; blB += RhsProgress; blA += 1*Traits::LhsProgress; } ResPacket R0; ResPacket alphav = pset1<ResPacket>(alpha); R0 = r0.loadPacket(0 * Traits::ResPacketSize); traits.acc(C0, alphav, R0); r0.storePacket(0 * Traits::ResPacketSize, R0); } } } if(peeled_mc1<rows) { for(Index j2=0; j2<packet_cols4; j2+=nr) { for(Index i=peeled_mc1; i<rows; i+=1) { const LhsScalar* blA = &blockA[i*strideA+offsetA]; prefetch(&blA[0]); const RhsScalar* blB = &blockB[j2*strideB+offsetB*nr]; const int SResPacketHalfSize = unpacket_traits<typename unpacket_traits<SResPacket>::half>::size; if ((SwappedTraits::LhsProgress % 4) == 0 && (SwappedTraits::LhsProgress <= 8) && (SwappedTraits::LhsProgress!=8 || SResPacketHalfSize==nr)) { SAccPacket C0, C1, C2, C3; straits.initAcc(C0); straits.initAcc(C1); straits.initAcc(C2); straits.initAcc(C3); const Index spk = (std::max)(1,SwappedTraits::LhsProgress/4); const Index endk = (depth/spk)*spk; const Index endk4 = (depth/(spk*4))*(spk*4); Index k=0; for(; k<endk4; k+=4*spk) { SLhsPacket A0,A1; SRhsPacket B_0,B_1; straits.loadLhsUnaligned(blB+0*SwappedTraits::LhsProgress, A0); straits.loadLhsUnaligned(blB+1*SwappedTraits::LhsProgress, A1); straits.loadRhsQuad(blA+0*spk, B_0); straits.loadRhsQuad(blA+1*spk, B_1); straits.madd(A0,B_0,C0,B_0); straits.madd(A1,B_1,C1,B_1); straits.loadLhsUnaligned(blB+2*SwappedTraits::LhsProgress, A0); straits.loadLhsUnaligned(blB+3*SwappedTraits::LhsProgress, A1); straits.loadRhsQuad(blA+2*spk, B_0); straits.loadRhsQuad(blA+3*spk, B_1); straits.madd(A0,B_0,C2,B_0); straits.madd(A1,B_1,C3,B_1); blB += 4*SwappedTraits::LhsProgress; blA += 4*spk; } C0 = padd(padd(C0,C1),padd(C2,C3)); for(; k<endk; k+=spk) { SLhsPacket A0; SRhsPacket B_0; straits.loadLhsUnaligned(blB, A0); straits.loadRhsQuad(blA, B_0); straits.madd(A0,B_0,C0,B_0); blB += SwappedTraits::LhsProgress; blA += spk; } if(SwappedTraits::LhsProgress==8) { typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SResPacket>::half,SResPacket>::type SResPacketHalf; typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SLhsPacket>::half,SLhsPacket>::type SLhsPacketHalf; typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SLhsPacket>::half,SRhsPacket>::type SRhsPacketHalf; typedef typename conditional<SwappedTraits::LhsProgress>=8,typename unpacket_traits<SAccPacket>::half,SAccPacket>::type SAccPacketHalf; SResPacketHalf R = res.template gatherPacket<SResPacketHalf>(i, j2); SResPacketHalf alphav = pset1<SResPacketHalf>(alpha); if(depth-endk>0) { SLhsPacketHalf a0; SRhsPacketHalf b0; straits.loadLhsUnaligned(blB, a0); straits.loadRhs(blA, b0); SAccPacketHalf c0 = predux_downto4(C0); straits.madd(a0,b0,c0,b0); straits.acc(c0, alphav, R); } else { straits.acc(predux_downto4(C0), alphav, R); } res.scatterPacket(i, j2, R); } else { SResPacket R = res.template gatherPacket<SResPacket>(i, j2); SResPacket alphav = pset1<SResPacket>(alpha); straits.acc(C0, alphav, R); res.scatterPacket(i, j2, R); } } else { ResScalar C0(0), C1(0), C2(0), C3(0); for(Index k=0; k<depth; k++) { LhsScalar A0; RhsScalar B_0, B_1; A0 = blA[k]; B_0 = blB[0]; B_1 = blB[1]; gebp_madd(cj,A0,B_0,C0,B_0);; gebp_madd(cj,A0,B_1,C1,B_1);; B_0 = blB[2]; B_1 = blB[3]; gebp_madd(cj,A0,B_0,C2,B_0);; gebp_madd(cj,A0,B_1,C3,B_1);; blB += 4; } res(i, j2 + 0) += alpha * C0; res(i, j2 + 1) += alpha * C1; res(i, j2 + 2) += alpha * C2; res(i, j2 + 3) += alpha * C3; } } } for(Index j2=packet_cols4; j2<cols; j2++) { for(Index i=peeled_mc1; i<rows; i+=1) { const LhsScalar* blA = &blockA[i*strideA+offsetA]; prefetch(&blA[0]); ResScalar C0(0); const RhsScalar* blB = &blockB[j2*strideB+offsetB]; for(Index k=0; k<depth; k++) { LhsScalar A0 = blA[k]; RhsScalar B_0 = blB[k]; gebp_madd(cj,A0,B_0,C0,B_0);; } res(i, j2) += alpha * C0; } } } } # 1695 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" template<typename Scalar, typename Index, typename DataMapper, int Pack1, int Pack2, bool Conjugate, bool PanelMode> struct gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, ColMajor, Conjugate, PanelMode> { typedef typename DataMapper::LinearMapper LinearMapper; __attribute__((noinline)) void operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride=0, Index offset=0); }; template<typename Scalar, typename Index, typename DataMapper, int Pack1, int Pack2, bool Conjugate, bool PanelMode> __attribute__((noinline)) void gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, ColMajor, Conjugate, PanelMode> ::operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride, Index offset) { typedef typename packet_traits<Scalar>::type Packet; enum { PacketSize = packet_traits<Scalar>::size }; __asm__("#" "EIGEN PRODUCT PACK LHS"); Eigen::internal::ignore_unused_variable(stride);; Eigen::internal::ignore_unused_variable(offset);; ((((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)) ? static_cast<void> (0) : __assert_fail ("((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)", "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h", 1712, __PRETTY_FUNCTION__)); ((((Pack1%PacketSize)==0 && Pack1<=4*PacketSize) || (Pack1<=4)) ? static_cast<void> (0) : __assert_fail ("((Pack1%PacketSize)==0 && Pack1<=4*PacketSize) || (Pack1<=4)", "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h", 1713, __PRETTY_FUNCTION__)); conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj; Index count = 0; const Index peeled_mc3 = Pack1>=3*PacketSize ? (rows/(3*PacketSize))*(3*PacketSize) : 0; const Index peeled_mc2 = Pack1>=2*PacketSize ? peeled_mc3+((rows-peeled_mc3)/(2*PacketSize))*(2*PacketSize) : 0; const Index peeled_mc1 = Pack1>=1*PacketSize ? (rows/(1*PacketSize))*(1*PacketSize) : 0; const Index peeled_mc0 = Pack2>=1*PacketSize ? peeled_mc1 : Pack2>1 ? (rows/Pack2)*Pack2 : 0; Index i=0; if(Pack1>=3*PacketSize) { for(; i<peeled_mc3; i+=3*PacketSize) { if(PanelMode) count += (3*PacketSize) * offset; for(Index k=0; k<depth; k++) { Packet A, B, C; A = lhs.loadPacket(i+0*PacketSize, k); B = lhs.loadPacket(i+1*PacketSize, k); C = lhs.loadPacket(i+2*PacketSize, k); pstore(blockA+count, cj.pconj(A)); count+=PacketSize; pstore(blockA+count, cj.pconj(B)); count+=PacketSize; pstore(blockA+count, cj.pconj(C)); count+=PacketSize; } if(PanelMode) count += (3*PacketSize) * (stride-offset-depth); } } if(Pack1>=2*PacketSize) { for(; i<peeled_mc2; i+=2*PacketSize) { if(PanelMode) count += (2*PacketSize) * offset; for(Index k=0; k<depth; k++) { Packet A, B; A = lhs.loadPacket(i+0*PacketSize, k); B = lhs.loadPacket(i+1*PacketSize, k); pstore(blockA+count, cj.pconj(A)); count+=PacketSize; pstore(blockA+count, cj.pconj(B)); count+=PacketSize; } if(PanelMode) count += (2*PacketSize) * (stride-offset-depth); } } if(Pack1>=1*PacketSize) { for(; i<peeled_mc1; i+=1*PacketSize) { if(PanelMode) count += (1*PacketSize) * offset; for(Index k=0; k<depth; k++) { Packet A; A = lhs.loadPacket(i+0*PacketSize, k); pstore(blockA+count, cj.pconj(A)); count+=PacketSize; } if(PanelMode) count += (1*PacketSize) * (stride-offset-depth); } } if(Pack2<PacketSize && Pack2>1) { for(; i<peeled_mc0; i+=Pack2) { if(PanelMode) count += Pack2 * offset; for(Index k=0; k<depth; k++) for(Index w=0; w<Pack2; w++) blockA[count++] = cj(lhs(i+w, k)); if(PanelMode) count += Pack2 * (stride-offset-depth); } } for(; i<rows; i++) { if(PanelMode) count += offset; for(Index k=0; k<depth; k++) blockA[count++] = cj(lhs(i, k)); if(PanelMode) count += (stride-offset-depth); } } template<typename Scalar, typename Index, typename DataMapper, int Pack1, int Pack2, bool Conjugate, bool PanelMode> struct gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, RowMajor, Conjugate, PanelMode> { typedef typename DataMapper::LinearMapper LinearMapper; __attribute__((noinline)) void operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride=0, Index offset=0); }; template<typename Scalar, typename Index, typename DataMapper, int Pack1, int Pack2, bool Conjugate, bool PanelMode> __attribute__((noinline)) void gemm_pack_lhs<Scalar, Index, DataMapper, Pack1, Pack2, RowMajor, Conjugate, PanelMode> ::operator()(Scalar* blockA, const DataMapper& lhs, Index depth, Index rows, Index stride, Index offset) { typedef typename packet_traits<Scalar>::type Packet; enum { PacketSize = packet_traits<Scalar>::size }; __asm__("#" "EIGEN PRODUCT PACK LHS"); Eigen::internal::ignore_unused_variable(stride);; Eigen::internal::ignore_unused_variable(offset);; ((((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)) ? static_cast<void> (0) : __assert_fail ("((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)", "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h", 1820, __PRETTY_FUNCTION__)); conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj; Index count = 0; int pack = Pack1; Index i = 0; while(pack>0) { Index remaining_rows = rows-i; Index peeled_mc = i+(remaining_rows/pack)*pack; for(; i<peeled_mc; i+=pack) { if(PanelMode) count += pack * offset; const Index peeled_k = (depth/PacketSize)*PacketSize; Index k=0; if(pack>=PacketSize) { for(; k<peeled_k; k+=PacketSize) { for (Index m = 0; m < pack; m += PacketSize) { PacketBlock<Packet> kernel; for (int p = 0; p < PacketSize; ++p) kernel.packet[p] = lhs.loadPacket(i+p+m, k); ptranspose(kernel); for (int p = 0; p < PacketSize; ++p) pstore(blockA+count+m+(pack)*p, cj.pconj(kernel.packet[p])); } count += PacketSize*pack; } } for(; k<depth; k++) { Index w=0; for(; w<pack-3; w+=4) { Scalar a(cj(lhs(i+w+0, k))), b(cj(lhs(i+w+1, k))), c(cj(lhs(i+w+2, k))), d(cj(lhs(i+w+3, k))); blockA[count++] = a; blockA[count++] = b; blockA[count++] = c; blockA[count++] = d; } if(pack%4) for(;w<pack;++w) blockA[count++] = cj(lhs(i+w, k)); } if(PanelMode) count += pack * (stride-offset-depth); } pack -= PacketSize; if(pack<Pack2 && (pack+PacketSize)!=Pack2) pack = Pack2; } for(; i<rows; i++) { if(PanelMode) count += offset; for(Index k=0; k<depth; k++) blockA[count++] = cj(lhs(i, k)); if(PanelMode) count += (stride-offset-depth); } } # 1897 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" template<typename Scalar, typename Index, typename DataMapper, int nr, bool Conjugate, bool PanelMode> struct gemm_pack_rhs<Scalar, Index, DataMapper, nr, ColMajor, Conjugate, PanelMode> { typedef typename packet_traits<Scalar>::type Packet; typedef typename DataMapper::LinearMapper LinearMapper; enum { PacketSize = packet_traits<Scalar>::size }; __attribute__((noinline)) void operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride=0, Index offset=0); }; template<typename Scalar, typename Index, typename DataMapper, int nr, bool Conjugate, bool PanelMode> __attribute__((noinline)) void gemm_pack_rhs<Scalar, Index, DataMapper, nr, ColMajor, Conjugate, PanelMode> ::operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride, Index offset) { __asm__("#" "EIGEN PRODUCT PACK RHS COLMAJOR"); Eigen::internal::ignore_unused_variable(stride);; Eigen::internal::ignore_unused_variable(offset);; ((((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)) ? static_cast<void> (0) : __assert_fail ("((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)", "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h", 1913, __PRETTY_FUNCTION__)); conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj; Index packet_cols8 = nr>=8 ? (cols/8) * 8 : 0; Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; Index count = 0; const Index peeled_k = (depth/PacketSize)*PacketSize; # 1965 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" if(nr>=4) { for(Index j2=packet_cols8; j2<packet_cols4; j2+=4) { if(PanelMode) count += 4 * offset; const LinearMapper dm0 = rhs.getLinearMapper(0, j2 + 0); const LinearMapper dm1 = rhs.getLinearMapper(0, j2 + 1); const LinearMapper dm2 = rhs.getLinearMapper(0, j2 + 2); const LinearMapper dm3 = rhs.getLinearMapper(0, j2 + 3); Index k=0; if((PacketSize%4)==0) { for(; k<peeled_k; k+=PacketSize) { PacketBlock<Packet,(PacketSize%4)==0?4:PacketSize> kernel; kernel.packet[0] = dm0.loadPacket(k); kernel.packet[1%PacketSize] = dm1.loadPacket(k); kernel.packet[2%PacketSize] = dm2.loadPacket(k); kernel.packet[3%PacketSize] = dm3.loadPacket(k); ptranspose(kernel); pstoreu(blockB+count+0*PacketSize, cj.pconj(kernel.packet[0])); pstoreu(blockB+count+1*PacketSize, cj.pconj(kernel.packet[1%PacketSize])); pstoreu(blockB+count+2*PacketSize, cj.pconj(kernel.packet[2%PacketSize])); pstoreu(blockB+count+3*PacketSize, cj.pconj(kernel.packet[3%PacketSize])); count+=4*PacketSize; } } for(; k<depth; k++) { blockB[count+0] = cj(dm0(k)); blockB[count+1] = cj(dm1(k)); blockB[count+2] = cj(dm2(k)); blockB[count+3] = cj(dm3(k)); count += 4; } if(PanelMode) count += 4 * (stride-offset-depth); } } for(Index j2=packet_cols4; j2<cols; ++j2) { if(PanelMode) count += offset; const LinearMapper dm0 = rhs.getLinearMapper(0, j2); for(Index k=0; k<depth; k++) { blockB[count] = cj(dm0(k)); count += 1; } if(PanelMode) count += (stride-offset-depth); } } template<typename Scalar, typename Index, typename DataMapper, int nr, bool Conjugate, bool PanelMode> struct gemm_pack_rhs<Scalar, Index, DataMapper, nr, RowMajor, Conjugate, PanelMode> { typedef typename packet_traits<Scalar>::type Packet; typedef typename DataMapper::LinearMapper LinearMapper; enum { PacketSize = packet_traits<Scalar>::size }; __attribute__((noinline)) void operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride=0, Index offset=0); }; template<typename Scalar, typename Index, typename DataMapper, int nr, bool Conjugate, bool PanelMode> __attribute__((noinline)) void gemm_pack_rhs<Scalar, Index, DataMapper, nr, RowMajor, Conjugate, PanelMode> ::operator()(Scalar* blockB, const DataMapper& rhs, Index depth, Index cols, Index stride, Index offset) { __asm__("#" "EIGEN PRODUCT PACK RHS ROWMAJOR"); Eigen::internal::ignore_unused_variable(stride);; Eigen::internal::ignore_unused_variable(offset);; ((((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)) ? static_cast<void> (0) : __assert_fail ("((!PanelMode) && stride==0 && offset==0) || (PanelMode && stride>=depth && offset<=stride)", "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h", 2037, __PRETTY_FUNCTION__)); conj_if<NumTraits<Scalar>::IsComplex && Conjugate> cj; Index packet_cols8 = nr>=8 ? (cols/8) * 8 : 0; Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; Index count = 0; # 2076 "eigen-3.3.7/Eigen/src/Core/products/GeneralBlockPanelKernel.h" if(nr>=4) { for(Index j2=packet_cols8; j2<packet_cols4; j2+=4) { if(PanelMode) count += 4 * offset; for(Index k=0; k<depth; k++) { if (PacketSize==4) { Packet A = rhs.loadPacket(k, j2); pstoreu(blockB+count, cj.pconj(A)); count += PacketSize; } else { const LinearMapper dm0 = rhs.getLinearMapper(k, j2); blockB[count+0] = cj(dm0(0)); blockB[count+1] = cj(dm0(1)); blockB[count+2] = cj(dm0(2)); blockB[count+3] = cj(dm0(3)); count += 4; } } if(PanelMode) count += 4 * (stride-offset-depth); } } for(Index j2=packet_cols4; j2<cols; ++j2) { if(PanelMode) count += offset; for(Index k=0; k<depth; k++) { blockB[count] = cj(rhs(k, j2)); count += 1; } if(PanelMode) count += stride-offset-depth; } } } inline std::ptrdiff_t l1CacheSize() { std::ptrdiff_t l1, l2, l3; internal::manage_caching_sizes(GetAction, &l1, &l2, &l3); return l1; } inline std::ptrdiff_t l2CacheSize() { std::ptrdiff_t l1, l2, l3; internal::manage_caching_sizes(GetAction, &l1, &l2, &l3); return l2; } inline std::ptrdiff_t l3CacheSize() { std::ptrdiff_t l1, l2, l3; internal::manage_caching_sizes(GetAction, &l1, &l2, &l3); return l3; } inline void setCpuCacheSizes(std::ptrdiff_t l1, std::ptrdiff_t l2, std::ptrdiff_t l3) { internal::manage_caching_sizes(SetAction, &l1, &l2, &l3); } } # 492 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/Parallelizer.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/Parallelizer.h" namespace Eigen { namespace internal { inline void manage_multi_threading(Action action, int* v) { static __attribute__((unused)) int m_maxThreads = -1; if(action==SetAction) { ; m_maxThreads = *v; } else if(action==GetAction) { ; *v = 1; } else { ; } } } inline void initParallel() { int nbt; internal::manage_multi_threading(GetAction, &nbt); std::ptrdiff_t l1, l2, l3; internal::manage_caching_sizes(GetAction, &l1, &l2, &l3); } inline int nbThreads() { int ret; internal::manage_multi_threading(GetAction, &ret); return ret; } inline void setNbThreads(int v) { internal::manage_multi_threading(SetAction, &v); } namespace internal { template<typename Index> struct GemmParallelInfo { GemmParallelInfo() : sync(-1), users(0), lhs_start(0), lhs_length(0) {} Index volatile sync; int volatile users; Index lhs_start; Index lhs_length; }; template<bool Condition, typename Functor, typename Index> void parallelize_gemm(const Functor& func, Index rows, Index cols, Index depth, bool transpose) { Eigen::internal::ignore_unused_variable(depth);; Eigen::internal::ignore_unused_variable(transpose);; func(0,rows, 0,cols); # 157 "eigen-3.3.7/Eigen/src/Core/products/Parallelizer.h" } } } # 493 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" 1 # 16 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" namespace Eigen { namespace internal { # 28 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" template<typename Lhs, typename Rhs, int Options> struct evaluator<Product<Lhs, Rhs, Options> > : public product_evaluator<Product<Lhs, Rhs, Options> > { typedef Product<Lhs, Rhs, Options> XprType; typedef product_evaluator<XprType> Base; inline explicit evaluator(const XprType& xpr) : Base(xpr) {} }; template<typename Lhs, typename Rhs, typename Scalar1, typename Scalar2, typename Plain1> struct evaluator_assume_aliasing<CwiseBinaryOp<internal::scalar_product_op<Scalar1,Scalar2>, const CwiseNullaryOp<internal::scalar_constant_op<Scalar1>, Plain1>, const Product<Lhs, Rhs, DefaultProduct> > > { static const bool value = true; }; template<typename Lhs, typename Rhs, typename Scalar1, typename Scalar2, typename Plain1> struct evaluator<CwiseBinaryOp<internal::scalar_product_op<Scalar1,Scalar2>, const CwiseNullaryOp<internal::scalar_constant_op<Scalar1>, Plain1>, const Product<Lhs, Rhs, DefaultProduct> > > : public evaluator<Product<CwiseBinaryOp<internal::scalar_product_op<Scalar1,typename internal::traits<Lhs>::Scalar>, const typename internal::plain_constant_type<Lhs,Scalar1>::type, const Lhs>, Rhs, DefaultProduct> > { typedef CwiseBinaryOp<internal::scalar_product_op<Scalar1,Scalar2>, const CwiseNullaryOp<internal::scalar_constant_op<Scalar1>, Plain1>, const Product<Lhs, Rhs, DefaultProduct> > XprType; typedef evaluator<Product<CwiseBinaryOp<internal::scalar_product_op<Scalar1,typename internal::traits<Lhs>::Scalar>, const typename internal::plain_constant_type<Lhs,Scalar1>::type, const Lhs>, Rhs, DefaultProduct> > Base; inline explicit evaluator(const XprType& xpr) : Base(xpr.lhs().functor().m_other * xpr.rhs().lhs() * xpr.rhs().rhs()) {} }; template<typename Lhs, typename Rhs, int DiagIndex> struct evaluator<Diagonal<const Product<Lhs, Rhs, DefaultProduct>, DiagIndex> > : public evaluator<Diagonal<const Product<Lhs, Rhs, LazyProduct>, DiagIndex> > { typedef Diagonal<const Product<Lhs, Rhs, DefaultProduct>, DiagIndex> XprType; typedef evaluator<Diagonal<const Product<Lhs, Rhs, LazyProduct>, DiagIndex> > Base; inline explicit evaluator(const XprType& xpr) : Base(Diagonal<const Product<Lhs, Rhs, LazyProduct>, DiagIndex>( Product<Lhs, Rhs, LazyProduct>(xpr.nestedExpression().lhs(), xpr.nestedExpression().rhs()), xpr.index() )) {} }; template< typename Lhs, typename Rhs, typename LhsShape = typename evaluator_traits<Lhs>::Shape, typename RhsShape = typename evaluator_traits<Rhs>::Shape, int ProductType = internal::product_type<Lhs,Rhs>::value> struct generic_product_impl; template<typename Lhs, typename Rhs> struct evaluator_assume_aliasing<Product<Lhs, Rhs, DefaultProduct> > { static const bool value = true; }; template<typename Lhs, typename Rhs, int Options, int ProductTag, typename LhsShape, typename RhsShape> struct product_evaluator<Product<Lhs, Rhs, Options>, ProductTag, LhsShape, RhsShape> : public evaluator<typename Product<Lhs, Rhs, Options>::PlainObject> { typedef Product<Lhs, Rhs, Options> XprType; typedef typename XprType::PlainObject PlainObject; typedef evaluator<PlainObject> Base; enum { Flags = Base::Flags | EvalBeforeNestingBit }; inline explicit product_evaluator(const XprType& xpr) : m_result(xpr.rows(), xpr.cols()) { ::new (static_cast<Base*>(this)) Base(m_result); # 124 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" generic_product_impl<Lhs, Rhs, LhsShape, RhsShape, ProductTag>::evalTo(m_result, xpr.lhs(), xpr.rhs()); } protected: PlainObject m_result; }; template< typename DstXprType, typename Lhs, typename Rhs, int Options, typename Scalar> struct Assignment<DstXprType, Product<Lhs,Rhs,Options>, internal::assign_op<Scalar,Scalar>, Dense2Dense, typename enable_if<(Options==DefaultProduct || Options==AliasFreeProduct)>::type> { typedef Product<Lhs,Rhs,Options> SrcXprType; static inline void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<Scalar,Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); generic_product_impl<Lhs, Rhs>::evalTo(dst, src.lhs(), src.rhs()); } }; template< typename DstXprType, typename Lhs, typename Rhs, int Options, typename Scalar> struct Assignment<DstXprType, Product<Lhs,Rhs,Options>, internal::add_assign_op<Scalar,Scalar>, Dense2Dense, typename enable_if<(Options==DefaultProduct || Options==AliasFreeProduct)>::type> { typedef Product<Lhs,Rhs,Options> SrcXprType; static inline void run(DstXprType &dst, const SrcXprType &src, const internal::add_assign_op<Scalar,Scalar> &) { ((dst.rows() == src.rows() && dst.cols() == src.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows() == src.rows() && dst.cols() == src.cols()", "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h", 161, __PRETTY_FUNCTION__)); generic_product_impl<Lhs, Rhs>::addTo(dst, src.lhs(), src.rhs()); } }; template< typename DstXprType, typename Lhs, typename Rhs, int Options, typename Scalar> struct Assignment<DstXprType, Product<Lhs,Rhs,Options>, internal::sub_assign_op<Scalar,Scalar>, Dense2Dense, typename enable_if<(Options==DefaultProduct || Options==AliasFreeProduct)>::type> { typedef Product<Lhs,Rhs,Options> SrcXprType; static inline void run(DstXprType &dst, const SrcXprType &src, const internal::sub_assign_op<Scalar,Scalar> &) { ((dst.rows() == src.rows() && dst.cols() == src.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows() == src.rows() && dst.cols() == src.cols()", "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h", 176, __PRETTY_FUNCTION__)); generic_product_impl<Lhs, Rhs>::subTo(dst, src.lhs(), src.rhs()); } }; template< typename DstXprType, typename Lhs, typename Rhs, typename AssignFunc, typename Scalar, typename ScalarBis, typename Plain> struct Assignment<DstXprType, CwiseBinaryOp<internal::scalar_product_op<ScalarBis,Scalar>, const CwiseNullaryOp<internal::scalar_constant_op<ScalarBis>,Plain>, const Product<Lhs,Rhs,DefaultProduct> >, AssignFunc, Dense2Dense> { typedef CwiseBinaryOp<internal::scalar_product_op<ScalarBis,Scalar>, const CwiseNullaryOp<internal::scalar_constant_op<ScalarBis>,Plain>, const Product<Lhs,Rhs,DefaultProduct> > SrcXprType; static inline void run(DstXprType &dst, const SrcXprType &src, const AssignFunc& func) { call_assignment_no_alias(dst, (src.lhs().functor().m_other * src.rhs().lhs())*src.rhs().rhs(), func); } }; template<typename OtherXpr, typename Lhs, typename Rhs> struct evaluator_assume_aliasing<CwiseBinaryOp<internal::scalar_sum_op<typename OtherXpr::Scalar,typename Product<Lhs,Rhs,DefaultProduct>::Scalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, DenseShape > { static const bool value = true; }; template<typename OtherXpr, typename Lhs, typename Rhs> struct evaluator_assume_aliasing<CwiseBinaryOp<internal::scalar_difference_op<typename OtherXpr::Scalar,typename Product<Lhs,Rhs,DefaultProduct>::Scalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, DenseShape > { static const bool value = true; }; template<typename DstXprType, typename OtherXpr, typename ProductType, typename Func1, typename Func2> struct assignment_from_xpr_op_product { template<typename SrcXprType, typename InitialFunc> static inline void run(DstXprType &dst, const SrcXprType &src, const InitialFunc& ) { call_assignment_no_alias(dst, src.lhs(), Func1()); call_assignment_no_alias(dst, src.rhs(), Func2()); } }; # 235 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" template< typename DstXprType, typename OtherXpr, typename Lhs, typename Rhs, typename DstScalar, typename SrcScalar, typename OtherScalar,typename ProdScalar> struct Assignment<DstXprType, CwiseBinaryOp<internal::scalar_sum_op<OtherScalar,ProdScalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, internal::assign_op<DstScalar,SrcScalar>, Dense2Dense> : assignment_from_xpr_op_product<DstXprType, OtherXpr, Product<Lhs,Rhs,DefaultProduct>, internal::assign_op<DstScalar,OtherScalar>, internal::add_assign_op<DstScalar,ProdScalar> > {}; template< typename DstXprType, typename OtherXpr, typename Lhs, typename Rhs, typename DstScalar, typename SrcScalar, typename OtherScalar,typename ProdScalar> struct Assignment<DstXprType, CwiseBinaryOp<internal::scalar_sum_op<OtherScalar,ProdScalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, internal::add_assign_op<DstScalar,SrcScalar>, Dense2Dense> : assignment_from_xpr_op_product<DstXprType, OtherXpr, Product<Lhs,Rhs,DefaultProduct>, internal::add_assign_op<DstScalar,OtherScalar>, internal::add_assign_op<DstScalar,ProdScalar> > {}; template< typename DstXprType, typename OtherXpr, typename Lhs, typename Rhs, typename DstScalar, typename SrcScalar, typename OtherScalar,typename ProdScalar> struct Assignment<DstXprType, CwiseBinaryOp<internal::scalar_sum_op<OtherScalar,ProdScalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, internal::sub_assign_op<DstScalar,SrcScalar>, Dense2Dense> : assignment_from_xpr_op_product<DstXprType, OtherXpr, Product<Lhs,Rhs,DefaultProduct>, internal::sub_assign_op<DstScalar,OtherScalar>, internal::sub_assign_op<DstScalar,ProdScalar> > {}; template< typename DstXprType, typename OtherXpr, typename Lhs, typename Rhs, typename DstScalar, typename SrcScalar, typename OtherScalar,typename ProdScalar> struct Assignment<DstXprType, CwiseBinaryOp<internal::scalar_difference_op<OtherScalar,ProdScalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, internal::assign_op<DstScalar,SrcScalar>, Dense2Dense> : assignment_from_xpr_op_product<DstXprType, OtherXpr, Product<Lhs,Rhs,DefaultProduct>, internal::assign_op<DstScalar,OtherScalar>, internal::sub_assign_op<DstScalar,ProdScalar> > {}; template< typename DstXprType, typename OtherXpr, typename Lhs, typename Rhs, typename DstScalar, typename SrcScalar, typename OtherScalar,typename ProdScalar> struct Assignment<DstXprType, CwiseBinaryOp<internal::scalar_difference_op<OtherScalar,ProdScalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, internal::add_assign_op<DstScalar,SrcScalar>, Dense2Dense> : assignment_from_xpr_op_product<DstXprType, OtherXpr, Product<Lhs,Rhs,DefaultProduct>, internal::add_assign_op<DstScalar,OtherScalar>, internal::sub_assign_op<DstScalar,ProdScalar> > {}; template< typename DstXprType, typename OtherXpr, typename Lhs, typename Rhs, typename DstScalar, typename SrcScalar, typename OtherScalar,typename ProdScalar> struct Assignment<DstXprType, CwiseBinaryOp<internal::scalar_difference_op<OtherScalar,ProdScalar>, const OtherXpr, const Product<Lhs,Rhs,DefaultProduct> >, internal::sub_assign_op<DstScalar,SrcScalar>, Dense2Dense> : assignment_from_xpr_op_product<DstXprType, OtherXpr, Product<Lhs,Rhs,DefaultProduct>, internal::sub_assign_op<DstScalar,OtherScalar>, internal::add_assign_op<DstScalar,ProdScalar> > {}; template<typename Lhs, typename Rhs> struct generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,InnerProduct> { template<typename Dst> static inline void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { dst.coeffRef(0,0) = (lhs.transpose().cwiseProduct(rhs)).sum(); } template<typename Dst> static inline void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { dst.coeffRef(0,0) += (lhs.transpose().cwiseProduct(rhs)).sum(); } template<typename Dst> static inline void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { dst.coeffRef(0,0) -= (lhs.transpose().cwiseProduct(rhs)).sum(); } }; template<typename Dst, typename Lhs, typename Rhs, typename Func> void outer_product_selector_run(Dst& dst, const Lhs &lhs, const Rhs &rhs, const Func& func, const false_type&) { evaluator<Rhs> rhsEval(rhs); typename nested_eval<Lhs,Rhs::SizeAtCompileTime>::type actual_lhs(lhs); const Index cols = dst.cols(); for (Index j=0; j<cols; ++j) func(dst.col(j), rhsEval.coeff(Index(0),j) * actual_lhs); } template<typename Dst, typename Lhs, typename Rhs, typename Func> void outer_product_selector_run(Dst& dst, const Lhs &lhs, const Rhs &rhs, const Func& func, const true_type&) { evaluator<Lhs> lhsEval(lhs); typename nested_eval<Rhs,Lhs::SizeAtCompileTime>::type actual_rhs(rhs); const Index rows = dst.rows(); for (Index i=0; i<rows; ++i) func(dst.row(i), lhsEval.coeff(i,Index(0)) * actual_rhs); } template<typename Lhs, typename Rhs> struct generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,OuterProduct> { template<typename T> struct is_row_major : internal::conditional<(int(T::Flags)&RowMajorBit), internal::true_type, internal::false_type>::type {}; typedef typename Product<Lhs,Rhs>::Scalar Scalar; struct set { template<typename Dst, typename Src> void operator()(const Dst& dst, const Src& src) const { dst.const_cast_derived() = src; } }; struct add { template<typename Dst, typename Src> void operator()(const Dst& dst, const Src& src) const { dst.const_cast_derived() += src; } }; struct sub { template<typename Dst, typename Src> void operator()(const Dst& dst, const Src& src) const { dst.const_cast_derived() -= src; } }; struct adds { Scalar m_scale; explicit adds(const Scalar& s) : m_scale(s) {} template<typename Dst, typename Src> void operator()(const Dst& dst, const Src& src) const { dst.const_cast_derived() += m_scale * src; } }; template<typename Dst> static inline void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { internal::outer_product_selector_run(dst, lhs, rhs, set(), is_row_major<Dst>()); } template<typename Dst> static inline void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { internal::outer_product_selector_run(dst, lhs, rhs, add(), is_row_major<Dst>()); } template<typename Dst> static inline void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { internal::outer_product_selector_run(dst, lhs, rhs, sub(), is_row_major<Dst>()); } template<typename Dst> static inline void scaleAndAddTo(Dst& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) { internal::outer_product_selector_run(dst, lhs, rhs, adds(alpha), is_row_major<Dst>()); } }; template<typename Lhs, typename Rhs, typename Derived> struct generic_product_impl_base { typedef typename Product<Lhs,Rhs>::Scalar Scalar; template<typename Dst> static inline void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); } template<typename Dst> static inline void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { scaleAndAddTo(dst,lhs, rhs, Scalar(1)); } template<typename Dst> static inline void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); } template<typename Dst> static inline void scaleAndAddTo(Dst& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) { Derived::scaleAndAddTo(dst,lhs,rhs,alpha); } }; template<typename Lhs, typename Rhs> struct generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,GemvProduct> : generic_product_impl_base<Lhs,Rhs,generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,GemvProduct> > { typedef typename nested_eval<Lhs,1>::type LhsNested; typedef typename nested_eval<Rhs,1>::type RhsNested; typedef typename Product<Lhs,Rhs>::Scalar Scalar; enum { Side = Lhs::IsVectorAtCompileTime ? OnTheLeft : OnTheRight }; typedef typename internal::remove_all<typename internal::conditional<int(Side)==OnTheRight,LhsNested,RhsNested>::type>::type MatrixType; template<typename Dest> static inline void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) { LhsNested actual_lhs(lhs); RhsNested actual_rhs(rhs); internal::gemv_dense_selector<Side, (int(MatrixType::Flags)&RowMajorBit) ? RowMajor : ColMajor, bool(internal::blas_traits<MatrixType>::HasUsableDirectAccess) >::run(actual_lhs, actual_rhs, dst, alpha); } }; template<typename Lhs, typename Rhs> struct generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,CoeffBasedProductMode> { typedef typename Product<Lhs,Rhs>::Scalar Scalar; template<typename Dst> static inline void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { call_assignment_no_alias(dst, lhs.lazyProduct(rhs), internal::assign_op<typename Dst::Scalar,Scalar>()); } template<typename Dst> static inline void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { call_assignment_no_alias(dst, lhs.lazyProduct(rhs), internal::add_assign_op<typename Dst::Scalar,Scalar>()); } template<typename Dst> static inline void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { call_assignment_no_alias(dst, lhs.lazyProduct(rhs), internal::sub_assign_op<typename Dst::Scalar,Scalar>()); } }; template<typename Lhs, typename Rhs> struct generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,LazyCoeffBasedProductMode> : generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,CoeffBasedProductMode> {}; template<int Traversal, int UnrollingIndex, typename Lhs, typename Rhs, typename RetScalar> struct etor_product_coeff_impl; template<int StorageOrder, int UnrollingIndex, typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl; template<typename Lhs, typename Rhs, int ProductTag> struct product_evaluator<Product<Lhs, Rhs, LazyProduct>, ProductTag, DenseShape, DenseShape> : evaluator_base<Product<Lhs, Rhs, LazyProduct> > { typedef Product<Lhs, Rhs, LazyProduct> XprType; typedef typename XprType::Scalar Scalar; typedef typename XprType::CoeffReturnType CoeffReturnType; inline explicit product_evaluator(const XprType& xpr) : m_lhs(xpr.lhs()), m_rhs(xpr.rhs()), m_lhsImpl(m_lhs), m_rhsImpl(m_rhs), m_innerDim(xpr.lhs().cols()) { if (Eigen::internal::static_assertion<static_cast<bool>((NumTraits<Scalar>::MulCost)>=0 && (NumTraits<Scalar>::MulCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((NumTraits<Scalar>::AddCost)>=0 && (NumTraits<Scalar>::AddCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; # 468 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" } typedef typename internal::nested_eval<Lhs,Rhs::ColsAtCompileTime>::type LhsNested; typedef typename internal::nested_eval<Rhs,Lhs::RowsAtCompileTime>::type RhsNested; typedef typename internal::remove_all<LhsNested>::type LhsNestedCleaned; typedef typename internal::remove_all<RhsNested>::type RhsNestedCleaned; typedef evaluator<LhsNestedCleaned> LhsEtorType; typedef evaluator<RhsNestedCleaned> RhsEtorType; enum { RowsAtCompileTime = LhsNestedCleaned::RowsAtCompileTime, ColsAtCompileTime = RhsNestedCleaned::ColsAtCompileTime, InnerSize = (((int)LhsNestedCleaned::ColsAtCompileTime == 0 || (int)RhsNestedCleaned::RowsAtCompileTime == 0) ? 0 : ((int)LhsNestedCleaned::ColsAtCompileTime == 1 || (int)RhsNestedCleaned::RowsAtCompileTime == 1) ? 1 : ((int)LhsNestedCleaned::ColsAtCompileTime == Dynamic && (int)RhsNestedCleaned::RowsAtCompileTime == Dynamic) ? Dynamic : ((int)LhsNestedCleaned::ColsAtCompileTime == Dynamic) ? (int)RhsNestedCleaned::RowsAtCompileTime : ((int)RhsNestedCleaned::RowsAtCompileTime == Dynamic) ? (int)LhsNestedCleaned::ColsAtCompileTime : ((int)LhsNestedCleaned::ColsAtCompileTime <= (int)RhsNestedCleaned::RowsAtCompileTime) ? (int)LhsNestedCleaned::ColsAtCompileTime : (int)RhsNestedCleaned::RowsAtCompileTime), MaxRowsAtCompileTime = LhsNestedCleaned::MaxRowsAtCompileTime, MaxColsAtCompileTime = RhsNestedCleaned::MaxColsAtCompileTime }; typedef typename find_best_packet<Scalar,RowsAtCompileTime>::type LhsVecPacketType; typedef typename find_best_packet<Scalar,ColsAtCompileTime>::type RhsVecPacketType; enum { LhsCoeffReadCost = LhsEtorType::CoeffReadCost, RhsCoeffReadCost = RhsEtorType::CoeffReadCost, CoeffReadCost = InnerSize==0 ? NumTraits<Scalar>::ReadCost : InnerSize == Dynamic ? HugeCost : InnerSize * (NumTraits<Scalar>::MulCost + LhsCoeffReadCost + RhsCoeffReadCost) + (InnerSize - 1) * NumTraits<Scalar>::AddCost, Unroll = CoeffReadCost <= 100, LhsFlags = LhsEtorType::Flags, RhsFlags = RhsEtorType::Flags, LhsRowMajor = LhsFlags & RowMajorBit, RhsRowMajor = RhsFlags & RowMajorBit, LhsVecPacketSize = unpacket_traits<LhsVecPacketType>::size, RhsVecPacketSize = unpacket_traits<RhsVecPacketType>::size, LhsAlignment = (((int)LhsEtorType::Alignment <= (int)LhsVecPacketSize*int(sizeof(typename LhsNestedCleaned::Scalar))) ? (int)LhsEtorType::Alignment : (int)LhsVecPacketSize*int(sizeof(typename LhsNestedCleaned::Scalar))), RhsAlignment = (((int)RhsEtorType::Alignment <= (int)RhsVecPacketSize*int(sizeof(typename RhsNestedCleaned::Scalar))) ? (int)RhsEtorType::Alignment : (int)RhsVecPacketSize*int(sizeof(typename RhsNestedCleaned::Scalar))), SameType = is_same<typename LhsNestedCleaned::Scalar,typename RhsNestedCleaned::Scalar>::value, CanVectorizeRhs = bool(RhsRowMajor) && (RhsFlags & PacketAccessBit) && (ColsAtCompileTime!=1), CanVectorizeLhs = (!LhsRowMajor) && (LhsFlags & PacketAccessBit) && (RowsAtCompileTime!=1), EvalToRowMajor = (MaxRowsAtCompileTime==1&&MaxColsAtCompileTime!=1) ? 1 : (MaxColsAtCompileTime==1&&MaxRowsAtCompileTime!=1) ? 0 : (bool(RhsRowMajor) && !CanVectorizeLhs), Flags = ((unsigned int)(LhsFlags | RhsFlags) & HereditaryBits & ~RowMajorBit) | (EvalToRowMajor ? RowMajorBit : 0) | (SameType && (CanVectorizeLhs || CanVectorizeRhs) ? PacketAccessBit : 0) | (XprType::IsVectorAtCompileTime ? LinearAccessBit : 0), LhsOuterStrideBytes = int(LhsNestedCleaned::OuterStrideAtCompileTime) * int(sizeof(typename LhsNestedCleaned::Scalar)), RhsOuterStrideBytes = int(RhsNestedCleaned::OuterStrideAtCompileTime) * int(sizeof(typename RhsNestedCleaned::Scalar)), Alignment = bool(CanVectorizeLhs) ? (LhsOuterStrideBytes<=0 || (int(LhsOuterStrideBytes) % (((int)1 >= (int)LhsAlignment) ? (int)1 : (int)LhsAlignment))!=0 ? 0 : LhsAlignment) : bool(CanVectorizeRhs) ? (RhsOuterStrideBytes<=0 || (int(RhsOuterStrideBytes) % (((int)1 >= (int)RhsAlignment) ? (int)1 : (int)RhsAlignment))!=0 ? 0 : RhsAlignment) : 0, CanVectorizeInner = SameType && LhsRowMajor && (!RhsRowMajor) && (LhsFlags & RhsFlags & ActualPacketAccessBit) && (InnerSize % packet_traits<Scalar>::size == 0) }; inline const CoeffReturnType coeff(Index row, Index col) const { return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum(); } const CoeffReturnType coeff(Index index) const { const Index row = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? 0 : index; const Index col = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? index : 0; return (m_lhs.row(row).transpose().cwiseProduct( m_rhs.col(col) )).sum(); } template<int LoadMode, typename PacketType> const PacketType packet(Index row, Index col) const { PacketType res; typedef etor_product_packet_impl<bool(int(Flags)&RowMajorBit) ? RowMajor : ColMajor, Unroll ? int(InnerSize) : Dynamic, LhsEtorType, RhsEtorType, PacketType, LoadMode> PacketImpl; PacketImpl::run(row, col, m_lhsImpl, m_rhsImpl, m_innerDim, res); return res; } template<int LoadMode, typename PacketType> const PacketType packet(Index index) const { const Index row = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? 0 : index; const Index col = (RowsAtCompileTime == 1 || MaxRowsAtCompileTime==1) ? index : 0; return packet<LoadMode,PacketType>(row,col); } protected: typename internal::add_const_on_value_type<LhsNested>::type m_lhs; typename internal::add_const_on_value_type<RhsNested>::type m_rhs; LhsEtorType m_lhsImpl; RhsEtorType m_rhsImpl; Index m_innerDim; }; template<typename Lhs, typename Rhs> struct product_evaluator<Product<Lhs, Rhs, DefaultProduct>, LazyCoeffBasedProductMode, DenseShape, DenseShape> : product_evaluator<Product<Lhs, Rhs, LazyProduct>, CoeffBasedProductMode, DenseShape, DenseShape> { typedef Product<Lhs, Rhs, DefaultProduct> XprType; typedef Product<Lhs, Rhs, LazyProduct> BaseProduct; typedef product_evaluator<BaseProduct, CoeffBasedProductMode, DenseShape, DenseShape> Base; enum { Flags = Base::Flags | EvalBeforeNestingBit }; explicit product_evaluator(const XprType& xpr) : Base(BaseProduct(xpr.lhs(),xpr.rhs())) {} }; template<int UnrollingIndex, typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<RowMajor, UnrollingIndex, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet &res) { etor_product_packet_impl<RowMajor, UnrollingIndex-1, Lhs, Rhs, Packet, LoadMode>::run(row, col, lhs, rhs, innerDim, res); res = pmadd(pset1<Packet>(lhs.coeff(row, Index(UnrollingIndex-1))), rhs.template packet<LoadMode,Packet>(Index(UnrollingIndex-1), col), res); } }; template<int UnrollingIndex, typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<ColMajor, UnrollingIndex, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet &res) { etor_product_packet_impl<ColMajor, UnrollingIndex-1, Lhs, Rhs, Packet, LoadMode>::run(row, col, lhs, rhs, innerDim, res); res = pmadd(lhs.template packet<LoadMode,Packet>(row, Index(UnrollingIndex-1)), pset1<Packet>(rhs.coeff(Index(UnrollingIndex-1), col)), res); } }; template<typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<RowMajor, 1, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index , Packet &res) { res = pmul(pset1<Packet>(lhs.coeff(row, Index(0))),rhs.template packet<LoadMode,Packet>(Index(0), col)); } }; template<typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<ColMajor, 1, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index , Packet &res) { res = pmul(lhs.template packet<LoadMode,Packet>(row, Index(0)), pset1<Packet>(rhs.coeff(Index(0), col))); } }; template<typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<RowMajor, 0, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index , Index , const Lhs& , const Rhs& , Index , Packet &res) { res = pset1<Packet>(typename unpacket_traits<Packet>::type(0)); } }; template<typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<ColMajor, 0, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index , Index , const Lhs& , const Rhs& , Index , Packet &res) { res = pset1<Packet>(typename unpacket_traits<Packet>::type(0)); } }; template<typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<RowMajor, Dynamic, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet& res) { res = pset1<Packet>(typename unpacket_traits<Packet>::type(0)); for(Index i = 0; i < innerDim; ++i) res = pmadd(pset1<Packet>(lhs.coeff(row, i)), rhs.template packet<LoadMode,Packet>(i, col), res); } }; template<typename Lhs, typename Rhs, typename Packet, int LoadMode> struct etor_product_packet_impl<ColMajor, Dynamic, Lhs, Rhs, Packet, LoadMode> { static inline void run(Index row, Index col, const Lhs& lhs, const Rhs& rhs, Index innerDim, Packet& res) { res = pset1<Packet>(typename unpacket_traits<Packet>::type(0)); for(Index i = 0; i < innerDim; ++i) res = pmadd(lhs.template packet<LoadMode,Packet>(row, i), pset1<Packet>(rhs.coeff(i, col)), res); } }; template<int Mode, bool LhsIsTriangular, typename Lhs, bool LhsIsVector, typename Rhs, bool RhsIsVector> struct triangular_product_impl; template<typename Lhs, typename Rhs, int ProductTag> struct generic_product_impl<Lhs,Rhs,TriangularShape,DenseShape,ProductTag> : generic_product_impl_base<Lhs,Rhs,generic_product_impl<Lhs,Rhs,TriangularShape,DenseShape,ProductTag> > { typedef typename Product<Lhs,Rhs>::Scalar Scalar; template<typename Dest> static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) { triangular_product_impl<Lhs::Mode,true,typename Lhs::MatrixType,false,Rhs, Rhs::ColsAtCompileTime==1> ::run(dst, lhs.nestedExpression(), rhs, alpha); } }; template<typename Lhs, typename Rhs, int ProductTag> struct generic_product_impl<Lhs,Rhs,DenseShape,TriangularShape,ProductTag> : generic_product_impl_base<Lhs,Rhs,generic_product_impl<Lhs,Rhs,DenseShape,TriangularShape,ProductTag> > { typedef typename Product<Lhs,Rhs>::Scalar Scalar; template<typename Dest> static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) { triangular_product_impl<Rhs::Mode,false,Lhs,Lhs::RowsAtCompileTime==1, typename Rhs::MatrixType, false>::run(dst, lhs, rhs.nestedExpression(), alpha); } }; template <typename Lhs, int LhsMode, bool LhsIsVector, typename Rhs, int RhsMode, bool RhsIsVector> struct selfadjoint_product_impl; template<typename Lhs, typename Rhs, int ProductTag> struct generic_product_impl<Lhs,Rhs,SelfAdjointShape,DenseShape,ProductTag> : generic_product_impl_base<Lhs,Rhs,generic_product_impl<Lhs,Rhs,SelfAdjointShape,DenseShape,ProductTag> > { typedef typename Product<Lhs,Rhs>::Scalar Scalar; template<typename Dest> static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) { selfadjoint_product_impl<typename Lhs::MatrixType,Lhs::Mode,false,Rhs,0,Rhs::IsVectorAtCompileTime>::run(dst, lhs.nestedExpression(), rhs, alpha); } }; template<typename Lhs, typename Rhs, int ProductTag> struct generic_product_impl<Lhs,Rhs,DenseShape,SelfAdjointShape,ProductTag> : generic_product_impl_base<Lhs,Rhs,generic_product_impl<Lhs,Rhs,DenseShape,SelfAdjointShape,ProductTag> > { typedef typename Product<Lhs,Rhs>::Scalar Scalar; template<typename Dest> static void scaleAndAddTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, const Scalar& alpha) { selfadjoint_product_impl<Lhs,0,Lhs::IsVectorAtCompileTime,typename Rhs::MatrixType,Rhs::Mode,false>::run(dst, lhs, rhs.nestedExpression(), alpha); } }; template<typename MatrixType, typename DiagonalType, typename Derived, int ProductOrder> struct diagonal_product_evaluator_base : evaluator_base<Derived> { typedef typename ScalarBinaryOpTraits<typename MatrixType::Scalar, typename DiagonalType::Scalar>::ReturnType Scalar; public: enum { CoeffReadCost = NumTraits<Scalar>::MulCost + evaluator<MatrixType>::CoeffReadCost + evaluator<DiagonalType>::CoeffReadCost, MatrixFlags = evaluator<MatrixType>::Flags, DiagFlags = evaluator<DiagonalType>::Flags, _StorageOrder = MatrixFlags & RowMajorBit ? RowMajor : ColMajor, _ScalarAccessOnDiag = !((int(_StorageOrder) == ColMajor && int(ProductOrder) == OnTheLeft) ||(int(_StorageOrder) == RowMajor && int(ProductOrder) == OnTheRight)), _SameTypes = is_same<typename MatrixType::Scalar, typename DiagonalType::Scalar>::value, _Vectorizable = bool(int(MatrixFlags)&PacketAccessBit) && _SameTypes && (_ScalarAccessOnDiag || (bool(int(DiagFlags)&PacketAccessBit))), _LinearAccessMask = (MatrixType::RowsAtCompileTime==1 || MatrixType::ColsAtCompileTime==1) ? LinearAccessBit : 0, Flags = ((HereditaryBits|_LinearAccessMask) & (unsigned int)(MatrixFlags)) | (_Vectorizable ? PacketAccessBit : 0), Alignment = evaluator<MatrixType>::Alignment, AsScalarProduct = (DiagonalType::SizeAtCompileTime==1) || (DiagonalType::SizeAtCompileTime==Dynamic && MatrixType::RowsAtCompileTime==1 && ProductOrder==OnTheLeft) || (DiagonalType::SizeAtCompileTime==Dynamic && MatrixType::ColsAtCompileTime==1 && ProductOrder==OnTheRight) }; diagonal_product_evaluator_base(const MatrixType &mat, const DiagonalType &diag) : m_diagImpl(diag), m_matImpl(mat) { if (Eigen::internal::static_assertion<static_cast<bool>((NumTraits<Scalar>::MulCost)>=0 && (NumTraits<Scalar>::MulCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; if (Eigen::internal::static_assertion<static_cast<bool>((CoeffReadCost)>=0 && (CoeffReadCost)<=HugeCost*HugeCost)>::EIGEN_INTERNAL_ERROR_PLEASE_FILE_A_BUG_REPORT__INVALID_COST_VALUE) {};; } inline const Scalar coeff(Index idx) const { if(AsScalarProduct) return m_diagImpl.coeff(0) * m_matImpl.coeff(idx); else return m_diagImpl.coeff(idx) * m_matImpl.coeff(idx); } protected: template<int LoadMode,typename PacketType> inline PacketType packet_impl(Index row, Index col, Index id, internal::true_type) const { return internal::pmul(m_matImpl.template packet<LoadMode,PacketType>(row, col), internal::pset1<PacketType>(m_diagImpl.coeff(id))); } template<int LoadMode,typename PacketType> inline PacketType packet_impl(Index row, Index col, Index id, internal::false_type) const { enum { InnerSize = (MatrixType::Flags & RowMajorBit) ? MatrixType::ColsAtCompileTime : MatrixType::RowsAtCompileTime, DiagonalPacketLoadMode = (((int)LoadMode <= (int)((InnerSize%16) == 0) ? int(Aligned16) : int(evaluator<DiagonalType>::Alignment)) ? (int)LoadMode : (int)((InnerSize%16) == 0) ? int(Aligned16) : int(evaluator<DiagonalType>::Alignment)) }; return internal::pmul(m_matImpl.template packet<LoadMode,PacketType>(row, col), m_diagImpl.template packet<DiagonalPacketLoadMode,PacketType>(id)); } evaluator<DiagonalType> m_diagImpl; evaluator<MatrixType> m_matImpl; }; template<typename Lhs, typename Rhs, int ProductKind, int ProductTag> struct product_evaluator<Product<Lhs, Rhs, ProductKind>, ProductTag, DiagonalShape, DenseShape> : diagonal_product_evaluator_base<Rhs, typename Lhs::DiagonalVectorType, Product<Lhs, Rhs, LazyProduct>, OnTheLeft> { typedef diagonal_product_evaluator_base<Rhs, typename Lhs::DiagonalVectorType, Product<Lhs, Rhs, LazyProduct>, OnTheLeft> Base; using Base::m_diagImpl; using Base::m_matImpl; using Base::coeff; typedef typename Base::Scalar Scalar; typedef Product<Lhs, Rhs, ProductKind> XprType; typedef typename XprType::PlainObject PlainObject; enum { StorageOrder = int(Rhs::Flags) & RowMajorBit ? RowMajor : ColMajor }; explicit product_evaluator(const XprType& xpr) : Base(xpr.rhs(), xpr.lhs().diagonal()) { } inline const Scalar coeff(Index row, Index col) const { return m_diagImpl.coeff(row) * m_matImpl.coeff(row, col); } template<int LoadMode,typename PacketType> inline PacketType packet(Index row, Index col) const { return this->template packet_impl<LoadMode,PacketType>(row,col, row, typename internal::conditional<int(StorageOrder)==RowMajor, internal::true_type, internal::false_type>::type()); } template<int LoadMode,typename PacketType> inline PacketType packet(Index idx) const { return packet<LoadMode,PacketType>(int(StorageOrder)==ColMajor?idx:0,int(StorageOrder)==ColMajor?0:idx); } }; template<typename Lhs, typename Rhs, int ProductKind, int ProductTag> struct product_evaluator<Product<Lhs, Rhs, ProductKind>, ProductTag, DenseShape, DiagonalShape> : diagonal_product_evaluator_base<Lhs, typename Rhs::DiagonalVectorType, Product<Lhs, Rhs, LazyProduct>, OnTheRight> { typedef diagonal_product_evaluator_base<Lhs, typename Rhs::DiagonalVectorType, Product<Lhs, Rhs, LazyProduct>, OnTheRight> Base; using Base::m_diagImpl; using Base::m_matImpl; using Base::coeff; typedef typename Base::Scalar Scalar; typedef Product<Lhs, Rhs, ProductKind> XprType; typedef typename XprType::PlainObject PlainObject; enum { StorageOrder = int(Lhs::Flags) & RowMajorBit ? RowMajor : ColMajor }; explicit product_evaluator(const XprType& xpr) : Base(xpr.lhs(), xpr.rhs().diagonal()) { } inline const Scalar coeff(Index row, Index col) const { return m_matImpl.coeff(row, col) * m_diagImpl.coeff(col); } template<int LoadMode,typename PacketType> inline PacketType packet(Index row, Index col) const { return this->template packet_impl<LoadMode,PacketType>(row,col, col, typename internal::conditional<int(StorageOrder)==ColMajor, internal::true_type, internal::false_type>::type()); } template<int LoadMode,typename PacketType> inline PacketType packet(Index idx) const { return packet<LoadMode,PacketType>(int(StorageOrder)==ColMajor?idx:0,int(StorageOrder)==ColMajor?0:idx); } }; # 930 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" template<typename ExpressionType, int Side, bool Transposed, typename ExpressionShape> struct permutation_matrix_product; template<typename ExpressionType, int Side, bool Transposed> struct permutation_matrix_product<ExpressionType, Side, Transposed, DenseShape> { typedef typename nested_eval<ExpressionType, 1>::type MatrixType; typedef typename remove_all<MatrixType>::type MatrixTypeCleaned; template<typename Dest, typename PermutationType> static inline void run(Dest& dst, const PermutationType& perm, const ExpressionType& xpr) { MatrixType mat(xpr); const Index n = Side==OnTheLeft ? mat.rows() : mat.cols(); if(is_same_dense(dst, mat)) { Matrix<bool,PermutationType::RowsAtCompileTime,1,0,PermutationType::MaxRowsAtCompileTime> mask(perm.size()); mask.fill(false); Index r = 0; while(r < perm.size()) { while(r<perm.size() && mask[r]) r++; if(r>=perm.size()) break; Index k0 = r++; Index kPrev = k0; mask.coeffRef(k0) = true; for(Index k=perm.indices().coeff(k0); k!=k0; k=perm.indices().coeff(k)) { Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime>(dst, k) .swap(Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime> (dst,((Side==OnTheLeft) ^ Transposed) ? k0 : kPrev)); mask.coeffRef(k) = true; kPrev = k; } } } else { for(Index i = 0; i < n; ++i) { Block<Dest, Side==OnTheLeft ? 1 : Dest::RowsAtCompileTime, Side==OnTheRight ? 1 : Dest::ColsAtCompileTime> (dst, ((Side==OnTheLeft) ^ Transposed) ? perm.indices().coeff(i) : i) = Block<const MatrixTypeCleaned,Side==OnTheLeft ? 1 : MatrixTypeCleaned::RowsAtCompileTime,Side==OnTheRight ? 1 : MatrixTypeCleaned::ColsAtCompileTime> (mat, ((Side==OnTheRight) ^ Transposed) ? perm.indices().coeff(i) : i); } } } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Lhs, Rhs, PermutationShape, MatrixShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) { permutation_matrix_product<Rhs, OnTheLeft, false, MatrixShape>::run(dst, lhs, rhs); } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Lhs, Rhs, MatrixShape, PermutationShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) { permutation_matrix_product<Lhs, OnTheRight, false, MatrixShape>::run(dst, rhs, lhs); } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Inverse<Lhs>, Rhs, PermutationShape, MatrixShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Inverse<Lhs>& lhs, const Rhs& rhs) { permutation_matrix_product<Rhs, OnTheLeft, true, MatrixShape>::run(dst, lhs.nestedExpression(), rhs); } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Lhs, Inverse<Rhs>, MatrixShape, PermutationShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Inverse<Rhs>& rhs) { permutation_matrix_product<Lhs, OnTheRight, true, MatrixShape>::run(dst, rhs.nestedExpression(), lhs); } }; # 1041 "eigen-3.3.7/Eigen/src/Core/ProductEvaluators.h" template<typename ExpressionType, int Side, bool Transposed, typename ExpressionShape> struct transposition_matrix_product { typedef typename nested_eval<ExpressionType, 1>::type MatrixType; typedef typename remove_all<MatrixType>::type MatrixTypeCleaned; template<typename Dest, typename TranspositionType> static inline void run(Dest& dst, const TranspositionType& tr, const ExpressionType& xpr) { MatrixType mat(xpr); typedef typename TranspositionType::StorageIndex StorageIndex; const Index size = tr.size(); StorageIndex j = 0; if(!is_same_dense(dst,mat)) dst = mat; for(Index k=(Transposed?size-1:0) ; Transposed?k>=0:k<size ; Transposed?--k:++k) if(Index(j=tr.coeff(k))!=k) { if(Side==OnTheLeft) dst.row(k).swap(dst.row(j)); else if(Side==OnTheRight) dst.col(k).swap(dst.col(j)); } } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Lhs, Rhs, TranspositionsShape, MatrixShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) { transposition_matrix_product<Rhs, OnTheLeft, false, MatrixShape>::run(dst, lhs, rhs); } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Lhs, Rhs, MatrixShape, TranspositionsShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) { transposition_matrix_product<Lhs, OnTheRight, false, MatrixShape>::run(dst, rhs, lhs); } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Transpose<Lhs>, Rhs, TranspositionsShape, MatrixShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Transpose<Lhs>& lhs, const Rhs& rhs) { transposition_matrix_product<Rhs, OnTheLeft, true, MatrixShape>::run(dst, lhs.nestedExpression(), rhs); } }; template<typename Lhs, typename Rhs, int ProductTag, typename MatrixShape> struct generic_product_impl<Lhs, Transpose<Rhs>, MatrixShape, TranspositionsShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Transpose<Rhs>& rhs) { transposition_matrix_product<Lhs, OnTheRight, true, MatrixShape>::run(dst, rhs.nestedExpression(), lhs); } }; } } # 494 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixVector.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixVector.h" namespace Eigen { namespace internal { # 58 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixVector.h" template<typename Index, typename LhsScalar, typename LhsMapper, bool ConjugateLhs, typename RhsScalar, typename RhsMapper, bool ConjugateRhs, int Version> struct general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,ConjugateLhs,RhsScalar,RhsMapper,ConjugateRhs,Version> { typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; enum { Vectorizable = packet_traits<LhsScalar>::Vectorizable && packet_traits<RhsScalar>::Vectorizable && int(packet_traits<LhsScalar>::size)==int(packet_traits<RhsScalar>::size), LhsPacketSize = Vectorizable ? packet_traits<LhsScalar>::size : 1, RhsPacketSize = Vectorizable ? packet_traits<RhsScalar>::size : 1, ResPacketSize = Vectorizable ? packet_traits<ResScalar>::size : 1 }; typedef typename packet_traits<LhsScalar>::type _LhsPacket; typedef typename packet_traits<RhsScalar>::type _RhsPacket; typedef typename packet_traits<ResScalar>::type _ResPacket; typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket; typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket; typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket; __attribute__((noinline)) static void run( Index rows, Index cols, const LhsMapper& lhs, const RhsMapper& rhs, ResScalar* res, Index resIncr, RhsScalar alpha); }; template<typename Index, typename LhsScalar, typename LhsMapper, bool ConjugateLhs, typename RhsScalar, typename RhsMapper, bool ConjugateRhs, int Version> __attribute__((noinline)) void general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,ConjugateLhs,RhsScalar,RhsMapper,ConjugateRhs,Version>::run( Index rows, Index cols, const LhsMapper& lhs, const RhsMapper& rhs, ResScalar* res, Index resIncr, RhsScalar alpha) { Eigen::internal::ignore_unused_variable(resIncr);; ; # 109 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixVector.h" typedef typename LhsMapper::VectorMapper LhsScalars; conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj; conj_helper<LhsPacket,RhsPacket,ConjugateLhs,ConjugateRhs> pcj; if(ConjugateRhs) alpha = numext::conj(alpha); enum { AllAligned = 0, EvenAligned, FirstAligned, NoneAligned }; const Index columnsAtOnce = 4; const Index peels = 2; const Index LhsPacketAlignedMask = LhsPacketSize-1; const Index ResPacketAlignedMask = ResPacketSize-1; const Index size = rows; const Index lhsStride = lhs.stride(); Index alignedStart = internal::first_default_aligned(res,size); Index alignedSize = ResPacketSize>1 ? alignedStart + ((size-alignedStart) & ~ResPacketAlignedMask) : 0; const Index peeledSize = alignedSize - RhsPacketSize*peels - RhsPacketSize + 1; const Index alignmentStep = LhsPacketSize>1 ? (LhsPacketSize - lhsStride % LhsPacketSize) & LhsPacketAlignedMask : 0; Index alignmentPattern = alignmentStep==0 ? AllAligned : alignmentStep==(LhsPacketSize/2) ? EvenAligned : FirstAligned; const Index lhsAlignmentOffset = lhs.firstAligned(size); Index skipColumns = 0; if( (lhsAlignmentOffset < 0) || (lhsAlignmentOffset == size) || (UIntPtr(res)%sizeof(ResScalar)) ) { alignedSize = 0; alignedStart = 0; alignmentPattern = NoneAligned; } else if(LhsPacketSize > 4) { alignmentPattern = NoneAligned; } else if (LhsPacketSize>1) { while (skipColumns<LhsPacketSize && alignedStart != ((lhsAlignmentOffset + alignmentStep*skipColumns)%LhsPacketSize)) ++skipColumns; if (skipColumns==LhsPacketSize) { alignmentPattern = NoneAligned; skipColumns = 0; } else { skipColumns = (std::min)(skipColumns,cols); } } else if(Vectorizable) { alignedStart = 0; alignedSize = size; alignmentPattern = AllAligned; } const Index offset1 = (alignmentPattern==FirstAligned && alignmentStep==1)?3:1; const Index offset3 = (alignmentPattern==FirstAligned && alignmentStep==1)?1:3; Index columnBound = ((cols-skipColumns)/columnsAtOnce)*columnsAtOnce + skipColumns; for (Index i=skipColumns; i<columnBound; i+=columnsAtOnce) { RhsPacket ptmp0 = pset1<RhsPacket>(alpha*rhs(i, 0)), ptmp1 = pset1<RhsPacket>(alpha*rhs(i+offset1, 0)), ptmp2 = pset1<RhsPacket>(alpha*rhs(i+2, 0)), ptmp3 = pset1<RhsPacket>(alpha*rhs(i+offset3, 0)); const LhsScalars lhs0 = lhs.getVectorMapper(0, i+0), lhs1 = lhs.getVectorMapper(0, i+offset1), lhs2 = lhs.getVectorMapper(0, i+2), lhs3 = lhs.getVectorMapper(0, i+offset3); if (Vectorizable) { for (Index j=0; j<alignedStart; ++j) { res[j] = cj.pmadd(lhs0(j), pfirst(ptmp0), res[j]); res[j] = cj.pmadd(lhs1(j), pfirst(ptmp1), res[j]); res[j] = cj.pmadd(lhs2(j), pfirst(ptmp2), res[j]); res[j] = cj.pmadd(lhs3(j), pfirst(ptmp3), res[j]); } if (alignedSize>alignedStart) { switch(alignmentPattern) { case AllAligned: for (Index j = alignedStart; j<alignedSize; j+=ResPacketSize) pstore(&res[j], padd(pload<ResPacket>(&res[j]), padd( padd(pcj.pmul(lhs0.template load<LhsPacket, Aligned>(j), ptmp0), pcj.pmul(lhs1.template load<LhsPacket, Aligned>(j), ptmp1)), padd(pcj.pmul(lhs2.template load<LhsPacket, Aligned>(j), ptmp2), pcj.pmul(lhs3.template load<LhsPacket, Aligned>(j), ptmp3)) ))); break; case EvenAligned: for (Index j = alignedStart; j<alignedSize; j+=ResPacketSize) pstore(&res[j], padd(pload<ResPacket>(&res[j]), padd( padd(pcj.pmul(lhs0.template load<LhsPacket, Aligned>(j), ptmp0), pcj.pmul(lhs1.template load<LhsPacket, Unaligned>(j), ptmp1)), padd(pcj.pmul(lhs2.template load<LhsPacket, Aligned>(j), ptmp2), pcj.pmul(lhs3.template load<LhsPacket, Unaligned>(j), ptmp3)) ))); break; case FirstAligned: { Index j = alignedStart; if(peels>1) { LhsPacket A00, A01, A02, A03, A10, A11, A12, A13; ResPacket T0, T1; A01 = lhs1.template load<LhsPacket, Aligned>(alignedStart-1); A02 = lhs2.template load<LhsPacket, Aligned>(alignedStart-2); A03 = lhs3.template load<LhsPacket, Aligned>(alignedStart-3); for (; j<peeledSize; j+=peels*ResPacketSize) { A11 = lhs1.template load<LhsPacket, Aligned>(j-1+LhsPacketSize); palign<1>(A01,A11); A12 = lhs2.template load<LhsPacket, Aligned>(j-2+LhsPacketSize); palign<2>(A02,A12); A13 = lhs3.template load<LhsPacket, Aligned>(j-3+LhsPacketSize); palign<3>(A03,A13); A00 = lhs0.template load<LhsPacket, Aligned>(j); A10 = lhs0.template load<LhsPacket, Aligned>(j+LhsPacketSize); T0 = pcj.pmadd(A00, ptmp0, pload<ResPacket>(&res[j])); T1 = pcj.pmadd(A10, ptmp0, pload<ResPacket>(&res[j+ResPacketSize])); T0 = pcj.pmadd(A01, ptmp1, T0); A01 = lhs1.template load<LhsPacket, Aligned>(j-1+2*LhsPacketSize); palign<1>(A11,A01); T0 = pcj.pmadd(A02, ptmp2, T0); A02 = lhs2.template load<LhsPacket, Aligned>(j-2+2*LhsPacketSize); palign<2>(A12,A02); T0 = pcj.pmadd(A03, ptmp3, T0); pstore(&res[j],T0); A03 = lhs3.template load<LhsPacket, Aligned>(j-3+2*LhsPacketSize); palign<3>(A13,A03); T1 = pcj.pmadd(A11, ptmp1, T1); T1 = pcj.pmadd(A12, ptmp2, T1); T1 = pcj.pmadd(A13, ptmp3, T1); pstore(&res[j+ResPacketSize],T1); } } for (; j<alignedSize; j+=ResPacketSize) pstore(&res[j], padd(pload<ResPacket>(&res[j]), padd( padd(pcj.pmul(lhs0.template load<LhsPacket, Aligned>(j), ptmp0), pcj.pmul(lhs1.template load<LhsPacket, Unaligned>(j), ptmp1)), padd(pcj.pmul(lhs2.template load<LhsPacket, Unaligned>(j), ptmp2), pcj.pmul(lhs3.template load<LhsPacket, Unaligned>(j), ptmp3)) ))); break; } default: for (Index j = alignedStart; j<alignedSize; j+=ResPacketSize) pstore(&res[j], padd(pload<ResPacket>(&res[j]), padd( padd(pcj.pmul(lhs0.template load<LhsPacket, Unaligned>(j), ptmp0), pcj.pmul(lhs1.template load<LhsPacket, Unaligned>(j), ptmp1)), padd(pcj.pmul(lhs2.template load<LhsPacket, Unaligned>(j), ptmp2), pcj.pmul(lhs3.template load<LhsPacket, Unaligned>(j), ptmp3)) ))); break; } } } for (Index j=alignedSize; j<size; ++j) { res[j] = cj.pmadd(lhs0(j), pfirst(ptmp0), res[j]); res[j] = cj.pmadd(lhs1(j), pfirst(ptmp1), res[j]); res[j] = cj.pmadd(lhs2(j), pfirst(ptmp2), res[j]); res[j] = cj.pmadd(lhs3(j), pfirst(ptmp3), res[j]); } } Index end = cols; Index start = columnBound; do { for (Index k=start; k<end; ++k) { RhsPacket ptmp0 = pset1<RhsPacket>(alpha*rhs(k, 0)); const LhsScalars lhs0 = lhs.getVectorMapper(0, k); if (Vectorizable) { for (Index j=0; j<alignedStart; ++j) res[j] += cj.pmul(lhs0(j), pfirst(ptmp0)); if (lhs0.template aligned<LhsPacket>(alignedStart)) for (Index i = alignedStart;i<alignedSize;i+=ResPacketSize) pstore(&res[i], pcj.pmadd(lhs0.template load<LhsPacket, Aligned>(i), ptmp0, pload<ResPacket>(&res[i]))); else for (Index i = alignedStart;i<alignedSize;i+=ResPacketSize) pstore(&res[i], pcj.pmadd(lhs0.template load<LhsPacket, Unaligned>(i), ptmp0, pload<ResPacket>(&res[i]))); } for (Index i=alignedSize; i<size; ++i) res[i] += cj.pmul(lhs0(i), pfirst(ptmp0)); } if (skipColumns) { start = 0; end = skipColumns; skipColumns = 0; } else break; } while(Vectorizable); } # 334 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixVector.h" template<typename Index, typename LhsScalar, typename LhsMapper, bool ConjugateLhs, typename RhsScalar, typename RhsMapper, bool ConjugateRhs, int Version> struct general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjugateLhs,RhsScalar,RhsMapper,ConjugateRhs,Version> { typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; enum { Vectorizable = packet_traits<LhsScalar>::Vectorizable && packet_traits<RhsScalar>::Vectorizable && int(packet_traits<LhsScalar>::size)==int(packet_traits<RhsScalar>::size), LhsPacketSize = Vectorizable ? packet_traits<LhsScalar>::size : 1, RhsPacketSize = Vectorizable ? packet_traits<RhsScalar>::size : 1, ResPacketSize = Vectorizable ? packet_traits<ResScalar>::size : 1 }; typedef typename packet_traits<LhsScalar>::type _LhsPacket; typedef typename packet_traits<RhsScalar>::type _RhsPacket; typedef typename packet_traits<ResScalar>::type _ResPacket; typedef typename conditional<Vectorizable,_LhsPacket,LhsScalar>::type LhsPacket; typedef typename conditional<Vectorizable,_RhsPacket,RhsScalar>::type RhsPacket; typedef typename conditional<Vectorizable,_ResPacket,ResScalar>::type ResPacket; __attribute__((noinline)) static void run( Index rows, Index cols, const LhsMapper& lhs, const RhsMapper& rhs, ResScalar* res, Index resIncr, ResScalar alpha); }; template<typename Index, typename LhsScalar, typename LhsMapper, bool ConjugateLhs, typename RhsScalar, typename RhsMapper, bool ConjugateRhs, int Version> __attribute__((noinline)) void general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjugateLhs,RhsScalar,RhsMapper,ConjugateRhs,Version>::run( Index rows, Index cols, const LhsMapper& lhs, const RhsMapper& rhs, ResScalar* res, Index resIncr, ResScalar alpha) { ; # 384 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixVector.h" conj_helper<LhsScalar,RhsScalar,ConjugateLhs,ConjugateRhs> cj; conj_helper<LhsPacket,RhsPacket,ConjugateLhs,ConjugateRhs> pcj; typedef typename LhsMapper::VectorMapper LhsScalars; enum { AllAligned=0, EvenAligned=1, FirstAligned=2, NoneAligned=3 }; const Index rowsAtOnce = 4; const Index peels = 2; const Index RhsPacketAlignedMask = RhsPacketSize-1; const Index LhsPacketAlignedMask = LhsPacketSize-1; const Index depth = cols; const Index lhsStride = lhs.stride(); Index alignedStart = rhs.firstAligned(depth); Index alignedSize = RhsPacketSize>1 ? alignedStart + ((depth-alignedStart) & ~RhsPacketAlignedMask) : 0; const Index peeledSize = alignedSize - RhsPacketSize*peels - RhsPacketSize + 1; const Index alignmentStep = LhsPacketSize>1 ? (LhsPacketSize - lhsStride % LhsPacketSize) & LhsPacketAlignedMask : 0; Index alignmentPattern = alignmentStep==0 ? AllAligned : alignmentStep==(LhsPacketSize/2) ? EvenAligned : FirstAligned; const Index lhsAlignmentOffset = lhs.firstAligned(depth); const Index rhsAlignmentOffset = rhs.firstAligned(rows); Index skipRows = 0; if( (sizeof(LhsScalar)!=sizeof(RhsScalar)) || (lhsAlignmentOffset < 0) || (lhsAlignmentOffset == depth) || (rhsAlignmentOffset < 0) || (rhsAlignmentOffset == rows) ) { alignedSize = 0; alignedStart = 0; alignmentPattern = NoneAligned; } else if(LhsPacketSize > 4) { alignmentPattern = NoneAligned; } else if (LhsPacketSize>1) { while (skipRows<LhsPacketSize && alignedStart != ((lhsAlignmentOffset + alignmentStep*skipRows)%LhsPacketSize)) ++skipRows; if (skipRows==LhsPacketSize) { alignmentPattern = NoneAligned; skipRows = 0; } else { skipRows = (std::min)(skipRows,Index(rows)); } } else if(Vectorizable) { alignedStart = 0; alignedSize = depth; alignmentPattern = AllAligned; } const Index offset1 = (alignmentPattern==FirstAligned && alignmentStep==1)?3:1; const Index offset3 = (alignmentPattern==FirstAligned && alignmentStep==1)?1:3; Index rowBound = ((rows-skipRows)/rowsAtOnce)*rowsAtOnce + skipRows; for (Index i=skipRows; i<rowBound; i+=rowsAtOnce) { __attribute__((aligned(16))) ResScalar tmp0 = ResScalar(0); ResScalar tmp1 = ResScalar(0), tmp2 = ResScalar(0), tmp3 = ResScalar(0); const LhsScalars lhs0 = lhs.getVectorMapper(i+0, 0), lhs1 = lhs.getVectorMapper(i+offset1, 0), lhs2 = lhs.getVectorMapper(i+2, 0), lhs3 = lhs.getVectorMapper(i+offset3, 0); if (Vectorizable) { ResPacket ptmp0 = pset1<ResPacket>(ResScalar(0)), ptmp1 = pset1<ResPacket>(ResScalar(0)), ptmp2 = pset1<ResPacket>(ResScalar(0)), ptmp3 = pset1<ResPacket>(ResScalar(0)); for (Index j=0; j<alignedStart; ++j) { RhsScalar b = rhs(j, 0); tmp0 += cj.pmul(lhs0(j),b); tmp1 += cj.pmul(lhs1(j),b); tmp2 += cj.pmul(lhs2(j),b); tmp3 += cj.pmul(lhs3(j),b); } if (alignedSize>alignedStart) { switch(alignmentPattern) { case AllAligned: for (Index j = alignedStart; j<alignedSize; j+=RhsPacketSize) { RhsPacket b = rhs.getVectorMapper(j, 0).template load<RhsPacket, Aligned>(0); ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Aligned>(j), b, ptmp0); ptmp1 = pcj.pmadd(lhs1.template load<LhsPacket, Aligned>(j), b, ptmp1); ptmp2 = pcj.pmadd(lhs2.template load<LhsPacket, Aligned>(j), b, ptmp2); ptmp3 = pcj.pmadd(lhs3.template load<LhsPacket, Aligned>(j), b, ptmp3); }; break; case EvenAligned: for (Index j = alignedStart; j<alignedSize; j+=RhsPacketSize) { RhsPacket b = rhs.getVectorMapper(j, 0).template load<RhsPacket, Aligned>(0); ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Aligned>(j), b, ptmp0); ptmp1 = pcj.pmadd(lhs1.template load<LhsPacket, Unaligned>(j), b, ptmp1); ptmp2 = pcj.pmadd(lhs2.template load<LhsPacket, Aligned>(j), b, ptmp2); ptmp3 = pcj.pmadd(lhs3.template load<LhsPacket, Unaligned>(j), b, ptmp3); }; break; case FirstAligned: { Index j = alignedStart; if (peels>1) { LhsPacket A01, A02, A03, A11, A12, A13; A01 = lhs1.template load<LhsPacket, Aligned>(alignedStart-1); A02 = lhs2.template load<LhsPacket, Aligned>(alignedStart-2); A03 = lhs3.template load<LhsPacket, Aligned>(alignedStart-3); for (; j<peeledSize; j+=peels*RhsPacketSize) { RhsPacket b = rhs.getVectorMapper(j, 0).template load<RhsPacket, Aligned>(0); A11 = lhs1.template load<LhsPacket, Aligned>(j-1+LhsPacketSize); palign<1>(A01,A11); A12 = lhs2.template load<LhsPacket, Aligned>(j-2+LhsPacketSize); palign<2>(A02,A12); A13 = lhs3.template load<LhsPacket, Aligned>(j-3+LhsPacketSize); palign<3>(A03,A13); ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Aligned>(j), b, ptmp0); ptmp1 = pcj.pmadd(A01, b, ptmp1); A01 = lhs1.template load<LhsPacket, Aligned>(j-1+2*LhsPacketSize); palign<1>(A11,A01); ptmp2 = pcj.pmadd(A02, b, ptmp2); A02 = lhs2.template load<LhsPacket, Aligned>(j-2+2*LhsPacketSize); palign<2>(A12,A02); ptmp3 = pcj.pmadd(A03, b, ptmp3); A03 = lhs3.template load<LhsPacket, Aligned>(j-3+2*LhsPacketSize); palign<3>(A13,A03); b = rhs.getVectorMapper(j+RhsPacketSize, 0).template load<RhsPacket, Aligned>(0); ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Aligned>(j+LhsPacketSize), b, ptmp0); ptmp1 = pcj.pmadd(A11, b, ptmp1); ptmp2 = pcj.pmadd(A12, b, ptmp2); ptmp3 = pcj.pmadd(A13, b, ptmp3); } } for (; j<alignedSize; j+=RhsPacketSize) { RhsPacket b = rhs.getVectorMapper(j, 0).template load<RhsPacket, Aligned>(0); ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Aligned>(j), b, ptmp0); ptmp1 = pcj.pmadd(lhs1.template load<LhsPacket, Unaligned>(j), b, ptmp1); ptmp2 = pcj.pmadd(lhs2.template load<LhsPacket, Unaligned>(j), b, ptmp2); ptmp3 = pcj.pmadd(lhs3.template load<LhsPacket, Unaligned>(j), b, ptmp3); }; break; } default: for (Index j = alignedStart; j<alignedSize; j+=RhsPacketSize) { RhsPacket b = rhs.getVectorMapper(j, 0).template load<RhsPacket, Aligned>(0); ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Unaligned>(j), b, ptmp0); ptmp1 = pcj.pmadd(lhs1.template load<LhsPacket, Unaligned>(j), b, ptmp1); ptmp2 = pcj.pmadd(lhs2.template load<LhsPacket, Unaligned>(j), b, ptmp2); ptmp3 = pcj.pmadd(lhs3.template load<LhsPacket, Unaligned>(j), b, ptmp3); }; break; } tmp0 += predux(ptmp0); tmp1 += predux(ptmp1); tmp2 += predux(ptmp2); tmp3 += predux(ptmp3); } } for (Index j=alignedSize; j<depth; ++j) { RhsScalar b = rhs(j, 0); tmp0 += cj.pmul(lhs0(j),b); tmp1 += cj.pmul(lhs1(j),b); tmp2 += cj.pmul(lhs2(j),b); tmp3 += cj.pmul(lhs3(j),b); } res[i*resIncr] += alpha*tmp0; res[(i+offset1)*resIncr] += alpha*tmp1; res[(i+2)*resIncr] += alpha*tmp2; res[(i+offset3)*resIncr] += alpha*tmp3; } Index end = rows; Index start = rowBound; do { for (Index i=start; i<end; ++i) { __attribute__((aligned(16))) ResScalar tmp0 = ResScalar(0); ResPacket ptmp0 = pset1<ResPacket>(tmp0); const LhsScalars lhs0 = lhs.getVectorMapper(i, 0); for (Index j=0; j<alignedStart; ++j) tmp0 += cj.pmul(lhs0(j), rhs(j, 0)); if (alignedSize>alignedStart) { if (lhs0.template aligned<LhsPacket>(alignedStart)) for (Index j = alignedStart;j<alignedSize;j+=RhsPacketSize) ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Aligned>(j), rhs.getVectorMapper(j, 0).template load<RhsPacket, Aligned>(0), ptmp0); else for (Index j = alignedStart;j<alignedSize;j+=RhsPacketSize) ptmp0 = pcj.pmadd(lhs0.template load<LhsPacket, Unaligned>(j), rhs.getVectorMapper(j, 0).template load<RhsPacket, Aligned>(0), ptmp0); tmp0 += predux(ptmp0); } for (Index j=alignedSize; j<depth; ++j) tmp0 += cj.pmul(lhs0(j), rhs(j, 0)); res[i*resIncr] += alpha*tmp0; } if (skipRows) { start = 0; end = skipRows; skipRows = 0; } else break; } while(Vectorizable); } } } # 495 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrix.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrix.h" namespace Eigen { namespace internal { template<typename _LhsScalar, typename _RhsScalar> class level3_blocking; template< typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs> struct general_matrix_matrix_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,RowMajor> { typedef gebp_traits<RhsScalar,LhsScalar> Traits; typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; static inline void run( Index rows, Index cols, Index depth, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, ResScalar alpha, level3_blocking<RhsScalar,LhsScalar>& blocking, GemmParallelInfo<Index>* info = 0) { general_matrix_matrix_product<Index, RhsScalar, RhsStorageOrder==RowMajor ? ColMajor : RowMajor, ConjugateRhs, LhsScalar, LhsStorageOrder==RowMajor ? ColMajor : RowMajor, ConjugateLhs, ColMajor> ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info); } }; template< typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs> struct general_matrix_matrix_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,ColMajor> { typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; static void run(Index rows, Index cols, Index depth, const LhsScalar* _lhs, Index lhsStride, const RhsScalar* _rhs, Index rhsStride, ResScalar* _res, Index resStride, ResScalar alpha, level3_blocking<LhsScalar,RhsScalar>& blocking, GemmParallelInfo<Index>* info = 0) { typedef const_blas_data_mapper<LhsScalar, Index, LhsStorageOrder> LhsMapper; typedef const_blas_data_mapper<RhsScalar, Index, RhsStorageOrder> RhsMapper; typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper; LhsMapper lhs(_lhs,lhsStride); RhsMapper rhs(_rhs,rhsStride); ResMapper res(_res, resStride); Index kc = blocking.kc(); Index mc = (std::min)(rows,blocking.mc()); Index nc = (std::min)(cols,blocking.nc()); gemm_pack_lhs<LhsScalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs; gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp; # 155 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrix.h" { Eigen::internal::ignore_unused_variable(info);; std::size_t sizeA = kc*mc; std::size_t sizeB = kc*nc; Eigen::internal::check_size_for_overflow<LhsScalar>(sizeA); LhsScalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<LhsScalar*>( (sizeof(LhsScalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(LhsScalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(LhsScalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<LhsScalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(LhsScalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<RhsScalar>(sizeB); RhsScalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<RhsScalar*>( (sizeof(RhsScalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(RhsScalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(RhsScalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<RhsScalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(RhsScalar)*sizeB>131072); const bool pack_rhs_once = mc!=rows && kc==depth && nc==cols; for(Index i2=0; i2<rows; i2+=mc) { const Index actual_mc = (std::min)(i2+mc,rows)-i2; for(Index k2=0; k2<depth; k2+=kc) { const Index actual_kc = (std::min)(k2+kc,depth)-k2; pack_lhs(blockA, lhs.getSubMapper(i2,k2), actual_kc, actual_mc); for(Index j2=0; j2<cols; j2+=nc) { const Index actual_nc = (std::min)(j2+nc,cols)-j2; if((!pack_rhs_once) || i2==0) pack_rhs(blockB, rhs.getSubMapper(k2,j2), actual_kc, actual_nc); gebp(res.getSubMapper(i2, j2), blockA, blockB, actual_mc, actual_kc, actual_nc, alpha); } } } } } }; template<typename Scalar, typename Index, typename Gemm, typename Lhs, typename Rhs, typename Dest, typename BlockingType> struct gemm_functor { gemm_functor(const Lhs& lhs, const Rhs& rhs, Dest& dest, const Scalar& actualAlpha, BlockingType& blocking) : m_lhs(lhs), m_rhs(rhs), m_dest(dest), m_actualAlpha(actualAlpha), m_blocking(blocking) {} void initParallelSession(Index num_threads) const { m_blocking.initParallel(m_lhs.rows(), m_rhs.cols(), m_lhs.cols(), num_threads); m_blocking.allocateA(); } void operator() (Index row, Index rows, Index col=0, Index cols=-1, GemmParallelInfo<Index>* info=0) const { if(cols==-1) cols = m_rhs.cols(); Gemm::run(rows, cols, m_lhs.cols(), &m_lhs.coeffRef(row,0), m_lhs.outerStride(), &m_rhs.coeffRef(0,col), m_rhs.outerStride(), (Scalar*)&(m_dest.coeffRef(row,col)), m_dest.outerStride(), m_actualAlpha, m_blocking, info); } typedef typename Gemm::Traits Traits; protected: const Lhs& m_lhs; const Rhs& m_rhs; Dest& m_dest; Scalar m_actualAlpha; BlockingType& m_blocking; }; template<int StorageOrder, typename LhsScalar, typename RhsScalar, int MaxRows, int MaxCols, int MaxDepth, int KcFactor=1, bool FiniteAtCompileTime = MaxRows!=Dynamic && MaxCols!=Dynamic && MaxDepth != Dynamic> class gemm_blocking_space; template<typename _LhsScalar, typename _RhsScalar> class level3_blocking { typedef _LhsScalar LhsScalar; typedef _RhsScalar RhsScalar; protected: LhsScalar* m_blockA; RhsScalar* m_blockB; Index m_mc; Index m_nc; Index m_kc; public: level3_blocking() : m_blockA(0), m_blockB(0), m_mc(0), m_nc(0), m_kc(0) {} inline Index mc() const { return m_mc; } inline Index nc() const { return m_nc; } inline Index kc() const { return m_kc; } inline LhsScalar* blockA() { return m_blockA; } inline RhsScalar* blockB() { return m_blockB; } }; template<int StorageOrder, typename _LhsScalar, typename _RhsScalar, int MaxRows, int MaxCols, int MaxDepth, int KcFactor> class gemm_blocking_space<StorageOrder,_LhsScalar,_RhsScalar,MaxRows, MaxCols, MaxDepth, KcFactor, true > : public level3_blocking< typename conditional<StorageOrder==RowMajor,_RhsScalar,_LhsScalar>::type, typename conditional<StorageOrder==RowMajor,_LhsScalar,_RhsScalar>::type> { enum { Transpose = StorageOrder==RowMajor, ActualRows = Transpose ? MaxCols : MaxRows, ActualCols = Transpose ? MaxRows : MaxCols }; typedef typename conditional<Transpose,_RhsScalar,_LhsScalar>::type LhsScalar; typedef typename conditional<Transpose,_LhsScalar,_RhsScalar>::type RhsScalar; typedef gebp_traits<LhsScalar,RhsScalar> Traits; enum { SizeA = ActualRows * MaxDepth, SizeB = ActualCols * MaxDepth }; __attribute__((aligned(16))) LhsScalar m_staticA[SizeA]; __attribute__((aligned(16))) RhsScalar m_staticB[SizeB]; public: gemm_blocking_space(Index , Index , Index , Index , bool ) { this->m_mc = ActualRows; this->m_nc = ActualCols; this->m_kc = MaxDepth; this->m_blockA = m_staticA; this->m_blockB = m_staticB; } void initParallel(Index, Index, Index, Index) {} inline void allocateA() {} inline void allocateB() {} inline void allocateAll() {} }; template<int StorageOrder, typename _LhsScalar, typename _RhsScalar, int MaxRows, int MaxCols, int MaxDepth, int KcFactor> class gemm_blocking_space<StorageOrder,_LhsScalar,_RhsScalar,MaxRows, MaxCols, MaxDepth, KcFactor, false> : public level3_blocking< typename conditional<StorageOrder==RowMajor,_RhsScalar,_LhsScalar>::type, typename conditional<StorageOrder==RowMajor,_LhsScalar,_RhsScalar>::type> { enum { Transpose = StorageOrder==RowMajor }; typedef typename conditional<Transpose,_RhsScalar,_LhsScalar>::type LhsScalar; typedef typename conditional<Transpose,_LhsScalar,_RhsScalar>::type RhsScalar; typedef gebp_traits<LhsScalar,RhsScalar> Traits; Index m_sizeA; Index m_sizeB; public: gemm_blocking_space(Index rows, Index cols, Index depth, Index num_threads, bool l3_blocking) { this->m_mc = Transpose ? cols : rows; this->m_nc = Transpose ? rows : cols; this->m_kc = depth; if(l3_blocking) { computeProductBlockingSizes<LhsScalar,RhsScalar,KcFactor>(this->m_kc, this->m_mc, this->m_nc, num_threads); } else { Index n = this->m_nc; computeProductBlockingSizes<LhsScalar,RhsScalar,KcFactor>(this->m_kc, this->m_mc, n, num_threads); } m_sizeA = this->m_mc * this->m_kc; m_sizeB = this->m_kc * this->m_nc; } void initParallel(Index rows, Index cols, Index depth, Index num_threads) { this->m_mc = Transpose ? cols : rows; this->m_nc = Transpose ? rows : cols; this->m_kc = depth; ; Index m = this->m_mc; computeProductBlockingSizes<LhsScalar,RhsScalar,KcFactor>(this->m_kc, m, this->m_nc, num_threads); m_sizeA = this->m_mc * this->m_kc; m_sizeB = this->m_kc * this->m_nc; } void allocateA() { if(this->m_blockA==0) this->m_blockA = aligned_new<LhsScalar>(m_sizeA); } void allocateB() { if(this->m_blockB==0) this->m_blockB = aligned_new<RhsScalar>(m_sizeB); } void allocateAll() { allocateA(); allocateB(); } ~gemm_blocking_space() { aligned_delete(this->m_blockA, m_sizeA); aligned_delete(this->m_blockB, m_sizeB); } }; } namespace internal { template<typename Lhs, typename Rhs> struct generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,GemmProduct> : generic_product_impl_base<Lhs,Rhs,generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,GemmProduct> > { typedef typename Product<Lhs,Rhs>::Scalar Scalar; typedef typename Lhs::Scalar LhsScalar; typedef typename Rhs::Scalar RhsScalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef typename internal::remove_all<ActualLhsType>::type ActualLhsTypeCleaned; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; typedef typename internal::remove_all<ActualRhsType>::type ActualRhsTypeCleaned; enum { MaxDepthAtCompileTime = (((int)Lhs::MaxColsAtCompileTime == 0 || (int)Rhs::MaxRowsAtCompileTime == 0) ? 0 : ((int)Lhs::MaxColsAtCompileTime == 1 || (int)Rhs::MaxRowsAtCompileTime == 1) ? 1 : ((int)Lhs::MaxColsAtCompileTime == Dynamic && (int)Rhs::MaxRowsAtCompileTime == Dynamic) ? Dynamic : ((int)Lhs::MaxColsAtCompileTime == Dynamic) ? (int)Rhs::MaxRowsAtCompileTime : ((int)Rhs::MaxRowsAtCompileTime == Dynamic) ? (int)Lhs::MaxColsAtCompileTime : ((int)Lhs::MaxColsAtCompileTime <= (int)Rhs::MaxRowsAtCompileTime) ? (int)Lhs::MaxColsAtCompileTime : (int)Rhs::MaxRowsAtCompileTime) }; typedef generic_product_impl<Lhs,Rhs,DenseShape,DenseShape,CoeffBasedProductMode> lazyproduct; template<typename Dst> static void evalTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { if((rhs.rows()+dst.rows()+dst.cols())<20 && rhs.rows()>0) lazyproduct::evalTo(dst, lhs, rhs); else { dst.setZero(); scaleAndAddTo(dst, lhs, rhs, Scalar(1)); } } template<typename Dst> static void addTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { if((rhs.rows()+dst.rows()+dst.cols())<20 && rhs.rows()>0) lazyproduct::addTo(dst, lhs, rhs); else scaleAndAddTo(dst,lhs, rhs, Scalar(1)); } template<typename Dst> static void subTo(Dst& dst, const Lhs& lhs, const Rhs& rhs) { if((rhs.rows()+dst.rows()+dst.cols())<20 && rhs.rows()>0) lazyproduct::subTo(dst, lhs, rhs); else scaleAndAddTo(dst, lhs, rhs, Scalar(-1)); } template<typename Dest> static void scaleAndAddTo(Dest& dst, const Lhs& a_lhs, const Rhs& a_rhs, const Scalar& alpha) { ((dst.rows()==a_lhs.rows() && dst.cols()==a_rhs.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows()==a_lhs.rows() && dst.cols()==a_rhs.cols()", "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrix.h", 460, __PRETTY_FUNCTION__)); if(a_lhs.cols()==0 || a_lhs.rows()==0 || a_rhs.cols()==0) return; typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(a_lhs); typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(a_rhs); Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) * RhsBlasTraits::extractScalarFactor(a_rhs); typedef internal::gemm_blocking_space<(Dest::Flags&RowMajorBit) ? RowMajor : ColMajor,LhsScalar,RhsScalar, Dest::MaxRowsAtCompileTime,Dest::MaxColsAtCompileTime,MaxDepthAtCompileTime> BlockingType; typedef internal::gemm_functor< Scalar, Index, internal::general_matrix_matrix_product< Index, LhsScalar, (ActualLhsTypeCleaned::Flags&RowMajorBit) ? RowMajor : ColMajor, bool(LhsBlasTraits::NeedToConjugate), RhsScalar, (ActualRhsTypeCleaned::Flags&RowMajorBit) ? RowMajor : ColMajor, bool(RhsBlasTraits::NeedToConjugate), (Dest::Flags&RowMajorBit) ? RowMajor : ColMajor>, ActualLhsTypeCleaned, ActualRhsTypeCleaned, Dest, BlockingType> GemmFunctor; BlockingType blocking(dst.rows(), dst.cols(), lhs.cols(), 1, true); internal::parallelize_gemm<(Dest::MaxRowsAtCompileTime>32 || Dest::MaxRowsAtCompileTime==Dynamic)> (GemmFunctor(lhs, rhs, dst, actualAlpha, blocking), a_lhs.rows(), a_rhs.cols(), a_lhs.cols(), Dest::Flags&RowMajorBit); } }; } } # 496 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/SolveTriangular.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/SolveTriangular.h" namespace Eigen { namespace internal { template<typename LhsScalar, typename RhsScalar, typename Index, int Side, int Mode, bool Conjugate, int StorageOrder> struct triangular_solve_vector; template <typename Scalar, typename Index, int Side, int Mode, bool Conjugate, int TriStorageOrder, int OtherStorageOrder> struct triangular_solve_matrix; template<typename Lhs, typename Rhs, int Side> class trsolve_traits { private: enum { RhsIsVectorAtCompileTime = (Side==OnTheLeft ? Rhs::ColsAtCompileTime : Rhs::RowsAtCompileTime)==1 }; public: enum { Unrolling = (RhsIsVectorAtCompileTime && Rhs::SizeAtCompileTime != Dynamic && Rhs::SizeAtCompileTime <= 8) ? CompleteUnrolling : NoUnrolling, RhsVectors = RhsIsVectorAtCompileTime ? 1 : Dynamic }; }; template<typename Lhs, typename Rhs, int Side, int Mode, int Unrolling = trsolve_traits<Lhs,Rhs,Side>::Unrolling, int RhsVectors = trsolve_traits<Lhs,Rhs,Side>::RhsVectors > struct triangular_solver_selector; template<typename Lhs, typename Rhs, int Side, int Mode> struct triangular_solver_selector<Lhs,Rhs,Side,Mode,NoUnrolling,1> { typedef typename Lhs::Scalar LhsScalar; typedef typename Rhs::Scalar RhsScalar; typedef blas_traits<Lhs> LhsProductTraits; typedef typename LhsProductTraits::ExtractType ActualLhsType; typedef Map<Matrix<RhsScalar,Dynamic,1>, Aligned> MappedRhs; static void run(const Lhs& lhs, Rhs& rhs) { ActualLhsType actualLhs = LhsProductTraits::extract(lhs); bool useRhsDirectly = Rhs::InnerStrideAtCompileTime==1 || rhs.innerStride()==1; Eigen::internal::check_size_for_overflow<RhsScalar>(rhs.size()); RhsScalar* actualRhs = ((useRhsDirectly ? rhs.data() : 0))!=0 ? ((useRhsDirectly ? rhs.data() : 0)) : reinterpret_cast<RhsScalar*>( (sizeof(RhsScalar)*rhs.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(RhsScalar)*rhs.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(RhsScalar)*rhs.size()) ); Eigen::internal::aligned_stack_memory_handler<RhsScalar> actualRhs_stack_memory_destructor # 65 "eigen-3.3.7/Eigen/src/Core/SolveTriangular.h" (((useRhsDirectly ? rhs.data() : 0))==0 ? actualRhs : 0,rhs.size(),sizeof(RhsScalar)*rhs.size()>131072) ; if(!useRhsDirectly) MappedRhs(actualRhs,rhs.size()) = rhs; triangular_solve_vector<LhsScalar, RhsScalar, Index, Side, Mode, LhsProductTraits::NeedToConjugate, (int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor> ::run(actualLhs.cols(), actualLhs.data(), actualLhs.outerStride(), actualRhs); if(!useRhsDirectly) rhs = MappedRhs(actualRhs, rhs.size()); } }; template<typename Lhs, typename Rhs, int Side, int Mode> struct triangular_solver_selector<Lhs,Rhs,Side,Mode,NoUnrolling,Dynamic> { typedef typename Rhs::Scalar Scalar; typedef blas_traits<Lhs> LhsProductTraits; typedef typename LhsProductTraits::DirectLinearAccessType ActualLhsType; static void run(const Lhs& lhs, Rhs& rhs) { typename internal::add_const_on_value_type<ActualLhsType>::type actualLhs = LhsProductTraits::extract(lhs); const Index size = lhs.rows(); const Index othersize = Side==OnTheLeft? rhs.cols() : rhs.rows(); typedef internal::gemm_blocking_space<(Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar, Rhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxRowsAtCompileTime,4> BlockingType; BlockingType blocking(rhs.rows(), rhs.cols(), size, 1, false); triangular_solve_matrix<Scalar,Index,Side,Mode,LhsProductTraits::NeedToConjugate,(int(Lhs::Flags) & RowMajorBit) ? RowMajor : ColMajor, (Rhs::Flags&RowMajorBit) ? RowMajor : ColMajor> ::run(size, othersize, &actualLhs.coeffRef(0,0), actualLhs.outerStride(), &rhs.coeffRef(0,0), rhs.outerStride(), blocking); } }; template<typename Lhs, typename Rhs, int Mode, int LoopIndex, int Size, bool Stop = LoopIndex==Size> struct triangular_solver_unroller; template<typename Lhs, typename Rhs, int Mode, int LoopIndex, int Size> struct triangular_solver_unroller<Lhs,Rhs,Mode,LoopIndex,Size,false> { enum { IsLower = ((Mode&Lower)==Lower), DiagIndex = IsLower ? LoopIndex : Size - LoopIndex - 1, StartIndex = IsLower ? 0 : DiagIndex+1 }; static void run(const Lhs& lhs, Rhs& rhs) { if (LoopIndex>0) rhs.coeffRef(DiagIndex) -= lhs.row(DiagIndex).template segment<LoopIndex>(StartIndex).transpose() .cwiseProduct(rhs.template segment<LoopIndex>(StartIndex)).sum(); if(!(Mode & UnitDiag)) rhs.coeffRef(DiagIndex) /= lhs.coeff(DiagIndex,DiagIndex); triangular_solver_unroller<Lhs,Rhs,Mode,LoopIndex+1,Size>::run(lhs,rhs); } }; template<typename Lhs, typename Rhs, int Mode, int LoopIndex, int Size> struct triangular_solver_unroller<Lhs,Rhs,Mode,LoopIndex,Size,true> { static void run(const Lhs&, Rhs&) {} }; template<typename Lhs, typename Rhs, int Mode> struct triangular_solver_selector<Lhs,Rhs,OnTheLeft,Mode,CompleteUnrolling,1> { static void run(const Lhs& lhs, Rhs& rhs) { triangular_solver_unroller<Lhs,Rhs,Mode,0,Rhs::SizeAtCompileTime>::run(lhs,rhs); } }; template<typename Lhs, typename Rhs, int Mode> struct triangular_solver_selector<Lhs,Rhs,OnTheRight,Mode,CompleteUnrolling,1> { static void run(const Lhs& lhs, Rhs& rhs) { Transpose<const Lhs> trLhs(lhs); Transpose<Rhs> trRhs(rhs); triangular_solver_unroller<Transpose<const Lhs>,Transpose<Rhs>, ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag), 0,Rhs::SizeAtCompileTime>::run(trLhs,trRhs); } }; } template<typename MatrixType, unsigned int Mode> template<int Side, typename OtherDerived> void TriangularViewImpl<MatrixType,Mode,Dense>::solveInPlace(const MatrixBase<OtherDerived>& _other) const { OtherDerived& other = _other.const_cast_derived(); ((derived().cols() == derived().rows() && ((Side==OnTheLeft && derived().cols() == other.rows()) || (Side==OnTheRight && derived().cols() == other.cols()))) ? static_cast<void> (0) : __assert_fail ("derived().cols() == derived().rows() && ((Side==OnTheLeft && derived().cols() == other.rows()) || (Side==OnTheRight && derived().cols() == other.cols()))", "eigen-3.3.7/Eigen/src/Core/SolveTriangular.h", 170, __PRETTY_FUNCTION__)); (((!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower))) ? static_cast<void> (0) : __assert_fail ("(!(Mode & ZeroDiag)) && bool(Mode & (Upper|Lower))", "eigen-3.3.7/Eigen/src/Core/SolveTriangular.h", 171, __PRETTY_FUNCTION__)); if (derived().cols() == 0) return; enum { copy = (internal::traits<OtherDerived>::Flags & RowMajorBit) && OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime!=1}; typedef typename internal::conditional<copy, typename internal::plain_matrix_type_column_major<OtherDerived>::type, OtherDerived&>::type OtherCopy; OtherCopy otherCopy(other); internal::triangular_solver_selector<MatrixType, typename internal::remove_reference<OtherCopy>::type, Side, Mode>::run(derived().nestedExpression(), otherCopy); if (copy) other = otherCopy; } template<typename Derived, unsigned int Mode> template<int Side, typename Other> const internal::triangular_solve_retval<Side,TriangularView<Derived,Mode>,Other> TriangularViewImpl<Derived,Mode,Dense>::solve(const MatrixBase<Other>& other) const { return internal::triangular_solve_retval<Side,TriangularViewType,Other>(derived(), other.derived()); } namespace internal { template<int Side, typename TriangularType, typename Rhs> struct traits<triangular_solve_retval<Side, TriangularType, Rhs> > { typedef typename internal::plain_matrix_type_column_major<Rhs>::type ReturnType; }; template<int Side, typename TriangularType, typename Rhs> struct triangular_solve_retval : public ReturnByValue<triangular_solve_retval<Side, TriangularType, Rhs> > { typedef typename remove_all<typename Rhs::Nested>::type RhsNestedCleaned; typedef ReturnByValue<triangular_solve_retval> Base; triangular_solve_retval(const TriangularType& tri, const Rhs& rhs) : m_triangularMatrix(tri), m_rhs(rhs) {} inline Index rows() const { return m_rhs.rows(); } inline Index cols() const { return m_rhs.cols(); } template<typename Dest> inline void evalTo(Dest& dst) const { if(!is_same_dense(dst,m_rhs)) dst = m_rhs; m_triangularMatrix.template solveInPlace<Side>(dst); } protected: const TriangularType& m_triangularMatrix; typename Rhs::Nested m_rhs; }; } } # 497 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h" namespace Eigen { template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjLhs, bool ConjRhs> struct selfadjoint_rank1_update; namespace internal { # 28 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h" template<typename LhsScalar, typename RhsScalar, typename Index, int mr, int nr, bool ConjLhs, bool ConjRhs, int UpLo> struct tribb_kernel; template <typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int ResStorageOrder, int UpLo, int Version = Specialized> struct general_matrix_matrix_triangular_product; template <typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int UpLo, int Version> struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,RowMajor,UpLo,Version> { typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; static inline void run(Index size, Index depth,const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, const ResScalar& alpha, level3_blocking<RhsScalar,LhsScalar>& blocking) { general_matrix_matrix_triangular_product<Index, RhsScalar, RhsStorageOrder==RowMajor ? ColMajor : RowMajor, ConjugateRhs, LhsScalar, LhsStorageOrder==RowMajor ? ColMajor : RowMajor, ConjugateLhs, ColMajor, UpLo==Lower?Upper:Lower> ::run(size,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking); } }; template <typename Index, typename LhsScalar, int LhsStorageOrder, bool ConjugateLhs, typename RhsScalar, int RhsStorageOrder, bool ConjugateRhs, int UpLo, int Version> struct general_matrix_matrix_triangular_product<Index,LhsScalar,LhsStorageOrder,ConjugateLhs,RhsScalar,RhsStorageOrder,ConjugateRhs,ColMajor,UpLo,Version> { typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; static inline void run(Index size, Index depth,const LhsScalar* _lhs, Index lhsStride, const RhsScalar* _rhs, Index rhsStride, ResScalar* _res, Index resStride, const ResScalar& alpha, level3_blocking<LhsScalar,RhsScalar>& blocking) { typedef gebp_traits<LhsScalar,RhsScalar> Traits; typedef const_blas_data_mapper<LhsScalar, Index, LhsStorageOrder> LhsMapper; typedef const_blas_data_mapper<RhsScalar, Index, RhsStorageOrder> RhsMapper; typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper; LhsMapper lhs(_lhs,lhsStride); RhsMapper rhs(_rhs,rhsStride); ResMapper res(_res, resStride); Index kc = blocking.kc(); Index mc = (std::min)(size,blocking.mc()); if(mc > Traits::nr) mc = (mc/Traits::nr)*Traits::nr; std::size_t sizeA = kc*mc; std::size_t sizeB = kc*size; Eigen::internal::check_size_for_overflow<LhsScalar>(sizeA); LhsScalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<LhsScalar*>( (sizeof(LhsScalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(LhsScalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(LhsScalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<LhsScalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(LhsScalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<RhsScalar>(sizeB); RhsScalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<RhsScalar*>( (sizeof(RhsScalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(RhsScalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(RhsScalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<RhsScalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(RhsScalar)*sizeB>131072); gemm_pack_lhs<LhsScalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; gemm_pack_rhs<RhsScalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs; gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp; tribb_kernel<LhsScalar, RhsScalar, Index, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs, UpLo> sybb; for(Index k2=0; k2<depth; k2+=kc) { const Index actual_kc = (std::min)(k2+kc,depth)-k2; pack_rhs(blockB, rhs.getSubMapper(k2,0), actual_kc, size); for(Index i2=0; i2<size; i2+=mc) { const Index actual_mc = (std::min)(i2+mc,size)-i2; pack_lhs(blockA, lhs.getSubMapper(i2, k2), actual_kc, actual_mc); if (UpLo==Lower) gebp(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, (std::min)(size,i2), alpha, -1, -1, 0, 0); sybb(_res+resStride*i2 + i2, resStride, blockA, blockB + actual_kc*i2, actual_mc, actual_kc, alpha); if (UpLo==Upper) { Index j2 = i2+actual_mc; gebp(res.getSubMapper(i2, j2), blockA, blockB+actual_kc*j2, actual_mc, actual_kc, (std::max)(Index(0), size-j2), alpha, -1, -1, 0, 0); } } } } }; # 136 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h" template<typename LhsScalar, typename RhsScalar, typename Index, int mr, int nr, bool ConjLhs, bool ConjRhs, int UpLo> struct tribb_kernel { typedef gebp_traits<LhsScalar,RhsScalar,ConjLhs,ConjRhs> Traits; typedef typename Traits::ResScalar ResScalar; enum { BlockSize = meta_least_common_multiple<(((int)mr >= (int)nr) ? (int)mr : (int)nr),(((int)mr <= (int)nr) ? (int)mr : (int)nr)>::ret }; void operator()(ResScalar* _res, Index resStride, const LhsScalar* blockA, const RhsScalar* blockB, Index size, Index depth, const ResScalar& alpha) { typedef blas_data_mapper<ResScalar, Index, ColMajor> ResMapper; ResMapper res(_res, resStride); gebp_kernel<LhsScalar, RhsScalar, Index, ResMapper, mr, nr, ConjLhs, ConjRhs> gebp_kernel; Matrix<ResScalar,BlockSize,BlockSize,ColMajor> buffer((internal::constructor_without_unaligned_array_assert())); for (Index j=0; j<size; j+=BlockSize) { Index actualBlockSize = std::min<Index>(BlockSize,size - j); const RhsScalar* actual_b = blockB+j*depth; if(UpLo==Upper) gebp_kernel(res.getSubMapper(0, j), blockA, actual_b, j, depth, actualBlockSize, alpha, -1, -1, 0, 0); { Index i = j; buffer.setZero(); gebp_kernel(ResMapper(buffer.data(), BlockSize), blockA+depth*i, actual_b, actualBlockSize, depth, actualBlockSize, alpha, -1, -1, 0, 0); for(Index j1=0; j1<actualBlockSize; ++j1) { ResScalar* r = &res(i, j + j1); for(Index i1=UpLo==Lower ? j1 : 0; UpLo==Lower ? i1<actualBlockSize : i1<=j1; ++i1) r[i1] += buffer(i1,j1); } } if(UpLo==Lower) { Index i = j+actualBlockSize; gebp_kernel(res.getSubMapper(i, j), blockA+depth*i, actual_b, size-i, depth, actualBlockSize, alpha, -1, -1, 0, 0); } } } }; } template<typename MatrixType, typename ProductType, int UpLo, bool IsOuterProduct> struct general_product_to_triangular_selector; template<typename MatrixType, typename ProductType, int UpLo> struct general_product_to_triangular_selector<MatrixType,ProductType,UpLo,true> { static void run(MatrixType& mat, const ProductType& prod, const typename MatrixType::Scalar& alpha, bool beta) { typedef typename MatrixType::Scalar Scalar; typedef typename internal::remove_all<typename ProductType::LhsNested>::type Lhs; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhs; typedef typename internal::remove_all<ActualLhs>::type _ActualLhs; typename internal::add_const_on_value_type<ActualLhs>::type actualLhs = LhsBlasTraits::extract(prod.lhs()); typedef typename internal::remove_all<typename ProductType::RhsNested>::type Rhs; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhs; typedef typename internal::remove_all<ActualRhs>::type _ActualRhs; typename internal::add_const_on_value_type<ActualRhs>::type actualRhs = RhsBlasTraits::extract(prod.rhs()); Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(prod.lhs().derived()) * RhsBlasTraits::extractScalarFactor(prod.rhs().derived()); if(!beta) mat.template triangularView<UpLo>().setZero(); enum { StorageOrder = (internal::traits<MatrixType>::Flags&RowMajorBit) ? RowMajor : ColMajor, UseLhsDirectly = _ActualLhs::InnerStrideAtCompileTime==1, UseRhsDirectly = _ActualRhs::InnerStrideAtCompileTime==1 }; internal::gemv_static_vector_if<Scalar,Lhs::SizeAtCompileTime,Lhs::MaxSizeAtCompileTime,!UseLhsDirectly> static_lhs; Eigen::internal::check_size_for_overflow<Scalar>(actualLhs.size()); Scalar* actualLhsPtr = ((UseLhsDirectly ? const_cast<Scalar*>(actualLhs.data()) : static_lhs.data()))!=0 ? ((UseLhsDirectly ? const_cast<Scalar*>(actualLhs.data()) : static_lhs.data())) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*actualLhs.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*actualLhs.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*actualLhs.size()) ); Eigen::internal::aligned_stack_memory_handler<Scalar> actualLhsPtr_stack_memory_destructor # 230 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h" (((UseLhsDirectly ? const_cast<Scalar*>(actualLhs.data()) : static_lhs.data()))==0 ? actualLhsPtr : 0,actualLhs.size(),sizeof(Scalar)*actualLhs.size()>131072) ; if(!UseLhsDirectly) Map<typename _ActualLhs::PlainObject>(actualLhsPtr, actualLhs.size()) = actualLhs; internal::gemv_static_vector_if<Scalar,Rhs::SizeAtCompileTime,Rhs::MaxSizeAtCompileTime,!UseRhsDirectly> static_rhs; Eigen::internal::check_size_for_overflow<Scalar>(actualRhs.size()); Scalar* actualRhsPtr = ((UseRhsDirectly ? const_cast<Scalar*>(actualRhs.data()) : static_rhs.data()))!=0 ? ((UseRhsDirectly ? const_cast<Scalar*>(actualRhs.data()) : static_rhs.data())) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*actualRhs.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*actualRhs.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*actualRhs.size()) ); Eigen::internal::aligned_stack_memory_handler<Scalar> actualRhsPtr_stack_memory_destructor # 235 "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h" (((UseRhsDirectly ? const_cast<Scalar*>(actualRhs.data()) : static_rhs.data()))==0 ? actualRhsPtr : 0,actualRhs.size(),sizeof(Scalar)*actualRhs.size()>131072) ; if(!UseRhsDirectly) Map<typename _ActualRhs::PlainObject>(actualRhsPtr, actualRhs.size()) = actualRhs; selfadjoint_rank1_update<Scalar,Index,StorageOrder,UpLo, LhsBlasTraits::NeedToConjugate && NumTraits<Scalar>::IsComplex, RhsBlasTraits::NeedToConjugate && NumTraits<Scalar>::IsComplex> ::run(actualLhs.size(), mat.data(), mat.outerStride(), actualLhsPtr, actualRhsPtr, actualAlpha); } }; template<typename MatrixType, typename ProductType, int UpLo> struct general_product_to_triangular_selector<MatrixType,ProductType,UpLo,false> { static void run(MatrixType& mat, const ProductType& prod, const typename MatrixType::Scalar& alpha, bool beta) { typedef typename internal::remove_all<typename ProductType::LhsNested>::type Lhs; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhs; typedef typename internal::remove_all<ActualLhs>::type _ActualLhs; typename internal::add_const_on_value_type<ActualLhs>::type actualLhs = LhsBlasTraits::extract(prod.lhs()); typedef typename internal::remove_all<typename ProductType::RhsNested>::type Rhs; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhs; typedef typename internal::remove_all<ActualRhs>::type _ActualRhs; typename internal::add_const_on_value_type<ActualRhs>::type actualRhs = RhsBlasTraits::extract(prod.rhs()); typename ProductType::Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(prod.lhs().derived()) * RhsBlasTraits::extractScalarFactor(prod.rhs().derived()); if(!beta) mat.template triangularView<UpLo>().setZero(); enum { IsRowMajor = (internal::traits<MatrixType>::Flags&RowMajorBit) ? 1 : 0, LhsIsRowMajor = _ActualLhs::Flags&RowMajorBit ? 1 : 0, RhsIsRowMajor = _ActualRhs::Flags&RowMajorBit ? 1 : 0, SkipDiag = (UpLo&(UnitDiag|ZeroDiag))!=0 }; Index size = mat.cols(); if(SkipDiag) size--; Index depth = actualLhs.cols(); typedef internal::gemm_blocking_space<IsRowMajor ? RowMajor : ColMajor,typename Lhs::Scalar,typename Rhs::Scalar, MatrixType::MaxColsAtCompileTime, MatrixType::MaxColsAtCompileTime, _ActualRhs::MaxColsAtCompileTime> BlockingType; BlockingType blocking(size, size, depth, 1, false); internal::general_matrix_matrix_triangular_product<Index, typename Lhs::Scalar, LhsIsRowMajor ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate, typename Rhs::Scalar, RhsIsRowMajor ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate, IsRowMajor ? RowMajor : ColMajor, UpLo&(Lower|Upper)> ::run(size, depth, &actualLhs.coeffRef(SkipDiag&&(UpLo&Lower)==Lower ? 1 : 0,0), actualLhs.outerStride(), &actualRhs.coeffRef(0,SkipDiag&&(UpLo&Upper)==Upper ? 1 : 0), actualRhs.outerStride(), mat.data() + (SkipDiag ? (bool(IsRowMajor) != ((UpLo&Lower)==Lower) ? 1 : mat.outerStride() ) : 0), mat.outerStride(), actualAlpha, blocking); } }; template<typename MatrixType, unsigned int UpLo> template<typename ProductType> TriangularView<MatrixType,UpLo>& TriangularViewImpl<MatrixType,UpLo,Dense>::_assignProduct(const ProductType& prod, const Scalar& alpha, bool beta) { if (Eigen::internal::static_assertion<static_cast<bool>((UpLo&UnitDiag)==0)>::WRITING_TO_TRIANGULAR_PART_WITH_UNIT_DIAGONAL_IS_NOT_SUPPORTED) {}; ((derived().nestedExpression().rows() == prod.rows() && derived().cols() == prod.cols()) ? static_cast<void> (0) : __assert_fail ("derived().nestedExpression().rows() == prod.rows() && derived().cols() == prod.cols()", "eigen-3.3.7/Eigen/src/Core/products/GeneralMatrixMatrixTriangular.h", 302, __PRETTY_FUNCTION__)); general_product_to_triangular_selector<MatrixType, ProductType, UpLo, internal::traits<ProductType>::InnerSize==1>::run(derived().nestedExpression().const_cast_derived(), prod, alpha, beta); return derived(); } } # 498 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixVector.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixVector.h" namespace Eigen { namespace internal { template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version=Specialized> struct selfadjoint_matrix_vector_product; template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version> struct selfadjoint_matrix_vector_product { static __attribute__((noinline)) void run( Index size, const Scalar* lhs, Index lhsStride, const Scalar* rhs, Scalar* res, Scalar alpha); }; template<typename Scalar, typename Index, int StorageOrder, int UpLo, bool ConjugateLhs, bool ConjugateRhs, int Version> __attribute__((noinline)) void selfadjoint_matrix_vector_product<Scalar,Index,StorageOrder,UpLo,ConjugateLhs,ConjugateRhs,Version>::run( Index size, const Scalar* lhs, Index lhsStride, const Scalar* rhs, Scalar* res, Scalar alpha) { typedef typename packet_traits<Scalar>::type Packet; typedef typename NumTraits<Scalar>::Real RealScalar; const Index PacketSize = sizeof(Packet)/sizeof(Scalar); enum { IsRowMajor = StorageOrder==RowMajor ? 1 : 0, IsLower = UpLo == Lower ? 1 : 0, FirstTriangular = IsRowMajor == IsLower }; conj_helper<Scalar,Scalar,NumTraits<Scalar>::IsComplex && (((ConjugateLhs) || (IsRowMajor)) && !((ConjugateLhs) && (IsRowMajor))), ConjugateRhs> cj0; conj_helper<Scalar,Scalar,NumTraits<Scalar>::IsComplex && (((ConjugateLhs) || (!IsRowMajor)) && !((ConjugateLhs) && (!IsRowMajor))), ConjugateRhs> cj1; conj_helper<RealScalar,Scalar,false, ConjugateRhs> cjd; conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && (((ConjugateLhs) || (IsRowMajor)) && !((ConjugateLhs) && (IsRowMajor))), ConjugateRhs> pcj0; conj_helper<Packet,Packet,NumTraits<Scalar>::IsComplex && (((ConjugateLhs) || (!IsRowMajor)) && !((ConjugateLhs) && (!IsRowMajor))), ConjugateRhs> pcj1; Scalar cjAlpha = ConjugateRhs ? numext::conj(alpha) : alpha; Index bound = (std::max)(Index(0),size-8) & 0xfffffffe; if (FirstTriangular) bound = size - bound; for (Index j=FirstTriangular ? bound : 0; j<(FirstTriangular ? size : bound);j+=2) { const Scalar* __restrict A0 = lhs + j*lhsStride; const Scalar* __restrict A1 = lhs + (j+1)*lhsStride; Scalar t0 = cjAlpha * rhs[j]; Packet ptmp0 = pset1<Packet>(t0); Scalar t1 = cjAlpha * rhs[j+1]; Packet ptmp1 = pset1<Packet>(t1); Scalar t2(0); Packet ptmp2 = pset1<Packet>(t2); Scalar t3(0); Packet ptmp3 = pset1<Packet>(t3); Index starti = FirstTriangular ? 0 : j+2; Index endi = FirstTriangular ? j : size; Index alignedStart = (starti) + internal::first_default_aligned(&res[starti], endi-starti); Index alignedEnd = alignedStart + ((endi-alignedStart)/(PacketSize))*(PacketSize); res[j] += cjd.pmul(numext::real(A0[j]), t0); res[j+1] += cjd.pmul(numext::real(A1[j+1]), t1); if(FirstTriangular) { res[j] += cj0.pmul(A1[j], t1); t3 += cj1.pmul(A1[j], rhs[j]); } else { res[j+1] += cj0.pmul(A0[j+1],t0); t2 += cj1.pmul(A0[j+1], rhs[j+1]); } for (Index i=starti; i<alignedStart; ++i) { res[i] += cj0.pmul(A0[i], t0) + cj0.pmul(A1[i],t1); t2 += cj1.pmul(A0[i], rhs[i]); t3 += cj1.pmul(A1[i], rhs[i]); } const Scalar* __restrict a0It = A0 + alignedStart; const Scalar* __restrict a1It = A1 + alignedStart; const Scalar* __restrict rhsIt = rhs + alignedStart; Scalar* __restrict resIt = res + alignedStart; for (Index i=alignedStart; i<alignedEnd; i+=PacketSize) { Packet A0i = ploadu<Packet>(a0It); a0It += PacketSize; Packet A1i = ploadu<Packet>(a1It); a1It += PacketSize; Packet Bi = ploadu<Packet>(rhsIt); rhsIt += PacketSize; Packet Xi = pload <Packet>(resIt); Xi = pcj0.pmadd(A0i,ptmp0, pcj0.pmadd(A1i,ptmp1,Xi)); ptmp2 = pcj1.pmadd(A0i, Bi, ptmp2); ptmp3 = pcj1.pmadd(A1i, Bi, ptmp3); pstore(resIt,Xi); resIt += PacketSize; } for (Index i=alignedEnd; i<endi; i++) { res[i] += cj0.pmul(A0[i], t0) + cj0.pmul(A1[i],t1); t2 += cj1.pmul(A0[i], rhs[i]); t3 += cj1.pmul(A1[i], rhs[i]); } res[j] += alpha * (t2 + predux(ptmp2)); res[j+1] += alpha * (t3 + predux(ptmp3)); } for (Index j=FirstTriangular ? 0 : bound;j<(FirstTriangular ? bound : size);j++) { const Scalar* __restrict A0 = lhs + j*lhsStride; Scalar t1 = cjAlpha * rhs[j]; Scalar t2(0); res[j] += cjd.pmul(numext::real(A0[j]), t1); for (Index i=FirstTriangular ? 0 : j+1; i<(FirstTriangular ? j : size); i++) { res[i] += cj0.pmul(A0[i], t1); t2 += cj1.pmul(A0[i], rhs[i]); } res[j] += alpha * t2; } } } namespace internal { template<typename Lhs, int LhsMode, typename Rhs> struct selfadjoint_product_impl<Lhs,LhsMode,false,Rhs,0,true> { typedef typename Product<Lhs,Rhs>::Scalar Scalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef typename internal::remove_all<ActualLhsType>::type ActualLhsTypeCleaned; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; typedef typename internal::remove_all<ActualRhsType>::type ActualRhsTypeCleaned; enum { LhsUpLo = LhsMode&(Upper|Lower) }; template<typename Dest> static void run(Dest& dest, const Lhs &a_lhs, const Rhs &a_rhs, const Scalar& alpha) { typedef typename Dest::Scalar ResScalar; typedef typename Rhs::Scalar RhsScalar; typedef Map<Matrix<ResScalar,Dynamic,1>, (((int)AlignedMax <= (int)internal::packet_traits<ResScalar>::size) ? (int)AlignedMax : (int)internal::packet_traits<ResScalar>::size)> MappedDest; ((dest.rows()==a_lhs.rows() && dest.cols()==a_rhs.cols()) ? static_cast<void> (0) : __assert_fail ("dest.rows()==a_lhs.rows() && dest.cols()==a_rhs.cols()", "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixVector.h", 184, __PRETTY_FUNCTION__)); typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(a_lhs); typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(a_rhs); Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) * RhsBlasTraits::extractScalarFactor(a_rhs); enum { EvalToDest = (Dest::InnerStrideAtCompileTime==1), UseRhs = (ActualRhsTypeCleaned::InnerStrideAtCompileTime==1) }; internal::gemv_static_vector_if<ResScalar,Dest::SizeAtCompileTime,Dest::MaxSizeAtCompileTime,!EvalToDest> static_dest; internal::gemv_static_vector_if<RhsScalar,ActualRhsTypeCleaned::SizeAtCompileTime,ActualRhsTypeCleaned::MaxSizeAtCompileTime,!UseRhs> static_rhs; Eigen::internal::check_size_for_overflow<ResScalar>(dest.size()); ResScalar* actualDestPtr = (EvalToDest ? dest.data() : static_dest.data())!=0 ? (EvalToDest ? dest.data() : static_dest.data()) : reinterpret_cast<ResScalar*>( (sizeof(ResScalar)*dest.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(ResScalar)*dest.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(ResScalar)*dest.size()) ); Eigen::internal::aligned_stack_memory_handler<ResScalar> actualDestPtr_stack_memory_destructor # 200 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixVector.h" ((EvalToDest ? dest.data() : static_dest.data())==0 ? actualDestPtr : 0,dest.size(),sizeof(ResScalar)*dest.size()>131072) ; Eigen::internal::check_size_for_overflow<RhsScalar>(rhs.size()); RhsScalar* actualRhsPtr = (UseRhs ? const_cast<RhsScalar*>(rhs.data()) : static_rhs.data())!=0 ? (UseRhs ? const_cast<RhsScalar*>(rhs.data()) : static_rhs.data()) : reinterpret_cast<RhsScalar*>( (sizeof(RhsScalar)*rhs.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(RhsScalar)*rhs.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(RhsScalar)*rhs.size()) ); Eigen::internal::aligned_stack_memory_handler<RhsScalar> actualRhsPtr_stack_memory_destructor # 203 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixVector.h" ((UseRhs ? const_cast<RhsScalar*>(rhs.data()) : static_rhs.data())==0 ? actualRhsPtr : 0,rhs.size(),sizeof(RhsScalar)*rhs.size()>131072) ; if(!EvalToDest) { MappedDest(actualDestPtr, dest.size()) = dest; } if(!UseRhs) { Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, rhs.size()) = rhs; } internal::selfadjoint_matrix_vector_product<Scalar, Index, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, int(LhsUpLo), bool(LhsBlasTraits::NeedToConjugate), bool(RhsBlasTraits::NeedToConjugate)>::run ( lhs.rows(), &lhs.coeffRef(0,0), lhs.outerStride(), actualRhsPtr, actualDestPtr, actualAlpha ); if(!EvalToDest) dest = MappedDest(actualDestPtr, dest.size()); } }; template<typename Lhs, typename Rhs, int RhsMode> struct selfadjoint_product_impl<Lhs,0,true,Rhs,RhsMode,false> { typedef typename Product<Lhs,Rhs>::Scalar Scalar; enum { RhsUpLo = RhsMode&(Upper|Lower) }; template<typename Dest> static void run(Dest& dest, const Lhs &a_lhs, const Rhs &a_rhs, const Scalar& alpha) { Transpose<Dest> destT(dest); selfadjoint_product_impl<Transpose<const Rhs>, int(RhsUpLo)==Upper ? Lower : Upper, false, Transpose<const Lhs>, 0, true>::run(destT, a_rhs.transpose(), a_lhs.transpose(), alpha); } }; } } # 499 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixMatrix.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixMatrix.h" namespace Eigen { namespace internal { template<typename Scalar, typename Index, int Pack1, int Pack2_dummy, int StorageOrder> struct symm_pack_lhs { template<int BlockRows> inline void pack(Scalar* blockA, const const_blas_data_mapper<Scalar,Index,StorageOrder>& lhs, Index cols, Index i, Index& count) { for(Index k=0; k<i; k++) for(Index w=0; w<BlockRows; w++) blockA[count++] = lhs(i+w,k); Index h = 0; for(Index k=i; k<i+BlockRows; k++) { for(Index w=0; w<h; w++) blockA[count++] = numext::conj(lhs(k, i+w)); blockA[count++] = numext::real(lhs(k,k)); for(Index w=h+1; w<BlockRows; w++) blockA[count++] = lhs(i+w, k); ++h; } for(Index k=i+BlockRows; k<cols; k++) for(Index w=0; w<BlockRows; w++) blockA[count++] = numext::conj(lhs(k, i+w)); } void operator()(Scalar* blockA, const Scalar* _lhs, Index lhsStride, Index cols, Index rows) { enum { PacketSize = packet_traits<Scalar>::size }; const_blas_data_mapper<Scalar,Index,StorageOrder> lhs(_lhs,lhsStride); Index count = 0; const Index peeled_mc3 = Pack1>=3*PacketSize ? (rows/(3*PacketSize))*(3*PacketSize) : 0; const Index peeled_mc2 = Pack1>=2*PacketSize ? peeled_mc3+((rows-peeled_mc3)/(2*PacketSize))*(2*PacketSize) : 0; const Index peeled_mc1 = Pack1>=1*PacketSize ? (rows/(1*PacketSize))*(1*PacketSize) : 0; if(Pack1>=3*PacketSize) for(Index i=0; i<peeled_mc3; i+=3*PacketSize) pack<3*PacketSize>(blockA, lhs, cols, i, count); if(Pack1>=2*PacketSize) for(Index i=peeled_mc3; i<peeled_mc2; i+=2*PacketSize) pack<2*PacketSize>(blockA, lhs, cols, i, count); if(Pack1>=1*PacketSize) for(Index i=peeled_mc2; i<peeled_mc1; i+=1*PacketSize) pack<1*PacketSize>(blockA, lhs, cols, i, count); for(Index i=peeled_mc1; i<rows; i++) { for(Index k=0; k<i; k++) blockA[count++] = lhs(i, k); blockA[count++] = numext::real(lhs(i, i)); for(Index k=i+1; k<cols; k++) blockA[count++] = numext::conj(lhs(k, i)); } } }; template<typename Scalar, typename Index, int nr, int StorageOrder> struct symm_pack_rhs { enum { PacketSize = packet_traits<Scalar>::size }; void operator()(Scalar* blockB, const Scalar* _rhs, Index rhsStride, Index rows, Index cols, Index k2) { Index end_k = k2 + rows; Index count = 0; const_blas_data_mapper<Scalar,Index,StorageOrder> rhs(_rhs,rhsStride); Index packet_cols8 = nr>=8 ? (cols/8) * 8 : 0; Index packet_cols4 = nr>=4 ? (cols/4) * 4 : 0; for(Index j2=0; j2<k2; j2+=nr) { for(Index k=k2; k<end_k; k++) { blockB[count+0] = rhs(k,j2+0); blockB[count+1] = rhs(k,j2+1); if (nr>=4) { blockB[count+2] = rhs(k,j2+2); blockB[count+3] = rhs(k,j2+3); } if (nr>=8) { blockB[count+4] = rhs(k,j2+4); blockB[count+5] = rhs(k,j2+5); blockB[count+6] = rhs(k,j2+6); blockB[count+7] = rhs(k,j2+7); } count += nr; } } Index end8 = nr>=8 ? (std::min)(k2+rows,packet_cols8) : k2; if(nr>=8) { for(Index j2=k2; j2<end8; j2+=8) { for(Index k=k2; k<j2; k++) { blockB[count+0] = numext::conj(rhs(j2+0,k)); blockB[count+1] = numext::conj(rhs(j2+1,k)); blockB[count+2] = numext::conj(rhs(j2+2,k)); blockB[count+3] = numext::conj(rhs(j2+3,k)); blockB[count+4] = numext::conj(rhs(j2+4,k)); blockB[count+5] = numext::conj(rhs(j2+5,k)); blockB[count+6] = numext::conj(rhs(j2+6,k)); blockB[count+7] = numext::conj(rhs(j2+7,k)); count += 8; } Index h = 0; for(Index k=j2; k<j2+8; k++) { for (Index w=0 ; w<h; ++w) blockB[count+w] = rhs(k,j2+w); blockB[count+h] = numext::real(rhs(k,k)); for (Index w=h+1 ; w<8; ++w) blockB[count+w] = numext::conj(rhs(j2+w,k)); count += 8; ++h; } for(Index k=j2+8; k<end_k; k++) { blockB[count+0] = rhs(k,j2+0); blockB[count+1] = rhs(k,j2+1); blockB[count+2] = rhs(k,j2+2); blockB[count+3] = rhs(k,j2+3); blockB[count+4] = rhs(k,j2+4); blockB[count+5] = rhs(k,j2+5); blockB[count+6] = rhs(k,j2+6); blockB[count+7] = rhs(k,j2+7); count += 8; } } } if(nr>=4) { for(Index j2=end8; j2<(std::min)(k2+rows,packet_cols4); j2+=4) { for(Index k=k2; k<j2; k++) { blockB[count+0] = numext::conj(rhs(j2+0,k)); blockB[count+1] = numext::conj(rhs(j2+1,k)); blockB[count+2] = numext::conj(rhs(j2+2,k)); blockB[count+3] = numext::conj(rhs(j2+3,k)); count += 4; } Index h = 0; for(Index k=j2; k<j2+4; k++) { for (Index w=0 ; w<h; ++w) blockB[count+w] = rhs(k,j2+w); blockB[count+h] = numext::real(rhs(k,k)); for (Index w=h+1 ; w<4; ++w) blockB[count+w] = numext::conj(rhs(j2+w,k)); count += 4; ++h; } for(Index k=j2+4; k<end_k; k++) { blockB[count+0] = rhs(k,j2+0); blockB[count+1] = rhs(k,j2+1); blockB[count+2] = rhs(k,j2+2); blockB[count+3] = rhs(k,j2+3); count += 4; } } } if(nr>=8) { for(Index j2=k2+rows; j2<packet_cols8; j2+=8) { for(Index k=k2; k<end_k; k++) { blockB[count+0] = numext::conj(rhs(j2+0,k)); blockB[count+1] = numext::conj(rhs(j2+1,k)); blockB[count+2] = numext::conj(rhs(j2+2,k)); blockB[count+3] = numext::conj(rhs(j2+3,k)); blockB[count+4] = numext::conj(rhs(j2+4,k)); blockB[count+5] = numext::conj(rhs(j2+5,k)); blockB[count+6] = numext::conj(rhs(j2+6,k)); blockB[count+7] = numext::conj(rhs(j2+7,k)); count += 8; } } } if(nr>=4) { for(Index j2=(std::max)(packet_cols8,k2+rows); j2<packet_cols4; j2+=4) { for(Index k=k2; k<end_k; k++) { blockB[count+0] = numext::conj(rhs(j2+0,k)); blockB[count+1] = numext::conj(rhs(j2+1,k)); blockB[count+2] = numext::conj(rhs(j2+2,k)); blockB[count+3] = numext::conj(rhs(j2+3,k)); count += 4; } } } for(Index j2=packet_cols4; j2<cols; ++j2) { Index half = (std::min)(end_k,j2); for(Index k=k2; k<half; k++) { blockB[count] = numext::conj(rhs(j2,k)); count += 1; } if(half==j2 && half<k2+rows) { blockB[count] = numext::real(rhs(j2,j2)); count += 1; } else half--; for(Index k=half+1; k<k2+rows; k++) { blockB[count] = rhs(k,j2); count += 1; } } } }; template <typename Scalar, typename Index, int LhsStorageOrder, bool LhsSelfAdjoint, bool ConjugateLhs, int RhsStorageOrder, bool RhsSelfAdjoint, bool ConjugateRhs, int ResStorageOrder> struct product_selfadjoint_matrix; template <typename Scalar, typename Index, int LhsStorageOrder, bool LhsSelfAdjoint, bool ConjugateLhs, int RhsStorageOrder, bool RhsSelfAdjoint, bool ConjugateRhs> struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,LhsSelfAdjoint,ConjugateLhs, RhsStorageOrder,RhsSelfAdjoint,ConjugateRhs,RowMajor> { static inline void run( Index rows, Index cols, const Scalar* lhs, Index lhsStride, const Scalar* rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking) { product_selfadjoint_matrix<Scalar, Index, (((RhsSelfAdjoint) || (RhsStorageOrder==RowMajor)) && !((RhsSelfAdjoint) && (RhsStorageOrder==RowMajor))) ? ColMajor : RowMajor, RhsSelfAdjoint, NumTraits<Scalar>::IsComplex && (((RhsSelfAdjoint) || (ConjugateRhs)) && !((RhsSelfAdjoint) && (ConjugateRhs))), (((LhsSelfAdjoint) || (LhsStorageOrder==RowMajor)) && !((LhsSelfAdjoint) && (LhsStorageOrder==RowMajor))) ? ColMajor : RowMajor, LhsSelfAdjoint, NumTraits<Scalar>::IsComplex && (((LhsSelfAdjoint) || (ConjugateLhs)) && !((LhsSelfAdjoint) && (ConjugateLhs))), ColMajor> ::run(cols, rows, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking); } }; template <typename Scalar, typename Index, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs> struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,true,ConjugateLhs, RhsStorageOrder,false,ConjugateRhs,ColMajor> { static __attribute__((noinline)) void run( Index rows, Index cols, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking); }; template <typename Scalar, typename Index, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs> __attribute__((noinline)) void product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,true,ConjugateLhs, RhsStorageOrder,false,ConjugateRhs,ColMajor>::run( Index rows, Index cols, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* _res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking) { Index size = rows; typedef gebp_traits<Scalar,Scalar> Traits; typedef const_blas_data_mapper<Scalar, Index, LhsStorageOrder> LhsMapper; typedef const_blas_data_mapper<Scalar, Index, (LhsStorageOrder == RowMajor) ? ColMajor : RowMajor> LhsTransposeMapper; typedef const_blas_data_mapper<Scalar, Index, RhsStorageOrder> RhsMapper; typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper; LhsMapper lhs(_lhs,lhsStride); LhsTransposeMapper lhs_transpose(_lhs,lhsStride); RhsMapper rhs(_rhs,rhsStride); ResMapper res(_res, resStride); Index kc = blocking.kc(); Index mc = (std::min)(rows,blocking.mc()); kc = (std::min)(kc,mc); std::size_t sizeA = kc*mc; std::size_t sizeB = kc*cols; Eigen::internal::check_size_for_overflow<Scalar>(sizeA); Scalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(Scalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<Scalar>(sizeB); Scalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(Scalar)*sizeB>131072); gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel; symm_pack_lhs<Scalar, Index, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr,RhsStorageOrder> pack_rhs; gemm_pack_lhs<Scalar, Index, LhsTransposeMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder==RowMajor?ColMajor:RowMajor, true> pack_lhs_transposed; for(Index k2=0; k2<size; k2+=kc) { const Index actual_kc = (std::min)(k2+kc,size)-k2; pack_rhs(blockB, rhs.getSubMapper(k2,0), actual_kc, cols); for(Index i2=0; i2<k2; i2+=mc) { const Index actual_mc = (std::min)(i2+mc,k2)-i2; pack_lhs_transposed(blockA, lhs_transpose.getSubMapper(i2, k2), actual_kc, actual_mc); gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha); } { const Index actual_mc = (std::min)(k2+kc,size)-k2; pack_lhs(blockA, &lhs(k2,k2), lhsStride, actual_kc, actual_mc); gebp_kernel(res.getSubMapper(k2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha); } for(Index i2=k2+kc; i2<size; i2+=mc) { const Index actual_mc = (std::min)(i2+mc,size)-i2; gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder,false>() (blockA, lhs.getSubMapper(i2, k2), actual_kc, actual_mc); gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha); } } } template <typename Scalar, typename Index, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs> struct product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,false,ConjugateLhs, RhsStorageOrder,true,ConjugateRhs,ColMajor> { static __attribute__((noinline)) void run( Index rows, Index cols, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking); }; template <typename Scalar, typename Index, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs> __attribute__((noinline)) void product_selfadjoint_matrix<Scalar,Index,LhsStorageOrder,false,ConjugateLhs, RhsStorageOrder,true,ConjugateRhs,ColMajor>::run( Index rows, Index cols, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* _res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking) { Index size = cols; typedef gebp_traits<Scalar,Scalar> Traits; typedef const_blas_data_mapper<Scalar, Index, LhsStorageOrder> LhsMapper; typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper; LhsMapper lhs(_lhs,lhsStride); ResMapper res(_res,resStride); Index kc = blocking.kc(); Index mc = (std::min)(rows,blocking.mc()); std::size_t sizeA = kc*mc; std::size_t sizeB = kc*cols; Eigen::internal::check_size_for_overflow<Scalar>(sizeA); Scalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(Scalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<Scalar>(sizeB); Scalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(Scalar)*sizeB>131072); gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel; gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; symm_pack_rhs<Scalar, Index, Traits::nr,RhsStorageOrder> pack_rhs; for(Index k2=0; k2<size; k2+=kc) { const Index actual_kc = (std::min)(k2+kc,size)-k2; pack_rhs(blockB, _rhs, rhsStride, actual_kc, cols, k2); for(Index i2=0; i2<rows; i2+=mc) { const Index actual_mc = (std::min)(i2+mc,rows)-i2; pack_lhs(blockA, lhs.getSubMapper(i2, k2), actual_kc, actual_mc); gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha); } } } } namespace internal { template<typename Lhs, int LhsMode, typename Rhs, int RhsMode> struct selfadjoint_product_impl<Lhs,LhsMode,false,Rhs,RhsMode,false> { typedef typename Product<Lhs,Rhs>::Scalar Scalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; enum { LhsIsUpper = (LhsMode&(Upper|Lower))==Upper, LhsIsSelfAdjoint = (LhsMode&SelfAdjoint)==SelfAdjoint, RhsIsUpper = (RhsMode&(Upper|Lower))==Upper, RhsIsSelfAdjoint = (RhsMode&SelfAdjoint)==SelfAdjoint }; template<typename Dest> static void run(Dest &dst, const Lhs &a_lhs, const Rhs &a_rhs, const Scalar& alpha) { ((dst.rows()==a_lhs.rows() && dst.cols()==a_rhs.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows()==a_lhs.rows() && dst.cols()==a_rhs.cols()", "eigen-3.3.7/Eigen/src/Core/products/SelfadjointMatrixMatrix.h", 488, __PRETTY_FUNCTION__)); typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(a_lhs); typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(a_rhs); Scalar actualAlpha = alpha * LhsBlasTraits::extractScalarFactor(a_lhs) * RhsBlasTraits::extractScalarFactor(a_rhs); typedef internal::gemm_blocking_space<(Dest::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar, Lhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxColsAtCompileTime,1> BlockingType; BlockingType blocking(lhs.rows(), rhs.cols(), lhs.cols(), 1, false); internal::product_selfadjoint_matrix<Scalar, Index, (((LhsIsUpper) || (internal::traits<Lhs>::Flags &RowMajorBit)) && !((LhsIsUpper) && (internal::traits<Lhs>::Flags &RowMajorBit))) ? RowMajor : ColMajor, LhsIsSelfAdjoint, NumTraits<Scalar>::IsComplex && (((LhsIsUpper) || (bool(LhsBlasTraits::NeedToConjugate))) && !((LhsIsUpper) && (bool(LhsBlasTraits::NeedToConjugate)))), (((RhsIsUpper) || (internal::traits<Rhs>::Flags &RowMajorBit)) && !((RhsIsUpper) && (internal::traits<Rhs>::Flags &RowMajorBit))) ? RowMajor : ColMajor, RhsIsSelfAdjoint, NumTraits<Scalar>::IsComplex && (((RhsIsUpper) || (bool(RhsBlasTraits::NeedToConjugate))) && !((RhsIsUpper) && (bool(RhsBlasTraits::NeedToConjugate)))), internal::traits<Dest>::Flags&RowMajorBit ? RowMajor : ColMajor> ::run( lhs.rows(), rhs.cols(), &lhs.coeffRef(0,0), lhs.outerStride(), &rhs.coeffRef(0,0), rhs.outerStride(), &dst.coeffRef(0,0), dst.outerStride(), actualAlpha, blocking ); } }; } } # 500 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointProduct.h" 1 # 19 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointProduct.h" namespace Eigen { template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs> struct selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo,ConjLhs,ConjRhs> { static void run(Index size, Scalar* mat, Index stride, const Scalar* vecX, const Scalar* vecY, const Scalar& alpha) { internal::conj_if<ConjRhs> cj; typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap; typedef typename internal::conditional<ConjLhs,typename OtherMap::ConjugateReturnType,const OtherMap&>::type ConjLhsType; for (Index i=0; i<size; ++i) { Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), (UpLo==Lower ? size-i : (i+1))) += (alpha * cj(vecY[i])) * ConjLhsType(OtherMap(vecX+(UpLo==Lower ? i : 0),UpLo==Lower ? size-i : (i+1))); } } }; template<typename Scalar, typename Index, int UpLo, bool ConjLhs, bool ConjRhs> struct selfadjoint_rank1_update<Scalar,Index,RowMajor,UpLo,ConjLhs,ConjRhs> { static void run(Index size, Scalar* mat, Index stride, const Scalar* vecX, const Scalar* vecY, const Scalar& alpha) { selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,stride,vecY,vecX,alpha); } }; template<typename MatrixType, typename OtherType, int UpLo, bool OtherIsVector = OtherType::IsVectorAtCompileTime> struct selfadjoint_product_selector; template<typename MatrixType, typename OtherType, int UpLo> struct selfadjoint_product_selector<MatrixType,OtherType,UpLo,true> { static void run(MatrixType& mat, const OtherType& other, const typename MatrixType::Scalar& alpha) { typedef typename MatrixType::Scalar Scalar; typedef internal::blas_traits<OtherType> OtherBlasTraits; typedef typename OtherBlasTraits::DirectLinearAccessType ActualOtherType; typedef typename internal::remove_all<ActualOtherType>::type _ActualOtherType; typename internal::add_const_on_value_type<ActualOtherType>::type actualOther = OtherBlasTraits::extract(other.derived()); Scalar actualAlpha = alpha * OtherBlasTraits::extractScalarFactor(other.derived()); enum { StorageOrder = (internal::traits<MatrixType>::Flags&RowMajorBit) ? RowMajor : ColMajor, UseOtherDirectly = _ActualOtherType::InnerStrideAtCompileTime==1 }; internal::gemv_static_vector_if<Scalar,OtherType::SizeAtCompileTime,OtherType::MaxSizeAtCompileTime,!UseOtherDirectly> static_other; Eigen::internal::check_size_for_overflow<Scalar>(other.size()); Scalar* actualOtherPtr = ((UseOtherDirectly ? const_cast<Scalar*>(actualOther.data()) : static_other.data()))!=0 ? ((UseOtherDirectly ? const_cast<Scalar*>(actualOther.data()) : static_other.data())) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*other.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*other.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*other.size()) ); Eigen::internal::aligned_stack_memory_handler<Scalar> actualOtherPtr_stack_memory_destructor # 69 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointProduct.h" (((UseOtherDirectly ? const_cast<Scalar*>(actualOther.data()) : static_other.data()))==0 ? actualOtherPtr : 0,other.size(),sizeof(Scalar)*other.size()>131072) ; if(!UseOtherDirectly) Map<typename _ActualOtherType::PlainObject>(actualOtherPtr, actualOther.size()) = actualOther; selfadjoint_rank1_update<Scalar,Index,StorageOrder,UpLo, OtherBlasTraits::NeedToConjugate && NumTraits<Scalar>::IsComplex, (!OtherBlasTraits::NeedToConjugate) && NumTraits<Scalar>::IsComplex> ::run(other.size(), mat.data(), mat.outerStride(), actualOtherPtr, actualOtherPtr, actualAlpha); } }; template<typename MatrixType, typename OtherType, int UpLo> struct selfadjoint_product_selector<MatrixType,OtherType,UpLo,false> { static void run(MatrixType& mat, const OtherType& other, const typename MatrixType::Scalar& alpha) { typedef typename MatrixType::Scalar Scalar; typedef internal::blas_traits<OtherType> OtherBlasTraits; typedef typename OtherBlasTraits::DirectLinearAccessType ActualOtherType; typedef typename internal::remove_all<ActualOtherType>::type _ActualOtherType; typename internal::add_const_on_value_type<ActualOtherType>::type actualOther = OtherBlasTraits::extract(other.derived()); Scalar actualAlpha = alpha * OtherBlasTraits::extractScalarFactor(other.derived()); enum { IsRowMajor = (internal::traits<MatrixType>::Flags&RowMajorBit) ? 1 : 0, OtherIsRowMajor = _ActualOtherType::Flags&RowMajorBit ? 1 : 0 }; Index size = mat.cols(); Index depth = actualOther.cols(); typedef internal::gemm_blocking_space<IsRowMajor ? RowMajor : ColMajor,Scalar,Scalar, MatrixType::MaxColsAtCompileTime, MatrixType::MaxColsAtCompileTime, _ActualOtherType::MaxColsAtCompileTime> BlockingType; BlockingType blocking(size, size, depth, 1, false); internal::general_matrix_matrix_triangular_product<Index, Scalar, OtherIsRowMajor ? RowMajor : ColMajor, OtherBlasTraits::NeedToConjugate && NumTraits<Scalar>::IsComplex, Scalar, OtherIsRowMajor ? ColMajor : RowMajor, (!OtherBlasTraits::NeedToConjugate) && NumTraits<Scalar>::IsComplex, IsRowMajor ? RowMajor : ColMajor, UpLo> ::run(size, depth, &actualOther.coeffRef(0,0), actualOther.outerStride(), &actualOther.coeffRef(0,0), actualOther.outerStride(), mat.data(), mat.outerStride(), actualAlpha, blocking); } }; template<typename MatrixType, unsigned int UpLo> template<typename DerivedU> SelfAdjointView<MatrixType,UpLo>& SelfAdjointView<MatrixType,UpLo> ::rankUpdate(const MatrixBase<DerivedU>& u, const Scalar& alpha) { selfadjoint_product_selector<MatrixType,DerivedU,UpLo>::run(_expression().const_cast_derived(), u.derived(), alpha); return *this; } } # 501 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointRank2Update.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/SelfadjointRank2Update.h" namespace Eigen { namespace internal { template<typename Scalar, typename Index, typename UType, typename VType, int UpLo> struct selfadjoint_rank2_update_selector; template<typename Scalar, typename Index, typename UType, typename VType> struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Lower> { static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha) { const Index size = u.size(); for (Index i=0; i<size; ++i) { Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+i, size-i) += (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.tail(size-i) + (alpha * numext::conj(v.coeff(i))) * u.tail(size-i); } } }; template<typename Scalar, typename Index, typename UType, typename VType> struct selfadjoint_rank2_update_selector<Scalar,Index,UType,VType,Upper> { static void run(Scalar* mat, Index stride, const UType& u, const VType& v, const Scalar& alpha) { const Index size = u.size(); for (Index i=0; i<size; ++i) Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i, i+1) += (numext::conj(alpha) * numext::conj(u.coeff(i))) * v.head(i+1) + (alpha * numext::conj(v.coeff(i))) * u.head(i+1); } }; template<bool Cond, typename T> struct conj_expr_if : conditional<!Cond, const T&, CwiseUnaryOp<scalar_conjugate_op<typename traits<T>::Scalar>,T> > {}; } template<typename MatrixType, unsigned int UpLo> template<typename DerivedU, typename DerivedV> SelfAdjointView<MatrixType,UpLo>& SelfAdjointView<MatrixType,UpLo> ::rankUpdate(const MatrixBase<DerivedU>& u, const MatrixBase<DerivedV>& v, const Scalar& alpha) { typedef internal::blas_traits<DerivedU> UBlasTraits; typedef typename UBlasTraits::DirectLinearAccessType ActualUType; typedef typename internal::remove_all<ActualUType>::type _ActualUType; typename internal::add_const_on_value_type<ActualUType>::type actualU = UBlasTraits::extract(u.derived()); typedef internal::blas_traits<DerivedV> VBlasTraits; typedef typename VBlasTraits::DirectLinearAccessType ActualVType; typedef typename internal::remove_all<ActualVType>::type _ActualVType; typename internal::add_const_on_value_type<ActualVType>::type actualV = VBlasTraits::extract(v.derived()); enum { IsRowMajor = (internal::traits<MatrixType>::Flags&RowMajorBit) ? 1 : 0 }; Scalar actualAlpha = alpha * UBlasTraits::extractScalarFactor(u.derived()) * numext::conj(VBlasTraits::extractScalarFactor(v.derived())); if (IsRowMajor) actualAlpha = numext::conj(actualAlpha); typedef typename internal::remove_all<typename internal::conj_expr_if<IsRowMajor ^ UBlasTraits::NeedToConjugate,_ActualUType>::type>::type UType; typedef typename internal::remove_all<typename internal::conj_expr_if<IsRowMajor ^ VBlasTraits::NeedToConjugate,_ActualVType>::type>::type VType; internal::selfadjoint_rank2_update_selector<Scalar, Index, UType, VType, (IsRowMajor ? int(UpLo==Upper ? Lower : Upper) : UpLo)> ::run(_expression().const_cast_derived().data(),_expression().outerStride(),UType(actualU),VType(actualV),actualAlpha); return *this; } } # 502 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixVector.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixVector.h" namespace Eigen { namespace internal { template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int StorageOrder, int Version=Specialized> struct triangular_matrix_vector_product; template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int Version> struct triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor,Version> { typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; enum { IsLower = ((Mode&Lower)==Lower), HasUnitDiag = (Mode & UnitDiag)==UnitDiag, HasZeroDiag = (Mode & ZeroDiag)==ZeroDiag }; static __attribute__((noinline)) void run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const RhsScalar& alpha); }; template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs, int Version> __attribute__((noinline)) void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,ColMajor,Version> ::run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const RhsScalar& alpha) { static const Index PanelWidth = 8; Index size = (std::min)(_rows,_cols); Index rows = IsLower ? _rows : (std::min)(_rows,_cols); Index cols = IsLower ? (std::min)(_rows,_cols) : _cols; typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap; const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride)); typename conj_expr_if<ConjLhs,LhsMap>::type cjLhs(lhs); typedef Map<const Matrix<RhsScalar,Dynamic,1>, 0, InnerStride<> > RhsMap; const RhsMap rhs(_rhs,cols,InnerStride<>(rhsIncr)); typename conj_expr_if<ConjRhs,RhsMap>::type cjRhs(rhs); typedef Map<Matrix<ResScalar,Dynamic,1> > ResMap; ResMap res(_res,rows); typedef const_blas_data_mapper<LhsScalar,Index,ColMajor> LhsMapper; typedef const_blas_data_mapper<RhsScalar,Index,RowMajor> RhsMapper; for (Index pi=0; pi<size; pi+=PanelWidth) { Index actualPanelWidth = (std::min)(PanelWidth, size-pi); for (Index k=0; k<actualPanelWidth; ++k) { Index i = pi + k; Index s = IsLower ? ((HasUnitDiag||HasZeroDiag) ? i+1 : i ) : pi; Index r = IsLower ? actualPanelWidth-k : k+1; if ((!(HasUnitDiag||HasZeroDiag)) || (--r)>0) res.segment(s,r) += (alpha * cjRhs.coeff(i)) * cjLhs.col(i).segment(s,r); if (HasUnitDiag) res.coeffRef(i) += alpha * cjRhs.coeff(i); } Index r = IsLower ? rows - pi - actualPanelWidth : pi; if (r>0) { Index s = IsLower ? pi+actualPanelWidth : 0; general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs,BuiltIn>::run( r, actualPanelWidth, LhsMapper(&lhs.coeffRef(s,pi), lhsStride), RhsMapper(&rhs.coeffRef(pi), rhsIncr), &res.coeffRef(s), resIncr, alpha); } } if((!IsLower) && cols>size) { general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs>::run( rows, cols-size, LhsMapper(&lhs.coeffRef(0,size), lhsStride), RhsMapper(&rhs.coeffRef(size), rhsIncr), _res, resIncr, alpha); } } template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs,int Version> struct triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version> { typedef typename ScalarBinaryOpTraits<LhsScalar, RhsScalar>::ReturnType ResScalar; enum { IsLower = ((Mode&Lower)==Lower), HasUnitDiag = (Mode & UnitDiag)==UnitDiag, HasZeroDiag = (Mode & ZeroDiag)==ZeroDiag }; static __attribute__((noinline)) void run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const ResScalar& alpha); }; template<typename Index, int Mode, typename LhsScalar, bool ConjLhs, typename RhsScalar, bool ConjRhs,int Version> __attribute__((noinline)) void triangular_matrix_vector_product<Index,Mode,LhsScalar,ConjLhs,RhsScalar,ConjRhs,RowMajor,Version> ::run(Index _rows, Index _cols, const LhsScalar* _lhs, Index lhsStride, const RhsScalar* _rhs, Index rhsIncr, ResScalar* _res, Index resIncr, const ResScalar& alpha) { static const Index PanelWidth = 8; Index diagSize = (std::min)(_rows,_cols); Index rows = IsLower ? _rows : diagSize; Index cols = IsLower ? diagSize : _cols; typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,RowMajor>, 0, OuterStride<> > LhsMap; const LhsMap lhs(_lhs,rows,cols,OuterStride<>(lhsStride)); typename conj_expr_if<ConjLhs,LhsMap>::type cjLhs(lhs); typedef Map<const Matrix<RhsScalar,Dynamic,1> > RhsMap; const RhsMap rhs(_rhs,cols); typename conj_expr_if<ConjRhs,RhsMap>::type cjRhs(rhs); typedef Map<Matrix<ResScalar,Dynamic,1>, 0, InnerStride<> > ResMap; ResMap res(_res,rows,InnerStride<>(resIncr)); typedef const_blas_data_mapper<LhsScalar,Index,RowMajor> LhsMapper; typedef const_blas_data_mapper<RhsScalar,Index,RowMajor> RhsMapper; for (Index pi=0; pi<diagSize; pi+=PanelWidth) { Index actualPanelWidth = (std::min)(PanelWidth, diagSize-pi); for (Index k=0; k<actualPanelWidth; ++k) { Index i = pi + k; Index s = IsLower ? pi : ((HasUnitDiag||HasZeroDiag) ? i+1 : i); Index r = IsLower ? k+1 : actualPanelWidth-k; if ((!(HasUnitDiag||HasZeroDiag)) || (--r)>0) res.coeffRef(i) += alpha * (cjLhs.row(i).segment(s,r).cwiseProduct(cjRhs.segment(s,r).transpose())).sum(); if (HasUnitDiag) res.coeffRef(i) += alpha * cjRhs.coeff(i); } Index r = IsLower ? pi : cols - pi - actualPanelWidth; if (r>0) { Index s = IsLower ? 0 : pi + actualPanelWidth; general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs,BuiltIn>::run( actualPanelWidth, r, LhsMapper(&lhs.coeffRef(pi,s), lhsStride), RhsMapper(&rhs.coeffRef(s), rhsIncr), &res.coeffRef(pi), resIncr, alpha); } } if(IsLower && rows>diagSize) { general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,ConjLhs,RhsScalar,RhsMapper,ConjRhs>::run( rows-diagSize, cols, LhsMapper(&lhs.coeffRef(diagSize,0), lhsStride), RhsMapper(&rhs.coeffRef(0), rhsIncr), &res.coeffRef(diagSize), resIncr, alpha); } } template<int Mode,int StorageOrder> struct trmv_selector; } namespace internal { template<int Mode, typename Lhs, typename Rhs> struct triangular_product_impl<Mode,true,Lhs,false,Rhs,true> { template<typename Dest> static void run(Dest& dst, const Lhs &lhs, const Rhs &rhs, const typename Dest::Scalar& alpha) { ((dst.rows()==lhs.rows() && dst.cols()==rhs.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows()==lhs.rows() && dst.cols()==rhs.cols()", "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixVector.h", 178, __PRETTY_FUNCTION__)); internal::trmv_selector<Mode,(int(internal::traits<Lhs>::Flags)&RowMajorBit) ? RowMajor : ColMajor>::run(lhs, rhs, dst, alpha); } }; template<int Mode, typename Lhs, typename Rhs> struct triangular_product_impl<Mode,false,Lhs,true,Rhs,false> { template<typename Dest> static void run(Dest& dst, const Lhs &lhs, const Rhs &rhs, const typename Dest::Scalar& alpha) { ((dst.rows()==lhs.rows() && dst.cols()==rhs.cols()) ? static_cast<void> (0) : __assert_fail ("dst.rows()==lhs.rows() && dst.cols()==rhs.cols()", "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixVector.h", 189, __PRETTY_FUNCTION__)); Transpose<Dest> dstT(dst); internal::trmv_selector<(Mode & (UnitDiag|ZeroDiag)) | ((Mode & Lower) ? Upper : Lower), (int(internal::traits<Rhs>::Flags)&RowMajorBit) ? ColMajor : RowMajor> ::run(rhs.transpose(),lhs.transpose(), dstT, alpha); } }; } namespace internal { template<int Mode> struct trmv_selector<Mode,ColMajor> { template<typename Lhs, typename Rhs, typename Dest> static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) { typedef typename Lhs::Scalar LhsScalar; typedef typename Rhs::Scalar RhsScalar; typedef typename Dest::Scalar ResScalar; typedef typename Dest::RealScalar RealScalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; typedef Map<Matrix<ResScalar,Dynamic,1>, (((int)AlignedMax <= (int)internal::packet_traits<ResScalar>::size) ? (int)AlignedMax : (int)internal::packet_traits<ResScalar>::size)> MappedDest; typename internal::add_const_on_value_type<ActualLhsType>::type actualLhs = LhsBlasTraits::extract(lhs); typename internal::add_const_on_value_type<ActualRhsType>::type actualRhs = RhsBlasTraits::extract(rhs); LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(lhs); RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(rhs); ResScalar actualAlpha = alpha * lhs_alpha * rhs_alpha; enum { EvalToDestAtCompileTime = Dest::InnerStrideAtCompileTime==1, ComplexByReal = (NumTraits<LhsScalar>::IsComplex) && (!NumTraits<RhsScalar>::IsComplex), MightCannotUseDest = (Dest::InnerStrideAtCompileTime!=1) || ComplexByReal }; gemv_static_vector_if<ResScalar,Dest::SizeAtCompileTime,Dest::MaxSizeAtCompileTime,MightCannotUseDest> static_dest; bool alphaIsCompatible = (!ComplexByReal) || (numext::imag(actualAlpha)==RealScalar(0)); bool evalToDest = EvalToDestAtCompileTime && alphaIsCompatible; RhsScalar compatibleAlpha = get_factor<ResScalar,RhsScalar>::run(actualAlpha); Eigen::internal::check_size_for_overflow<ResScalar>(dest.size()); ResScalar* actualDestPtr = (evalToDest ? dest.data() : static_dest.data())!=0 ? (evalToDest ? dest.data() : static_dest.data()) : reinterpret_cast<ResScalar*>( (sizeof(ResScalar)*dest.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(ResScalar)*dest.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(ResScalar)*dest.size()) ); Eigen::internal::aligned_stack_memory_handler<ResScalar> actualDestPtr_stack_memory_destructor # 243 "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixVector.h" ((evalToDest ? dest.data() : static_dest.data())==0 ? actualDestPtr : 0,dest.size(),sizeof(ResScalar)*dest.size()>131072) ; if(!evalToDest) { if(!alphaIsCompatible) { MappedDest(actualDestPtr, dest.size()).setZero(); compatibleAlpha = RhsScalar(1); } else MappedDest(actualDestPtr, dest.size()) = dest; } internal::triangular_matrix_vector_product <Index,Mode, LhsScalar, LhsBlasTraits::NeedToConjugate, RhsScalar, RhsBlasTraits::NeedToConjugate, ColMajor> ::run(actualLhs.rows(),actualLhs.cols(), actualLhs.data(),actualLhs.outerStride(), actualRhs.data(),actualRhs.innerStride(), actualDestPtr,1,compatibleAlpha); if (!evalToDest) { if(!alphaIsCompatible) dest += actualAlpha * MappedDest(actualDestPtr, dest.size()); else dest = MappedDest(actualDestPtr, dest.size()); } if ( ((Mode&UnitDiag)==UnitDiag) && (lhs_alpha!=LhsScalar(1)) ) { Index diagSize = (std::min)(lhs.rows(),lhs.cols()); dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize); } } }; template<int Mode> struct trmv_selector<Mode,RowMajor> { template<typename Lhs, typename Rhs, typename Dest> static void run(const Lhs &lhs, const Rhs &rhs, Dest& dest, const typename Dest::Scalar& alpha) { typedef typename Lhs::Scalar LhsScalar; typedef typename Rhs::Scalar RhsScalar; typedef typename Dest::Scalar ResScalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; typedef typename internal::remove_all<ActualRhsType>::type ActualRhsTypeCleaned; typename add_const<ActualLhsType>::type actualLhs = LhsBlasTraits::extract(lhs); typename add_const<ActualRhsType>::type actualRhs = RhsBlasTraits::extract(rhs); LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(lhs); RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(rhs); ResScalar actualAlpha = alpha * lhs_alpha * rhs_alpha; enum { DirectlyUseRhs = ActualRhsTypeCleaned::InnerStrideAtCompileTime==1 }; gemv_static_vector_if<RhsScalar,ActualRhsTypeCleaned::SizeAtCompileTime,ActualRhsTypeCleaned::MaxSizeAtCompileTime,!DirectlyUseRhs> static_rhs; Eigen::internal::check_size_for_overflow<RhsScalar>(actualRhs.size()); RhsScalar* actualRhsPtr = (DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data())!=0 ? (DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data()) : reinterpret_cast<RhsScalar*>( (sizeof(RhsScalar)*actualRhs.size()<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(RhsScalar)*actualRhs.size()+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(RhsScalar)*actualRhs.size()) ); Eigen::internal::aligned_stack_memory_handler<RhsScalar> actualRhsPtr_stack_memory_destructor # 315 "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixVector.h" ((DirectlyUseRhs ? const_cast<RhsScalar*>(actualRhs.data()) : static_rhs.data())==0 ? actualRhsPtr : 0,actualRhs.size(),sizeof(RhsScalar)*actualRhs.size()>131072) ; if(!DirectlyUseRhs) { Map<typename ActualRhsTypeCleaned::PlainObject>(actualRhsPtr, actualRhs.size()) = actualRhs; } internal::triangular_matrix_vector_product <Index,Mode, LhsScalar, LhsBlasTraits::NeedToConjugate, RhsScalar, RhsBlasTraits::NeedToConjugate, RowMajor> ::run(actualLhs.rows(),actualLhs.cols(), actualLhs.data(),actualLhs.outerStride(), actualRhsPtr,1, dest.data(),dest.innerStride(), actualAlpha); if ( ((Mode&UnitDiag)==UnitDiag) && (lhs_alpha!=LhsScalar(1)) ) { Index diagSize = (std::min)(lhs.rows(),lhs.cols()); dest.head(diagSize) -= (lhs_alpha-LhsScalar(1))*rhs.head(diagSize); } } }; } } # 503 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixMatrix.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixMatrix.h" namespace Eigen { namespace internal { # 44 "eigen-3.3.7/Eigen/src/Core/products/TriangularMatrixMatrix.h" template <typename Scalar, typename Index, int Mode, bool LhsIsTriangular, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs, int ResStorageOrder, int Version = Specialized> struct product_triangular_matrix_matrix; template <typename Scalar, typename Index, int Mode, bool LhsIsTriangular, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs, int Version> struct product_triangular_matrix_matrix<Scalar,Index,Mode,LhsIsTriangular, LhsStorageOrder,ConjugateLhs, RhsStorageOrder,ConjugateRhs,RowMajor,Version> { static inline void run( Index rows, Index cols, Index depth, const Scalar* lhs, Index lhsStride, const Scalar* rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking) { product_triangular_matrix_matrix<Scalar, Index, (Mode&(UnitDiag|ZeroDiag)) | ((Mode&Upper) ? Lower : Upper), (!LhsIsTriangular), RhsStorageOrder==RowMajor ? ColMajor : RowMajor, ConjugateRhs, LhsStorageOrder==RowMajor ? ColMajor : RowMajor, ConjugateLhs, ColMajor> ::run(cols, rows, depth, rhs, rhsStride, lhs, lhsStride, res, resStride, alpha, blocking); } }; template <typename Scalar, typename Index, int Mode, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs, int Version> struct product_triangular_matrix_matrix<Scalar,Index,Mode,true, LhsStorageOrder,ConjugateLhs, RhsStorageOrder,ConjugateRhs,ColMajor,Version> { typedef gebp_traits<Scalar,Scalar> Traits; enum { SmallPanelWidth = 2 * (((int)Traits::mr >= (int)Traits::nr) ? (int)Traits::mr : (int)Traits::nr), IsLower = (Mode&Lower) == Lower, SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1 }; static __attribute__((noinline)) void run( Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking); }; template <typename Scalar, typename Index, int Mode, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs, int Version> __attribute__((noinline)) void product_triangular_matrix_matrix<Scalar,Index,Mode,true, LhsStorageOrder,ConjugateLhs, RhsStorageOrder,ConjugateRhs,ColMajor,Version>::run( Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* _res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking) { Index diagSize = (std::min)(_rows,_depth); Index rows = IsLower ? _rows : diagSize; Index depth = IsLower ? diagSize : _depth; Index cols = _cols; typedef const_blas_data_mapper<Scalar, Index, LhsStorageOrder> LhsMapper; typedef const_blas_data_mapper<Scalar, Index, RhsStorageOrder> RhsMapper; typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper; LhsMapper lhs(_lhs,lhsStride); RhsMapper rhs(_rhs,rhsStride); ResMapper res(_res, resStride); Index kc = blocking.kc(); Index mc = (std::min)(rows,blocking.mc()); Index panelWidth = (std::min)(Index(SmallPanelWidth),(std::min)(kc,mc)); std::size_t sizeA = kc*mc; std::size_t sizeB = kc*cols; Eigen::internal::check_size_for_overflow<Scalar>(sizeA); Scalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(Scalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<Scalar>(sizeB); Scalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(Scalar)*sizeB>131072); internal::constructor_without_unaligned_array_assert a; Matrix<Scalar,SmallPanelWidth,SmallPanelWidth,LhsStorageOrder> triangularBuffer(a); triangularBuffer.setZero(); if((Mode&ZeroDiag)==ZeroDiag) triangularBuffer.diagonal().setZero(); else triangularBuffer.diagonal().setOnes(); gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel; gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr,RhsStorageOrder> pack_rhs; for(Index k2=IsLower ? depth : 0; IsLower ? k2>0 : k2<depth; IsLower ? k2-=kc : k2+=kc) { Index actual_kc = (std::min)(IsLower ? k2 : depth-k2, kc); Index actual_k2 = IsLower ? k2-actual_kc : k2; if((!IsLower)&&(k2<rows)&&(k2+actual_kc>rows)) { actual_kc = rows-k2; k2 = k2+actual_kc-kc; } pack_rhs(blockB, rhs.getSubMapper(actual_k2,0), actual_kc, cols); if(IsLower || actual_k2<rows) { for (Index k1=0; k1<actual_kc; k1+=panelWidth) { Index actualPanelWidth = std::min<Index>(actual_kc-k1, panelWidth); Index lengthTarget = IsLower ? actual_kc-k1-actualPanelWidth : k1; Index startBlock = actual_k2+k1; Index blockBOffset = k1; for (Index k=0;k<actualPanelWidth;++k) { if (SetDiag) triangularBuffer.coeffRef(k,k) = lhs(startBlock+k,startBlock+k); for (Index i=IsLower ? k+1 : 0; IsLower ? i<actualPanelWidth : i<k; ++i) triangularBuffer.coeffRef(i,k) = lhs(startBlock+i,startBlock+k); } pack_lhs(blockA, LhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth); gebp_kernel(res.getSubMapper(startBlock, 0), blockA, blockB, actualPanelWidth, actualPanelWidth, cols, alpha, actualPanelWidth, actual_kc, 0, blockBOffset); if (lengthTarget>0) { Index startTarget = IsLower ? actual_k2+k1+actualPanelWidth : actual_k2; pack_lhs(blockA, lhs.getSubMapper(startTarget,startBlock), actualPanelWidth, lengthTarget); gebp_kernel(res.getSubMapper(startTarget, 0), blockA, blockB, lengthTarget, actualPanelWidth, cols, alpha, actualPanelWidth, actual_kc, 0, blockBOffset); } } } { Index start = IsLower ? k2 : 0; Index end = IsLower ? rows : (std::min)(actual_k2,rows); for(Index i2=start; i2<end; i2+=mc) { const Index actual_mc = (std::min)(i2+mc,end)-i2; gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr,Traits::LhsProgress, LhsStorageOrder,false>() (blockA, lhs.getSubMapper(i2, actual_k2), actual_kc, actual_mc); gebp_kernel(res.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, alpha, -1, -1, 0, 0); } } } } template <typename Scalar, typename Index, int Mode, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs, int Version> struct product_triangular_matrix_matrix<Scalar,Index,Mode,false, LhsStorageOrder,ConjugateLhs, RhsStorageOrder,ConjugateRhs,ColMajor,Version> { typedef gebp_traits<Scalar,Scalar> Traits; enum { SmallPanelWidth = (((int)Traits::mr >= (int)Traits::nr) ? (int)Traits::mr : (int)Traits::nr), IsLower = (Mode&Lower) == Lower, SetDiag = (Mode&(ZeroDiag|UnitDiag)) ? 0 : 1 }; static __attribute__((noinline)) void run( Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking); }; template <typename Scalar, typename Index, int Mode, int LhsStorageOrder, bool ConjugateLhs, int RhsStorageOrder, bool ConjugateRhs, int Version> __attribute__((noinline)) void product_triangular_matrix_matrix<Scalar,Index,Mode,false, LhsStorageOrder,ConjugateLhs, RhsStorageOrder,ConjugateRhs,ColMajor,Version>::run( Index _rows, Index _cols, Index _depth, const Scalar* _lhs, Index lhsStride, const Scalar* _rhs, Index rhsStride, Scalar* _res, Index resStride, const Scalar& alpha, level3_blocking<Scalar,Scalar>& blocking) { const Index PacketBytes = packet_traits<Scalar>::size*sizeof(Scalar); Index diagSize = (std::min)(_cols,_depth); Index rows = _rows; Index depth = IsLower ? _depth : diagSize; Index cols = IsLower ? diagSize : _cols; typedef const_blas_data_mapper<Scalar, Index, LhsStorageOrder> LhsMapper; typedef const_blas_data_mapper<Scalar, Index, RhsStorageOrder> RhsMapper; typedef blas_data_mapper<typename Traits::ResScalar, Index, ColMajor> ResMapper; LhsMapper lhs(_lhs,lhsStride); RhsMapper rhs(_rhs,rhsStride); ResMapper res(_res, resStride); Index kc = blocking.kc(); Index mc = (std::min)(rows,blocking.mc()); std::size_t sizeA = kc*mc; std::size_t sizeB = kc*cols+16/sizeof(Scalar); Eigen::internal::check_size_for_overflow<Scalar>(sizeA); Scalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(Scalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<Scalar>(sizeB); Scalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(Scalar)*sizeB>131072); internal::constructor_without_unaligned_array_assert a; Matrix<Scalar,SmallPanelWidth,SmallPanelWidth,RhsStorageOrder> triangularBuffer(a); triangularBuffer.setZero(); if((Mode&ZeroDiag)==ZeroDiag) triangularBuffer.diagonal().setZero(); else triangularBuffer.diagonal().setOnes(); gebp_kernel<Scalar, Scalar, Index, ResMapper, Traits::mr, Traits::nr, ConjugateLhs, ConjugateRhs> gebp_kernel; gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, LhsStorageOrder> pack_lhs; gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr,RhsStorageOrder> pack_rhs; gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr,RhsStorageOrder,false,true> pack_rhs_panel; for(Index k2=IsLower ? 0 : depth; IsLower ? k2<depth : k2>0; IsLower ? k2+=kc : k2-=kc) { Index actual_kc = (std::min)(IsLower ? depth-k2 : k2, kc); Index actual_k2 = IsLower ? k2 : k2-actual_kc; if(IsLower && (k2<cols) && (actual_k2+actual_kc>cols)) { actual_kc = cols-k2; k2 = actual_k2 + actual_kc - kc; } Index rs = IsLower ? (std::min)(cols,actual_k2) : cols - k2; Index ts = (IsLower && actual_k2>=cols) ? 0 : actual_kc; Scalar* geb = blockB+ts*ts; geb = geb + internal::first_aligned<PacketBytes>(geb,PacketBytes/sizeof(Scalar)); pack_rhs(geb, rhs.getSubMapper(actual_k2,IsLower ? 0 : k2), actual_kc, rs); if(ts>0) { for (Index j2=0; j2<actual_kc; j2+=SmallPanelWidth) { Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth); Index actual_j2 = actual_k2 + j2; Index panelOffset = IsLower ? j2+actualPanelWidth : 0; Index panelLength = IsLower ? actual_kc-j2-actualPanelWidth : j2; pack_rhs_panel(blockB+j2*actual_kc, rhs.getSubMapper(actual_k2+panelOffset, actual_j2), panelLength, actualPanelWidth, actual_kc, panelOffset); for (Index j=0;j<actualPanelWidth;++j) { if (SetDiag) triangularBuffer.coeffRef(j,j) = rhs(actual_j2+j,actual_j2+j); for (Index k=IsLower ? j+1 : 0; IsLower ? k<actualPanelWidth : k<j; ++k) triangularBuffer.coeffRef(k,j) = rhs(actual_j2+k,actual_j2+j); } pack_rhs_panel(blockB+j2*actual_kc, RhsMapper(triangularBuffer.data(), triangularBuffer.outerStride()), actualPanelWidth, actualPanelWidth, actual_kc, j2); } } for (Index i2=0; i2<rows; i2+=mc) { const Index actual_mc = (std::min)(mc,rows-i2); pack_lhs(blockA, lhs.getSubMapper(i2, actual_k2), actual_kc, actual_mc); if(ts>0) { for (Index j2=0; j2<actual_kc; j2+=SmallPanelWidth) { Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth); Index panelLength = IsLower ? actual_kc-j2 : j2+actualPanelWidth; Index blockOffset = IsLower ? j2 : 0; gebp_kernel(res.getSubMapper(i2, actual_k2 + j2), blockA, blockB+j2*actual_kc, actual_mc, panelLength, actualPanelWidth, alpha, actual_kc, actual_kc, blockOffset, blockOffset); } } gebp_kernel(res.getSubMapper(i2, IsLower ? 0 : k2), blockA, geb, actual_mc, actual_kc, rs, alpha, -1, -1, 0, 0); } } } } namespace internal { template<int Mode, bool LhsIsTriangular, typename Lhs, typename Rhs> struct triangular_product_impl<Mode,LhsIsTriangular,Lhs,false,Rhs,false> { template<typename Dest> static void run(Dest& dst, const Lhs &a_lhs, const Rhs &a_rhs, const typename Dest::Scalar& alpha) { typedef typename Lhs::Scalar LhsScalar; typedef typename Rhs::Scalar RhsScalar; typedef typename Dest::Scalar Scalar; typedef internal::blas_traits<Lhs> LhsBlasTraits; typedef typename LhsBlasTraits::DirectLinearAccessType ActualLhsType; typedef typename internal::remove_all<ActualLhsType>::type ActualLhsTypeCleaned; typedef internal::blas_traits<Rhs> RhsBlasTraits; typedef typename RhsBlasTraits::DirectLinearAccessType ActualRhsType; typedef typename internal::remove_all<ActualRhsType>::type ActualRhsTypeCleaned; typename internal::add_const_on_value_type<ActualLhsType>::type lhs = LhsBlasTraits::extract(a_lhs); typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(a_rhs); LhsScalar lhs_alpha = LhsBlasTraits::extractScalarFactor(a_lhs); RhsScalar rhs_alpha = RhsBlasTraits::extractScalarFactor(a_rhs); Scalar actualAlpha = alpha * lhs_alpha * rhs_alpha; typedef internal::gemm_blocking_space<(Dest::Flags&RowMajorBit) ? RowMajor : ColMajor,Scalar,Scalar, Lhs::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime, Lhs::MaxColsAtCompileTime,4> BlockingType; enum { IsLower = (Mode&Lower) == Lower }; Index stripedRows = ((!LhsIsTriangular) || (IsLower)) ? lhs.rows() : (std::min)(lhs.rows(),lhs.cols()); Index stripedCols = ((LhsIsTriangular) || (!IsLower)) ? rhs.cols() : (std::min)(rhs.cols(),rhs.rows()); Index stripedDepth = LhsIsTriangular ? ((!IsLower) ? lhs.cols() : (std::min)(lhs.cols(),lhs.rows())) : ((IsLower) ? rhs.rows() : (std::min)(rhs.rows(),rhs.cols())); BlockingType blocking(stripedRows, stripedCols, stripedDepth, 1, false); internal::product_triangular_matrix_matrix<Scalar, Index, Mode, LhsIsTriangular, (internal::traits<ActualLhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, LhsBlasTraits::NeedToConjugate, (internal::traits<ActualRhsTypeCleaned>::Flags&RowMajorBit) ? RowMajor : ColMajor, RhsBlasTraits::NeedToConjugate, (internal::traits<Dest >::Flags&RowMajorBit) ? RowMajor : ColMajor> ::run( stripedRows, stripedCols, stripedDepth, &lhs.coeffRef(0,0), lhs.outerStride(), &rhs.coeffRef(0,0), rhs.outerStride(), &dst.coeffRef(0,0), dst.outerStride(), actualAlpha, blocking ); if ((Mode&UnitDiag)==UnitDiag) { if (LhsIsTriangular && lhs_alpha!=LhsScalar(1)) { Index diagSize = (std::min)(lhs.rows(),lhs.cols()); dst.topRows(diagSize) -= ((lhs_alpha-LhsScalar(1))*a_rhs).topRows(diagSize); } else if ((!LhsIsTriangular) && rhs_alpha!=RhsScalar(1)) { Index diagSize = (std::min)(rhs.rows(),rhs.cols()); dst.leftCols(diagSize) -= (rhs_alpha-RhsScalar(1))*a_lhs.leftCols(diagSize); } } } }; } } # 504 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/TriangularSolverMatrix.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/TriangularSolverMatrix.h" namespace Eigen { namespace internal { template <typename Scalar, typename Index, int Side, int Mode, bool Conjugate, int TriStorageOrder> struct triangular_solve_matrix<Scalar,Index,Side,Mode,Conjugate,TriStorageOrder,RowMajor> { static void run( Index size, Index cols, const Scalar* tri, Index triStride, Scalar* _other, Index otherStride, level3_blocking<Scalar,Scalar>& blocking) { triangular_solve_matrix< Scalar, Index, Side==OnTheLeft?OnTheRight:OnTheLeft, (Mode&UnitDiag) | ((Mode&Upper) ? Lower : Upper), NumTraits<Scalar>::IsComplex && Conjugate, TriStorageOrder==RowMajor ? ColMajor : RowMajor, ColMajor> ::run(size, cols, tri, triStride, _other, otherStride, blocking); } }; template <typename Scalar, typename Index, int Mode, bool Conjugate, int TriStorageOrder> struct triangular_solve_matrix<Scalar,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor> { static __attribute__((noinline)) void run( Index size, Index otherSize, const Scalar* _tri, Index triStride, Scalar* _other, Index otherStride, level3_blocking<Scalar,Scalar>& blocking); }; template <typename Scalar, typename Index, int Mode, bool Conjugate, int TriStorageOrder> __attribute__((noinline)) void triangular_solve_matrix<Scalar,Index,OnTheLeft,Mode,Conjugate,TriStorageOrder,ColMajor>::run( Index size, Index otherSize, const Scalar* _tri, Index triStride, Scalar* _other, Index otherStride, level3_blocking<Scalar,Scalar>& blocking) { Index cols = otherSize; typedef const_blas_data_mapper<Scalar, Index, TriStorageOrder> TriMapper; typedef blas_data_mapper<Scalar, Index, ColMajor> OtherMapper; TriMapper tri(_tri, triStride); OtherMapper other(_other, otherStride); typedef gebp_traits<Scalar,Scalar> Traits; enum { SmallPanelWidth = (((int)Traits::mr >= (int)Traits::nr) ? (int)Traits::mr : (int)Traits::nr), IsLower = (Mode&Lower) == Lower }; Index kc = blocking.kc(); Index mc = (std::min)(size,blocking.mc()); std::size_t sizeA = kc*mc; std::size_t sizeB = kc*cols; Eigen::internal::check_size_for_overflow<Scalar>(sizeA); Scalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(Scalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<Scalar>(sizeB); Scalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(Scalar)*sizeB>131072); conj_if<Conjugate> conj; gebp_kernel<Scalar, Scalar, Index, OtherMapper, Traits::mr, Traits::nr, Conjugate, false> gebp_kernel; gemm_pack_lhs<Scalar, Index, TriMapper, Traits::mr, Traits::LhsProgress, TriStorageOrder> pack_lhs; gemm_pack_rhs<Scalar, Index, OtherMapper, Traits::nr, ColMajor, false, true> pack_rhs; std::ptrdiff_t l1, l2, l3; manage_caching_sizes(GetAction, &l1, &l2, &l3); Index subcols = cols>0 ? l2/(4 * sizeof(Scalar) * std::max<Index>(otherStride,size)) : 0; subcols = std::max<Index>((subcols/Traits::nr)*Traits::nr, Traits::nr); for(Index k2=IsLower ? 0 : size; IsLower ? k2<size : k2>0; IsLower ? k2+=kc : k2-=kc) { const Index actual_kc = (std::min)(IsLower ? size-k2 : k2, kc); # 108 "eigen-3.3.7/Eigen/src/Core/products/TriangularSolverMatrix.h" for(Index j2=0; j2<cols; j2+=subcols) { Index actual_cols = (std::min)(cols-j2,subcols); for (Index k1=0; k1<actual_kc; k1+=SmallPanelWidth) { Index actualPanelWidth = std::min<Index>(actual_kc-k1, SmallPanelWidth); for (Index k=0; k<actualPanelWidth; ++k) { Index i = IsLower ? k2+k1+k : k2-k1-k-1; Index rs = actualPanelWidth - k - 1; Index s = TriStorageOrder==RowMajor ? (IsLower ? k2+k1 : i+1) : IsLower ? i+1 : i-rs; Scalar a = (Mode & UnitDiag) ? Scalar(1) : Scalar(1)/conj(tri(i,i)); for (Index j=j2; j<j2+actual_cols; ++j) { if (TriStorageOrder==RowMajor) { Scalar b(0); const Scalar* l = &tri(i,s); Scalar* r = &other(s,j); for (Index i3=0; i3<k; ++i3) b += conj(l[i3]) * r[i3]; other(i,j) = (other(i,j) - b)*a; } else { Scalar b = (other(i,j) *= a); Scalar* r = &other(s,j); const Scalar* l = &tri(s,i); for (Index i3=0;i3<rs;++i3) r[i3] -= b * conj(l[i3]); } } } Index lengthTarget = actual_kc-k1-actualPanelWidth; Index startBlock = IsLower ? k2+k1 : k2-k1-actualPanelWidth; Index blockBOffset = IsLower ? k1 : lengthTarget; pack_rhs(blockB+actual_kc*j2, other.getSubMapper(startBlock,j2), actualPanelWidth, actual_cols, actual_kc, blockBOffset); if (lengthTarget>0) { Index startTarget = IsLower ? k2+k1+actualPanelWidth : k2-actual_kc; pack_lhs(blockA, tri.getSubMapper(startTarget,startBlock), actualPanelWidth, lengthTarget); gebp_kernel(other.getSubMapper(startTarget,j2), blockA, blockB+actual_kc*j2, lengthTarget, actualPanelWidth, actual_cols, Scalar(-1), actualPanelWidth, actual_kc, 0, blockBOffset); } } } { Index start = IsLower ? k2+kc : 0; Index end = IsLower ? size : k2-kc; for(Index i2=start; i2<end; i2+=mc) { const Index actual_mc = (std::min)(mc,end-i2); if (actual_mc>0) { pack_lhs(blockA, tri.getSubMapper(i2, IsLower ? k2 : k2-kc), actual_kc, actual_mc); gebp_kernel(other.getSubMapper(i2, 0), blockA, blockB, actual_mc, actual_kc, cols, Scalar(-1), -1, -1, 0, 0); } } } } } template <typename Scalar, typename Index, int Mode, bool Conjugate, int TriStorageOrder> struct triangular_solve_matrix<Scalar,Index,OnTheRight,Mode,Conjugate,TriStorageOrder,ColMajor> { static __attribute__((noinline)) void run( Index size, Index otherSize, const Scalar* _tri, Index triStride, Scalar* _other, Index otherStride, level3_blocking<Scalar,Scalar>& blocking); }; template <typename Scalar, typename Index, int Mode, bool Conjugate, int TriStorageOrder> __attribute__((noinline)) void triangular_solve_matrix<Scalar,Index,OnTheRight,Mode,Conjugate,TriStorageOrder,ColMajor>::run( Index size, Index otherSize, const Scalar* _tri, Index triStride, Scalar* _other, Index otherStride, level3_blocking<Scalar,Scalar>& blocking) { Index rows = otherSize; typedef typename NumTraits<Scalar>::Real RealScalar; typedef blas_data_mapper<Scalar, Index, ColMajor> LhsMapper; typedef const_blas_data_mapper<Scalar, Index, TriStorageOrder> RhsMapper; LhsMapper lhs(_other, otherStride); RhsMapper rhs(_tri, triStride); typedef gebp_traits<Scalar,Scalar> Traits; enum { RhsStorageOrder = TriStorageOrder, SmallPanelWidth = (((int)Traits::mr >= (int)Traits::nr) ? (int)Traits::mr : (int)Traits::nr), IsLower = (Mode&Lower) == Lower }; Index kc = blocking.kc(); Index mc = (std::min)(rows,blocking.mc()); std::size_t sizeA = kc*mc; std::size_t sizeB = kc*size; Eigen::internal::check_size_for_overflow<Scalar>(sizeA); Scalar* blockA = (blocking.blockA())!=0 ? (blocking.blockA()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeA<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeA+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeA) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockA_stack_memory_destructor((blocking.blockA())==0 ? blockA : 0,sizeA,sizeof(Scalar)*sizeA>131072); Eigen::internal::check_size_for_overflow<Scalar>(sizeB); Scalar* blockB = (blocking.blockB())!=0 ? (blocking.blockB()) : reinterpret_cast<Scalar*>( (sizeof(Scalar)*sizeB<=131072) ? reinterpret_cast<void*>((internal::UIntPtr(__builtin_alloca (sizeof(Scalar)*sizeB+16 -1)) + 16 -1) & ~(std::size_t(16 -1))) : Eigen::internal::aligned_malloc(sizeof(Scalar)*sizeB) ); Eigen::internal::aligned_stack_memory_handler<Scalar> blockB_stack_memory_destructor((blocking.blockB())==0 ? blockB : 0,sizeB,sizeof(Scalar)*sizeB>131072); conj_if<Conjugate> conj; gebp_kernel<Scalar, Scalar, Index, LhsMapper, Traits::mr, Traits::nr, false, Conjugate> gebp_kernel; gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr, RhsStorageOrder> pack_rhs; gemm_pack_rhs<Scalar, Index, RhsMapper, Traits::nr, RhsStorageOrder,false,true> pack_rhs_panel; gemm_pack_lhs<Scalar, Index, LhsMapper, Traits::mr, Traits::LhsProgress, ColMajor, false, true> pack_lhs_panel; for(Index k2=IsLower ? size : 0; IsLower ? k2>0 : k2<size; IsLower ? k2-=kc : k2+=kc) { const Index actual_kc = (std::min)(IsLower ? k2 : size-k2, kc); Index actual_k2 = IsLower ? k2-actual_kc : k2 ; Index startPanel = IsLower ? 0 : k2+actual_kc; Index rs = IsLower ? actual_k2 : size - actual_k2 - actual_kc; Scalar* geb = blockB+actual_kc*actual_kc; if (rs>0) pack_rhs(geb, rhs.getSubMapper(actual_k2,startPanel), actual_kc, rs); { for (Index j2=0; j2<actual_kc; j2+=SmallPanelWidth) { Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth); Index actual_j2 = actual_k2 + j2; Index panelOffset = IsLower ? j2+actualPanelWidth : 0; Index panelLength = IsLower ? actual_kc-j2-actualPanelWidth : j2; if (panelLength>0) pack_rhs_panel(blockB+j2*actual_kc, rhs.getSubMapper(actual_k2+panelOffset, actual_j2), panelLength, actualPanelWidth, actual_kc, panelOffset); } } for(Index i2=0; i2<rows; i2+=mc) { const Index actual_mc = (std::min)(mc,rows-i2); { for (Index j2 = IsLower ? (actual_kc - ((actual_kc%SmallPanelWidth) ? Index(actual_kc%SmallPanelWidth) : Index(SmallPanelWidth))) : 0; IsLower ? j2>=0 : j2<actual_kc; IsLower ? j2-=SmallPanelWidth : j2+=SmallPanelWidth) { Index actualPanelWidth = std::min<Index>(actual_kc-j2, SmallPanelWidth); Index absolute_j2 = actual_k2 + j2; Index panelOffset = IsLower ? j2+actualPanelWidth : 0; Index panelLength = IsLower ? actual_kc - j2 - actualPanelWidth : j2; if(panelLength>0) { gebp_kernel(lhs.getSubMapper(i2,absolute_j2), blockA, blockB+j2*actual_kc, actual_mc, panelLength, actualPanelWidth, Scalar(-1), actual_kc, actual_kc, panelOffset, panelOffset); } for (Index k=0; k<actualPanelWidth; ++k) { Index j = IsLower ? absolute_j2+actualPanelWidth-k-1 : absolute_j2+k; Scalar* r = &lhs(i2,j); for (Index k3=0; k3<k; ++k3) { Scalar b = conj(rhs(IsLower ? j+1+k3 : absolute_j2+k3,j)); Scalar* a = &lhs(i2,IsLower ? j+1+k3 : absolute_j2+k3); for (Index i=0; i<actual_mc; ++i) r[i] -= a[i] * b; } if((Mode & UnitDiag)==0) { Scalar inv_rjj = RealScalar(1)/conj(rhs(j,j)); for (Index i=0; i<actual_mc; ++i) r[i] *= inv_rjj; } } pack_lhs_panel(blockA, LhsMapper(_other+absolute_j2*otherStride+i2, otherStride), actualPanelWidth, actual_mc, actual_kc, j2); } } if (rs>0) gebp_kernel(lhs.getSubMapper(i2, startPanel), blockA, geb, actual_mc, actual_kc, rs, Scalar(-1), -1, -1, 0, 0); } } } } } # 505 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/products/TriangularSolverVector.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/products/TriangularSolverVector.h" namespace Eigen { namespace internal { template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate, int StorageOrder> struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheRight, Mode, Conjugate, StorageOrder> { static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) { triangular_solve_vector<LhsScalar,RhsScalar,Index,OnTheLeft, ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag), Conjugate,StorageOrder==RowMajor?ColMajor:RowMajor >::run(size, _lhs, lhsStride, rhs); } }; template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate> struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, RowMajor> { enum { IsLower = ((Mode&Lower)==Lower) }; static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) { typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,RowMajor>, 0, OuterStride<> > LhsMap; const LhsMap lhs(_lhs,size,size,OuterStride<>(lhsStride)); typedef const_blas_data_mapper<LhsScalar,Index,RowMajor> LhsMapper; typedef const_blas_data_mapper<RhsScalar,Index,ColMajor> RhsMapper; typename internal::conditional< Conjugate, const CwiseUnaryOp<typename internal::scalar_conjugate_op<LhsScalar>,LhsMap>, const LhsMap&> ::type cjLhs(lhs); static const Index PanelWidth = 8; for(Index pi=IsLower ? 0 : size; IsLower ? pi<size : pi>0; IsLower ? pi+=PanelWidth : pi-=PanelWidth) { Index actualPanelWidth = (std::min)(IsLower ? size - pi : pi, PanelWidth); Index r = IsLower ? pi : size - pi; if (r > 0) { Index startRow = IsLower ? pi : pi-actualPanelWidth; Index startCol = IsLower ? 0 : pi; general_matrix_vector_product<Index,LhsScalar,LhsMapper,RowMajor,Conjugate,RhsScalar,RhsMapper,false>::run( actualPanelWidth, r, LhsMapper(&lhs.coeffRef(startRow,startCol), lhsStride), RhsMapper(rhs + startCol, 1), rhs + startRow, 1, RhsScalar(-1)); } for(Index k=0; k<actualPanelWidth; ++k) { Index i = IsLower ? pi+k : pi-k-1; Index s = IsLower ? pi : i+1; if (k>0) rhs[i] -= (cjLhs.row(i).segment(s,k).transpose().cwiseProduct(Map<const Matrix<RhsScalar,Dynamic,1> >(rhs+s,k))).sum(); if(!(Mode & UnitDiag)) rhs[i] /= cjLhs(i,i); } } } }; template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate> struct triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, ColMajor> { enum { IsLower = ((Mode&Lower)==Lower) }; static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) { typedef Map<const Matrix<LhsScalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > LhsMap; const LhsMap lhs(_lhs,size,size,OuterStride<>(lhsStride)); typedef const_blas_data_mapper<LhsScalar,Index,ColMajor> LhsMapper; typedef const_blas_data_mapper<RhsScalar,Index,ColMajor> RhsMapper; typename internal::conditional<Conjugate, const CwiseUnaryOp<typename internal::scalar_conjugate_op<LhsScalar>,LhsMap>, const LhsMap& >::type cjLhs(lhs); static const Index PanelWidth = 8; for(Index pi=IsLower ? 0 : size; IsLower ? pi<size : pi>0; IsLower ? pi+=PanelWidth : pi-=PanelWidth) { Index actualPanelWidth = (std::min)(IsLower ? size - pi : pi, PanelWidth); Index startBlock = IsLower ? pi : pi-actualPanelWidth; Index endBlock = IsLower ? pi + actualPanelWidth : 0; for(Index k=0; k<actualPanelWidth; ++k) { Index i = IsLower ? pi+k : pi-k-1; if(!(Mode & UnitDiag)) rhs[i] /= cjLhs.coeff(i,i); Index r = actualPanelWidth - k - 1; Index s = IsLower ? i+1 : i-r; if (r>0) Map<Matrix<RhsScalar,Dynamic,1> >(rhs+s,r) -= rhs[i] * cjLhs.col(i).segment(s,r); } Index r = IsLower ? size - endBlock : startBlock; if (r > 0) { general_matrix_vector_product<Index,LhsScalar,LhsMapper,ColMajor,Conjugate,RhsScalar,RhsMapper,false>::run( r, actualPanelWidth, LhsMapper(&lhs.coeffRef(endBlock,startBlock), lhsStride), RhsMapper(rhs+startBlock, 1), rhs+endBlock, 1, RhsScalar(-1)); } } } }; } } # 506 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/BandMatrix.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/BandMatrix.h" namespace Eigen { namespace internal { template<typename Derived> class BandMatrixBase : public EigenBase<Derived> { public: enum { Flags = internal::traits<Derived>::Flags, CoeffReadCost = internal::traits<Derived>::CoeffReadCost, RowsAtCompileTime = internal::traits<Derived>::RowsAtCompileTime, ColsAtCompileTime = internal::traits<Derived>::ColsAtCompileTime, MaxRowsAtCompileTime = internal::traits<Derived>::MaxRowsAtCompileTime, MaxColsAtCompileTime = internal::traits<Derived>::MaxColsAtCompileTime, Supers = internal::traits<Derived>::Supers, Subs = internal::traits<Derived>::Subs, Options = internal::traits<Derived>::Options }; typedef typename internal::traits<Derived>::Scalar Scalar; typedef Matrix<Scalar,RowsAtCompileTime,ColsAtCompileTime> DenseMatrixType; typedef typename DenseMatrixType::StorageIndex StorageIndex; typedef typename internal::traits<Derived>::CoefficientsType CoefficientsType; typedef EigenBase<Derived> Base; protected: enum { DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic)) ? 1 + Supers + Subs : Dynamic, SizeAtCompileTime = (((int)RowsAtCompileTime == 0 || (int)ColsAtCompileTime == 0) ? 0 : ((int)RowsAtCompileTime == 1 || (int)ColsAtCompileTime == 1) ? 1 : ((int)RowsAtCompileTime == Dynamic || (int)ColsAtCompileTime == Dynamic) ? Dynamic : ((int)RowsAtCompileTime <= (int)ColsAtCompileTime) ? (int)RowsAtCompileTime : (int)ColsAtCompileTime) }; public: using Base::derived; using Base::rows; using Base::cols; inline Index supers() const { return derived().supers(); } inline Index subs() const { return derived().subs(); } inline const CoefficientsType& coeffs() const { return derived().coeffs(); } inline CoefficientsType& coeffs() { return derived().coeffs(); } inline Block<CoefficientsType,Dynamic,1> col(Index i) { if (Eigen::internal::static_assertion<static_cast<bool>((Options&RowMajor)==0)>::THIS_METHOD_IS_ONLY_FOR_COLUMN_MAJOR_MATRICES) {}; Index start = 0; Index len = coeffs().rows(); if (i<=supers()) { start = supers()-i; len = (std::min)(rows(),std::max<Index>(0,coeffs().rows() - (supers()-i))); } else if (i>=rows()-subs()) len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs())); return Block<CoefficientsType,Dynamic,1>(coeffs(), start, i, len, 1); } inline Block<CoefficientsType,1,SizeAtCompileTime> diagonal() { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); } inline const Block<const CoefficientsType,1,SizeAtCompileTime> diagonal() const { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); } template<int Index> struct DiagonalIntReturnType { enum { ReturnOpposite = (Options&SelfAdjoint) && (((Index)>0 && Supers==0) || ((Index)<0 && Subs==0)), Conjugate = ReturnOpposite && NumTraits<Scalar>::IsComplex, ActualIndex = ReturnOpposite ? -Index : Index, DiagonalSize = (RowsAtCompileTime==Dynamic || ColsAtCompileTime==Dynamic) ? Dynamic : (ActualIndex<0 ? (((int)ColsAtCompileTime == 0 || (int)RowsAtCompileTime + ActualIndex == 0) ? 0 : ((int)ColsAtCompileTime == 1 || (int)RowsAtCompileTime + ActualIndex == 1) ? 1 : ((int)ColsAtCompileTime == Dynamic || (int)RowsAtCompileTime + ActualIndex == Dynamic) ? Dynamic : ((int)ColsAtCompileTime <= (int)RowsAtCompileTime + ActualIndex) ? (int)ColsAtCompileTime : (int)RowsAtCompileTime + ActualIndex) : (((int)RowsAtCompileTime == 0 || (int)ColsAtCompileTime - ActualIndex == 0) ? 0 : ((int)RowsAtCompileTime == 1 || (int)ColsAtCompileTime - ActualIndex == 1) ? 1 : ((int)RowsAtCompileTime == Dynamic || (int)ColsAtCompileTime - ActualIndex == Dynamic) ? Dynamic : ((int)RowsAtCompileTime <= (int)ColsAtCompileTime - ActualIndex) ? (int)RowsAtCompileTime : (int)ColsAtCompileTime - ActualIndex)) }; typedef Block<CoefficientsType,1, DiagonalSize> BuildType; typedef typename internal::conditional<Conjugate, CwiseUnaryOp<internal::scalar_conjugate_op<Scalar>,BuildType >, BuildType>::type Type; }; template<int N> inline typename DiagonalIntReturnType<N>::Type diagonal() { return typename DiagonalIntReturnType<N>::BuildType(coeffs(), supers()-N, (std::max)(0,N), 1, diagonalLength(N)); } template<int N> inline const typename DiagonalIntReturnType<N>::Type diagonal() const { return typename DiagonalIntReturnType<N>::BuildType(coeffs(), supers()-N, (std::max)(0,N), 1, diagonalLength(N)); } inline Block<CoefficientsType,1,Dynamic> diagonal(Index i) { (((i<0 && -i<=subs()) || (i>=0 && i<=supers())) ? static_cast<void> (0) : __assert_fail ("(i<0 && -i<=subs()) || (i>=0 && i<=supers())", "eigen-3.3.7/Eigen/src/Core/BandMatrix.h", 123, __PRETTY_FUNCTION__)); return Block<CoefficientsType,1,Dynamic>(coeffs(), supers()-i, std::max<Index>(0,i), 1, diagonalLength(i)); } inline const Block<const CoefficientsType,1,Dynamic> diagonal(Index i) const { (((i<0 && -i<=subs()) || (i>=0 && i<=supers())) ? static_cast<void> (0) : __assert_fail ("(i<0 && -i<=subs()) || (i>=0 && i<=supers())", "eigen-3.3.7/Eigen/src/Core/BandMatrix.h", 130, __PRETTY_FUNCTION__)); return Block<const CoefficientsType,1,Dynamic>(coeffs(), supers()-i, std::max<Index>(0,i), 1, diagonalLength(i)); } template<typename Dest> inline void evalTo(Dest& dst) const { dst.resize(rows(),cols()); dst.setZero(); dst.diagonal() = diagonal(); for (Index i=1; i<=supers();++i) dst.diagonal(i) = diagonal(i); for (Index i=1; i<=subs();++i) dst.diagonal(-i) = diagonal(-i); } DenseMatrixType toDenseMatrix() const { DenseMatrixType res(rows(),cols()); evalTo(res); return res; } protected: inline Index diagonalLength(Index i) const { return i<0 ? (std::min)(cols(),rows()+i) : (std::min)(rows(),cols()-i); } }; # 177 "eigen-3.3.7/Eigen/src/Core/BandMatrix.h" template<typename _Scalar, int _Rows, int _Cols, int _Supers, int _Subs, int _Options> struct traits<BandMatrix<_Scalar,_Rows,_Cols,_Supers,_Subs,_Options> > { typedef _Scalar Scalar; typedef Dense StorageKind; typedef Eigen::Index StorageIndex; enum { CoeffReadCost = NumTraits<Scalar>::ReadCost, RowsAtCompileTime = _Rows, ColsAtCompileTime = _Cols, MaxRowsAtCompileTime = _Rows, MaxColsAtCompileTime = _Cols, Flags = LvalueBit, Supers = _Supers, Subs = _Subs, Options = _Options, DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic)) ? 1 + Supers + Subs : Dynamic }; typedef Matrix<Scalar,DataRowsAtCompileTime,ColsAtCompileTime,Options&RowMajor?RowMajor:ColMajor> CoefficientsType; }; template<typename _Scalar, int Rows, int Cols, int Supers, int Subs, int Options> class BandMatrix : public BandMatrixBase<BandMatrix<_Scalar,Rows,Cols,Supers,Subs,Options> > { public: typedef typename internal::traits<BandMatrix>::Scalar Scalar; typedef typename internal::traits<BandMatrix>::StorageIndex StorageIndex; typedef typename internal::traits<BandMatrix>::CoefficientsType CoefficientsType; explicit inline BandMatrix(Index rows=Rows, Index cols=Cols, Index supers=Supers, Index subs=Subs) : m_coeffs(1+supers+subs,cols), m_rows(rows), m_supers(supers), m_subs(subs) { } inline Index rows() const { return m_rows.value(); } inline Index cols() const { return m_coeffs.cols(); } inline Index supers() const { return m_supers.value(); } inline Index subs() const { return m_subs.value(); } inline const CoefficientsType& coeffs() const { return m_coeffs; } inline CoefficientsType& coeffs() { return m_coeffs; } protected: CoefficientsType m_coeffs; internal::variable_if_dynamic<Index, Rows> m_rows; internal::variable_if_dynamic<Index, Supers> m_supers; internal::variable_if_dynamic<Index, Subs> m_subs; }; template<typename _CoefficientsType,int _Rows, int _Cols, int _Supers, int _Subs,int _Options> class BandMatrixWrapper; template<typename _CoefficientsType,int _Rows, int _Cols, int _Supers, int _Subs,int _Options> struct traits<BandMatrixWrapper<_CoefficientsType,_Rows,_Cols,_Supers,_Subs,_Options> > { typedef typename _CoefficientsType::Scalar Scalar; typedef typename _CoefficientsType::StorageKind StorageKind; typedef typename _CoefficientsType::StorageIndex StorageIndex; enum { CoeffReadCost = internal::traits<_CoefficientsType>::CoeffReadCost, RowsAtCompileTime = _Rows, ColsAtCompileTime = _Cols, MaxRowsAtCompileTime = _Rows, MaxColsAtCompileTime = _Cols, Flags = LvalueBit, Supers = _Supers, Subs = _Subs, Options = _Options, DataRowsAtCompileTime = ((Supers!=Dynamic) && (Subs!=Dynamic)) ? 1 + Supers + Subs : Dynamic }; typedef _CoefficientsType CoefficientsType; }; template<typename _CoefficientsType,int _Rows, int _Cols, int _Supers, int _Subs,int _Options> class BandMatrixWrapper : public BandMatrixBase<BandMatrixWrapper<_CoefficientsType,_Rows,_Cols,_Supers,_Subs,_Options> > { public: typedef typename internal::traits<BandMatrixWrapper>::Scalar Scalar; typedef typename internal::traits<BandMatrixWrapper>::CoefficientsType CoefficientsType; typedef typename internal::traits<BandMatrixWrapper>::StorageIndex StorageIndex; explicit inline BandMatrixWrapper(const CoefficientsType& coeffs, Index rows=_Rows, Index cols=_Cols, Index supers=_Supers, Index subs=_Subs) : m_coeffs(coeffs), m_rows(rows), m_supers(supers), m_subs(subs) { Eigen::internal::ignore_unused_variable(cols);; } inline Index rows() const { return m_rows.value(); } inline Index cols() const { return m_coeffs.cols(); } inline Index supers() const { return m_supers.value(); } inline Index subs() const { return m_subs.value(); } inline const CoefficientsType& coeffs() const { return m_coeffs; } protected: const CoefficientsType& m_coeffs; internal::variable_if_dynamic<Index, _Rows> m_rows; internal::variable_if_dynamic<Index, _Supers> m_supers; internal::variable_if_dynamic<Index, _Subs> m_subs; }; # 311 "eigen-3.3.7/Eigen/src/Core/BandMatrix.h" template<typename Scalar, int Size, int Options> class TridiagonalMatrix : public BandMatrix<Scalar,Size,Size,Options&SelfAdjoint?0:1,1,Options|RowMajor> { typedef BandMatrix<Scalar,Size,Size,Options&SelfAdjoint?0:1,1,Options|RowMajor> Base; typedef typename Base::StorageIndex StorageIndex; public: explicit TridiagonalMatrix(Index size = Size) : Base(size,size,Options&SelfAdjoint?0:1,1) {} inline typename Base::template DiagonalIntReturnType<1>::Type super() { return Base::template diagonal<1>(); } inline const typename Base::template DiagonalIntReturnType<1>::Type super() const { return Base::template diagonal<1>(); } inline typename Base::template DiagonalIntReturnType<-1>::Type sub() { return Base::template diagonal<-1>(); } inline const typename Base::template DiagonalIntReturnType<-1>::Type sub() const { return Base::template diagonal<-1>(); } protected: }; struct BandShape {}; template<typename _Scalar, int _Rows, int _Cols, int _Supers, int _Subs, int _Options> struct evaluator_traits<BandMatrix<_Scalar,_Rows,_Cols,_Supers,_Subs,_Options> > : public evaluator_traits_base<BandMatrix<_Scalar,_Rows,_Cols,_Supers,_Subs,_Options> > { typedef BandShape Shape; }; template<typename _CoefficientsType,int _Rows, int _Cols, int _Supers, int _Subs,int _Options> struct evaluator_traits<BandMatrixWrapper<_CoefficientsType,_Rows,_Cols,_Supers,_Subs,_Options> > : public evaluator_traits_base<BandMatrixWrapper<_CoefficientsType,_Rows,_Cols,_Supers,_Subs,_Options> > { typedef BandShape Shape; }; template<> struct AssignmentKind<DenseShape,BandShape> { typedef EigenBase2EigenBase Kind; }; } } # 507 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/CoreIterators.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/CoreIterators.h" namespace Eigen { namespace internal { template<typename XprType, typename EvaluatorKind> class inner_iterator_selector; } # 32 "eigen-3.3.7/Eigen/src/Core/CoreIterators.h" template<typename XprType> class InnerIterator { protected: typedef internal::inner_iterator_selector<XprType, typename internal::evaluator_traits<XprType>::Kind> IteratorType; typedef internal::evaluator<XprType> EvaluatorType; typedef typename internal::traits<XprType>::Scalar Scalar; public: InnerIterator(const XprType &xpr, const Index &outerId) : m_eval(xpr), m_iter(m_eval, outerId, xpr.innerSize()) {} inline Scalar value() const { return m_iter.value(); } inline InnerIterator& operator++() { m_iter.operator++(); return *this; } inline Index index() const { return m_iter.index(); } inline Index row() const { return m_iter.row(); } inline Index col() const { return m_iter.col(); } inline operator bool() const { return m_iter; } protected: EvaluatorType m_eval; IteratorType m_iter; private: template<typename T> InnerIterator(const EigenBase<T>&,Index outer); }; namespace internal { template<typename XprType> class inner_iterator_selector<XprType, IndexBased> { protected: typedef evaluator<XprType> EvaluatorType; typedef typename traits<XprType>::Scalar Scalar; enum { IsRowMajor = (XprType::Flags&RowMajorBit)==RowMajorBit }; public: inline inner_iterator_selector(const EvaluatorType &eval, const Index &outerId, const Index &innerSize) : m_eval(eval), m_inner(0), m_outer(outerId), m_end(innerSize) {} inline Scalar value() const { return (IsRowMajor) ? m_eval.coeff(m_outer, m_inner) : m_eval.coeff(m_inner, m_outer); } inline inner_iterator_selector& operator++() { m_inner++; return *this; } inline Index index() const { return m_inner; } inline Index row() const { return IsRowMajor ? m_outer : index(); } inline Index col() const { return IsRowMajor ? index() : m_outer; } inline operator bool() const { return m_inner < m_end && m_inner>=0; } protected: const EvaluatorType& m_eval; Index m_inner; const Index m_outer; const Index m_end; }; template<typename XprType> class inner_iterator_selector<XprType, IteratorBased> : public evaluator<XprType>::InnerIterator { protected: typedef typename evaluator<XprType>::InnerIterator Base; typedef evaluator<XprType> EvaluatorType; public: inline inner_iterator_selector(const EvaluatorType &eval, const Index &outerId, const Index & ) : Base(eval, outerId) {} }; } } # 508 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h" namespace Eigen { namespace internal { template <typename Vector, typename RealVector, bool IsComplex> struct rcond_compute_sign { static inline Vector run(const Vector& v) { const RealVector v_abs = v.cwiseAbs(); return (v_abs.array() == static_cast<typename Vector::RealScalar>(0)) .select(Vector::Ones(v.size()), v.cwiseQuotient(v_abs)); } }; template <typename Vector> struct rcond_compute_sign<Vector, Vector, false> { static inline Vector run(const Vector& v) { return (v.array() < static_cast<typename Vector::RealScalar>(0)) .select(-Vector::Ones(v.size()), Vector::Ones(v.size())); } }; # 55 "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h" template <typename Decomposition> typename Decomposition::RealScalar rcond_invmatrix_L1_norm_estimate(const Decomposition& dec) { typedef typename Decomposition::MatrixType MatrixType; typedef typename Decomposition::Scalar Scalar; typedef typename Decomposition::RealScalar RealScalar; typedef typename internal::plain_col_type<MatrixType>::type Vector; typedef typename internal::plain_col_type<MatrixType, RealScalar>::type RealVector; const bool is_complex = (NumTraits<Scalar>::IsComplex != 0); ((dec.rows() == dec.cols()) ? static_cast<void> (0) : __assert_fail ("dec.rows() == dec.cols()", "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h", 65, __PRETTY_FUNCTION__)); const Index n = dec.rows(); if (n == 0) return 0; Vector v = dec.solve(Vector::Ones(n) / Scalar(n)); # 84 "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h" RealScalar lower_bound = v.template lpNorm<1>(); if (n == 1) return lower_bound; RealScalar old_lower_bound = lower_bound; Vector sign_vector(n); Vector old_sign_vector; Index v_max_abs_index = -1; Index old_v_max_abs_index = v_max_abs_index; for (int k = 0; k < 4; ++k) { sign_vector = internal::rcond_compute_sign<Vector, RealVector, is_complex>::run(v); if (k > 0 && !is_complex && sign_vector == old_sign_vector) { break; } v = dec.adjoint().solve(sign_vector); v.real().cwiseAbs().maxCoeff(&v_max_abs_index); if (v_max_abs_index == old_v_max_abs_index) { break; } v = dec.solve(Vector::Unit(n, v_max_abs_index)); lower_bound = v.template lpNorm<1>(); if (lower_bound <= old_lower_bound) { break; } if (!is_complex) { old_sign_vector = sign_vector; } old_v_max_abs_index = v_max_abs_index; old_lower_bound = lower_bound; } # 133 "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h" Scalar alternating_sign(RealScalar(1)); for (Index i = 0; i < n; ++i) { v[i] = alternating_sign * static_cast<RealScalar>(RealScalar(1) + (RealScalar(i) / (RealScalar(n - 1)))); alternating_sign = -alternating_sign; } v = dec.solve(v); const RealScalar alternate_lower_bound = (2 * v.template lpNorm<1>()) / (3 * RealScalar(n)); return numext::maxi(lower_bound, alternate_lower_bound); } # 157 "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h" template <typename Decomposition> typename Decomposition::RealScalar rcond_estimate_helper(typename Decomposition::RealScalar matrix_norm, const Decomposition& dec) { typedef typename Decomposition::RealScalar RealScalar; ((dec.rows() == dec.cols()) ? static_cast<void> (0) : __assert_fail ("dec.rows() == dec.cols()", "eigen-3.3.7/Eigen/src/Core/ConditionEstimator.h", 162, __PRETTY_FUNCTION__)); if (dec.rows() == 0) return NumTraits<RealScalar>::infinity(); if (matrix_norm == RealScalar(0)) return RealScalar(0); if (dec.rows() == 1) return RealScalar(1); const RealScalar inverse_matrix_norm = rcond_invmatrix_L1_norm_estimate(dec); return (inverse_matrix_norm == RealScalar(0) ? RealScalar(0) : (RealScalar(1) / inverse_matrix_norm) / matrix_norm); } } } # 509 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/BooleanRedux.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/BooleanRedux.h" namespace Eigen { namespace internal { template<typename Derived, int UnrollCount> struct all_unroller { typedef typename Derived::ExpressionTraits Traits; enum { col = (UnrollCount-1) / Traits::RowsAtCompileTime, row = (UnrollCount-1) % Traits::RowsAtCompileTime }; static inline bool run(const Derived &mat) { return all_unroller<Derived, UnrollCount-1>::run(mat) && mat.coeff(row, col); } }; template<typename Derived> struct all_unroller<Derived, 0> { static inline bool run(const Derived & ) { return true; } }; template<typename Derived> struct all_unroller<Derived, Dynamic> { static inline bool run(const Derived &) { return false; } }; template<typename Derived, int UnrollCount> struct any_unroller { typedef typename Derived::ExpressionTraits Traits; enum { col = (UnrollCount-1) / Traits::RowsAtCompileTime, row = (UnrollCount-1) % Traits::RowsAtCompileTime }; static inline bool run(const Derived &mat) { return any_unroller<Derived, UnrollCount-1>::run(mat) || mat.coeff(row, col); } }; template<typename Derived> struct any_unroller<Derived, 0> { static inline bool run(const Derived & ) { return false; } }; template<typename Derived> struct any_unroller<Derived, Dynamic> { static inline bool run(const Derived &) { return false; } }; } # 80 "eigen-3.3.7/Eigen/src/Core/BooleanRedux.h" template<typename Derived> inline bool DenseBase<Derived>::all() const { typedef internal::evaluator<Derived> Evaluator; enum { unroll = SizeAtCompileTime != Dynamic && SizeAtCompileTime * (Evaluator::CoeffReadCost + NumTraits<Scalar>::AddCost) <= 100 }; Evaluator evaluator(derived()); if(unroll) return internal::all_unroller<Evaluator, unroll ? int(SizeAtCompileTime) : Dynamic>::run(evaluator); else { for(Index j = 0; j < cols(); ++j) for(Index i = 0; i < rows(); ++i) if (!evaluator.coeff(i, j)) return false; return true; } } template<typename Derived> inline bool DenseBase<Derived>::any() const { typedef internal::evaluator<Derived> Evaluator; enum { unroll = SizeAtCompileTime != Dynamic && SizeAtCompileTime * (Evaluator::CoeffReadCost + NumTraits<Scalar>::AddCost) <= 100 }; Evaluator evaluator(derived()); if(unroll) return internal::any_unroller<Evaluator, unroll ? int(SizeAtCompileTime) : Dynamic>::run(evaluator); else { for(Index j = 0; j < cols(); ++j) for(Index i = 0; i < rows(); ++i) if (evaluator.coeff(i, j)) return true; return false; } } template<typename Derived> inline Eigen::Index DenseBase<Derived>::count() const { return derived().template cast<bool>().template cast<Index>().sum(); } template<typename Derived> inline bool DenseBase<Derived>::hasNaN() const { return !((derived().array()==derived().array()).all()); } template<typename Derived> inline bool DenseBase<Derived>::allFinite() const { return !((derived()-derived()).hasNaN()); } } # 511 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Select.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Select.h" namespace Eigen { # 30 "eigen-3.3.7/Eigen/src/Core/Select.h" namespace internal { template<typename ConditionMatrixType, typename ThenMatrixType, typename ElseMatrixType> struct traits<Select<ConditionMatrixType, ThenMatrixType, ElseMatrixType> > : traits<ThenMatrixType> { typedef typename traits<ThenMatrixType>::Scalar Scalar; typedef Dense StorageKind; typedef typename traits<ThenMatrixType>::XprKind XprKind; typedef typename ConditionMatrixType::Nested ConditionMatrixNested; typedef typename ThenMatrixType::Nested ThenMatrixNested; typedef typename ElseMatrixType::Nested ElseMatrixNested; enum { RowsAtCompileTime = ConditionMatrixType::RowsAtCompileTime, ColsAtCompileTime = ConditionMatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = ConditionMatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = ConditionMatrixType::MaxColsAtCompileTime, Flags = (unsigned int)ThenMatrixType::Flags & ElseMatrixType::Flags & RowMajorBit }; }; } template<typename ConditionMatrixType, typename ThenMatrixType, typename ElseMatrixType> class Select : public internal::dense_xpr_base< Select<ConditionMatrixType, ThenMatrixType, ElseMatrixType> >::type, internal::no_assignment_operator { public: typedef typename internal::dense_xpr_base<Select>::type Base; typedef typename Eigen::internal::traits<Select>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Select>::type Nested; typedef typename Eigen::internal::traits<Select>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Select>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Select>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Select>::ColsAtCompileTime, Flags = Eigen::internal::traits<Select>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; inline Select(const ConditionMatrixType& a_conditionMatrix, const ThenMatrixType& a_thenMatrix, const ElseMatrixType& a_elseMatrix) : m_condition(a_conditionMatrix), m_then(a_thenMatrix), m_else(a_elseMatrix) { ((m_condition.rows() == m_then.rows() && m_condition.rows() == m_else.rows()) ? static_cast<void> (0) : __assert_fail ("m_condition.rows() == m_then.rows() && m_condition.rows() == m_else.rows()", "eigen-3.3.7/Eigen/src/Core/Select.h", 66, __PRETTY_FUNCTION__)); ((m_condition.cols() == m_then.cols() && m_condition.cols() == m_else.cols()) ? static_cast<void> (0) : __assert_fail ("m_condition.cols() == m_then.cols() && m_condition.cols() == m_else.cols()", "eigen-3.3.7/Eigen/src/Core/Select.h", 67, __PRETTY_FUNCTION__)); } inline Index rows() const { return m_condition.rows(); } inline Index cols() const { return m_condition.cols(); } inline const Scalar coeff(Index i, Index j) const { if (m_condition.coeff(i,j)) return m_then.coeff(i,j); else return m_else.coeff(i,j); } inline const Scalar coeff(Index i) const { if (m_condition.coeff(i)) return m_then.coeff(i); else return m_else.coeff(i); } inline const ConditionMatrixType& conditionMatrix() const { return m_condition; } inline const ThenMatrixType& thenMatrix() const { return m_then; } inline const ElseMatrixType& elseMatrix() const { return m_else; } protected: typename ConditionMatrixType::Nested m_condition; typename ThenMatrixType::Nested m_then; typename ElseMatrixType::Nested m_else; }; # 121 "eigen-3.3.7/Eigen/src/Core/Select.h" template<typename Derived> template<typename ThenDerived,typename ElseDerived> inline const Select<Derived,ThenDerived,ElseDerived> DenseBase<Derived>::select(const DenseBase<ThenDerived>& thenMatrix, const DenseBase<ElseDerived>& elseMatrix) const { return Select<Derived,ThenDerived,ElseDerived>(derived(), thenMatrix.derived(), elseMatrix.derived()); } template<typename Derived> template<typename ThenDerived> inline const Select<Derived,ThenDerived, typename ThenDerived::ConstantReturnType> DenseBase<Derived>::select(const DenseBase<ThenDerived>& thenMatrix, const typename ThenDerived::Scalar& elseScalar) const { return Select<Derived,ThenDerived,typename ThenDerived::ConstantReturnType>( derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar)); } template<typename Derived> template<typename ElseDerived> inline const Select<Derived, typename ElseDerived::ConstantReturnType, ElseDerived > DenseBase<Derived>::select(const typename ElseDerived::Scalar& thenScalar, const DenseBase<ElseDerived>& elseMatrix) const { return Select<Derived,typename ElseDerived::ConstantReturnType,ElseDerived>( derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived()); } } # 512 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" 1 # 14 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" namespace Eigen { # 32 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" template< typename MatrixType, typename MemberOp, int Direction> class PartialReduxExpr; namespace internal { template<typename MatrixType, typename MemberOp, int Direction> struct traits<PartialReduxExpr<MatrixType, MemberOp, Direction> > : traits<MatrixType> { typedef typename MemberOp::result_type Scalar; typedef typename traits<MatrixType>::StorageKind StorageKind; typedef typename traits<MatrixType>::XprKind XprKind; typedef typename MatrixType::Scalar InputScalar; enum { RowsAtCompileTime = Direction==Vertical ? 1 : MatrixType::RowsAtCompileTime, ColsAtCompileTime = Direction==Horizontal ? 1 : MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = Direction==Vertical ? 1 : MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = Direction==Horizontal ? 1 : MatrixType::MaxColsAtCompileTime, Flags = RowsAtCompileTime == 1 ? RowMajorBit : 0, TraversalSize = Direction==Vertical ? MatrixType::RowsAtCompileTime : MatrixType::ColsAtCompileTime }; }; } template< typename MatrixType, typename MemberOp, int Direction> class PartialReduxExpr : public internal::dense_xpr_base< PartialReduxExpr<MatrixType, MemberOp, Direction> >::type, internal::no_assignment_operator { public: typedef typename internal::dense_xpr_base<PartialReduxExpr>::type Base; typedef typename Eigen::internal::traits<PartialReduxExpr>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<PartialReduxExpr>::type Nested; typedef typename Eigen::internal::traits<PartialReduxExpr>::StorageKind StorageKind; typedef typename Eigen::internal::traits<PartialReduxExpr>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<PartialReduxExpr>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<PartialReduxExpr>::ColsAtCompileTime, Flags = Eigen::internal::traits<PartialReduxExpr>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; explicit PartialReduxExpr(const MatrixType& mat, const MemberOp& func = MemberOp()) : m_matrix(mat), m_functor(func) {} Index rows() const { return (Direction==Vertical ? 1 : m_matrix.rows()); } Index cols() const { return (Direction==Horizontal ? 1 : m_matrix.cols()); } typename MatrixType::Nested nestedExpression() const { return m_matrix; } const MemberOp& functor() const { return m_functor; } protected: typename MatrixType::Nested m_matrix; const MemberOp m_functor; }; # 97 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" namespace internal { template <typename ResultType> struct member_squaredNorm { inline member_squaredNorm() {} inline member_squaredNorm(const member_squaredNorm& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = Size * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.squaredNorm(); } }; template <typename ResultType> struct member_norm { inline member_norm() {} inline member_norm(const member_norm& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size+5) * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.norm(); } }; template <typename ResultType> struct member_stableNorm { inline member_stableNorm() {} inline member_stableNorm(const member_stableNorm& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size+5) * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.stableNorm(); } }; template <typename ResultType> struct member_blueNorm { inline member_blueNorm() {} inline member_blueNorm(const member_blueNorm& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size+5) * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.blueNorm(); } }; template <typename ResultType> struct member_hypotNorm { inline member_hypotNorm() {} inline member_hypotNorm(const member_hypotNorm& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1) * functor_traits<scalar_hypot_op<Scalar> >::Cost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.hypotNorm(); } }; template <typename ResultType> struct member_sum { inline member_sum() {} inline member_sum(const member_sum& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.sum(); } }; template <typename ResultType> struct member_mean { inline member_mean() {} inline member_mean(const member_mean& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::AddCost + NumTraits<Scalar>::MulCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.mean(); } }; template <typename ResultType> struct member_minCoeff { inline member_minCoeff() {} inline member_minCoeff(const member_minCoeff& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.minCoeff(); } }; template <typename ResultType> struct member_maxCoeff { inline member_maxCoeff() {} inline member_maxCoeff(const member_maxCoeff& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.maxCoeff(); } }; template <typename ResultType> struct member_all { inline member_all() {} inline member_all(const member_all& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.all(); } }; template <typename ResultType> struct member_any { inline member_any() {} inline member_any(const member_any& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.any(); } }; template <typename ResultType> struct member_count { inline member_count() {} inline member_count(const member_count& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::AddCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.count(); } }; template <typename ResultType> struct member_prod { inline member_prod() {} inline member_prod(const member_prod& ) {} typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size-1)*NumTraits<Scalar>::MulCost }; }; template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.prod(); } }; template <int p, typename ResultType> struct member_lpnorm { typedef ResultType result_type; template<typename Scalar, int Size> struct Cost { enum { value = (Size+5) * NumTraits<Scalar>::MulCost + (Size-1)*NumTraits<Scalar>::AddCost }; }; member_lpnorm() {} template<typename XprType> inline ResultType operator()(const XprType& mat) const { return mat.template lpNorm<p>(); } }; template <typename BinaryOp, typename Scalar> struct member_redux { typedef typename result_of< BinaryOp(const Scalar&,const Scalar&) >::type result_type; template<typename _Scalar, int Size> struct Cost { enum { value = (Size-1) * functor_traits<BinaryOp>::Cost }; }; explicit member_redux(const BinaryOp func) : m_functor(func) {} template<typename Derived> inline result_type operator()(const DenseBase<Derived>& mat) const { return mat.redux(m_functor); } const BinaryOp m_functor; }; } # 156 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" template<typename ExpressionType, int Direction> class VectorwiseOp { public: typedef typename ExpressionType::Scalar Scalar; typedef typename ExpressionType::RealScalar RealScalar; typedef Eigen::Index Index; typedef typename internal::ref_selector<ExpressionType>::non_const_type ExpressionTypeNested; typedef typename internal::remove_all<ExpressionTypeNested>::type ExpressionTypeNestedCleaned; template<template<typename _Scalar> class Functor, typename Scalar_=Scalar> struct ReturnType { typedef PartialReduxExpr<ExpressionType, Functor<Scalar_>, Direction > Type; }; template<typename BinaryOp> struct ReduxReturnType { typedef PartialReduxExpr<ExpressionType, internal::member_redux<BinaryOp,Scalar>, Direction > Type; }; enum { isVertical = (Direction==Vertical) ? 1 : 0, isHorizontal = (Direction==Horizontal) ? 1 : 0 }; protected: typedef typename internal::conditional<isVertical, typename ExpressionType::ColXpr, typename ExpressionType::RowXpr>::type SubVector; SubVector subVector(Index i) { return SubVector(m_matrix.derived(),i); } Index subVectors() const { return isVertical?m_matrix.cols():m_matrix.rows(); } template<typename OtherDerived> struct ExtendedType { typedef Replicate<OtherDerived, isVertical ? 1 : ExpressionType::RowsAtCompileTime, isHorizontal ? 1 : ExpressionType::ColsAtCompileTime> Type; }; template<typename OtherDerived> typename ExtendedType<OtherDerived>::Type extendedTo(const DenseBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>((!(isVertical) || (OtherDerived::MaxColsAtCompileTime==1)))>::YOU_PASSED_A_ROW_VECTOR_BUT_A_COLUMN_VECTOR_WAS_EXPECTED) {} if (Eigen::internal::static_assertion<static_cast<bool>((!(isHorizontal) || (OtherDerived::MaxRowsAtCompileTime==1)))>::YOU_PASSED_A_COLUMN_VECTOR_BUT_A_ROW_VECTOR_WAS_EXPECTED) {} return typename ExtendedType<OtherDerived>::Type (other.derived(), isVertical ? 1 : m_matrix.rows(), isHorizontal ? 1 : m_matrix.cols()); } template<typename OtherDerived> struct OppositeExtendedType { typedef Replicate<OtherDerived, isHorizontal ? 1 : ExpressionType::RowsAtCompileTime, isVertical ? 1 : ExpressionType::ColsAtCompileTime> Type; }; template<typename OtherDerived> typename OppositeExtendedType<OtherDerived>::Type extendedToOpposite(const DenseBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>((!(isHorizontal) || (OtherDerived::MaxColsAtCompileTime==1)))>::YOU_PASSED_A_ROW_VECTOR_BUT_A_COLUMN_VECTOR_WAS_EXPECTED) {} if (Eigen::internal::static_assertion<static_cast<bool>((!(isVertical) || (OtherDerived::MaxRowsAtCompileTime==1)))>::YOU_PASSED_A_COLUMN_VECTOR_BUT_A_ROW_VECTOR_WAS_EXPECTED) {} return typename OppositeExtendedType<OtherDerived>::Type (other.derived(), isHorizontal ? 1 : m_matrix.rows(), isVertical ? 1 : m_matrix.cols()); } public: explicit inline VectorwiseOp(ExpressionType& matrix) : m_matrix(matrix) {} inline const ExpressionType& _expression() const { return m_matrix; } # 268 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" template<typename BinaryOp> const typename ReduxReturnType<BinaryOp>::Type redux(const BinaryOp& func = BinaryOp()) const { return typename ReduxReturnType<BinaryOp>::Type(_expression(), internal::member_redux<BinaryOp,Scalar>(func)); } typedef typename ReturnType<internal::member_minCoeff>::Type MinCoeffReturnType; typedef typename ReturnType<internal::member_maxCoeff>::Type MaxCoeffReturnType; typedef typename ReturnType<internal::member_squaredNorm,RealScalar>::Type SquaredNormReturnType; typedef typename ReturnType<internal::member_norm,RealScalar>::Type NormReturnType; typedef typename ReturnType<internal::member_blueNorm,RealScalar>::Type BlueNormReturnType; typedef typename ReturnType<internal::member_stableNorm,RealScalar>::Type StableNormReturnType; typedef typename ReturnType<internal::member_hypotNorm,RealScalar>::Type HypotNormReturnType; typedef typename ReturnType<internal::member_sum>::Type SumReturnType; typedef typename ReturnType<internal::member_mean>::Type MeanReturnType; typedef typename ReturnType<internal::member_all>::Type AllReturnType; typedef typename ReturnType<internal::member_any>::Type AnyReturnType; typedef PartialReduxExpr<ExpressionType, internal::member_count<Index>, Direction> CountReturnType; typedef typename ReturnType<internal::member_prod>::Type ProdReturnType; typedef Reverse<const ExpressionType, Direction> ConstReverseReturnType; typedef Reverse<ExpressionType, Direction> ReverseReturnType; template<int p> struct LpNormReturnType { typedef PartialReduxExpr<ExpressionType, internal::member_lpnorm<p,RealScalar>,Direction> Type; }; # 303 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const MinCoeffReturnType minCoeff() const { return MinCoeffReturnType(_expression()); } # 316 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const MaxCoeffReturnType maxCoeff() const { return MaxCoeffReturnType(_expression()); } # 328 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const SquaredNormReturnType squaredNorm() const { return SquaredNormReturnType(_expression()); } # 340 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const NormReturnType norm() const { return NormReturnType(_expression()); } # 352 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" template<int p> const typename LpNormReturnType<p>::Type lpNorm() const { return typename LpNormReturnType<p>::Type(_expression()); } # 364 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const BlueNormReturnType blueNorm() const { return BlueNormReturnType(_expression()); } # 375 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const StableNormReturnType stableNorm() const { return StableNormReturnType(_expression()); } # 386 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const HypotNormReturnType hypotNorm() const { return HypotNormReturnType(_expression()); } # 397 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const SumReturnType sum() const { return SumReturnType(_expression()); } const MeanReturnType mean() const { return MeanReturnType(_expression()); } const AllReturnType all() const { return AllReturnType(_expression()); } const AnyReturnType any() const { return AnyReturnType(_expression()); } # 436 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const CountReturnType count() const { return CountReturnType(_expression()); } # 447 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const ProdReturnType prod() const { return ProdReturnType(_expression()); } # 459 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" const ConstReverseReturnType reverse() const { return ConstReverseReturnType( _expression() ); } ReverseReturnType reverse() { return ReverseReturnType( _expression() ); } typedef Replicate<ExpressionType,(isVertical?Dynamic:1),(isHorizontal?Dynamic:1)> ReplicateReturnType; const ReplicateReturnType replicate(Index factor) const; # 485 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" template<int Factor> const Replicate<ExpressionType,isVertical*Factor+isHorizontal,isHorizontal*Factor+isVertical> replicate(Index factor = Factor) const { return Replicate<ExpressionType,(isVertical?Factor:1),(isHorizontal?Factor:1)> (_expression(),isVertical?factor:1,isHorizontal?factor:1); } template<typename OtherDerived> ExpressionType& operator=(const DenseBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} return const_cast<ExpressionType&>(m_matrix = extendedTo(other.derived())); } template<typename OtherDerived> ExpressionType& operator+=(const DenseBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} return const_cast<ExpressionType&>(m_matrix += extendedTo(other.derived())); } template<typename OtherDerived> ExpressionType& operator-=(const DenseBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} return const_cast<ExpressionType&>(m_matrix -= extendedTo(other.derived())); } template<typename OtherDerived> ExpressionType& operator*=(const DenseBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, ArrayXpr>::value))>::THIS_METHOD_IS_ONLY_FOR_ARRAYS_NOT_MATRICES) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} m_matrix *= extendedTo(other.derived()); return const_cast<ExpressionType&>(m_matrix); } template<typename OtherDerived> ExpressionType& operator/=(const DenseBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, ArrayXpr>::value))>::THIS_METHOD_IS_ONLY_FOR_ARRAYS_NOT_MATRICES) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} m_matrix /= extendedTo(other.derived()); return const_cast<ExpressionType&>(m_matrix); } template<typename OtherDerived> inline CwiseBinaryOp<internal::scalar_sum_op<Scalar,typename OtherDerived::Scalar>, const ExpressionTypeNestedCleaned, const typename ExtendedType<OtherDerived>::Type> operator+(const DenseBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} return m_matrix + extendedTo(other.derived()); } template<typename OtherDerived> CwiseBinaryOp<internal::scalar_difference_op<Scalar,typename OtherDerived::Scalar>, const ExpressionTypeNestedCleaned, const typename ExtendedType<OtherDerived>::Type> operator-(const DenseBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} return m_matrix - extendedTo(other.derived()); } template<typename OtherDerived> inline CwiseBinaryOp<internal::scalar_product_op<Scalar>, const ExpressionTypeNestedCleaned, const typename ExtendedType<OtherDerived>::Type> operator*(const DenseBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, ArrayXpr>::value))>::THIS_METHOD_IS_ONLY_FOR_ARRAYS_NOT_MATRICES) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} return m_matrix * extendedTo(other.derived()); } template<typename OtherDerived> CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const ExpressionTypeNestedCleaned, const typename ExtendedType<OtherDerived>::Type> operator/(const DenseBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, ArrayXpr>::value))>::THIS_METHOD_IS_ONLY_FOR_ARRAYS_NOT_MATRICES) {} if (Eigen::internal::static_assertion<static_cast<bool>((Eigen::internal::is_same<typename Eigen::internal::traits<ExpressionType>::XprKind, typename Eigen::internal::traits<OtherDerived>::XprKind >::value))>::YOU_CANNOT_MIX_ARRAYS_AND_MATRICES) {} return m_matrix / extendedTo(other.derived()); } CwiseBinaryOp<internal::scalar_quotient_op<Scalar>, const ExpressionTypeNestedCleaned, const typename OppositeExtendedType<typename ReturnType<internal::member_norm,RealScalar>::Type>::Type> normalized() const { return m_matrix.cwiseQuotient(extendedToOpposite(this->norm())); } void normalize() { m_matrix = this->normalized(); } inline void reverseInPlace(); typedef Homogeneous<ExpressionType,Direction> HomogeneousReturnType; HomogeneousReturnType homogeneous() const; typedef typename ExpressionType::PlainObject CrossReturnType; template<typename OtherDerived> const CrossReturnType cross(const MatrixBase<OtherDerived>& other) const; enum { HNormalized_Size = Direction==Vertical ? internal::traits<ExpressionType>::RowsAtCompileTime : internal::traits<ExpressionType>::ColsAtCompileTime, HNormalized_SizeMinusOne = HNormalized_Size==Dynamic ? Dynamic : HNormalized_Size-1 }; typedef Block<const ExpressionType, Direction==Vertical ? int(HNormalized_SizeMinusOne) : int(internal::traits<ExpressionType>::RowsAtCompileTime), Direction==Horizontal ? int(HNormalized_SizeMinusOne) : int(internal::traits<ExpressionType>::ColsAtCompileTime)> HNormalized_Block; typedef Block<const ExpressionType, Direction==Vertical ? 1 : int(internal::traits<ExpressionType>::RowsAtCompileTime), Direction==Horizontal ? 1 : int(internal::traits<ExpressionType>::ColsAtCompileTime)> HNormalized_Factors; typedef CwiseBinaryOp<internal::scalar_quotient_op<typename internal::traits<ExpressionType>::Scalar>, const HNormalized_Block, const Replicate<HNormalized_Factors, Direction==Vertical ? HNormalized_SizeMinusOne : 1, Direction==Horizontal ? HNormalized_SizeMinusOne : 1> > HNormalizedReturnType; const HNormalizedReturnType hnormalized() const; protected: ExpressionTypeNested m_matrix; }; # 672 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" template<typename Derived> inline typename DenseBase<Derived>::ColwiseReturnType DenseBase<Derived>::colwise() { return ColwiseReturnType(derived()); } # 686 "eigen-3.3.7/Eigen/src/Core/VectorwiseOp.h" template<typename Derived> inline typename DenseBase<Derived>::RowwiseReturnType DenseBase<Derived>::rowwise() { return RowwiseReturnType(derived()); } } # 513 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Random.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Random.h" namespace Eigen { namespace internal { template<typename Scalar> struct scalar_random_op { inline scalar_random_op() {} inline scalar_random_op(const scalar_random_op& ) {} inline const Scalar operator() () const { return random<Scalar>(); } }; template<typename Scalar> struct functor_traits<scalar_random_op<Scalar> > { enum { Cost = 5 * NumTraits<Scalar>::MulCost, PacketAccess = false, IsRepeatable = false }; }; } # 54 "eigen-3.3.7/Eigen/src/Core/Random.h" template<typename Derived> inline const typename DenseBase<Derived>::RandomReturnType DenseBase<Derived>::Random(Index rows, Index cols) { return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>()); } # 85 "eigen-3.3.7/Eigen/src/Core/Random.h" template<typename Derived> inline const typename DenseBase<Derived>::RandomReturnType DenseBase<Derived>::Random(Index size) { return NullaryExpr(size, internal::scalar_random_op<Scalar>()); } # 111 "eigen-3.3.7/Eigen/src/Core/Random.h" template<typename Derived> inline const typename DenseBase<Derived>::RandomReturnType DenseBase<Derived>::Random() { return NullaryExpr(RowsAtCompileTime, ColsAtCompileTime, internal::scalar_random_op<Scalar>()); } # 130 "eigen-3.3.7/Eigen/src/Core/Random.h" template<typename Derived> inline Derived& DenseBase<Derived>::setRandom() { return *this = Random(rows(), cols()); } # 149 "eigen-3.3.7/Eigen/src/Core/Random.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setRandom(Index newSize) { resize(newSize); return setRandom(); } # 172 "eigen-3.3.7/Eigen/src/Core/Random.h" template<typename Derived> inline Derived& PlainObjectBase<Derived>::setRandom(Index rows, Index cols) { resize(rows, cols); return setRandom(); } } # 514 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Replicate.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/Replicate.h" namespace Eigen { namespace internal { template<typename MatrixType,int RowFactor,int ColFactor> struct traits<Replicate<MatrixType,RowFactor,ColFactor> > : traits<MatrixType> { typedef typename MatrixType::Scalar Scalar; typedef typename traits<MatrixType>::StorageKind StorageKind; typedef typename traits<MatrixType>::XprKind XprKind; typedef typename ref_selector<MatrixType>::type MatrixTypeNested; typedef typename remove_reference<MatrixTypeNested>::type _MatrixTypeNested; enum { RowsAtCompileTime = RowFactor==Dynamic || int(MatrixType::RowsAtCompileTime)==Dynamic ? Dynamic : RowFactor * MatrixType::RowsAtCompileTime, ColsAtCompileTime = ColFactor==Dynamic || int(MatrixType::ColsAtCompileTime)==Dynamic ? Dynamic : ColFactor * MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = RowsAtCompileTime, MaxColsAtCompileTime = ColsAtCompileTime, IsRowMajor = MaxRowsAtCompileTime==1 && MaxColsAtCompileTime!=1 ? 1 : MaxColsAtCompileTime==1 && MaxRowsAtCompileTime!=1 ? 0 : (MatrixType::Flags & RowMajorBit) ? 1 : 0, Flags = IsRowMajor ? RowMajorBit : 0 }; }; } # 61 "eigen-3.3.7/Eigen/src/Core/Replicate.h" template<typename MatrixType,int RowFactor,int ColFactor> class Replicate : public internal::dense_xpr_base< Replicate<MatrixType,RowFactor,ColFactor> >::type { typedef typename internal::traits<Replicate>::MatrixTypeNested MatrixTypeNested; typedef typename internal::traits<Replicate>::_MatrixTypeNested _MatrixTypeNested; public: typedef typename internal::dense_xpr_base<Replicate>::type Base; typedef typename Eigen::internal::traits<Replicate>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Replicate>::type Nested; typedef typename Eigen::internal::traits<Replicate>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Replicate>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Replicate>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Replicate>::ColsAtCompileTime, Flags = Eigen::internal::traits<Replicate>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; typedef typename internal::remove_all<MatrixType>::type NestedExpression; template<typename OriginalMatrixType> inline explicit Replicate(const OriginalMatrixType& matrix) : m_matrix(matrix), m_rowFactor(RowFactor), m_colFactor(ColFactor) { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<typename internal::remove_const<MatrixType>::type,OriginalMatrixType>::value))>::THE_MATRIX_OR_EXPRESSION_THAT_YOU_PASSED_DOES_NOT_HAVE_THE_EXPECTED_TYPE) {} ((RowFactor!=Dynamic && ColFactor!=Dynamic) ? static_cast<void> (0) : __assert_fail ("RowFactor!=Dynamic && ColFactor!=Dynamic", "eigen-3.3.7/Eigen/src/Core/Replicate.h", 79, __PRETTY_FUNCTION__)); } template<typename OriginalMatrixType> inline Replicate(const OriginalMatrixType& matrix, Index rowFactor, Index colFactor) : m_matrix(matrix), m_rowFactor(rowFactor), m_colFactor(colFactor) { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<typename internal::remove_const<MatrixType>::type,OriginalMatrixType>::value))>::THE_MATRIX_OR_EXPRESSION_THAT_YOU_PASSED_DOES_NOT_HAVE_THE_EXPECTED_TYPE) {} } inline Index rows() const { return m_matrix.rows() * m_rowFactor.value(); } inline Index cols() const { return m_matrix.cols() * m_colFactor.value(); } const _MatrixTypeNested& nestedExpression() const { return m_matrix; } protected: MatrixTypeNested m_matrix; const internal::variable_if_dynamic<Index, RowFactor> m_rowFactor; const internal::variable_if_dynamic<Index, ColFactor> m_colFactor; }; # 116 "eigen-3.3.7/Eigen/src/Core/Replicate.h" template<typename Derived> template<int RowFactor, int ColFactor> const Replicate<Derived,RowFactor,ColFactor> DenseBase<Derived>::replicate() const { return Replicate<Derived,RowFactor,ColFactor>(derived()); } # 132 "eigen-3.3.7/Eigen/src/Core/Replicate.h" template<typename ExpressionType, int Direction> const typename VectorwiseOp<ExpressionType,Direction>::ReplicateReturnType VectorwiseOp<ExpressionType,Direction>::replicate(Index factor) const { return typename VectorwiseOp<ExpressionType,Direction>::ReplicateReturnType (_expression(),Direction==Vertical?factor:1,Direction==Horizontal?factor:1); } } # 515 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/Reverse.h" 1 # 15 "eigen-3.3.7/Eigen/src/Core/Reverse.h" namespace Eigen { namespace internal { template<typename MatrixType, int Direction> struct traits<Reverse<MatrixType, Direction> > : traits<MatrixType> { typedef typename MatrixType::Scalar Scalar; typedef typename traits<MatrixType>::StorageKind StorageKind; typedef typename traits<MatrixType>::XprKind XprKind; typedef typename ref_selector<MatrixType>::type MatrixTypeNested; typedef typename remove_reference<MatrixTypeNested>::type _MatrixTypeNested; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, Flags = _MatrixTypeNested::Flags & (RowMajorBit | LvalueBit) }; }; template<typename PacketType, bool ReversePacket> struct reverse_packet_cond { static inline PacketType run(const PacketType& x) { return preverse(x); } }; template<typename PacketType> struct reverse_packet_cond<PacketType,false> { static inline PacketType run(const PacketType& x) { return x; } }; } # 63 "eigen-3.3.7/Eigen/src/Core/Reverse.h" template<typename MatrixType, int Direction> class Reverse : public internal::dense_xpr_base< Reverse<MatrixType, Direction> >::type { public: typedef typename internal::dense_xpr_base<Reverse>::type Base; typedef typename Eigen::internal::traits<Reverse>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Reverse>::type Nested; typedef typename Eigen::internal::traits<Reverse>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Reverse>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Reverse>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Reverse>::ColsAtCompileTime, Flags = Eigen::internal::traits<Reverse>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; typedef typename internal::remove_all<MatrixType>::type NestedExpression; using Base::IsRowMajor; protected: enum { PacketSize = internal::packet_traits<Scalar>::size, IsColMajor = !IsRowMajor, ReverseRow = (Direction == Vertical) || (Direction == BothDirections), ReverseCol = (Direction == Horizontal) || (Direction == BothDirections), OffsetRow = ReverseRow && IsColMajor ? PacketSize : 1, OffsetCol = ReverseCol && IsRowMajor ? PacketSize : 1, ReversePacket = (Direction == BothDirections) || ((Direction == Vertical) && IsColMajor) || ((Direction == Horizontal) && IsRowMajor) }; typedef internal::reverse_packet_cond<PacketScalar,ReversePacket> reverse_packet; public: explicit inline Reverse(const MatrixType& matrix) : m_matrix(matrix) { } using Base::operator =; inline Reverse& operator=(const Reverse& other) { Base::operator=(other); return *this; } inline Index rows() const { return m_matrix.rows(); } inline Index cols() const { return m_matrix.cols(); } inline Index innerStride() const { return -m_matrix.innerStride(); } const typename internal::remove_all<typename MatrixType::Nested>::type& nestedExpression() const { return m_matrix; } protected: typename MatrixType::Nested m_matrix; }; template<typename Derived> inline typename DenseBase<Derived>::ReverseReturnType DenseBase<Derived>::reverse() { return ReverseReturnType(derived()); } # 138 "eigen-3.3.7/Eigen/src/Core/Reverse.h" template<typename Derived> inline void DenseBase<Derived>::reverseInPlace() { if(cols()>rows()) { Index half = cols()/2; leftCols(half).swap(rightCols(half).reverse()); if((cols()%2)==1) { Index half2 = rows()/2; col(half).head(half2).swap(col(half).tail(half2).reverse()); } } else { Index half = rows()/2; topRows(half).swap(bottomRows(half).reverse()); if((rows()%2)==1) { Index half2 = cols()/2; row(half).head(half2).swap(row(half).tail(half2).reverse()); } } } namespace internal { template<int Direction> struct vectorwise_reverse_inplace_impl; template<> struct vectorwise_reverse_inplace_impl<Vertical> { template<typename ExpressionType> static void run(ExpressionType &xpr) { Index half = xpr.rows()/2; xpr.topRows(half).swap(xpr.bottomRows(half).colwise().reverse()); } }; template<> struct vectorwise_reverse_inplace_impl<Horizontal> { template<typename ExpressionType> static void run(ExpressionType &xpr) { Index half = xpr.cols()/2; xpr.leftCols(half).swap(xpr.rightCols(half).rowwise().reverse()); } }; } # 203 "eigen-3.3.7/Eigen/src/Core/Reverse.h" template<typename ExpressionType, int Direction> void VectorwiseOp<ExpressionType,Direction>::reverseInPlace() { internal::vectorwise_reverse_inplace_impl<Direction>::run(_expression().const_cast_derived()); } } # 516 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/ArrayWrapper.h" 1 # 13 "eigen-3.3.7/Eigen/src/Core/ArrayWrapper.h" namespace Eigen { # 26 "eigen-3.3.7/Eigen/src/Core/ArrayWrapper.h" namespace internal { template<typename ExpressionType> struct traits<ArrayWrapper<ExpressionType> > : public traits<typename remove_all<typename ExpressionType::Nested>::type > { typedef ArrayXpr XprKind; enum { Flags0 = traits<typename remove_all<typename ExpressionType::Nested>::type >::Flags, LvalueBitFlag = is_lvalue<ExpressionType>::value ? LvalueBit : 0, Flags = (Flags0 & ~(NestByRefBit | LvalueBit)) | LvalueBitFlag }; }; } template<typename ExpressionType> class ArrayWrapper : public ArrayBase<ArrayWrapper<ExpressionType> > { public: typedef ArrayBase<ArrayWrapper> Base; typedef typename Eigen::internal::traits<ArrayWrapper>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<ArrayWrapper>::type Nested; typedef typename Eigen::internal::traits<ArrayWrapper>::StorageKind StorageKind; typedef typename Eigen::internal::traits<ArrayWrapper>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<ArrayWrapper>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<ArrayWrapper>::ColsAtCompileTime, Flags = Eigen::internal::traits<ArrayWrapper>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; using Base::operator =; inline ArrayWrapper& operator=(const ArrayWrapper& other) { Base::operator=(other); return *this; } typedef typename internal::remove_all<ExpressionType>::type NestedExpression; typedef typename internal::conditional< internal::is_lvalue<ExpressionType>::value, Scalar, const Scalar >::type ScalarWithConstIfNotLvalue; typedef typename internal::ref_selector<ExpressionType>::non_const_type NestedExpressionType; using Base::coeffRef; explicit inline ArrayWrapper(ExpressionType& matrix) : m_expression(matrix) {} inline Index rows() const { return m_expression.rows(); } inline Index cols() const { return m_expression.cols(); } inline Index outerStride() const { return m_expression.outerStride(); } inline Index innerStride() const { return m_expression.innerStride(); } inline ScalarWithConstIfNotLvalue* data() { return m_expression.data(); } inline const Scalar* data() const { return m_expression.data(); } inline const Scalar& coeffRef(Index rowId, Index colId) const { return m_expression.coeffRef(rowId, colId); } inline const Scalar& coeffRef(Index index) const { return m_expression.coeffRef(index); } template<typename Dest> inline void evalTo(Dest& dst) const { dst = m_expression; } const typename internal::remove_all<NestedExpressionType>::type& nestedExpression() const { return m_expression; } void resize(Index newSize) { m_expression.resize(newSize); } void resize(Index rows, Index cols) { m_expression.resize(rows,cols); } protected: NestedExpressionType m_expression; }; # 124 "eigen-3.3.7/Eigen/src/Core/ArrayWrapper.h" namespace internal { template<typename ExpressionType> struct traits<MatrixWrapper<ExpressionType> > : public traits<typename remove_all<typename ExpressionType::Nested>::type > { typedef MatrixXpr XprKind; enum { Flags0 = traits<typename remove_all<typename ExpressionType::Nested>::type >::Flags, LvalueBitFlag = is_lvalue<ExpressionType>::value ? LvalueBit : 0, Flags = (Flags0 & ~(NestByRefBit | LvalueBit)) | LvalueBitFlag }; }; } template<typename ExpressionType> class MatrixWrapper : public MatrixBase<MatrixWrapper<ExpressionType> > { public: typedef MatrixBase<MatrixWrapper<ExpressionType> > Base; typedef typename Eigen::internal::traits<MatrixWrapper>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<MatrixWrapper>::type Nested; typedef typename Eigen::internal::traits<MatrixWrapper>::StorageKind StorageKind; typedef typename Eigen::internal::traits<MatrixWrapper>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<MatrixWrapper>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<MatrixWrapper>::ColsAtCompileTime, Flags = Eigen::internal::traits<MatrixWrapper>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; using Base::operator =; inline MatrixWrapper& operator=(const MatrixWrapper& other) { Base::operator=(other); return *this; } typedef typename internal::remove_all<ExpressionType>::type NestedExpression; typedef typename internal::conditional< internal::is_lvalue<ExpressionType>::value, Scalar, const Scalar >::type ScalarWithConstIfNotLvalue; typedef typename internal::ref_selector<ExpressionType>::non_const_type NestedExpressionType; using Base::coeffRef; explicit inline MatrixWrapper(ExpressionType& matrix) : m_expression(matrix) {} inline Index rows() const { return m_expression.rows(); } inline Index cols() const { return m_expression.cols(); } inline Index outerStride() const { return m_expression.outerStride(); } inline Index innerStride() const { return m_expression.innerStride(); } inline ScalarWithConstIfNotLvalue* data() { return m_expression.data(); } inline const Scalar* data() const { return m_expression.data(); } inline const Scalar& coeffRef(Index rowId, Index colId) const { return m_expression.derived().coeffRef(rowId, colId); } inline const Scalar& coeffRef(Index index) const { return m_expression.coeffRef(index); } const typename internal::remove_all<NestedExpressionType>::type& nestedExpression() const { return m_expression; } void resize(Index newSize) { m_expression.resize(newSize); } void resize(Index rows, Index cols) { m_expression.resize(rows,cols); } protected: NestedExpressionType m_expression; }; } # 517 "eigen-3.3.7/Eigen/Core" 2 # 533 "eigen-3.3.7/Eigen/Core" # 1 "eigen-3.3.7/Eigen/src/Core/GlobalFunctions.h" 1 # 54 "eigen-3.3.7/Eigen/src/Core/GlobalFunctions.h" namespace Eigen { template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_real_op<typename Derived::Scalar>, const Derived> (real)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_real_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_imag_op<typename Derived::Scalar>, const Derived> (imag)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_imag_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_conjugate_op<typename Derived::Scalar>, const Derived> (conj)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_conjugate_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<typename Derived::Scalar>, const Derived> (inverse)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_inverse_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_sin_op<typename Derived::Scalar>, const Derived> (sin)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_sin_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_cos_op<typename Derived::Scalar>, const Derived> (cos)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_cos_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_tan_op<typename Derived::Scalar>, const Derived> (tan)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_tan_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_atan_op<typename Derived::Scalar>, const Derived> (atan)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_atan_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_asin_op<typename Derived::Scalar>, const Derived> (asin)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_asin_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_acos_op<typename Derived::Scalar>, const Derived> (acos)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_acos_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_sinh_op<typename Derived::Scalar>, const Derived> (sinh)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_sinh_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_cosh_op<typename Derived::Scalar>, const Derived> (cosh)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_cosh_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_tanh_op<typename Derived::Scalar>, const Derived> (tanh)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_tanh_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_lgamma_op<typename Derived::Scalar>, const Derived> (lgamma)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_lgamma_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_digamma_op<typename Derived::Scalar>, const Derived> (digamma)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_digamma_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_erf_op<typename Derived::Scalar>, const Derived> (erf)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_erf_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_erfc_op<typename Derived::Scalar>, const Derived> (erfc)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_erfc_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_exp_op<typename Derived::Scalar>, const Derived> (exp)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_exp_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_log_op<typename Derived::Scalar>, const Derived> (log)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_log_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_log1p_op<typename Derived::Scalar>, const Derived> (log1p)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_log1p_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_log10_op<typename Derived::Scalar>, const Derived> (log10)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_log10_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<typename Derived::Scalar>, const Derived> (abs)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<typename Derived::Scalar>, const Derived> (abs2)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_arg_op<typename Derived::Scalar>, const Derived> (arg)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_arg_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_sqrt_op<typename Derived::Scalar>, const Derived> (sqrt)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_sqrt_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_rsqrt_op<typename Derived::Scalar>, const Derived> (rsqrt)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_rsqrt_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_square_op<typename Derived::Scalar>, const Derived> (square)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_square_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_cube_op<typename Derived::Scalar>, const Derived> (cube)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_cube_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_round_op<typename Derived::Scalar>, const Derived> (round)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_round_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_floor_op<typename Derived::Scalar>, const Derived> (floor)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_floor_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_ceil_op<typename Derived::Scalar>, const Derived> (ceil)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_ceil_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_isnan_op<typename Derived::Scalar>, const Derived> (isnan)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_isnan_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_isinf_op<typename Derived::Scalar>, const Derived> (isinf)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_isinf_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_isfinite_op<typename Derived::Scalar>, const Derived> (isfinite)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_isfinite_op<typename Derived::Scalar>, const Derived>(x.derived()); } template<typename Derived> inline const Eigen::CwiseUnaryOp<Eigen::internal::scalar_sign_op<typename Derived::Scalar>, const Derived> (sign)(const Eigen::ArrayBase<Derived>& x) { return Eigen::CwiseUnaryOp<Eigen::internal::scalar_sign_op<typename Derived::Scalar>, const Derived>(x.derived()); } # 105 "eigen-3.3.7/Eigen/src/Core/GlobalFunctions.h" template<typename Derived,typename ScalarExponent> inline typename internal::enable_if< !(internal::is_same<typename Derived::Scalar,ScalarExponent>::value) && (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<typename Derived::Scalar,ScalarExponent,Eigen::internal::scalar_pow_op<typename Derived::Scalar,ScalarExponent> > >::value), const CwiseBinaryOp<internal::scalar_pow_op<typename internal::traits<Derived>::Scalar,ScalarExponent>, const Derived, const typename internal::plain_constant_type<Derived,ScalarExponent>::type> >::type pow(const Eigen::ArrayBase<Derived>& x, const ScalarExponent& exponent) { return x.derived().pow(exponent); } template<typename Derived> inline const CwiseBinaryOp<internal::scalar_pow_op<typename internal::traits<Derived>::Scalar,typename Derived::Scalar>, const Derived, const typename internal::plain_constant_type<Derived,typename Derived::Scalar>::type> pow(const Eigen::ArrayBase<Derived>& x, const typename Derived::Scalar& exponent) { return x.derived().pow(exponent); } # 130 "eigen-3.3.7/Eigen/src/Core/GlobalFunctions.h" template<typename Derived,typename ExponentDerived> inline const Eigen::CwiseBinaryOp<Eigen::internal::scalar_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived> pow(const Eigen::ArrayBase<Derived>& x, const Eigen::ArrayBase<ExponentDerived>& exponents) { return Eigen::CwiseBinaryOp<Eigen::internal::scalar_pow_op<typename Derived::Scalar, typename ExponentDerived::Scalar>, const Derived, const ExponentDerived>( x.derived(), exponents.derived() ); } # 158 "eigen-3.3.7/Eigen/src/Core/GlobalFunctions.h" template<typename Scalar, typename Derived> inline typename internal::enable_if< !(internal::is_same<typename Derived::Scalar,Scalar>::value) && (Eigen::internal::has_ReturnType<Eigen::ScalarBinaryOpTraits<Scalar,typename Derived::Scalar,Eigen::internal::scalar_pow_op<Scalar,typename Derived::Scalar> > >::value), const CwiseBinaryOp<internal::scalar_pow_op<Scalar,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,Scalar>::type, const Derived> >::type pow(const Scalar& x, const Eigen::ArrayBase<Derived>& exponents) { return CwiseBinaryOp<internal::scalar_pow_op<Scalar,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,Scalar>::type, const Derived>( typename internal::plain_constant_type<Derived,Scalar>::type(exponents.rows(), exponents.cols(), x), exponents.derived() ); } template<typename Derived> inline const CwiseBinaryOp<internal::scalar_pow_op<typename Derived::Scalar,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,typename Derived::Scalar>::type, const Derived> pow(const typename Derived::Scalar& x, const Eigen::ArrayBase<Derived>& exponents) { return CwiseBinaryOp<internal::scalar_pow_op<typename Derived::Scalar,typename internal::traits<Derived>::Scalar>, const typename internal::plain_constant_type<Derived,typename Derived::Scalar>::type, const Derived>( typename internal::plain_constant_type<Derived,typename Derived::Scalar>::type(exponents.rows(), exponents.cols(), x), exponents.derived() ); } namespace internal { template<typename Derived> struct real_retval<ArrayBase<Derived> > { typedef const Eigen::CwiseUnaryOp<Eigen::internal::scalar_real_op<typename Derived::Scalar>, const Derived> type; }; template<typename Derived> struct real_impl<ArrayBase<Derived> > { static inline typename real_retval<ArrayBase<Derived> >::type run(const Eigen::ArrayBase<Derived>& x) { return typename real_retval<ArrayBase<Derived> >::type(x.derived()); } }; template<typename Derived> struct imag_retval<ArrayBase<Derived> > { typedef const Eigen::CwiseUnaryOp<Eigen::internal::scalar_imag_op<typename Derived::Scalar>, const Derived> type; }; template<typename Derived> struct imag_impl<ArrayBase<Derived> > { static inline typename imag_retval<ArrayBase<Derived> >::type run(const Eigen::ArrayBase<Derived>& x) { return typename imag_retval<ArrayBase<Derived> >::type(x.derived()); } }; template<typename Derived> struct abs2_retval<ArrayBase<Derived> > { typedef const Eigen::CwiseUnaryOp<Eigen::internal::scalar_abs2_op<typename Derived::Scalar>, const Derived> type; }; template<typename Derived> struct abs2_impl<ArrayBase<Derived> > { static inline typename abs2_retval<ArrayBase<Derived> >::type run(const Eigen::ArrayBase<Derived>& x) { return typename abs2_retval<ArrayBase<Derived> >::type(x.derived()); } }; } } # 534 "eigen-3.3.7/Eigen/Core" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 12 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" #pragma GCC diagnostic pop # 536 "eigen-3.3.7/Eigen/Core" 2 # 12 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" 1 # 49 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wshadow" #pragma GCC diagnostic ignored "-Wtype-limits" # 14 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/SVD" 1 # 11 "eigen-3.3.7/Eigen/SVD" # 1 "eigen-3.3.7/Eigen/QR" 1 # 15 "eigen-3.3.7/Eigen/QR" # 1 "eigen-3.3.7/Eigen/Cholesky" 1 # 12 "eigen-3.3.7/Eigen/Cholesky" # 1 "eigen-3.3.7/Eigen/Jacobi" 1 # 27 "eigen-3.3.7/Eigen/Jacobi" # 1 "eigen-3.3.7/Eigen/src/Jacobi/Jacobi.h" 1 # 14 "eigen-3.3.7/Eigen/src/Jacobi/Jacobi.h" namespace Eigen { # 34 "eigen-3.3.7/Eigen/src/Jacobi/Jacobi.h" template<typename Scalar> class JacobiRotation { public: typedef typename NumTraits<Scalar>::Real RealScalar; JacobiRotation() {} JacobiRotation(const Scalar& c, const Scalar& s) : m_c(c), m_s(s) {} Scalar& c() { return m_c; } Scalar c() const { return m_c; } Scalar& s() { return m_s; } Scalar s() const { return m_s; } JacobiRotation operator*(const JacobiRotation& other) { using numext::conj; return JacobiRotation(m_c * other.m_c - conj(m_s) * other.m_s, conj(m_c * conj(other.m_s) + conj(m_s) * conj(other.m_c))); } JacobiRotation transpose() const { using numext::conj; return JacobiRotation(m_c, -conj(m_s)); } JacobiRotation adjoint() const { using numext::conj; return JacobiRotation(conj(m_c), -m_s); } template<typename Derived> bool makeJacobi(const MatrixBase<Derived>&, Index p, Index q); bool makeJacobi(const RealScalar& x, const Scalar& y, const RealScalar& z); void makeGivens(const Scalar& p, const Scalar& q, Scalar* r=0); protected: void makeGivens(const Scalar& p, const Scalar& q, Scalar* r, internal::true_type); void makeGivens(const Scalar& p, const Scalar& q, Scalar* r, internal::false_type); Scalar m_c, m_s; }; template<typename Scalar> bool JacobiRotation<Scalar>::makeJacobi(const RealScalar& x, const Scalar& y, const RealScalar& z) { using std::sqrt; using std::abs; RealScalar deno = RealScalar(2)*abs(y); if(deno < (std::numeric_limits<RealScalar>::min)()) { m_c = Scalar(1); m_s = Scalar(0); return false; } else { RealScalar tau = (x-z)/deno; RealScalar w = sqrt(numext::abs2(tau) + RealScalar(1)); RealScalar t; if(tau>RealScalar(0)) { t = RealScalar(1) / (tau + w); } else { t = RealScalar(1) / (tau - w); } RealScalar sign_t = t > RealScalar(0) ? RealScalar(1) : RealScalar(-1); RealScalar n = RealScalar(1) / sqrt(numext::abs2(t)+RealScalar(1)); m_s = - sign_t * (numext::conj(y) / abs(y)) * abs(t) * n; m_c = n; return true; } } # 124 "eigen-3.3.7/Eigen/src/Jacobi/Jacobi.h" template<typename Scalar> template<typename Derived> inline bool JacobiRotation<Scalar>::makeJacobi(const MatrixBase<Derived>& m, Index p, Index q) { return makeJacobi(numext::real(m.coeff(p,p)), m.coeff(p,q), numext::real(m.coeff(q,q))); } # 147 "eigen-3.3.7/Eigen/src/Jacobi/Jacobi.h" template<typename Scalar> void JacobiRotation<Scalar>::makeGivens(const Scalar& p, const Scalar& q, Scalar* r) { makeGivens(p, q, r, typename internal::conditional<NumTraits<Scalar>::IsComplex, internal::true_type, internal::false_type>::type()); } template<typename Scalar> void JacobiRotation<Scalar>::makeGivens(const Scalar& p, const Scalar& q, Scalar* r, internal::true_type) { using std::sqrt; using std::abs; using numext::conj; if(q==Scalar(0)) { m_c = numext::real(p)<0 ? Scalar(-1) : Scalar(1); m_s = 0; if(r) *r = m_c * p; } else if(p==Scalar(0)) { m_c = 0; m_s = -q/abs(q); if(r) *r = abs(q); } else { RealScalar p1 = numext::norm1(p); RealScalar q1 = numext::norm1(q); if(p1>=q1) { Scalar ps = p / p1; RealScalar p2 = numext::abs2(ps); Scalar qs = q / p1; RealScalar q2 = numext::abs2(qs); RealScalar u = sqrt(RealScalar(1) + q2/p2); if(numext::real(p)<RealScalar(0)) u = -u; m_c = Scalar(1)/u; m_s = -qs*conj(ps)*(m_c/p2); if(r) *r = p * u; } else { Scalar ps = p / q1; RealScalar p2 = numext::abs2(ps); Scalar qs = q / q1; RealScalar q2 = numext::abs2(qs); RealScalar u = q1 * sqrt(p2 + q2); if(numext::real(p)<RealScalar(0)) u = -u; p1 = abs(p); ps = p/p1; m_c = p1/u; m_s = -conj(ps) * (q/u); if(r) *r = ps * u; } } } template<typename Scalar> void JacobiRotation<Scalar>::makeGivens(const Scalar& p, const Scalar& q, Scalar* r, internal::false_type) { using std::sqrt; using std::abs; if(q==Scalar(0)) { m_c = p<Scalar(0) ? Scalar(-1) : Scalar(1); m_s = Scalar(0); if(r) *r = abs(p); } else if(p==Scalar(0)) { m_c = Scalar(0); m_s = q<Scalar(0) ? Scalar(1) : Scalar(-1); if(r) *r = abs(q); } else if(abs(p) > abs(q)) { Scalar t = q/p; Scalar u = sqrt(Scalar(1) + numext::abs2(t)); if(p<Scalar(0)) u = -u; m_c = Scalar(1)/u; m_s = -t * m_c; if(r) *r = p * u; } else { Scalar t = p/q; Scalar u = sqrt(Scalar(1) + numext::abs2(t)); if(q<Scalar(0)) u = -u; m_s = -Scalar(1)/u; m_c = -t * m_s; if(r) *r = q * u; } } namespace internal { template<typename VectorX, typename VectorY, typename OtherScalar> void apply_rotation_in_the_plane(DenseBase<VectorX>& xpr_x, DenseBase<VectorY>& xpr_y, const JacobiRotation<OtherScalar>& j); } template<typename Derived> template<typename OtherScalar> inline void MatrixBase<Derived>::applyOnTheLeft(Index p, Index q, const JacobiRotation<OtherScalar>& j) { RowXpr x(this->row(p)); RowXpr y(this->row(q)); internal::apply_rotation_in_the_plane(x, y, j); } template<typename Derived> template<typename OtherScalar> inline void MatrixBase<Derived>::applyOnTheRight(Index p, Index q, const JacobiRotation<OtherScalar>& j) { ColXpr x(this->col(p)); ColXpr y(this->col(q)); internal::apply_rotation_in_the_plane(x, y, j.transpose()); } namespace internal { template<typename Scalar, typename OtherScalar, int SizeAtCompileTime, int MinAlignment, bool Vectorizable> struct apply_rotation_in_the_plane_selector { static inline void run(Scalar *x, Index incrx, Scalar *y, Index incry, Index size, OtherScalar c, OtherScalar s) { for(Index i=0; i<size; ++i) { Scalar xi = *x; Scalar yi = *y; *x = c * xi + numext::conj(s) * yi; *y = -s * xi + numext::conj(c) * yi; x += incrx; y += incry; } } }; template<typename Scalar, typename OtherScalar, int SizeAtCompileTime, int MinAlignment> struct apply_rotation_in_the_plane_selector<Scalar,OtherScalar,SizeAtCompileTime,MinAlignment,true > { static inline void run(Scalar *x, Index incrx, Scalar *y, Index incry, Index size, OtherScalar c, OtherScalar s) { enum { PacketSize = packet_traits<Scalar>::size, OtherPacketSize = packet_traits<OtherScalar>::size }; typedef typename packet_traits<Scalar>::type Packet; typedef typename packet_traits<OtherScalar>::type OtherPacket; if(SizeAtCompileTime == Dynamic && ((incrx==1 && incry==1) || PacketSize == 1)) { enum { Peeling = 2 }; Index alignedStart = internal::first_default_aligned(y, size); Index alignedEnd = alignedStart + ((size-alignedStart)/PacketSize)*PacketSize; const OtherPacket pc = pset1<OtherPacket>(c); const OtherPacket ps = pset1<OtherPacket>(s); conj_helper<OtherPacket,Packet,NumTraits<OtherScalar>::IsComplex,false> pcj; conj_helper<OtherPacket,Packet,false,false> pm; for(Index i=0; i<alignedStart; ++i) { Scalar xi = x[i]; Scalar yi = y[i]; x[i] = c * xi + numext::conj(s) * yi; y[i] = -s * xi + numext::conj(c) * yi; } Scalar* __restrict px = x + alignedStart; Scalar* __restrict py = y + alignedStart; if(internal::first_default_aligned(x, size)==alignedStart) { for(Index i=alignedStart; i<alignedEnd; i+=PacketSize) { Packet xi = pload<Packet>(px); Packet yi = pload<Packet>(py); pstore(px, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); pstore(py, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); px += PacketSize; py += PacketSize; } } else { Index peelingEnd = alignedStart + ((size-alignedStart)/(Peeling*PacketSize))*(Peeling*PacketSize); for(Index i=alignedStart; i<peelingEnd; i+=Peeling*PacketSize) { Packet xi = ploadu<Packet>(px); Packet xi1 = ploadu<Packet>(px+PacketSize); Packet yi = pload <Packet>(py); Packet yi1 = pload <Packet>(py+PacketSize); pstoreu(px, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); pstoreu(px+PacketSize, padd(pm.pmul(pc,xi1),pcj.pmul(ps,yi1))); pstore (py, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); pstore (py+PacketSize, psub(pcj.pmul(pc,yi1),pm.pmul(ps,xi1))); px += Peeling*PacketSize; py += Peeling*PacketSize; } if(alignedEnd!=peelingEnd) { Packet xi = ploadu<Packet>(x+peelingEnd); Packet yi = pload <Packet>(y+peelingEnd); pstoreu(x+peelingEnd, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); pstore (y+peelingEnd, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); } } for(Index i=alignedEnd; i<size; ++i) { Scalar xi = x[i]; Scalar yi = y[i]; x[i] = c * xi + numext::conj(s) * yi; y[i] = -s * xi + numext::conj(c) * yi; } } else if(SizeAtCompileTime != Dynamic && MinAlignment>0) { const OtherPacket pc = pset1<OtherPacket>(c); const OtherPacket ps = pset1<OtherPacket>(s); conj_helper<OtherPacket,Packet,NumTraits<OtherPacket>::IsComplex,false> pcj; conj_helper<OtherPacket,Packet,false,false> pm; Scalar* __restrict px = x; Scalar* __restrict py = y; for(Index i=0; i<size; i+=PacketSize) { Packet xi = pload<Packet>(px); Packet yi = pload<Packet>(py); pstore(px, padd(pm.pmul(pc,xi),pcj.pmul(ps,yi))); pstore(py, psub(pcj.pmul(pc,yi),pm.pmul(ps,xi))); px += PacketSize; py += PacketSize; } } else { apply_rotation_in_the_plane_selector<Scalar,OtherScalar,SizeAtCompileTime,MinAlignment,false>::run(x,incrx,y,incry,size,c,s); } } }; template<typename VectorX, typename VectorY, typename OtherScalar> void apply_rotation_in_the_plane(DenseBase<VectorX>& xpr_x, DenseBase<VectorY>& xpr_y, const JacobiRotation<OtherScalar>& j) { typedef typename VectorX::Scalar Scalar; const bool Vectorizable = (VectorX::Flags & VectorY::Flags & PacketAccessBit) && (int(packet_traits<Scalar>::size) == int(packet_traits<OtherScalar>::size)); ((xpr_x.size() == xpr_y.size()) ? static_cast<void> (0) : __assert_fail ("xpr_x.size() == xpr_y.size()", "eigen-3.3.7/Eigen/src/Jacobi/Jacobi.h", 438, __PRETTY_FUNCTION__)); Index size = xpr_x.size(); Index incrx = xpr_x.derived().innerStride(); Index incry = xpr_y.derived().innerStride(); Scalar* __restrict x = &xpr_x.derived().coeffRef(0); Scalar* __restrict y = &xpr_y.derived().coeffRef(0); OtherScalar c = j.c(); OtherScalar s = j.s(); if (c==OtherScalar(1) && s==OtherScalar(0)) return; apply_rotation_in_the_plane_selector< Scalar,OtherScalar, VectorX::SizeAtCompileTime, (((int)evaluator<VectorX>::Alignment <= (int)evaluator<VectorY>::Alignment) ? (int)evaluator<VectorX>::Alignment : (int)evaluator<VectorY>::Alignment), Vectorizable>::run(x,incrx,y,incry,size,c,s); } } } # 28 "eigen-3.3.7/Eigen/Jacobi" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 12 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" #pragma GCC diagnostic pop # 30 "eigen-3.3.7/Eigen/Jacobi" 2 # 13 "eigen-3.3.7/Eigen/Cholesky" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" 1 # 49 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wshadow" #pragma GCC diagnostic ignored "-Wtype-limits" # 15 "eigen-3.3.7/Eigen/Cholesky" 2 # 32 "eigen-3.3.7/Eigen/Cholesky" # 1 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" 1 # 13 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" namespace Eigen { namespace internal{ template<typename MatrixType, int UpLo> struct LLT_Traits; } # 56 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" template<typename _MatrixType, int _UpLo> class LLT { public: typedef _MatrixType MatrixType; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime }; typedef typename MatrixType::Scalar Scalar; typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar; typedef Eigen::Index Index; typedef typename MatrixType::StorageIndex StorageIndex; enum { PacketSize = internal::packet_traits<Scalar>::size, AlignmentMask = int(PacketSize)-1, UpLo = _UpLo }; typedef internal::LLT_Traits<MatrixType,UpLo> Traits; LLT() : m_matrix(), m_isInitialized(false) {} explicit LLT(Index size) : m_matrix(size, size), m_isInitialized(false) {} template<typename InputType> explicit LLT(const EigenBase<InputType>& matrix) : m_matrix(matrix.rows(), matrix.cols()), m_isInitialized(false) { compute(matrix.derived()); } # 110 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" template<typename InputType> explicit LLT(EigenBase<InputType>& matrix) : m_matrix(matrix.derived()), m_isInitialized(false) { compute(matrix.derived()); } inline typename Traits::MatrixU matrixU() const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 121, __PRETTY_FUNCTION__)); return Traits::getU(m_matrix); } inline typename Traits::MatrixL matrixL() const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 128, __PRETTY_FUNCTION__)); return Traits::getL(m_matrix); } # 142 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" template<typename Rhs> inline const Solve<LLT, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 146, __PRETTY_FUNCTION__)); ((m_matrix.rows()==b.rows() && "LLT::solve(): invalid number of rows of the right hand side matrix b") ? static_cast<void> (0) : __assert_fail ("m_matrix.rows()==b.rows() && \"LLT::solve(): invalid number of rows of the right hand side matrix b\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" # 147 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" , 148 # 147 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" , __PRETTY_FUNCTION__)) ; return Solve<LLT, Rhs>(*this, b.derived()); } template<typename Derived> void solveInPlace(const MatrixBase<Derived> &bAndX) const; template<typename InputType> LLT& compute(const EigenBase<InputType>& matrix); RealScalar rcond() const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 163, __PRETTY_FUNCTION__)); ((m_info == Success && "LLT failed because matrix appears to be negative") ? static_cast<void> (0) : __assert_fail ("m_info == Success && \"LLT failed because matrix appears to be negative\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 164, __PRETTY_FUNCTION__)); return internal::rcond_estimate_helper(m_l1_norm, *this); } inline const MatrixType& matrixLLT() const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 174, __PRETTY_FUNCTION__)); return m_matrix; } MatrixType reconstructedMatrix() const; ComputationInfo info() const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 188, __PRETTY_FUNCTION__)); return m_info; } const LLT& adjoint() const { return *this; }; inline Index rows() const { return m_matrix.rows(); } inline Index cols() const { return m_matrix.cols(); } template<typename VectorType> LLT rankUpdate(const VectorType& vec, const RealScalar& sigma = 1); template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const; protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } MatrixType m_matrix; RealScalar m_l1_norm; bool m_isInitialized; ComputationInfo m_info; }; namespace internal { template<typename Scalar, int UpLo> struct llt_inplace; template<typename MatrixType, typename VectorType> static Index llt_rank_update_lower(MatrixType& mat, const VectorType& vec, const typename MatrixType::RealScalar& sigma) { using std::sqrt; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef typename MatrixType::ColXpr ColXpr; typedef typename internal::remove_all<ColXpr>::type ColXprCleaned; typedef typename ColXprCleaned::SegmentReturnType ColXprSegment; typedef Matrix<Scalar,Dynamic,1> TempVectorType; typedef typename TempVectorType::SegmentReturnType TempVecSegment; Index n = mat.cols(); ((mat.rows()==n && vec.size()==n) ? static_cast<void> (0) : __assert_fail ("mat.rows()==n && vec.size()==n", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 245, __PRETTY_FUNCTION__)); TempVectorType temp; if(sigma>0) { temp = sqrt(sigma) * vec; for(Index i=0; i<n; ++i) { JacobiRotation<Scalar> g; g.makeGivens(mat(i,i), -temp(i), &mat(i,i)); Index rs = n-i-1; if(rs>0) { ColXprSegment x(mat.col(i).tail(rs)); TempVecSegment y(temp.tail(rs)); apply_rotation_in_the_plane(x, y, g); } } } else { temp = vec; RealScalar beta = 1; for(Index j=0; j<n; ++j) { RealScalar Ljj = numext::real(mat.coeff(j,j)); RealScalar dj = numext::abs2(Ljj); Scalar wj = temp.coeff(j); RealScalar swj2 = sigma*numext::abs2(wj); RealScalar gamma = dj*beta + swj2; RealScalar x = dj + swj2/beta; if (x<=RealScalar(0)) return j; RealScalar nLjj = sqrt(x); mat.coeffRef(j,j) = nLjj; beta += swj2/dj; Index rs = n-j-1; if(rs) { temp.tail(rs) -= (wj/Ljj) * mat.col(j).tail(rs); if(gamma != 0) mat.col(j).tail(rs) = (nLjj/Ljj) * mat.col(j).tail(rs) + (nLjj * sigma*numext::conj(wj)/gamma)*temp.tail(rs); } } } return -1; } template<typename Scalar> struct llt_inplace<Scalar, Lower> { typedef typename NumTraits<Scalar>::Real RealScalar; template<typename MatrixType> static Index unblocked(MatrixType& mat) { using std::sqrt; ((mat.rows()==mat.cols()) ? static_cast<void> (0) : __assert_fail ("mat.rows()==mat.cols()", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 310, __PRETTY_FUNCTION__)); const Index size = mat.rows(); for(Index k = 0; k < size; ++k) { Index rs = size-k-1; Block<MatrixType,Dynamic,1> A21(mat,k+1,k,rs,1); Block<MatrixType,1,Dynamic> A10(mat,k,0,1,k); Block<MatrixType,Dynamic,Dynamic> A20(mat,k+1,0,rs,k); RealScalar x = numext::real(mat.coeff(k,k)); if (k>0) x -= A10.squaredNorm(); if (x<=RealScalar(0)) return k; mat.coeffRef(k,k) = x = sqrt(x); if (k>0 && rs>0) A21.noalias() -= A20 * A10.adjoint(); if (rs>0) A21 /= x; } return -1; } template<typename MatrixType> static Index blocked(MatrixType& m) { ((m.rows()==m.cols()) ? static_cast<void> (0) : __assert_fail ("m.rows()==m.cols()", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 334, __PRETTY_FUNCTION__)); Index size = m.rows(); if(size<32) return unblocked(m); Index blockSize = size/8; blockSize = (blockSize/16)*16; blockSize = (std::min)((std::max)(blockSize,Index(8)), Index(128)); for (Index k=0; k<size; k+=blockSize) { Index bs = (std::min)(blockSize, size-k); Index rs = size - k - bs; Block<MatrixType,Dynamic,Dynamic> A11(m,k, k, bs,bs); Block<MatrixType,Dynamic,Dynamic> A21(m,k+bs,k, rs,bs); Block<MatrixType,Dynamic,Dynamic> A22(m,k+bs,k+bs,rs,rs); Index ret; if((ret=unblocked(A11))>=0) return k+ret; if(rs>0) A11.adjoint().template triangularView<Upper>().template solveInPlace<OnTheRight>(A21); if(rs>0) A22.template selfadjointView<Lower>().rankUpdate(A21,typename NumTraits<RealScalar>::Literal(-1)); } return -1; } template<typename MatrixType, typename VectorType> static Index rankUpdate(MatrixType& mat, const VectorType& vec, const RealScalar& sigma) { return Eigen::internal::llt_rank_update_lower(mat, vec, sigma); } }; template<typename Scalar> struct llt_inplace<Scalar, Upper> { typedef typename NumTraits<Scalar>::Real RealScalar; template<typename MatrixType> static inline Index unblocked(MatrixType& mat) { Transpose<MatrixType> matt(mat); return llt_inplace<Scalar, Lower>::unblocked(matt); } template<typename MatrixType> static inline Index blocked(MatrixType& mat) { Transpose<MatrixType> matt(mat); return llt_inplace<Scalar, Lower>::blocked(matt); } template<typename MatrixType, typename VectorType> static Index rankUpdate(MatrixType& mat, const VectorType& vec, const RealScalar& sigma) { Transpose<MatrixType> matt(mat); return llt_inplace<Scalar, Lower>::rankUpdate(matt, vec.conjugate(), sigma); } }; template<typename MatrixType> struct LLT_Traits<MatrixType,Lower> { typedef const TriangularView<const MatrixType, Lower> MatrixL; typedef const TriangularView<const typename MatrixType::AdjointReturnType, Upper> MatrixU; static inline MatrixL getL(const MatrixType& m) { return MatrixL(m); } static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } static bool inplace_decomposition(MatrixType& m) { return llt_inplace<typename MatrixType::Scalar, Lower>::blocked(m)==-1; } }; template<typename MatrixType> struct LLT_Traits<MatrixType,Upper> { typedef const TriangularView<const typename MatrixType::AdjointReturnType, Lower> MatrixL; typedef const TriangularView<const MatrixType, Upper> MatrixU; static inline MatrixL getL(const MatrixType& m) { return MatrixL(m.adjoint()); } static inline MatrixU getU(const MatrixType& m) { return MatrixU(m); } static bool inplace_decomposition(MatrixType& m) { return llt_inplace<typename MatrixType::Scalar, Upper>::blocked(m)==-1; } }; } # 423 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" template<typename MatrixType, int _UpLo> template<typename InputType> LLT<MatrixType,_UpLo>& LLT<MatrixType,_UpLo>::compute(const EigenBase<InputType>& a) { check_template_parameters(); ((a.rows()==a.cols()) ? static_cast<void> (0) : __assert_fail ("a.rows()==a.cols()", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 429, __PRETTY_FUNCTION__)); const Index size = a.rows(); m_matrix.resize(size, size); if (!internal::is_same_dense(m_matrix, a.derived())) m_matrix = a.derived(); m_l1_norm = RealScalar(0); for (Index col = 0; col < size; ++col) { RealScalar abs_col_sum; if (_UpLo == Lower) abs_col_sum = m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>(); else abs_col_sum = m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>(); if (abs_col_sum > m_l1_norm) m_l1_norm = abs_col_sum; } m_isInitialized = true; bool ok = Traits::inplace_decomposition(m_matrix); m_info = ok ? Success : NumericalIssue; return *this; } template<typename _MatrixType, int _UpLo> template<typename VectorType> LLT<_MatrixType,_UpLo> LLT<_MatrixType,_UpLo>::rankUpdate(const VectorType& v, const RealScalar& sigma) { if (Eigen::internal::static_assertion<static_cast<bool>(VectorType::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {}; ((v.size()==m_matrix.cols()) ? static_cast<void> (0) : __assert_fail ("v.size()==m_matrix.cols()", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 465, __PRETTY_FUNCTION__)); ((m_isInitialized) ? static_cast<void> (0) : __assert_fail ("m_isInitialized", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 466, __PRETTY_FUNCTION__)); if(internal::llt_inplace<typename MatrixType::Scalar, UpLo>::rankUpdate(m_matrix,v,sigma)>=0) m_info = NumericalIssue; else m_info = Success; return *this; } template<typename _MatrixType,int _UpLo> template<typename RhsType, typename DstType> void LLT<_MatrixType,_UpLo>::_solve_impl(const RhsType &rhs, DstType &dst) const { dst = rhs; solveInPlace(dst); } # 498 "eigen-3.3.7/Eigen/src/Cholesky/LLT.h" template<typename MatrixType, int _UpLo> template<typename Derived> void LLT<MatrixType,_UpLo>::solveInPlace(const MatrixBase<Derived> &bAndX) const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 502, __PRETTY_FUNCTION__)); ((m_matrix.rows()==bAndX.rows()) ? static_cast<void> (0) : __assert_fail ("m_matrix.rows()==bAndX.rows()", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 503, __PRETTY_FUNCTION__)); matrixL().solveInPlace(bAndX); matrixU().solveInPlace(bAndX); } template<typename MatrixType, int _UpLo> MatrixType LLT<MatrixType,_UpLo>::reconstructedMatrix() const { ((m_isInitialized && "LLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LLT.h", 514, __PRETTY_FUNCTION__)); return matrixL() * matrixL().adjoint().toDenseMatrix(); } template<typename Derived> inline const LLT<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::llt() const { return LLT<PlainObject>(derived()); } template<typename MatrixType, unsigned int UpLo> inline const LLT<typename SelfAdjointView<MatrixType, UpLo>::PlainObject, UpLo> SelfAdjointView<MatrixType, UpLo>::llt() const { return LLT<PlainObject,UpLo>(m_matrix); } } # 33 "eigen-3.3.7/Eigen/Cholesky" 2 # 1 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" 1 # 16 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" namespace Eigen { namespace internal { template<typename MatrixType, int UpLo> struct LDLT_Traits; enum SignMatrix { PositiveSemiDef, NegativeSemiDef, ZeroSign, Indefinite }; } # 50 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" template<typename _MatrixType, int _UpLo> class LDLT { public: typedef _MatrixType MatrixType; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, UpLo = _UpLo }; typedef typename MatrixType::Scalar Scalar; typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar; typedef Eigen::Index Index; typedef typename MatrixType::StorageIndex StorageIndex; typedef Matrix<Scalar, RowsAtCompileTime, 1, 0, MaxRowsAtCompileTime, 1> TmpMatrixType; typedef Transpositions<RowsAtCompileTime, MaxRowsAtCompileTime> TranspositionType; typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> PermutationType; typedef internal::LDLT_Traits<MatrixType,UpLo> Traits; LDLT() : m_matrix(), m_transpositions(), m_sign(internal::ZeroSign), m_isInitialized(false) {} explicit LDLT(Index size) : m_matrix(size, size), m_transpositions(size), m_temporary(size), m_sign(internal::ZeroSign), m_isInitialized(false) {} template<typename InputType> explicit LDLT(const EigenBase<InputType>& matrix) : m_matrix(matrix.rows(), matrix.cols()), m_transpositions(matrix.rows()), m_temporary(matrix.rows()), m_sign(internal::ZeroSign), m_isInitialized(false) { compute(matrix.derived()); } template<typename InputType> explicit LDLT(EigenBase<InputType>& matrix) : m_matrix(matrix.derived()), m_transpositions(matrix.rows()), m_temporary(matrix.rows()), m_sign(internal::ZeroSign), m_isInitialized(false) { compute(matrix.derived()); } void setZero() { m_isInitialized = false; } inline typename Traits::MatrixU matrixU() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 143, __PRETTY_FUNCTION__)); return Traits::getU(m_matrix); } inline typename Traits::MatrixL matrixL() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 150, __PRETTY_FUNCTION__)); return Traits::getL(m_matrix); } inline const TranspositionType& transpositionsP() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 158, __PRETTY_FUNCTION__)); return m_transpositions; } inline Diagonal<const MatrixType> vectorD() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 165, __PRETTY_FUNCTION__)); return m_matrix.diagonal(); } inline bool isPositive() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 172, __PRETTY_FUNCTION__)); return m_sign == internal::PositiveSemiDef || m_sign == internal::ZeroSign; } inline bool isNegative(void) const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 179, __PRETTY_FUNCTION__)); return m_sign == internal::NegativeSemiDef || m_sign == internal::ZeroSign; } # 198 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" template<typename Rhs> inline const Solve<LDLT, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 202, __PRETTY_FUNCTION__)); ((m_matrix.rows()==b.rows() && "LDLT::solve(): invalid number of rows of the right hand side matrix b") ? static_cast<void> (0) : __assert_fail ("m_matrix.rows()==b.rows() && \"LDLT::solve(): invalid number of rows of the right hand side matrix b\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" # 203 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" , 204 # 203 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" , __PRETTY_FUNCTION__)) ; return Solve<LDLT, Rhs>(*this, b.derived()); } template<typename Derived> bool solveInPlace(MatrixBase<Derived> &bAndX) const; template<typename InputType> LDLT& compute(const EigenBase<InputType>& matrix); RealScalar rcond() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 219, __PRETTY_FUNCTION__)); return internal::rcond_estimate_helper(m_l1_norm, *this); } template <typename Derived> LDLT& rankUpdate(const MatrixBase<Derived>& w, const RealScalar& alpha=1); inline const MatrixType& matrixLDLT() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 232, __PRETTY_FUNCTION__)); return m_matrix; } MatrixType reconstructedMatrix() const; const LDLT& adjoint() const { return *this; }; inline Index rows() const { return m_matrix.rows(); } inline Index cols() const { return m_matrix.cols(); } ComputationInfo info() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 255, __PRETTY_FUNCTION__)); return m_info; } template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const; protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } MatrixType m_matrix; RealScalar m_l1_norm; TranspositionType m_transpositions; TmpMatrixType m_temporary; internal::SignMatrix m_sign; bool m_isInitialized; ComputationInfo m_info; }; namespace internal { template<int UpLo> struct ldlt_inplace; template<> struct ldlt_inplace<Lower> { template<typename MatrixType, typename TranspositionType, typename Workspace> static bool unblocked(MatrixType& mat, TranspositionType& transpositions, Workspace& temp, SignMatrix& sign) { using std::abs; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef typename TranspositionType::StorageIndex IndexType; ((mat.rows()==mat.cols()) ? static_cast<void> (0) : __assert_fail ("mat.rows()==mat.cols()", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 300, __PRETTY_FUNCTION__)); const Index size = mat.rows(); bool found_zero_pivot = false; bool ret = true; if (size <= 1) { transpositions.setIdentity(); if(size==0) sign = ZeroSign; else if (numext::real(mat.coeff(0,0)) > static_cast<RealScalar>(0) ) sign = PositiveSemiDef; else if (numext::real(mat.coeff(0,0)) < static_cast<RealScalar>(0)) sign = NegativeSemiDef; else sign = ZeroSign; return true; } for (Index k = 0; k < size; ++k) { Index index_of_biggest_in_corner; mat.diagonal().tail(size-k).cwiseAbs().maxCoeff(&index_of_biggest_in_corner); index_of_biggest_in_corner += k; transpositions.coeffRef(k) = IndexType(index_of_biggest_in_corner); if(k != index_of_biggest_in_corner) { Index s = size-index_of_biggest_in_corner-1; mat.row(k).head(k).swap(mat.row(index_of_biggest_in_corner).head(k)); mat.col(k).tail(s).swap(mat.col(index_of_biggest_in_corner).tail(s)); std::swap(mat.coeffRef(k,k),mat.coeffRef(index_of_biggest_in_corner,index_of_biggest_in_corner)); for(Index i=k+1;i<index_of_biggest_in_corner;++i) { Scalar tmp = mat.coeffRef(i,k); mat.coeffRef(i,k) = numext::conj(mat.coeffRef(index_of_biggest_in_corner,i)); mat.coeffRef(index_of_biggest_in_corner,i) = numext::conj(tmp); } if(NumTraits<Scalar>::IsComplex) mat.coeffRef(index_of_biggest_in_corner,k) = numext::conj(mat.coeff(index_of_biggest_in_corner,k)); } Index rs = size - k - 1; Block<MatrixType,Dynamic,1> A21(mat,k+1,k,rs,1); Block<MatrixType,1,Dynamic> A10(mat,k,0,1,k); Block<MatrixType,Dynamic,Dynamic> A20(mat,k+1,0,rs,k); if(k>0) { temp.head(k) = mat.diagonal().real().head(k).asDiagonal() * A10.adjoint(); mat.coeffRef(k,k) -= (A10 * temp.head(k)).value(); if(rs>0) A21.noalias() -= A20 * temp.head(k); } RealScalar realAkk = numext::real(mat.coeffRef(k,k)); bool pivot_is_valid = (abs(realAkk) > RealScalar(0)); if(k==0 && !pivot_is_valid) { sign = ZeroSign; for(Index j = 0; j<size; ++j) { transpositions.coeffRef(j) = IndexType(j); ret = ret && (mat.col(j).tail(size-j-1).array()==Scalar(0)).all(); } return ret; } if((rs>0) && pivot_is_valid) A21 /= realAkk; else if(rs>0) ret = ret && (A21.array()==Scalar(0)).all(); if(found_zero_pivot && pivot_is_valid) ret = false; else if(!pivot_is_valid) found_zero_pivot = true; if (sign == PositiveSemiDef) { if (realAkk < static_cast<RealScalar>(0)) sign = Indefinite; } else if (sign == NegativeSemiDef) { if (realAkk > static_cast<RealScalar>(0)) sign = Indefinite; } else if (sign == ZeroSign) { if (realAkk > static_cast<RealScalar>(0)) sign = PositiveSemiDef; else if (realAkk < static_cast<RealScalar>(0)) sign = NegativeSemiDef; } } return ret; } # 406 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" template<typename MatrixType, typename WDerived> static bool updateInPlace(MatrixType& mat, MatrixBase<WDerived>& w, const typename MatrixType::RealScalar& sigma=1) { using numext::isfinite; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; const Index size = mat.rows(); ((mat.cols() == size && w.size()==size) ? static_cast<void> (0) : __assert_fail ("mat.cols() == size && w.size()==size", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 414, __PRETTY_FUNCTION__)); RealScalar alpha = 1; for (Index j = 0; j < size; j++) { if (!(isfinite)(alpha)) break; RealScalar dj = numext::real(mat.coeff(j,j)); Scalar wj = w.coeff(j); RealScalar swj2 = sigma*numext::abs2(wj); RealScalar gamma = dj*alpha + swj2; mat.coeffRef(j,j) += swj2/alpha; alpha += swj2/dj; Index rs = size-j-1; w.tail(rs) -= wj * mat.col(j).tail(rs); if(gamma != 0) mat.col(j).tail(rs) += (sigma*numext::conj(wj)/gamma)*w.tail(rs); } return true; } template<typename MatrixType, typename TranspositionType, typename Workspace, typename WType> static bool update(MatrixType& mat, const TranspositionType& transpositions, Workspace& tmp, const WType& w, const typename MatrixType::RealScalar& sigma=1) { tmp = transpositions * w; return ldlt_inplace<Lower>::updateInPlace(mat,tmp,sigma); } }; template<> struct ldlt_inplace<Upper> { template<typename MatrixType, typename TranspositionType, typename Workspace> static inline bool unblocked(MatrixType& mat, TranspositionType& transpositions, Workspace& temp, SignMatrix& sign) { Transpose<MatrixType> matt(mat); return ldlt_inplace<Lower>::unblocked(matt, transpositions, temp, sign); } template<typename MatrixType, typename TranspositionType, typename Workspace, typename WType> static inline bool update(MatrixType& mat, TranspositionType& transpositions, Workspace& tmp, WType& w, const typename MatrixType::RealScalar& sigma=1) { Transpose<MatrixType> matt(mat); return ldlt_inplace<Lower>::update(matt, transpositions, tmp, w.conjugate(), sigma); } }; template<typename MatrixType> struct LDLT_Traits<MatrixType,Lower> { typedef const TriangularView<const MatrixType, UnitLower> MatrixL; typedef const TriangularView<const typename MatrixType::AdjointReturnType, UnitUpper> MatrixU; static inline MatrixL getL(const MatrixType& m) { return MatrixL(m); } static inline MatrixU getU(const MatrixType& m) { return MatrixU(m.adjoint()); } }; template<typename MatrixType> struct LDLT_Traits<MatrixType,Upper> { typedef const TriangularView<const typename MatrixType::AdjointReturnType, UnitLower> MatrixL; typedef const TriangularView<const MatrixType, UnitUpper> MatrixU; static inline MatrixL getL(const MatrixType& m) { return MatrixL(m.adjoint()); } static inline MatrixU getU(const MatrixType& m) { return MatrixU(m); } }; } template<typename MatrixType, int _UpLo> template<typename InputType> LDLT<MatrixType,_UpLo>& LDLT<MatrixType,_UpLo>::compute(const EigenBase<InputType>& a) { check_template_parameters(); ((a.rows()==a.cols()) ? static_cast<void> (0) : __assert_fail ("a.rows()==a.cols()", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 497, __PRETTY_FUNCTION__)); const Index size = a.rows(); m_matrix = a.derived(); m_l1_norm = RealScalar(0); for (Index col = 0; col < size; ++col) { RealScalar abs_col_sum; if (_UpLo == Lower) abs_col_sum = m_matrix.col(col).tail(size - col).template lpNorm<1>() + m_matrix.row(col).head(col).template lpNorm<1>(); else abs_col_sum = m_matrix.col(col).head(col).template lpNorm<1>() + m_matrix.row(col).tail(size - col).template lpNorm<1>(); if (abs_col_sum > m_l1_norm) m_l1_norm = abs_col_sum; } m_transpositions.resize(size); m_isInitialized = false; m_temporary.resize(size); m_sign = internal::ZeroSign; m_info = internal::ldlt_inplace<UpLo>::unblocked(m_matrix, m_transpositions, m_temporary, m_sign) ? Success : NumericalIssue; m_isInitialized = true; return *this; } template<typename MatrixType, int _UpLo> template<typename Derived> LDLT<MatrixType,_UpLo>& LDLT<MatrixType,_UpLo>::rankUpdate(const MatrixBase<Derived>& w, const typename LDLT<MatrixType,_UpLo>::RealScalar& sigma) { typedef typename TranspositionType::StorageIndex IndexType; const Index size = w.rows(); if (m_isInitialized) { ((m_matrix.rows()==size) ? static_cast<void> (0) : __assert_fail ("m_matrix.rows()==size", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 539, __PRETTY_FUNCTION__)); } else { m_matrix.resize(size,size); m_matrix.setZero(); m_transpositions.resize(size); for (Index i = 0; i < size; i++) m_transpositions.coeffRef(i) = IndexType(i); m_temporary.resize(size); m_sign = sigma>=0 ? internal::PositiveSemiDef : internal::NegativeSemiDef; m_isInitialized = true; } internal::ldlt_inplace<UpLo>::update(m_matrix, m_transpositions, m_temporary, w, sigma); return *this; } template<typename _MatrixType, int _UpLo> template<typename RhsType, typename DstType> void LDLT<_MatrixType,_UpLo>::_solve_impl(const RhsType &rhs, DstType &dst) const { ((rhs.rows() == rows()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == rows()", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 563, __PRETTY_FUNCTION__)); dst = m_transpositions * rhs; matrixL().solveInPlace(dst); using std::abs; const typename Diagonal<const MatrixType>::RealReturnType vecD(vectorD()); RealScalar tolerance = (std::numeric_limits<RealScalar>::min)(); for (Index i = 0; i < vecD.size(); ++i) { if(abs(vecD(i)) > tolerance) dst.row(i) /= vecD(i); else dst.row(i).setZero(); } matrixU().solveInPlace(dst); dst = m_transpositions.transpose() * dst; } # 612 "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h" template<typename MatrixType,int _UpLo> template<typename Derived> bool LDLT<MatrixType,_UpLo>::solveInPlace(MatrixBase<Derived> &bAndX) const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 616, __PRETTY_FUNCTION__)); ((m_matrix.rows() == bAndX.rows()) ? static_cast<void> (0) : __assert_fail ("m_matrix.rows() == bAndX.rows()", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 617, __PRETTY_FUNCTION__)); bAndX = this->solve(bAndX); return true; } template<typename MatrixType, int _UpLo> MatrixType LDLT<MatrixType,_UpLo>::reconstructedMatrix() const { ((m_isInitialized && "LDLT is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LDLT is not initialized.\"", "eigen-3.3.7/Eigen/src/Cholesky/LDLT.h", 630, __PRETTY_FUNCTION__)); const Index size = m_matrix.rows(); MatrixType res(size,size); res.setIdentity(); res = transpositionsP() * res; res = matrixU() * res; res = vectorD().real().asDiagonal() * res; res = matrixL() * res; res = transpositionsP().transpose() * res; return res; } template<typename MatrixType, unsigned int UpLo> inline const LDLT<typename SelfAdjointView<MatrixType, UpLo>::PlainObject, UpLo> SelfAdjointView<MatrixType, UpLo>::ldlt() const { return LDLT<PlainObject,UpLo>(m_matrix); } template<typename Derived> inline const LDLT<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::ldlt() const { return LDLT<PlainObject>(derived()); } } # 34 "eigen-3.3.7/Eigen/Cholesky" 2 # 43 "eigen-3.3.7/Eigen/Cholesky" # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 12 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" #pragma GCC diagnostic pop # 44 "eigen-3.3.7/Eigen/Cholesky" 2 # 16 "eigen-3.3.7/Eigen/QR" 2 # 1 "eigen-3.3.7/Eigen/Householder" 1 # 13 "eigen-3.3.7/Eigen/Householder" # 1 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" 1 # 49 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wshadow" #pragma GCC diagnostic ignored "-Wtype-limits" # 14 "eigen-3.3.7/Eigen/Householder" 2 # 23 "eigen-3.3.7/Eigen/Householder" # 1 "eigen-3.3.7/Eigen/src/Householder/Householder.h" 1 # 14 "eigen-3.3.7/Eigen/src/Householder/Householder.h" namespace Eigen { namespace internal { template<int n> struct decrement_size { enum { ret = n==Dynamic ? n : n-1 }; }; } # 41 "eigen-3.3.7/Eigen/src/Householder/Householder.h" template<typename Derived> void MatrixBase<Derived>::makeHouseholderInPlace(Scalar& tau, RealScalar& beta) { VectorBlock<Derived, internal::decrement_size<Base::SizeAtCompileTime>::ret> essentialPart(derived(), 1, size()-1); makeHouseholder(essentialPart, tau, beta); } # 63 "eigen-3.3.7/Eigen/src/Householder/Householder.h" template<typename Derived> template<typename EssentialPart> void MatrixBase<Derived>::makeHouseholder( EssentialPart& essential, Scalar& tau, RealScalar& beta) const { using std::sqrt; using numext::conj; if (Eigen::internal::static_assertion<static_cast<bool>(EssentialPart::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} VectorBlock<const Derived, EssentialPart::SizeAtCompileTime> tail(derived(), 1, size()-1); RealScalar tailSqNorm = size()==1 ? RealScalar(0) : tail.squaredNorm(); Scalar c0 = coeff(0); const RealScalar tol = (std::numeric_limits<RealScalar>::min)(); if(tailSqNorm <= tol && numext::abs2(numext::imag(c0))<=tol) { tau = RealScalar(0); beta = numext::real(c0); essential.setZero(); } else { beta = sqrt(numext::abs2(c0) + tailSqNorm); if (numext::real(c0)>=RealScalar(0)) beta = -beta; essential = tail / (c0 - beta); tau = conj((beta - c0) / beta); } } # 111 "eigen-3.3.7/Eigen/src/Householder/Householder.h" template<typename Derived> template<typename EssentialPart> void MatrixBase<Derived>::applyHouseholderOnTheLeft( const EssentialPart& essential, const Scalar& tau, Scalar* workspace) { if(rows() == 1) { *this *= Scalar(1)-tau; } else if(tau!=Scalar(0)) { Map<typename internal::plain_row_type<PlainObject>::type> tmp(workspace,cols()); Block<Derived, EssentialPart::SizeAtCompileTime, Derived::ColsAtCompileTime> bottom(derived(), 1, 0, rows()-1, cols()); tmp.noalias() = essential.adjoint() * bottom; tmp += this->row(0); this->row(0) -= tau * tmp; bottom.noalias() -= tau * essential * tmp; } } # 148 "eigen-3.3.7/Eigen/src/Householder/Householder.h" template<typename Derived> template<typename EssentialPart> void MatrixBase<Derived>::applyHouseholderOnTheRight( const EssentialPart& essential, const Scalar& tau, Scalar* workspace) { if(cols() == 1) { *this *= Scalar(1)-tau; } else if(tau!=Scalar(0)) { Map<typename internal::plain_col_type<PlainObject>::type> tmp(workspace,rows()); Block<Derived, Derived::RowsAtCompileTime, EssentialPart::SizeAtCompileTime> right(derived(), 0, 1, rows(), cols()-1); tmp.noalias() = right * essential.conjugate(); tmp += this->col(0); this->col(0) -= tau * tmp; right.noalias() -= tau * tmp * essential.transpose(); } } } # 24 "eigen-3.3.7/Eigen/Householder" 2 # 1 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" 1 # 14 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" namespace Eigen { # 57 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" namespace internal { template<typename VectorsType, typename CoeffsType, int Side> struct traits<HouseholderSequence<VectorsType,CoeffsType,Side> > { typedef typename VectorsType::Scalar Scalar; typedef typename VectorsType::StorageIndex StorageIndex; typedef typename VectorsType::StorageKind StorageKind; enum { RowsAtCompileTime = Side==OnTheLeft ? traits<VectorsType>::RowsAtCompileTime : traits<VectorsType>::ColsAtCompileTime, ColsAtCompileTime = RowsAtCompileTime, MaxRowsAtCompileTime = Side==OnTheLeft ? traits<VectorsType>::MaxRowsAtCompileTime : traits<VectorsType>::MaxColsAtCompileTime, MaxColsAtCompileTime = MaxRowsAtCompileTime, Flags = 0 }; }; struct HouseholderSequenceShape {}; template<typename VectorsType, typename CoeffsType, int Side> struct evaluator_traits<HouseholderSequence<VectorsType,CoeffsType,Side> > : public evaluator_traits_base<HouseholderSequence<VectorsType,CoeffsType,Side> > { typedef HouseholderSequenceShape Shape; }; template<typename VectorsType, typename CoeffsType, int Side> struct hseq_side_dependent_impl { typedef Block<const VectorsType, Dynamic, 1> EssentialVectorType; typedef HouseholderSequence<VectorsType, CoeffsType, OnTheLeft> HouseholderSequenceType; static inline const EssentialVectorType essentialVector(const HouseholderSequenceType& h, Index k) { Index start = k+1+h.m_shift; return Block<const VectorsType,Dynamic,1>(h.m_vectors, start, k, h.rows()-start, 1); } }; template<typename VectorsType, typename CoeffsType> struct hseq_side_dependent_impl<VectorsType, CoeffsType, OnTheRight> { typedef Transpose<Block<const VectorsType, 1, Dynamic> > EssentialVectorType; typedef HouseholderSequence<VectorsType, CoeffsType, OnTheRight> HouseholderSequenceType; static inline const EssentialVectorType essentialVector(const HouseholderSequenceType& h, Index k) { Index start = k+1+h.m_shift; return Block<const VectorsType,1,Dynamic>(h.m_vectors, k, start, 1, h.rows()-start).transpose(); } }; template<typename OtherScalarType, typename MatrixType> struct matrix_type_times_scalar_type { typedef typename ScalarBinaryOpTraits<OtherScalarType, typename MatrixType::Scalar>::ReturnType ResultScalar; typedef Matrix<ResultScalar, MatrixType::RowsAtCompileTime, MatrixType::ColsAtCompileTime, 0, MatrixType::MaxRowsAtCompileTime, MatrixType::MaxColsAtCompileTime> Type; }; } template<typename VectorsType, typename CoeffsType, int Side> class HouseholderSequence : public EigenBase<HouseholderSequence<VectorsType,CoeffsType,Side> > { typedef typename internal::hseq_side_dependent_impl<VectorsType,CoeffsType,Side>::EssentialVectorType EssentialVectorType; public: enum { RowsAtCompileTime = internal::traits<HouseholderSequence>::RowsAtCompileTime, ColsAtCompileTime = internal::traits<HouseholderSequence>::ColsAtCompileTime, MaxRowsAtCompileTime = internal::traits<HouseholderSequence>::MaxRowsAtCompileTime, MaxColsAtCompileTime = internal::traits<HouseholderSequence>::MaxColsAtCompileTime }; typedef typename internal::traits<HouseholderSequence>::Scalar Scalar; typedef HouseholderSequence< typename internal::conditional<NumTraits<Scalar>::IsComplex, typename internal::remove_all<typename VectorsType::ConjugateReturnType>::type, VectorsType>::type, typename internal::conditional<NumTraits<Scalar>::IsComplex, typename internal::remove_all<typename CoeffsType::ConjugateReturnType>::type, CoeffsType>::type, Side > ConjugateReturnType; # 160 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" HouseholderSequence(const VectorsType& v, const CoeffsType& h) : m_vectors(v), m_coeffs(h), m_trans(false), m_length(v.diagonalSize()), m_shift(0) { } HouseholderSequence(const HouseholderSequence& other) : m_vectors(other.m_vectors), m_coeffs(other.m_coeffs), m_trans(other.m_trans), m_length(other.m_length), m_shift(other.m_shift) { } Index rows() const { return Side==OnTheLeft ? m_vectors.rows() : m_vectors.cols(); } Index cols() const { return rows(); } # 202 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" const EssentialVectorType essentialVector(Index k) const { ((k >= 0 && k < m_length) ? static_cast<void> (0) : __assert_fail ("k >= 0 && k < m_length", "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h", 204, __PRETTY_FUNCTION__)); return internal::hseq_side_dependent_impl<VectorsType,CoeffsType,Side>::essentialVector(*this, k); } HouseholderSequence transpose() const { return HouseholderSequence(*this).setTrans(!m_trans); } ConjugateReturnType conjugate() const { return ConjugateReturnType(m_vectors.conjugate(), m_coeffs.conjugate()) .setTrans(m_trans) .setLength(m_length) .setShift(m_shift); } ConjugateReturnType adjoint() const { return conjugate().setTrans(!m_trans); } ConjugateReturnType inverse() const { return adjoint(); } template<typename DestType> inline void evalTo(DestType& dst) const { Matrix<Scalar, DestType::RowsAtCompileTime, 1, AutoAlign|ColMajor, DestType::MaxRowsAtCompileTime, 1> workspace(rows()); evalTo(dst, workspace); } template<typename Dest, typename Workspace> void evalTo(Dest& dst, Workspace& workspace) const { workspace.resize(rows()); Index vecs = m_length; if(internal::is_same_dense(dst,m_vectors)) { dst.diagonal().setOnes(); dst.template triangularView<StrictlyUpper>().setZero(); for(Index k = vecs-1; k >= 0; --k) { Index cornerSize = rows() - k - m_shift; if(m_trans) dst.bottomRightCorner(cornerSize, cornerSize) .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), workspace.data()); else dst.bottomRightCorner(cornerSize, cornerSize) .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), workspace.data()); dst.col(k).tail(rows()-k-1).setZero(); } for(Index k = 0; k<cols()-vecs ; ++k) dst.col(k).tail(rows()-k-1).setZero(); } else { dst.setIdentity(rows(), rows()); for(Index k = vecs-1; k >= 0; --k) { Index cornerSize = rows() - k - m_shift; if(m_trans) dst.bottomRightCorner(cornerSize, cornerSize) .applyHouseholderOnTheRight(essentialVector(k), m_coeffs.coeff(k), &workspace.coeffRef(0)); else dst.bottomRightCorner(cornerSize, cornerSize) .applyHouseholderOnTheLeft(essentialVector(k), m_coeffs.coeff(k), &workspace.coeffRef(0)); } } } template<typename Dest> inline void applyThisOnTheRight(Dest& dst) const { Matrix<Scalar,1,Dest::RowsAtCompileTime,RowMajor,1,Dest::MaxRowsAtCompileTime> workspace(dst.rows()); applyThisOnTheRight(dst, workspace); } template<typename Dest, typename Workspace> inline void applyThisOnTheRight(Dest& dst, Workspace& workspace) const { workspace.resize(dst.rows()); for(Index k = 0; k < m_length; ++k) { Index actual_k = m_trans ? m_length-k-1 : k; dst.rightCols(rows()-m_shift-actual_k) .applyHouseholderOnTheRight(essentialVector(actual_k), m_coeffs.coeff(actual_k), workspace.data()); } } template<typename Dest> inline void applyThisOnTheLeft(Dest& dst) const { Matrix<Scalar,1,Dest::ColsAtCompileTime,RowMajor,1,Dest::MaxColsAtCompileTime> workspace; applyThisOnTheLeft(dst, workspace); } template<typename Dest, typename Workspace> inline void applyThisOnTheLeft(Dest& dst, Workspace& workspace) const { const Index BlockSize = 48; if(m_length>=BlockSize && dst.cols()>1) { for(Index i = 0; i < m_length; i+=BlockSize) { Index end = m_trans ? (std::min)(m_length,i+BlockSize) : m_length-i; Index k = m_trans ? i : (std::max)(Index(0),end-BlockSize); Index bs = end-k; Index start = k + m_shift; typedef Block<typename internal::remove_all<VectorsType>::type,Dynamic,Dynamic> SubVectorsType; SubVectorsType sub_vecs1(m_vectors.const_cast_derived(), Side==OnTheRight ? k : start, Side==OnTheRight ? start : k, Side==OnTheRight ? bs : m_vectors.rows()-start, Side==OnTheRight ? m_vectors.cols()-start : bs); typename internal::conditional<Side==OnTheRight, Transpose<SubVectorsType>, SubVectorsType&>::type sub_vecs(sub_vecs1); Block<Dest,Dynamic,Dynamic> sub_dst(dst,dst.rows()-rows()+m_shift+k,0, rows()-m_shift-k,dst.cols()); apply_block_householder_on_the_left(sub_dst, sub_vecs, m_coeffs.segment(k, bs), !m_trans); } } else { workspace.resize(dst.cols()); for(Index k = 0; k < m_length; ++k) { Index actual_k = m_trans ? k : m_length-k-1; dst.bottomRows(rows()-m_shift-actual_k) .applyHouseholderOnTheLeft(essentialVector(actual_k), m_coeffs.coeff(actual_k), workspace.data()); } } } # 355 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" template<typename OtherDerived> typename internal::matrix_type_times_scalar_type<Scalar, OtherDerived>::Type operator*(const MatrixBase<OtherDerived>& other) const { typename internal::matrix_type_times_scalar_type<Scalar, OtherDerived>::Type res(other.template cast<typename internal::matrix_type_times_scalar_type<Scalar,OtherDerived>::ResultScalar>()); applyThisOnTheLeft(res); return res; } template<typename _VectorsType, typename _CoeffsType, int _Side> friend struct internal::hseq_side_dependent_impl; # 375 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" HouseholderSequence& setLength(Index length) { m_length = length; return *this; } # 392 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" HouseholderSequence& setShift(Index shift) { m_shift = shift; return *this; } Index length() const { return m_length; } Index shift() const { return m_shift; } template <typename VectorsType2, typename CoeffsType2, int Side2> friend class HouseholderSequence; protected: # 414 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" HouseholderSequence& setTrans(bool trans) { m_trans = trans; return *this; } bool trans() const { return m_trans; } typename VectorsType::Nested m_vectors; typename CoeffsType::Nested m_coeffs; bool m_trans; Index m_length; Index m_shift; }; # 437 "eigen-3.3.7/Eigen/src/Householder/HouseholderSequence.h" template<typename OtherDerived, typename VectorsType, typename CoeffsType, int Side> typename internal::matrix_type_times_scalar_type<typename VectorsType::Scalar,OtherDerived>::Type operator*(const MatrixBase<OtherDerived>& other, const HouseholderSequence<VectorsType,CoeffsType,Side>& h) { typename internal::matrix_type_times_scalar_type<typename VectorsType::Scalar,OtherDerived>::Type res(other.template cast<typename internal::matrix_type_times_scalar_type<typename VectorsType::Scalar,OtherDerived>::ResultScalar>()); h.applyThisOnTheRight(res); return res; } template<typename VectorsType, typename CoeffsType> HouseholderSequence<VectorsType,CoeffsType> householderSequence(const VectorsType& v, const CoeffsType& h) { return HouseholderSequence<VectorsType,CoeffsType,OnTheLeft>(v, h); } template<typename VectorsType, typename CoeffsType> HouseholderSequence<VectorsType,CoeffsType,OnTheRight> rightHouseholderSequence(const VectorsType& v, const CoeffsType& h) { return HouseholderSequence<VectorsType,CoeffsType,OnTheRight>(v, h); } } # 25 "eigen-3.3.7/Eigen/Householder" 2 # 1 "eigen-3.3.7/Eigen/src/Householder/BlockHouseholder.h" 1 # 16 "eigen-3.3.7/Eigen/src/Householder/BlockHouseholder.h" namespace Eigen { namespace internal { # 50 "eigen-3.3.7/Eigen/src/Householder/BlockHouseholder.h" template<typename TriangularFactorType,typename VectorsType,typename CoeffsType> void make_block_householder_triangular_factor(TriangularFactorType& triFactor, const VectorsType& vectors, const CoeffsType& hCoeffs) { const Index nbVecs = vectors.cols(); ((triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs) ? static_cast<void> (0) : __assert_fail ("triFactor.rows() == nbVecs && triFactor.cols() == nbVecs && vectors.rows()>=nbVecs", "eigen-3.3.7/Eigen/src/Householder/BlockHouseholder.h", 54, __PRETTY_FUNCTION__)); for(Index i = nbVecs-1; i >=0 ; --i) { Index rs = vectors.rows() - i - 1; Index rt = nbVecs-i-1; if(rt>0) { triFactor.row(i).tail(rt).noalias() = -hCoeffs(i) * vectors.col(i).tail(rs).adjoint() * vectors.bottomRightCorner(rs, rt).template triangularView<UnitLower>(); triFactor.row(i).tail(rt) = triFactor.row(i).tail(rt) * triFactor.bottomRightCorner(rt,rt).template triangularView<Upper>(); } triFactor(i,i) = hCoeffs(i); } } template<typename MatrixType,typename VectorsType,typename CoeffsType> void apply_block_householder_on_the_left(MatrixType& mat, const VectorsType& vectors, const CoeffsType& hCoeffs, bool forward) { enum { TFactorSize = MatrixType::ColsAtCompileTime }; Index nbVecs = vectors.cols(); Matrix<typename MatrixType::Scalar, TFactorSize, TFactorSize, RowMajor> T(nbVecs,nbVecs); if(forward) make_block_householder_triangular_factor(T, vectors, hCoeffs); else make_block_householder_triangular_factor(T, vectors, hCoeffs.conjugate()); const TriangularView<const VectorsType, UnitLower> V(vectors); Matrix<typename MatrixType::Scalar,VectorsType::ColsAtCompileTime,MatrixType::ColsAtCompileTime, (VectorsType::MaxColsAtCompileTime==1 && MatrixType::MaxColsAtCompileTime!=1)?RowMajor:ColMajor, VectorsType::MaxColsAtCompileTime,MatrixType::MaxColsAtCompileTime> tmp = V.adjoint() * mat; if(forward) tmp = T.template triangularView<Upper>() * tmp; else tmp = T.template triangularView<Upper>().adjoint() * tmp; mat.noalias() -= V * tmp; } } } # 26 "eigen-3.3.7/Eigen/Householder" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 12 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" #pragma GCC diagnostic pop # 28 "eigen-3.3.7/Eigen/Householder" 2 # 18 "eigen-3.3.7/Eigen/QR" 2 # 34 "eigen-3.3.7/Eigen/QR" # 1 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" 1 # 15 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" namespace Eigen { # 44 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" template<typename _MatrixType> class HouseholderQR { public: typedef _MatrixType MatrixType; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime }; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef typename MatrixType::StorageIndex StorageIndex; typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, (MatrixType::Flags&RowMajorBit) ? RowMajor : ColMajor, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixQType; typedef typename internal::plain_diag_type<MatrixType>::type HCoeffsType; typedef typename internal::plain_row_type<MatrixType>::type RowVectorType; typedef HouseholderSequence<MatrixType,typename internal::remove_all<typename HCoeffsType::ConjugateReturnType>::type> HouseholderSequenceType; HouseholderQR() : m_qr(), m_hCoeffs(), m_temp(), m_isInitialized(false) {} HouseholderQR(Index rows, Index cols) : m_qr(rows, cols), m_hCoeffs((std::min)(rows,cols)), m_temp(cols), m_isInitialized(false) {} # 96 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" template<typename InputType> explicit HouseholderQR(const EigenBase<InputType>& matrix) : m_qr(matrix.rows(), matrix.cols()), m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), m_temp(matrix.cols()), m_isInitialized(false) { compute(matrix.derived()); } # 114 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" template<typename InputType> explicit HouseholderQR(EigenBase<InputType>& matrix) : m_qr(matrix.derived()), m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), m_temp(matrix.cols()), m_isInitialized(false) { computeInPlace(); } # 138 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" template<typename Rhs> inline const Solve<HouseholderQR, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "HouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"HouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 142, __PRETTY_FUNCTION__)); return Solve<HouseholderQR, Rhs>(*this, b.derived()); } # 154 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" HouseholderSequenceType householderQ() const { ((m_isInitialized && "HouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"HouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 156, __PRETTY_FUNCTION__)); return HouseholderSequenceType(m_qr, m_hCoeffs.conjugate()); } const MatrixType& matrixQR() const { ((m_isInitialized && "HouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"HouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 165, __PRETTY_FUNCTION__)); return m_qr; } template<typename InputType> HouseholderQR& compute(const EigenBase<InputType>& matrix) { m_qr = matrix.derived(); computeInPlace(); return *this; } # 189 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" typename MatrixType::RealScalar absDeterminant() const; # 203 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" typename MatrixType::RealScalar logAbsDeterminant() const; inline Index rows() const { return m_qr.rows(); } inline Index cols() const { return m_qr.cols(); } const HCoeffsType& hCoeffs() const { return m_hCoeffs; } template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const; protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } void computeInPlace(); MatrixType m_qr; HCoeffsType m_hCoeffs; RowVectorType m_temp; bool m_isInitialized; }; template<typename MatrixType> typename MatrixType::RealScalar HouseholderQR<MatrixType>::absDeterminant() const { using std::abs; ((m_isInitialized && "HouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"HouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 239, __PRETTY_FUNCTION__)); ((m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_qr.rows() == m_qr.cols() && \"You can't take the determinant of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 240, __PRETTY_FUNCTION__)); return abs(m_qr.diagonal().prod()); } template<typename MatrixType> typename MatrixType::RealScalar HouseholderQR<MatrixType>::logAbsDeterminant() const { ((m_isInitialized && "HouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"HouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 247, __PRETTY_FUNCTION__)); ((m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_qr.rows() == m_qr.cols() && \"You can't take the determinant of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 248, __PRETTY_FUNCTION__)); return m_qr.diagonal().cwiseAbs().array().log().sum(); } namespace internal { template<typename MatrixQR, typename HCoeffs> void householder_qr_inplace_unblocked(MatrixQR& mat, HCoeffs& hCoeffs, typename MatrixQR::Scalar* tempData = 0) { typedef typename MatrixQR::Scalar Scalar; typedef typename MatrixQR::RealScalar RealScalar; Index rows = mat.rows(); Index cols = mat.cols(); Index size = (std::min)(rows,cols); ((hCoeffs.size() == size) ? static_cast<void> (0) : __assert_fail ("hCoeffs.size() == size", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 264, __PRETTY_FUNCTION__)); typedef Matrix<Scalar,MatrixQR::ColsAtCompileTime,1> TempType; TempType tempVector; if(tempData==0) { tempVector.resize(cols); tempData = tempVector.data(); } for(Index k = 0; k < size; ++k) { Index remainingRows = rows - k; Index remainingCols = cols - k - 1; RealScalar beta; mat.col(k).tail(remainingRows).makeHouseholderInPlace(hCoeffs.coeffRef(k), beta); mat.coeffRef(k,k) = beta; mat.bottomRightCorner(remainingRows, remainingCols) .applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows-1), hCoeffs.coeffRef(k), tempData+k+1); } } template<typename MatrixQR, typename HCoeffs, typename MatrixQRScalar = typename MatrixQR::Scalar, bool InnerStrideIsOne = (MatrixQR::InnerStrideAtCompileTime == 1 && HCoeffs::InnerStrideAtCompileTime == 1)> struct householder_qr_inplace_blocked { static void run(MatrixQR& mat, HCoeffs& hCoeffs, Index maxBlockSize=32, typename MatrixQR::Scalar* tempData = 0) { typedef typename MatrixQR::Scalar Scalar; typedef Block<MatrixQR,Dynamic,Dynamic> BlockType; Index rows = mat.rows(); Index cols = mat.cols(); Index size = (std::min)(rows, cols); typedef Matrix<Scalar,Dynamic,1,ColMajor,MatrixQR::MaxColsAtCompileTime,1> TempType; TempType tempVector; if(tempData==0) { tempVector.resize(cols); tempData = tempVector.data(); } Index blockSize = (std::min)(maxBlockSize,size); Index k = 0; for (k = 0; k < size; k += blockSize) { Index bs = (std::min)(size-k,blockSize); Index tcols = cols - k - bs; Index brows = rows-k; # 331 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" BlockType A11_21 = mat.block(k,k,brows,bs); Block<HCoeffs,Dynamic,1> hCoeffsSegment = hCoeffs.segment(k,bs); householder_qr_inplace_unblocked(A11_21, hCoeffsSegment, tempData); if(tcols) { BlockType A21_22 = mat.block(k,k+bs,brows,tcols); apply_block_householder_on_the_left(A21_22,A11_21,hCoeffsSegment, false); } } } }; } template<typename _MatrixType> template<typename RhsType, typename DstType> void HouseholderQR<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const { const Index rank = (std::min)(rows(), cols()); ((rhs.rows() == rows()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == rows()", "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h", 353, __PRETTY_FUNCTION__)); typename RhsType::PlainObject c(rhs); c.applyOnTheLeft(householderSequence( m_qr.leftCols(rank), m_hCoeffs.head(rank)).transpose() ); m_qr.topLeftCorner(rank, rank) .template triangularView<Upper>() .solveInPlace(c.topRows(rank)); dst.topRows(rank) = c.topRows(rank); dst.bottomRows(cols()-rank).setZero(); } # 378 "eigen-3.3.7/Eigen/src/QR/HouseholderQR.h" template<typename MatrixType> void HouseholderQR<MatrixType>::computeInPlace() { check_template_parameters(); Index rows = m_qr.rows(); Index cols = m_qr.cols(); Index size = (std::min)(rows,cols); m_hCoeffs.resize(size); m_temp.resize(cols); internal::householder_qr_inplace_blocked<MatrixType, HCoeffsType>::run(m_qr, m_hCoeffs, 48, m_temp.data()); m_isInitialized = true; } template<typename Derived> const HouseholderQR<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::householderQr() const { return HouseholderQR<PlainObject>(eval()); } } # 35 "eigen-3.3.7/Eigen/QR" 2 # 1 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" 1 # 14 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" namespace Eigen { namespace internal { template<typename _MatrixType> struct traits<FullPivHouseholderQR<_MatrixType> > : traits<_MatrixType> { enum { Flags = 0 }; }; template<typename MatrixType> struct FullPivHouseholderQRMatrixQReturnType; template<typename MatrixType> struct traits<FullPivHouseholderQRMatrixQReturnType<MatrixType> > { typedef typename MatrixType::PlainObject ReturnType; }; } # 57 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" template<typename _MatrixType> class FullPivHouseholderQR { public: typedef _MatrixType MatrixType; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime }; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef typename MatrixType::StorageIndex StorageIndex; typedef internal::FullPivHouseholderQRMatrixQReturnType<MatrixType> MatrixQReturnType; typedef typename internal::plain_diag_type<MatrixType>::type HCoeffsType; typedef Matrix<StorageIndex, 1, (((int)ColsAtCompileTime == 0 || (int)RowsAtCompileTime == 0) ? 0 : ((int)ColsAtCompileTime == 1 || (int)RowsAtCompileTime == 1) ? 1 : ((int)ColsAtCompileTime == Dynamic || (int)RowsAtCompileTime == Dynamic) ? Dynamic : ((int)ColsAtCompileTime <= (int)RowsAtCompileTime) ? (int)ColsAtCompileTime : (int)RowsAtCompileTime), RowMajor, 1, (((int)MaxColsAtCompileTime == 0 || (int)MaxRowsAtCompileTime == 0) ? 0 : ((int)MaxColsAtCompileTime == 1 || (int)MaxRowsAtCompileTime == 1) ? 1 : ((int)MaxColsAtCompileTime == Dynamic && (int)MaxRowsAtCompileTime == Dynamic) ? Dynamic : ((int)MaxColsAtCompileTime == Dynamic) ? (int)MaxRowsAtCompileTime : ((int)MaxRowsAtCompileTime == Dynamic) ? (int)MaxColsAtCompileTime : ((int)MaxColsAtCompileTime <= (int)MaxRowsAtCompileTime) ? (int)MaxColsAtCompileTime : (int)MaxRowsAtCompileTime)> IntDiagSizeVectorType; typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationType; typedef typename internal::plain_row_type<MatrixType>::type RowVectorType; typedef typename internal::plain_col_type<MatrixType>::type ColVectorType; typedef typename MatrixType::PlainObject PlainObject; FullPivHouseholderQR() : m_qr(), m_hCoeffs(), m_rows_transpositions(), m_cols_transpositions(), m_cols_permutation(), m_temp(), m_isInitialized(false), m_usePrescribedThreshold(false) {} FullPivHouseholderQR(Index rows, Index cols) : m_qr(rows, cols), m_hCoeffs((std::min)(rows,cols)), m_rows_transpositions((std::min)(rows,cols)), m_cols_transpositions((std::min)(rows,cols)), m_cols_permutation(cols), m_temp(cols), m_isInitialized(false), m_usePrescribedThreshold(false) {} # 125 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" template<typename InputType> explicit FullPivHouseholderQR(const EigenBase<InputType>& matrix) : m_qr(matrix.rows(), matrix.cols()), m_hCoeffs((std::min)(matrix.rows(), matrix.cols())), m_rows_transpositions((std::min)(matrix.rows(), matrix.cols())), m_cols_transpositions((std::min)(matrix.rows(), matrix.cols())), m_cols_permutation(matrix.cols()), m_temp(matrix.cols()), m_isInitialized(false), m_usePrescribedThreshold(false) { compute(matrix.derived()); } template<typename InputType> explicit FullPivHouseholderQR(EigenBase<InputType>& matrix) : m_qr(matrix.derived()), m_hCoeffs((std::min)(matrix.rows(), matrix.cols())), m_rows_transpositions((std::min)(matrix.rows(), matrix.cols())), m_cols_transpositions((std::min)(matrix.rows(), matrix.cols())), m_cols_permutation(matrix.cols()), m_temp(matrix.cols()), m_isInitialized(false), m_usePrescribedThreshold(false) { computeInPlace(); } # 174 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" template<typename Rhs> inline const Solve<FullPivHouseholderQR, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 178, __PRETTY_FUNCTION__)); return Solve<FullPivHouseholderQR, Rhs>(*this, b.derived()); } MatrixQReturnType matrixQ(void) const; const MatrixType& matrixQR() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 190, __PRETTY_FUNCTION__)); return m_qr; } template<typename InputType> FullPivHouseholderQR& compute(const EigenBase<InputType>& matrix); const PermutationType& colsPermutation() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 200, __PRETTY_FUNCTION__)); return m_cols_permutation; } const IntDiagSizeVectorType& rowsTranspositions() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 207, __PRETTY_FUNCTION__)); return m_rows_transpositions; } # 224 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" typename MatrixType::RealScalar absDeterminant() const; # 238 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" typename MatrixType::RealScalar logAbsDeterminant() const; inline Index rank() const { using std::abs; ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 249, __PRETTY_FUNCTION__)); RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold(); Index result = 0; for(Index i = 0; i < m_nonzero_pivots; ++i) result += (abs(m_qr.coeff(i,i)) > premultiplied_threshold); return result; } inline Index dimensionOfKernel() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 265, __PRETTY_FUNCTION__)); return cols() - rank(); } # 276 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" inline bool isInjective() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 278, __PRETTY_FUNCTION__)); return rank() == cols(); } # 289 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" inline bool isSurjective() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 291, __PRETTY_FUNCTION__)); return rank() == rows(); } inline bool isInvertible() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 303, __PRETTY_FUNCTION__)); return isInjective() && isSurjective(); } inline const Inverse<FullPivHouseholderQR> inverse() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 314, __PRETTY_FUNCTION__)); return Inverse<FullPivHouseholderQR>(*this); } inline Index rows() const { return m_qr.rows(); } inline Index cols() const { return m_qr.cols(); } const HCoeffsType& hCoeffs() const { return m_hCoeffs; } # 344 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" FullPivHouseholderQR& setThreshold(const RealScalar& threshold) { m_usePrescribedThreshold = true; m_prescribedThreshold = threshold; return *this; } # 359 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" FullPivHouseholderQR& setThreshold(Default_t) { m_usePrescribedThreshold = false; return *this; } RealScalar threshold() const { ((m_isInitialized || m_usePrescribedThreshold) ? static_cast<void> (0) : __assert_fail ("m_isInitialized || m_usePrescribedThreshold", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 371, __PRETTY_FUNCTION__)); return m_usePrescribedThreshold ? m_prescribedThreshold : NumTraits<Scalar>::epsilon() * RealScalar(m_qr.diagonalSize()); } # 385 "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h" inline Index nonzeroPivots() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 387, __PRETTY_FUNCTION__)); return m_nonzero_pivots; } RealScalar maxPivot() const { return m_maxpivot; } template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const; protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } void computeInPlace(); MatrixType m_qr; HCoeffsType m_hCoeffs; IntDiagSizeVectorType m_rows_transpositions; IntDiagSizeVectorType m_cols_transpositions; PermutationType m_cols_permutation; RowVectorType m_temp; bool m_isInitialized, m_usePrescribedThreshold; RealScalar m_prescribedThreshold, m_maxpivot; Index m_nonzero_pivots; RealScalar m_precision; Index m_det_pq; }; template<typename MatrixType> typename MatrixType::RealScalar FullPivHouseholderQR<MatrixType>::absDeterminant() const { using std::abs; ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 428, __PRETTY_FUNCTION__)); ((m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_qr.rows() == m_qr.cols() && \"You can't take the determinant of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 429, __PRETTY_FUNCTION__)); return abs(m_qr.diagonal().prod()); } template<typename MatrixType> typename MatrixType::RealScalar FullPivHouseholderQR<MatrixType>::logAbsDeterminant() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 436, __PRETTY_FUNCTION__)); ((m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_qr.rows() == m_qr.cols() && \"You can't take the determinant of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 437, __PRETTY_FUNCTION__)); return m_qr.diagonal().cwiseAbs().array().log().sum(); } template<typename MatrixType> template<typename InputType> FullPivHouseholderQR<MatrixType>& FullPivHouseholderQR<MatrixType>::compute(const EigenBase<InputType>& matrix) { m_qr = matrix.derived(); computeInPlace(); return *this; } template<typename MatrixType> void FullPivHouseholderQR<MatrixType>::computeInPlace() { check_template_parameters(); using std::abs; Index rows = m_qr.rows(); Index cols = m_qr.cols(); Index size = (std::min)(rows,cols); m_hCoeffs.resize(size); m_temp.resize(cols); m_precision = NumTraits<Scalar>::epsilon() * RealScalar(size); m_rows_transpositions.resize(size); m_cols_transpositions.resize(size); Index number_of_transpositions = 0; RealScalar biggest(0); m_nonzero_pivots = size; m_maxpivot = RealScalar(0); for (Index k = 0; k < size; ++k) { Index row_of_biggest_in_corner, col_of_biggest_in_corner; typedef internal::scalar_score_coeff_op<Scalar> Scoring; typedef typename Scoring::result_type Score; Score score = m_qr.bottomRightCorner(rows-k, cols-k) .unaryExpr(Scoring()) .maxCoeff(&row_of_biggest_in_corner, &col_of_biggest_in_corner); row_of_biggest_in_corner += k; col_of_biggest_in_corner += k; RealScalar biggest_in_corner = internal::abs_knowing_score<Scalar>()(m_qr(row_of_biggest_in_corner, col_of_biggest_in_corner), score); if(k==0) biggest = biggest_in_corner; if(internal::isMuchSmallerThan(biggest_in_corner, biggest, m_precision)) { m_nonzero_pivots = k; for(Index i = k; i < size; i++) { m_rows_transpositions.coeffRef(i) = i; m_cols_transpositions.coeffRef(i) = i; m_hCoeffs.coeffRef(i) = Scalar(0); } break; } m_rows_transpositions.coeffRef(k) = row_of_biggest_in_corner; m_cols_transpositions.coeffRef(k) = col_of_biggest_in_corner; if(k != row_of_biggest_in_corner) { m_qr.row(k).tail(cols-k).swap(m_qr.row(row_of_biggest_in_corner).tail(cols-k)); ++number_of_transpositions; } if(k != col_of_biggest_in_corner) { m_qr.col(k).swap(m_qr.col(col_of_biggest_in_corner)); ++number_of_transpositions; } RealScalar beta; m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta); m_qr.coeffRef(k,k) = beta; if(abs(beta) > m_maxpivot) m_maxpivot = abs(beta); m_qr.bottomRightCorner(rows-k, cols-k-1) .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1)); } m_cols_permutation.setIdentity(cols); for(Index k = 0; k < size; ++k) m_cols_permutation.applyTranspositionOnTheRight(k, m_cols_transpositions.coeff(k)); m_det_pq = (number_of_transpositions%2) ? -1 : 1; m_isInitialized = true; } template<typename _MatrixType> template<typename RhsType, typename DstType> void FullPivHouseholderQR<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const { ((rhs.rows() == rows()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == rows()", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 544, __PRETTY_FUNCTION__)); const Index l_rank = rank(); if(l_rank==0) { dst.setZero(); return; } typename RhsType::PlainObject c(rhs); Matrix<Scalar,1,RhsType::ColsAtCompileTime> temp(rhs.cols()); for (Index k = 0; k < l_rank; ++k) { Index remainingSize = rows()-k; c.row(k).swap(c.row(m_rows_transpositions.coeff(k))); c.bottomRightCorner(remainingSize, rhs.cols()) .applyHouseholderOnTheLeft(m_qr.col(k).tail(remainingSize-1), m_hCoeffs.coeff(k), &temp.coeffRef(0)); } m_qr.topLeftCorner(l_rank, l_rank) .template triangularView<Upper>() .solveInPlace(c.topRows(l_rank)); for(Index i = 0; i < l_rank; ++i) dst.row(m_cols_permutation.indices().coeff(i)) = c.row(i); for(Index i = l_rank; i < cols(); ++i) dst.row(m_cols_permutation.indices().coeff(i)).setZero(); } namespace internal { template<typename DstXprType, typename MatrixType> struct Assignment<DstXprType, Inverse<FullPivHouseholderQR<MatrixType> >, internal::assign_op<typename DstXprType::Scalar,typename FullPivHouseholderQR<MatrixType>::Scalar>, Dense2Dense> { typedef FullPivHouseholderQR<MatrixType> QrType; typedef Inverse<QrType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename QrType::Scalar> &) { dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); } }; template<typename MatrixType> struct FullPivHouseholderQRMatrixQReturnType : public ReturnByValue<FullPivHouseholderQRMatrixQReturnType<MatrixType> > { public: typedef typename FullPivHouseholderQR<MatrixType>::IntDiagSizeVectorType IntDiagSizeVectorType; typedef typename internal::plain_diag_type<MatrixType>::type HCoeffsType; typedef Matrix<typename MatrixType::Scalar, 1, MatrixType::RowsAtCompileTime, RowMajor, 1, MatrixType::MaxRowsAtCompileTime> WorkVectorType; FullPivHouseholderQRMatrixQReturnType(const MatrixType& qr, const HCoeffsType& hCoeffs, const IntDiagSizeVectorType& rowsTranspositions) : m_qr(qr), m_hCoeffs(hCoeffs), m_rowsTranspositions(rowsTranspositions) {} template <typename ResultType> void evalTo(ResultType& result) const { const Index rows = m_qr.rows(); WorkVectorType workspace(rows); evalTo(result, workspace); } template <typename ResultType> void evalTo(ResultType& result, WorkVectorType& workspace) const { using numext::conj; const Index rows = m_qr.rows(); const Index cols = m_qr.cols(); const Index size = (std::min)(rows, cols); workspace.resize(rows); result.setIdentity(rows, rows); for (Index k = size-1; k >= 0; k--) { result.block(k, k, rows-k, rows-k) .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), conj(m_hCoeffs.coeff(k)), &workspace.coeffRef(k)); result.row(k).swap(result.row(m_rowsTranspositions.coeff(k))); } } Index rows() const { return m_qr.rows(); } Index cols() const { return m_qr.rows(); } protected: typename MatrixType::Nested m_qr; typename HCoeffsType::Nested m_hCoeffs; typename IntDiagSizeVectorType::Nested m_rowsTranspositions; }; } template<typename MatrixType> inline typename FullPivHouseholderQR<MatrixType>::MatrixQReturnType FullPivHouseholderQR<MatrixType>::matrixQ() const { ((m_isInitialized && "FullPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"FullPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/FullPivHouseholderQR.h", 659, __PRETTY_FUNCTION__)); return MatrixQReturnType(m_qr, m_hCoeffs, m_rows_transpositions); } template<typename Derived> const FullPivHouseholderQR<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::fullPivHouseholderQr() const { return FullPivHouseholderQR<PlainObject>(eval()); } } # 36 "eigen-3.3.7/Eigen/QR" 2 # 1 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" 1 # 14 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" namespace Eigen { namespace internal { template<typename _MatrixType> struct traits<ColPivHouseholderQR<_MatrixType> > : traits<_MatrixType> { enum { Flags = 0 }; }; } # 48 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" template<typename _MatrixType> class ColPivHouseholderQR { public: typedef _MatrixType MatrixType; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime }; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef typename MatrixType::StorageIndex StorageIndex; typedef typename internal::plain_diag_type<MatrixType>::type HCoeffsType; typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationType; typedef typename internal::plain_row_type<MatrixType, Index>::type IntRowVectorType; typedef typename internal::plain_row_type<MatrixType>::type RowVectorType; typedef typename internal::plain_row_type<MatrixType, RealScalar>::type RealRowVectorType; typedef HouseholderSequence<MatrixType,typename internal::remove_all<typename HCoeffsType::ConjugateReturnType>::type> HouseholderSequenceType; typedef typename MatrixType::PlainObject PlainObject; private: typedef typename PermutationType::StorageIndex PermIndexType; public: ColPivHouseholderQR() : m_qr(), m_hCoeffs(), m_colsPermutation(), m_colsTranspositions(), m_temp(), m_colNormsUpdated(), m_colNormsDirect(), m_isInitialized(false), m_usePrescribedThreshold(false) {} ColPivHouseholderQR(Index rows, Index cols) : m_qr(rows, cols), m_hCoeffs((std::min)(rows,cols)), m_colsPermutation(PermIndexType(cols)), m_colsTranspositions(cols), m_temp(cols), m_colNormsUpdated(cols), m_colNormsDirect(cols), m_isInitialized(false), m_usePrescribedThreshold(false) {} # 123 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" template<typename InputType> explicit ColPivHouseholderQR(const EigenBase<InputType>& matrix) : m_qr(matrix.rows(), matrix.cols()), m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), m_colsPermutation(PermIndexType(matrix.cols())), m_colsTranspositions(matrix.cols()), m_temp(matrix.cols()), m_colNormsUpdated(matrix.cols()), m_colNormsDirect(matrix.cols()), m_isInitialized(false), m_usePrescribedThreshold(false) { compute(matrix.derived()); } template<typename InputType> explicit ColPivHouseholderQR(EigenBase<InputType>& matrix) : m_qr(matrix.derived()), m_hCoeffs((std::min)(matrix.rows(),matrix.cols())), m_colsPermutation(PermIndexType(matrix.cols())), m_colsTranspositions(matrix.cols()), m_temp(matrix.cols()), m_colNormsUpdated(matrix.cols()), m_colNormsDirect(matrix.cols()), m_isInitialized(false), m_usePrescribedThreshold(false) { computeInPlace(); } # 173 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" template<typename Rhs> inline const Solve<ColPivHouseholderQR, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 177, __PRETTY_FUNCTION__)); return Solve<ColPivHouseholderQR, Rhs>(*this, b.derived()); } HouseholderSequenceType householderQ() const; HouseholderSequenceType matrixQ() const { return householderQ(); } const MatrixType& matrixQR() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 191, __PRETTY_FUNCTION__)); return m_qr; } # 204 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" const MatrixType& matrixR() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 206, __PRETTY_FUNCTION__)); return m_qr; } template<typename InputType> ColPivHouseholderQR& compute(const EigenBase<InputType>& matrix); const PermutationType& colsPermutation() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 216, __PRETTY_FUNCTION__)); return m_colsPermutation; } # 233 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" typename MatrixType::RealScalar absDeterminant() const; # 247 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" typename MatrixType::RealScalar logAbsDeterminant() const; inline Index rank() const { using std::abs; ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 258, __PRETTY_FUNCTION__)); RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold(); Index result = 0; for(Index i = 0; i < m_nonzero_pivots; ++i) result += (abs(m_qr.coeff(i,i)) > premultiplied_threshold); return result; } inline Index dimensionOfKernel() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 274, __PRETTY_FUNCTION__)); return cols() - rank(); } # 285 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" inline bool isInjective() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 287, __PRETTY_FUNCTION__)); return rank() == cols(); } # 298 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" inline bool isSurjective() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 300, __PRETTY_FUNCTION__)); return rank() == rows(); } inline bool isInvertible() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 312, __PRETTY_FUNCTION__)); return isInjective() && isSurjective(); } inline const Inverse<ColPivHouseholderQR> inverse() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 323, __PRETTY_FUNCTION__)); return Inverse<ColPivHouseholderQR>(*this); } inline Index rows() const { return m_qr.rows(); } inline Index cols() const { return m_qr.cols(); } const HCoeffsType& hCoeffs() const { return m_hCoeffs; } # 353 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" ColPivHouseholderQR& setThreshold(const RealScalar& threshold) { m_usePrescribedThreshold = true; m_prescribedThreshold = threshold; return *this; } # 368 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" ColPivHouseholderQR& setThreshold(Default_t) { m_usePrescribedThreshold = false; return *this; } RealScalar threshold() const { ((m_isInitialized || m_usePrescribedThreshold) ? static_cast<void> (0) : __assert_fail ("m_isInitialized || m_usePrescribedThreshold", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 380, __PRETTY_FUNCTION__)); return m_usePrescribedThreshold ? m_prescribedThreshold : NumTraits<Scalar>::epsilon() * RealScalar(m_qr.diagonalSize()); } # 394 "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h" inline Index nonzeroPivots() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 396, __PRETTY_FUNCTION__)); return m_nonzero_pivots; } RealScalar maxPivot() const { return m_maxpivot; } ComputationInfo info() const { ((m_isInitialized && "Decomposition is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"Decomposition is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 413, __PRETTY_FUNCTION__)); return Success; } template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const; protected: friend class CompleteOrthogonalDecomposition<MatrixType>; static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } void computeInPlace(); MatrixType m_qr; HCoeffsType m_hCoeffs; PermutationType m_colsPermutation; IntRowVectorType m_colsTranspositions; RowVectorType m_temp; RealRowVectorType m_colNormsUpdated; RealRowVectorType m_colNormsDirect; bool m_isInitialized, m_usePrescribedThreshold; RealScalar m_prescribedThreshold, m_maxpivot; Index m_nonzero_pivots; Index m_det_pq; }; template<typename MatrixType> typename MatrixType::RealScalar ColPivHouseholderQR<MatrixType>::absDeterminant() const { using std::abs; ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 451, __PRETTY_FUNCTION__)); ((m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_qr.rows() == m_qr.cols() && \"You can't take the determinant of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 452, __PRETTY_FUNCTION__)); return abs(m_qr.diagonal().prod()); } template<typename MatrixType> typename MatrixType::RealScalar ColPivHouseholderQR<MatrixType>::logAbsDeterminant() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 459, __PRETTY_FUNCTION__)); ((m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_qr.rows() == m_qr.cols() && \"You can't take the determinant of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 460, __PRETTY_FUNCTION__)); return m_qr.diagonal().cwiseAbs().array().log().sum(); } template<typename MatrixType> template<typename InputType> ColPivHouseholderQR<MatrixType>& ColPivHouseholderQR<MatrixType>::compute(const EigenBase<InputType>& matrix) { m_qr = matrix.derived(); computeInPlace(); return *this; } template<typename MatrixType> void ColPivHouseholderQR<MatrixType>::computeInPlace() { check_template_parameters(); ((m_qr.cols()<=NumTraits<int>::highest()) ? static_cast<void> (0) : __assert_fail ("m_qr.cols()<=NumTraits<int>::highest()", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 485, __PRETTY_FUNCTION__)); using std::abs; Index rows = m_qr.rows(); Index cols = m_qr.cols(); Index size = m_qr.diagonalSize(); m_hCoeffs.resize(size); m_temp.resize(cols); m_colsTranspositions.resize(m_qr.cols()); Index number_of_transpositions = 0; m_colNormsUpdated.resize(cols); m_colNormsDirect.resize(cols); for (Index k = 0; k < cols; ++k) { m_colNormsDirect.coeffRef(k) = m_qr.col(k).norm(); m_colNormsUpdated.coeffRef(k) = m_colNormsDirect.coeffRef(k); } RealScalar threshold_helper = numext::abs2<RealScalar>(m_colNormsUpdated.maxCoeff() * NumTraits<RealScalar>::epsilon()) / RealScalar(rows); RealScalar norm_downdate_threshold = numext::sqrt(NumTraits<RealScalar>::epsilon()); m_nonzero_pivots = size; m_maxpivot = RealScalar(0); for(Index k = 0; k < size; ++k) { Index biggest_col_index; RealScalar biggest_col_sq_norm = numext::abs2(m_colNormsUpdated.tail(cols-k).maxCoeff(&biggest_col_index)); biggest_col_index += k; if(m_nonzero_pivots==size && biggest_col_sq_norm < threshold_helper * RealScalar(rows-k)) m_nonzero_pivots = k; m_colsTranspositions.coeffRef(k) = biggest_col_index; if(k != biggest_col_index) { m_qr.col(k).swap(m_qr.col(biggest_col_index)); std::swap(m_colNormsUpdated.coeffRef(k), m_colNormsUpdated.coeffRef(biggest_col_index)); std::swap(m_colNormsDirect.coeffRef(k), m_colNormsDirect.coeffRef(biggest_col_index)); ++number_of_transpositions; } RealScalar beta; m_qr.col(k).tail(rows-k).makeHouseholderInPlace(m_hCoeffs.coeffRef(k), beta); m_qr.coeffRef(k,k) = beta; if(abs(beta) > m_maxpivot) m_maxpivot = abs(beta); m_qr.bottomRightCorner(rows-k, cols-k-1) .applyHouseholderOnTheLeft(m_qr.col(k).tail(rows-k-1), m_hCoeffs.coeffRef(k), &m_temp.coeffRef(k+1)); for (Index j = k + 1; j < cols; ++j) { if (m_colNormsUpdated.coeffRef(j) != RealScalar(0)) { RealScalar temp = abs(m_qr.coeffRef(k, j)) / m_colNormsUpdated.coeffRef(j); temp = (RealScalar(1) + temp) * (RealScalar(1) - temp); temp = temp < RealScalar(0) ? RealScalar(0) : temp; RealScalar temp2 = temp * numext::abs2<RealScalar>(m_colNormsUpdated.coeffRef(j) / m_colNormsDirect.coeffRef(j)); if (temp2 <= norm_downdate_threshold) { m_colNormsDirect.coeffRef(j) = m_qr.col(j).tail(rows - k - 1).norm(); m_colNormsUpdated.coeffRef(j) = m_colNormsDirect.coeffRef(j); } else { m_colNormsUpdated.coeffRef(j) *= numext::sqrt(temp); } } } } m_colsPermutation.setIdentity(PermIndexType(cols)); for(PermIndexType k = 0; k < size ; ++k) m_colsPermutation.applyTranspositionOnTheRight(k, PermIndexType(m_colsTranspositions.coeff(k))); m_det_pq = (number_of_transpositions%2) ? -1 : 1; m_isInitialized = true; } template<typename _MatrixType> template<typename RhsType, typename DstType> void ColPivHouseholderQR<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const { ((rhs.rows() == rows()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == rows()", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 587, __PRETTY_FUNCTION__)); const Index nonzero_pivots = nonzeroPivots(); if(nonzero_pivots == 0) { dst.setZero(); return; } typename RhsType::PlainObject c(rhs); c.applyOnTheLeft(householderSequence(m_qr, m_hCoeffs) .setLength(nonzero_pivots) .transpose() ); m_qr.topLeftCorner(nonzero_pivots, nonzero_pivots) .template triangularView<Upper>() .solveInPlace(c.topRows(nonzero_pivots)); for(Index i = 0; i < nonzero_pivots; ++i) dst.row(m_colsPermutation.indices().coeff(i)) = c.row(i); for(Index i = nonzero_pivots; i < cols(); ++i) dst.row(m_colsPermutation.indices().coeff(i)).setZero(); } namespace internal { template<typename DstXprType, typename MatrixType> struct Assignment<DstXprType, Inverse<ColPivHouseholderQR<MatrixType> >, internal::assign_op<typename DstXprType::Scalar,typename ColPivHouseholderQR<MatrixType>::Scalar>, Dense2Dense> { typedef ColPivHouseholderQR<MatrixType> QrType; typedef Inverse<QrType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename QrType::Scalar> &) { dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); } }; } template<typename MatrixType> typename ColPivHouseholderQR<MatrixType>::HouseholderSequenceType ColPivHouseholderQR<MatrixType> ::householderQ() const { ((m_isInitialized && "ColPivHouseholderQR is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"ColPivHouseholderQR is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/ColPivHouseholderQR.h", 636, __PRETTY_FUNCTION__)); return HouseholderSequenceType(m_qr, m_hCoeffs.conjugate()); } template<typename Derived> const ColPivHouseholderQR<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::colPivHouseholderQr() const { return ColPivHouseholderQR<PlainObject>(eval()); } } # 37 "eigen-3.3.7/Eigen/QR" 2 # 1 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" 1 # 13 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" namespace Eigen { namespace internal { template <typename _MatrixType> struct traits<CompleteOrthogonalDecomposition<_MatrixType> > : traits<_MatrixType> { enum { Flags = 0 }; }; } # 47 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" template <typename _MatrixType> class CompleteOrthogonalDecomposition { public: typedef _MatrixType MatrixType; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime }; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef typename MatrixType::StorageIndex StorageIndex; typedef typename internal::plain_diag_type<MatrixType>::type HCoeffsType; typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationType; typedef typename internal::plain_row_type<MatrixType, Index>::type IntRowVectorType; typedef typename internal::plain_row_type<MatrixType>::type RowVectorType; typedef typename internal::plain_row_type<MatrixType, RealScalar>::type RealRowVectorType; typedef HouseholderSequence< MatrixType, typename internal::remove_all< typename HCoeffsType::ConjugateReturnType>::type> HouseholderSequenceType; typedef typename MatrixType::PlainObject PlainObject; private: typedef typename PermutationType::Index PermIndexType; public: CompleteOrthogonalDecomposition() : m_cpqr(), m_zCoeffs(), m_temp() {} CompleteOrthogonalDecomposition(Index rows, Index cols) : m_cpqr(rows, cols), m_zCoeffs((std::min)(rows, cols)), m_temp(cols) {} # 112 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" template <typename InputType> explicit CompleteOrthogonalDecomposition(const EigenBase<InputType>& matrix) : m_cpqr(matrix.rows(), matrix.cols()), m_zCoeffs((std::min)(matrix.rows(), matrix.cols())), m_temp(matrix.cols()) { compute(matrix.derived()); } template<typename InputType> explicit CompleteOrthogonalDecomposition(EigenBase<InputType>& matrix) : m_cpqr(matrix.derived()), m_zCoeffs((std::min)(matrix.rows(), matrix.cols())), m_temp(matrix.cols()) { computeInPlace(); } # 146 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" template <typename Rhs> inline const Solve<CompleteOrthogonalDecomposition, Rhs> solve( const MatrixBase<Rhs>& b) const { ((m_cpqr.m_isInitialized && "CompleteOrthogonalDecomposition is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_cpqr.m_isInitialized && \"CompleteOrthogonalDecomposition is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" # 149 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" , 150 # 149 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" , __PRETTY_FUNCTION__)) ; return Solve<CompleteOrthogonalDecomposition, Rhs>(*this, b.derived()); } HouseholderSequenceType householderQ(void) const; HouseholderSequenceType matrixQ(void) const { return m_cpqr.householderQ(); } MatrixType matrixZ() const { MatrixType Z = MatrixType::Identity(m_cpqr.cols(), m_cpqr.cols()); applyZAdjointOnTheLeftInPlace(Z); return Z.adjoint(); } const MatrixType& matrixQTZ() const { return m_cpqr.matrixQR(); } # 181 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" const MatrixType& matrixT() const { return m_cpqr.matrixQR(); } template <typename InputType> CompleteOrthogonalDecomposition& compute(const EigenBase<InputType>& matrix) { m_cpqr.compute(matrix); computeInPlace(); return *this; } const PermutationType& colsPermutation() const { return m_cpqr.colsPermutation(); } # 209 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" typename MatrixType::RealScalar absDeterminant() const; # 224 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" typename MatrixType::RealScalar logAbsDeterminant() const; # 233 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" inline Index rank() const { return m_cpqr.rank(); } # 242 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" inline Index dimensionOfKernel() const { return m_cpqr.dimensionOfKernel(); } # 251 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" inline bool isInjective() const { return m_cpqr.isInjective(); } # 260 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" inline bool isSurjective() const { return m_cpqr.isSurjective(); } # 269 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" inline bool isInvertible() const { return m_cpqr.isInvertible(); } inline const Inverse<CompleteOrthogonalDecomposition> pseudoInverse() const { return Inverse<CompleteOrthogonalDecomposition>(*this); } inline Index rows() const { return m_cpqr.rows(); } inline Index cols() const { return m_cpqr.cols(); } inline const HCoeffsType& hCoeffs() const { return m_cpqr.hCoeffs(); } const HCoeffsType& zCoeffs() const { return m_zCoeffs; } # 317 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" CompleteOrthogonalDecomposition& setThreshold(const RealScalar& threshold) { m_cpqr.setThreshold(threshold); return *this; } # 330 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" CompleteOrthogonalDecomposition& setThreshold(Default_t) { m_cpqr.setThreshold(Default); return *this; } RealScalar threshold() const { return m_cpqr.threshold(); } # 348 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" inline Index nonzeroPivots() const { return m_cpqr.nonzeroPivots(); } inline RealScalar maxPivot() const { return m_cpqr.maxPivot(); } # 363 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" ComputationInfo info() const { ((m_cpqr.m_isInitialized && "Decomposition is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_cpqr.m_isInitialized && \"Decomposition is not initialized.\"", "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h", 364, __PRETTY_FUNCTION__)); return Success; } template <typename RhsType, typename DstType> void _solve_impl(const RhsType& rhs, DstType& dst) const; protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } void computeInPlace(); template <typename Rhs> void applyZAdjointOnTheLeftInPlace(Rhs& rhs) const; ColPivHouseholderQR<MatrixType> m_cpqr; HCoeffsType m_zCoeffs; RowVectorType m_temp; }; template <typename MatrixType> typename MatrixType::RealScalar CompleteOrthogonalDecomposition<MatrixType>::absDeterminant() const { return m_cpqr.absDeterminant(); } template <typename MatrixType> typename MatrixType::RealScalar CompleteOrthogonalDecomposition<MatrixType>::logAbsDeterminant() const { return m_cpqr.logAbsDeterminant(); } # 409 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" template <typename MatrixType> void CompleteOrthogonalDecomposition<MatrixType>::computeInPlace() { check_template_parameters(); ((m_cpqr.cols() <= NumTraits<int>::highest()) ? static_cast<void> (0) : __assert_fail ("m_cpqr.cols() <= NumTraits<int>::highest()", "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h", 415, __PRETTY_FUNCTION__)); const Index rank = m_cpqr.rank(); const Index cols = m_cpqr.cols(); const Index rows = m_cpqr.rows(); m_zCoeffs.resize((std::min)(rows, cols)); m_temp.resize(cols); if (rank < cols) { # 435 "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h" for (Index k = rank - 1; k >= 0; --k) { if (k != rank - 1) { m_cpqr.m_qr.col(k).head(k + 1).swap( m_cpqr.m_qr.col(rank - 1).head(k + 1)); } RealScalar beta; m_cpqr.m_qr.row(k) .tail(cols - rank + 1) .makeHouseholderInPlace(m_zCoeffs(k), beta); m_cpqr.m_qr(k, rank - 1) = beta; if (k > 0) { m_cpqr.m_qr.topRightCorner(k, cols - rank + 1) .applyHouseholderOnTheRight( m_cpqr.m_qr.row(k).tail(cols - rank).transpose(), m_zCoeffs(k), &m_temp(0)); } if (k != rank - 1) { m_cpqr.m_qr.col(k).head(k + 1).swap( m_cpqr.m_qr.col(rank - 1).head(k + 1)); } } } } template <typename MatrixType> template <typename Rhs> void CompleteOrthogonalDecomposition<MatrixType>::applyZAdjointOnTheLeftInPlace( Rhs& rhs) const { const Index cols = this->cols(); const Index nrhs = rhs.cols(); const Index rank = this->rank(); Matrix<typename MatrixType::Scalar, Dynamic, 1> temp((std::max)(cols, nrhs)); for (Index k = 0; k < rank; ++k) { if (k != rank - 1) { rhs.row(k).swap(rhs.row(rank - 1)); } rhs.middleRows(rank - 1, cols - rank + 1) .applyHouseholderOnTheLeft( matrixQTZ().row(k).tail(cols - rank).adjoint(), zCoeffs()(k), &temp(0)); if (k != rank - 1) { rhs.row(k).swap(rhs.row(rank - 1)); } } } template <typename _MatrixType> template <typename RhsType, typename DstType> void CompleteOrthogonalDecomposition<_MatrixType>::_solve_impl( const RhsType& rhs, DstType& dst) const { ((rhs.rows() == this->rows()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == this->rows()", "eigen-3.3.7/Eigen/src/QR/CompleteOrthogonalDecomposition.h", 494, __PRETTY_FUNCTION__)); const Index rank = this->rank(); if (rank == 0) { dst.setZero(); return; } typename RhsType::PlainObject c(rhs); c.applyOnTheLeft( householderSequence(matrixQTZ(), hCoeffs()).setLength(rank).transpose()); dst.topRows(rank) = matrixT() .topLeftCorner(rank, rank) .template triangularView<Upper>() .solve(c.topRows(rank)); const Index cols = this->cols(); if (rank < cols) { dst.bottomRows(cols - rank).setZero(); applyZAdjointOnTheLeftInPlace(dst); } dst = colsPermutation() * dst; } namespace internal { template<typename DstXprType, typename MatrixType> struct Assignment<DstXprType, Inverse<CompleteOrthogonalDecomposition<MatrixType> >, internal::assign_op<typename DstXprType::Scalar,typename CompleteOrthogonalDecomposition<MatrixType>::Scalar>, Dense2Dense> { typedef CompleteOrthogonalDecomposition<MatrixType> CodType; typedef Inverse<CodType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename CodType::Scalar> &) { dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.rows())); } }; } template <typename MatrixType> typename CompleteOrthogonalDecomposition<MatrixType>::HouseholderSequenceType CompleteOrthogonalDecomposition<MatrixType>::householderQ() const { return m_cpqr.householderQ(); } template <typename Derived> const CompleteOrthogonalDecomposition<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::completeOrthogonalDecomposition() const { return CompleteOrthogonalDecomposition<PlainObject>(eval()); } } # 38 "eigen-3.3.7/Eigen/QR" 2 # 48 "eigen-3.3.7/Eigen/QR" # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 49 "eigen-3.3.7/Eigen/QR" 2 # 12 "eigen-3.3.7/Eigen/SVD" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" 1 # 49 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wshadow" #pragma GCC diagnostic ignored "-Wtype-limits" # 16 "eigen-3.3.7/Eigen/SVD" 2 # 34 "eigen-3.3.7/Eigen/SVD" # 1 "eigen-3.3.7/Eigen/src/misc/RealSvd2x2.h" 1 # 14 "eigen-3.3.7/Eigen/src/misc/RealSvd2x2.h" namespace Eigen { namespace internal { template<typename MatrixType, typename RealScalar, typename Index> void real_2x2_jacobi_svd(const MatrixType& matrix, Index p, Index q, JacobiRotation<RealScalar> *j_left, JacobiRotation<RealScalar> *j_right) { using std::sqrt; using std::abs; Matrix<RealScalar,2,2> m; m << numext::real(matrix.coeff(p,p)), numext::real(matrix.coeff(p,q)), numext::real(matrix.coeff(q,p)), numext::real(matrix.coeff(q,q)); JacobiRotation<RealScalar> rot1; RealScalar t = m.coeff(0,0) + m.coeff(1,1); RealScalar d = m.coeff(1,0) - m.coeff(0,1); if(abs(d) < (std::numeric_limits<RealScalar>::min)()) { rot1.s() = RealScalar(0); rot1.c() = RealScalar(1); } else { RealScalar u = t / d; RealScalar tmp = sqrt(RealScalar(1) + numext::abs2(u)); rot1.s() = RealScalar(1) / tmp; rot1.c() = u / tmp; } m.applyOnTheLeft(0,1,rot1); j_right->makeJacobi(m,0,1); *j_left = rot1 * j_right->transpose(); } } } # 35 "eigen-3.3.7/Eigen/SVD" 2 # 1 "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h" 1 # 14 "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h" namespace Eigen { namespace internal { template<typename _MatrixType> class UpperBidiagonalization { public: typedef _MatrixType MatrixType; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, ColsAtCompileTimeMinusOne = internal::decrement_size<ColsAtCompileTime>::ret }; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef Eigen::Index Index; typedef Matrix<Scalar, 1, ColsAtCompileTime> RowVectorType; typedef Matrix<Scalar, RowsAtCompileTime, 1> ColVectorType; typedef BandMatrix<RealScalar, ColsAtCompileTime, ColsAtCompileTime, 1, 0, RowMajor> BidiagonalType; typedef Matrix<Scalar, ColsAtCompileTime, 1> DiagVectorType; typedef Matrix<Scalar, ColsAtCompileTimeMinusOne, 1> SuperDiagVectorType; typedef HouseholderSequence< const MatrixType, const typename internal::remove_all<typename Diagonal<const MatrixType,0>::ConjugateReturnType>::type > HouseholderUSequenceType; typedef HouseholderSequence< const typename internal::remove_all<typename MatrixType::ConjugateReturnType>::type, Diagonal<const MatrixType,1>, OnTheRight > HouseholderVSequenceType; UpperBidiagonalization() : m_householder(), m_bidiagonal(), m_isInitialized(false) {} explicit UpperBidiagonalization(const MatrixType& matrix) : m_householder(matrix.rows(), matrix.cols()), m_bidiagonal(matrix.cols(), matrix.cols()), m_isInitialized(false) { compute(matrix); } UpperBidiagonalization& compute(const MatrixType& matrix); UpperBidiagonalization& computeUnblocked(const MatrixType& matrix); const MatrixType& householder() const { return m_householder; } const BidiagonalType& bidiagonal() const { return m_bidiagonal; } const HouseholderUSequenceType householderU() const { ((m_isInitialized && "UpperBidiagonalization is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"UpperBidiagonalization is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h", 72, __PRETTY_FUNCTION__)); return HouseholderUSequenceType(m_householder, m_householder.diagonal().conjugate()); } const HouseholderVSequenceType householderV() { ((m_isInitialized && "UpperBidiagonalization is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"UpperBidiagonalization is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h", 78, __PRETTY_FUNCTION__)); return HouseholderVSequenceType(m_householder.conjugate(), m_householder.const_derived().template diagonal<1>()) .setLength(m_householder.cols()-1) .setShift(1); } protected: MatrixType m_householder; BidiagonalType m_bidiagonal; bool m_isInitialized; }; template<typename MatrixType> void upperbidiagonalization_inplace_unblocked(MatrixType& mat, typename MatrixType::RealScalar *diagonal, typename MatrixType::RealScalar *upper_diagonal, typename MatrixType::Scalar* tempData = 0) { typedef typename MatrixType::Scalar Scalar; Index rows = mat.rows(); Index cols = mat.cols(); typedef Matrix<Scalar,Dynamic,1,ColMajor,MatrixType::MaxRowsAtCompileTime,1> TempType; TempType tempVector; if(tempData==0) { tempVector.resize(rows); tempData = tempVector.data(); } for (Index k = 0; ; ++k) { Index remainingRows = rows - k; Index remainingCols = cols - k - 1; mat.col(k).tail(remainingRows) .makeHouseholderInPlace(mat.coeffRef(k,k), diagonal[k]); mat.bottomRightCorner(remainingRows, remainingCols) .applyHouseholderOnTheLeft(mat.col(k).tail(remainingRows-1), mat.coeff(k,k), tempData); if(k == cols-1) break; mat.row(k).tail(remainingCols) .makeHouseholderInPlace(mat.coeffRef(k,k+1), upper_diagonal[k]); mat.bottomRightCorner(remainingRows-1, remainingCols) .applyHouseholderOnTheRight(mat.row(k).tail(remainingCols-1).transpose(), mat.coeff(k,k+1), tempData); } } # 151 "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h" template<typename MatrixType> void upperbidiagonalization_blocked_helper(MatrixType& A, typename MatrixType::RealScalar *diagonal, typename MatrixType::RealScalar *upper_diagonal, Index bs, Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, traits<MatrixType>::Flags & RowMajorBit> > X, Ref<Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, traits<MatrixType>::Flags & RowMajorBit> > Y) { typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef typename NumTraits<RealScalar>::Literal Literal; enum { StorageOrder = traits<MatrixType>::Flags & RowMajorBit }; typedef InnerStride<int(StorageOrder) == int(ColMajor) ? 1 : Dynamic> ColInnerStride; typedef InnerStride<int(StorageOrder) == int(ColMajor) ? Dynamic : 1> RowInnerStride; typedef Ref<Matrix<Scalar, Dynamic, 1>, 0, ColInnerStride> SubColumnType; typedef Ref<Matrix<Scalar, 1, Dynamic>, 0, RowInnerStride> SubRowType; typedef Ref<Matrix<Scalar, Dynamic, Dynamic, StorageOrder > > SubMatType; Index brows = A.rows(); Index bcols = A.cols(); Scalar tau_u, tau_u_prev(0), tau_v; for(Index k = 0; k < bs; ++k) { Index remainingRows = brows - k; Index remainingCols = bcols - k - 1; SubMatType X_k1( X.block(k,0, remainingRows,k) ); SubMatType V_k1( A.block(k,0, remainingRows,k) ); SubColumnType v_k = A.col(k).tail(remainingRows); v_k -= V_k1 * Y.row(k).head(k).adjoint(); if(k) v_k -= X_k1 * A.col(k).head(k); v_k.makeHouseholderInPlace(tau_v, diagonal[k]); if(k+1<bcols) { SubMatType Y_k ( Y.block(k+1,0, remainingCols, k+1) ); SubMatType U_k1 ( A.block(0,k+1, k,remainingCols) ); A(k,k) = Scalar(1); { SubColumnType y_k( Y.col(k).tail(remainingCols) ); SubColumnType tmp( Y.col(k).head(k) ); y_k.noalias() = A.block(k,k+1, remainingRows,remainingCols).adjoint() * v_k; tmp.noalias() = V_k1.adjoint() * v_k; y_k.noalias() -= Y_k.leftCols(k) * tmp; tmp.noalias() = X_k1.adjoint() * v_k; y_k.noalias() -= U_k1.adjoint() * tmp; y_k *= numext::conj(tau_v); } SubRowType u_k( A.row(k).tail(remainingCols) ); u_k = u_k.conjugate(); { u_k -= Y_k * A.row(k).head(k+1).adjoint(); if(k) u_k -= U_k1.adjoint() * X.row(k).head(k).adjoint(); } u_k.makeHouseholderInPlace(tau_u, upper_diagonal[k]); A(k,k+1) = Scalar(1); { SubColumnType x_k ( X.col(k).tail(remainingRows-1) ); SubColumnType tmp0 ( X.col(k).head(k) ), tmp1 ( X.col(k).head(k+1) ); x_k.noalias() = A.block(k+1,k+1, remainingRows-1,remainingCols) * u_k.transpose(); tmp0.noalias() = U_k1 * u_k.transpose(); x_k.noalias() -= X_k1.bottomRows(remainingRows-1) * tmp0; tmp1.noalias() = Y_k.adjoint() * u_k.transpose(); x_k.noalias() -= A.block(k+1,0, remainingRows-1,k+1) * tmp1; x_k *= numext::conj(tau_u); tau_u = numext::conj(tau_u); u_k = u_k.conjugate(); } if(k>0) A.coeffRef(k-1,k) = tau_u_prev; tau_u_prev = tau_u; } else A.coeffRef(k-1,k) = tau_u_prev; A.coeffRef(k,k) = tau_v; } if(bs<bcols) A.coeffRef(bs-1,bs) = tau_u_prev; if(bcols>bs && brows>bs) { SubMatType A11( A.bottomRightCorner(brows-bs,bcols-bs) ); SubMatType A10( A.block(bs,0, brows-bs,bs) ); SubMatType A01( A.block(0,bs, bs,bcols-bs) ); Scalar tmp = A01(bs-1,0); A01(bs-1,0) = Literal(1); A11.noalias() -= A10 * Y.topLeftCorner(bcols,bs).bottomRows(bcols-bs).adjoint(); A11.noalias() -= X.topLeftCorner(brows,bs).bottomRows(brows-bs) * A01; A01(bs-1,0) = tmp; } } # 283 "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h" template<typename MatrixType, typename BidiagType> void upperbidiagonalization_inplace_blocked(MatrixType& A, BidiagType& bidiagonal, Index maxBlockSize=32, typename MatrixType::Scalar* = 0) { typedef typename MatrixType::Scalar Scalar; typedef Block<MatrixType,Dynamic,Dynamic> BlockType; Index rows = A.rows(); Index cols = A.cols(); Index size = (std::min)(rows, cols); enum { StorageOrder = traits<MatrixType>::Flags & RowMajorBit }; Matrix<Scalar, MatrixType::RowsAtCompileTime, Dynamic, StorageOrder, MatrixType::MaxRowsAtCompileTime> X(rows,maxBlockSize); Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic, StorageOrder, MatrixType::MaxColsAtCompileTime> Y(cols,maxBlockSize); Index blockSize = (std::min)(maxBlockSize,size); Index k = 0; for(k = 0; k < size; k += blockSize) { Index bs = (std::min)(size-k,blockSize); Index brows = rows - k; Index bcols = cols - k; # 330 "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h" BlockType B = A.block(k,k,brows,bcols); if(k+bs==cols || bcols<48) { upperbidiagonalization_inplace_unblocked(B, &(bidiagonal.template diagonal<0>().coeffRef(k)), &(bidiagonal.template diagonal<1>().coeffRef(k)), X.data() ); break; } else { upperbidiagonalization_blocked_helper<BlockType>( B, &(bidiagonal.template diagonal<0>().coeffRef(k)), &(bidiagonal.template diagonal<1>().coeffRef(k)), bs, X.topLeftCorner(brows,bs), Y.topLeftCorner(bcols,bs) ); } } } template<typename _MatrixType> UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::computeUnblocked(const _MatrixType& matrix) { Index rows = matrix.rows(); Index cols = matrix.cols(); ; ((rows >= cols && "UpperBidiagonalization is only for Arices satisfying rows>=cols.") ? static_cast<void> (0) : __assert_fail ("rows >= cols && \"UpperBidiagonalization is only for Arices satisfying rows>=cols.\"", "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h", 365, __PRETTY_FUNCTION__)); m_householder = matrix; ColVectorType temp(rows); upperbidiagonalization_inplace_unblocked(m_householder, &(m_bidiagonal.template diagonal<0>().coeffRef(0)), &(m_bidiagonal.template diagonal<1>().coeffRef(0)), temp.data()); m_isInitialized = true; return *this; } template<typename _MatrixType> UpperBidiagonalization<_MatrixType>& UpperBidiagonalization<_MatrixType>::compute(const _MatrixType& matrix) { Index rows = matrix.rows(); Index cols = matrix.cols(); ; ; ((rows >= cols && "UpperBidiagonalization is only for Arices satisfying rows>=cols.") ? static_cast<void> (0) : __assert_fail ("rows >= cols && \"UpperBidiagonalization is only for Arices satisfying rows>=cols.\"", "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h", 388, __PRETTY_FUNCTION__)); m_householder = matrix; upperbidiagonalization_inplace_blocked(m_householder, m_bidiagonal); m_isInitialized = true; return *this; } # 410 "eigen-3.3.7/Eigen/src/SVD/UpperBidiagonalization.h" } } # 36 "eigen-3.3.7/Eigen/SVD" 2 # 1 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" 1 # 19 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" namespace Eigen { # 47 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" template<typename Derived> class SVDBase { public: typedef typename internal::traits<Derived>::MatrixType MatrixType; typedef typename MatrixType::Scalar Scalar; typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar; typedef typename MatrixType::StorageIndex StorageIndex; typedef Eigen::Index Index; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, DiagSizeAtCompileTime = (((int)RowsAtCompileTime == 0 || (int)ColsAtCompileTime == 0) ? 0 : ((int)RowsAtCompileTime == 1 || (int)ColsAtCompileTime == 1) ? 1 : ((int)RowsAtCompileTime == Dynamic || (int)ColsAtCompileTime == Dynamic) ? Dynamic : ((int)RowsAtCompileTime <= (int)ColsAtCompileTime) ? (int)RowsAtCompileTime : (int)ColsAtCompileTime), MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, MaxDiagSizeAtCompileTime = (((int)MaxRowsAtCompileTime == 0 || (int)MaxColsAtCompileTime == 0) ? 0 : ((int)MaxRowsAtCompileTime == 1 || (int)MaxColsAtCompileTime == 1) ? 1 : ((int)MaxRowsAtCompileTime == Dynamic && (int)MaxColsAtCompileTime == Dynamic) ? Dynamic : ((int)MaxRowsAtCompileTime == Dynamic) ? (int)MaxColsAtCompileTime : ((int)MaxColsAtCompileTime == Dynamic) ? (int)MaxRowsAtCompileTime : ((int)MaxRowsAtCompileTime <= (int)MaxColsAtCompileTime) ? (int)MaxRowsAtCompileTime : (int)MaxColsAtCompileTime), MatrixOptions = MatrixType::Options }; typedef Matrix<Scalar, RowsAtCompileTime, RowsAtCompileTime, MatrixOptions, MaxRowsAtCompileTime, MaxRowsAtCompileTime> MatrixUType; typedef Matrix<Scalar, ColsAtCompileTime, ColsAtCompileTime, MatrixOptions, MaxColsAtCompileTime, MaxColsAtCompileTime> MatrixVType; typedef typename internal::plain_diag_type<MatrixType, RealScalar>::type SingularValuesType; Derived& derived() { return *static_cast<Derived*>(this); } const Derived& derived() const { return *static_cast<const Derived*>(this); } # 83 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" const MatrixUType& matrixU() const { ((m_isInitialized && "SVD is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"SVD is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 85, __PRETTY_FUNCTION__)); ((computeU() && "This SVD decomposition didn't compute U. Did you ask for it?") ? static_cast<void> (0) : __assert_fail ("computeU() && \"This SVD decomposition didn't compute U. Did you ask for it?\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 86, __PRETTY_FUNCTION__)); return m_matrixU; } # 99 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" const MatrixVType& matrixV() const { ((m_isInitialized && "SVD is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"SVD is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 101, __PRETTY_FUNCTION__)); ((computeV() && "This SVD decomposition didn't compute V. Did you ask for it?") ? static_cast<void> (0) : __assert_fail ("computeV() && \"This SVD decomposition didn't compute V. Did you ask for it?\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 102, __PRETTY_FUNCTION__)); return m_matrixV; } const SingularValuesType& singularValues() const { ((m_isInitialized && "SVD is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"SVD is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 113, __PRETTY_FUNCTION__)); return m_singularValues; } Index nonzeroSingularValues() const { ((m_isInitialized && "SVD is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"SVD is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 120, __PRETTY_FUNCTION__)); return m_nonzeroSingularValues; } inline Index rank() const { using std::abs; ((m_isInitialized && "JacobiSVD is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"JacobiSVD is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 133, __PRETTY_FUNCTION__)); if(m_singularValues.size()==0) return 0; RealScalar premultiplied_threshold = numext::maxi<RealScalar>(m_singularValues.coeff(0) * threshold(), (std::numeric_limits<RealScalar>::min)()); Index i = m_nonzeroSingularValues-1; while(i>=0 && m_singularValues.coeff(i) < premultiplied_threshold) --i; return i+1; } # 155 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" Derived& setThreshold(const RealScalar& threshold) { m_usePrescribedThreshold = true; m_prescribedThreshold = threshold; return derived(); } # 170 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" Derived& setThreshold(Default_t) { m_usePrescribedThreshold = false; return derived(); } RealScalar threshold() const { ((m_isInitialized || m_usePrescribedThreshold) ? static_cast<void> (0) : __assert_fail ("m_isInitialized || m_usePrescribedThreshold", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 182, __PRETTY_FUNCTION__)); Index diagSize = (std::max<Index>)(1,m_diagSize); return m_usePrescribedThreshold ? m_prescribedThreshold : diagSize*NumTraits<Scalar>::epsilon(); } inline bool computeU() const { return m_computeFullU || m_computeThinU; } inline bool computeV() const { return m_computeFullV || m_computeThinV; } inline Index rows() const { return m_rows; } inline Index cols() const { return m_cols; } # 206 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" template<typename Rhs> inline const Solve<Derived, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "SVD is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"SVD is not initialized.\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 210, __PRETTY_FUNCTION__)); ((computeU() && computeV() && "SVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice).") ? static_cast<void> (0) : __assert_fail ("computeU() && computeV() && \"SVD::solve() requires both unitaries U and V to be computed (thin unitaries suffice).\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 211, __PRETTY_FUNCTION__)); return Solve<Derived, Rhs>(derived(), b.derived()); } template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const; protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } bool allocate(Index rows, Index cols, unsigned int computationOptions) ; MatrixUType m_matrixU; MatrixVType m_matrixV; SingularValuesType m_singularValues; bool m_isInitialized, m_isAllocated, m_usePrescribedThreshold; bool m_computeFullU, m_computeThinU; bool m_computeFullV, m_computeThinV; unsigned int m_computationOptions; Index m_nonzeroSingularValues, m_rows, m_cols, m_diagSize; RealScalar m_prescribedThreshold; SVDBase() : m_isInitialized(false), m_isAllocated(false), m_usePrescribedThreshold(false), m_computationOptions(0), m_rows(-1), m_cols(-1), m_diagSize(0) { check_template_parameters(); } }; template<typename Derived> template<typename RhsType, typename DstType> void SVDBase<Derived>::_solve_impl(const RhsType &rhs, DstType &dst) const { ((rhs.rows() == rows()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == rows()", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 263, __PRETTY_FUNCTION__)); Matrix<Scalar, Dynamic, RhsType::ColsAtCompileTime, 0, MatrixType::MaxRowsAtCompileTime, RhsType::MaxColsAtCompileTime> tmp; Index l_rank = rank(); tmp.noalias() = m_matrixU.leftCols(l_rank).adjoint() * rhs; tmp = m_singularValues.head(l_rank).asDiagonal().inverse() * tmp; dst = m_matrixV.leftCols(l_rank) * tmp; } template<typename MatrixType> bool SVDBase<MatrixType>::allocate(Index rows, Index cols, unsigned int computationOptions) { ((rows >= 0 && cols >= 0) ? static_cast<void> (0) : __assert_fail ("rows >= 0 && cols >= 0", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 279, __PRETTY_FUNCTION__)); if (m_isAllocated && rows == m_rows && cols == m_cols && computationOptions == m_computationOptions) { return true; } m_rows = rows; m_cols = cols; m_isInitialized = false; m_isAllocated = true; m_computationOptions = computationOptions; m_computeFullU = (computationOptions & ComputeFullU) != 0; m_computeThinU = (computationOptions & ComputeThinU) != 0; m_computeFullV = (computationOptions & ComputeFullV) != 0; m_computeThinV = (computationOptions & ComputeThinV) != 0; ((!(m_computeFullU && m_computeThinU) && "SVDBase: you can't ask for both full and thin U") ? static_cast<void> (0) : __assert_fail ("!(m_computeFullU && m_computeThinU) && \"SVDBase: you can't ask for both full and thin U\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 298, __PRETTY_FUNCTION__)); ((!(m_computeFullV && m_computeThinV) && "SVDBase: you can't ask for both full and thin V") ? static_cast<void> (0) : __assert_fail ("!(m_computeFullV && m_computeThinV) && \"SVDBase: you can't ask for both full and thin V\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h", 299, __PRETTY_FUNCTION__)); (((!(m_computeThinU || m_computeThinV) || (MatrixType::ColsAtCompileTime==Dynamic)) && "SVDBase: thin U and V are only available when your matrix has a dynamic number of columns.") ? static_cast<void> (0) : __assert_fail ("(!(m_computeThinU || m_computeThinV) || (MatrixType::ColsAtCompileTime==Dynamic)) && \"SVDBase: thin U and V are only available when your matrix has a dynamic number of columns.\"", "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" # 300 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" , 301 # 300 "eigen-3.3.7/Eigen/src/SVD/SVDBase.h" , __PRETTY_FUNCTION__)) ; m_diagSize = (std::min)(m_rows, m_cols); m_singularValues.resize(m_diagSize); if(RowsAtCompileTime==Dynamic) m_matrixU.resize(m_rows, m_computeFullU ? m_rows : m_computeThinU ? m_diagSize : 0); if(ColsAtCompileTime==Dynamic) m_matrixV.resize(m_cols, m_computeFullV ? m_cols : m_computeThinV ? m_diagSize : 0); return false; } } # 37 "eigen-3.3.7/Eigen/SVD" 2 # 1 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" 1 # 14 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" namespace Eigen { namespace internal { template<typename MatrixType, int QRPreconditioner, bool IsComplex = NumTraits<typename MatrixType::Scalar>::IsComplex> struct svd_precondition_2x2_block_to_be_real {}; # 30 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" enum { PreconditionIfMoreColsThanRows, PreconditionIfMoreRowsThanCols }; template<typename MatrixType, int QRPreconditioner, int Case> struct qr_preconditioner_should_do_anything { enum { a = MatrixType::RowsAtCompileTime != Dynamic && MatrixType::ColsAtCompileTime != Dynamic && MatrixType::ColsAtCompileTime <= MatrixType::RowsAtCompileTime, b = MatrixType::RowsAtCompileTime != Dynamic && MatrixType::ColsAtCompileTime != Dynamic && MatrixType::RowsAtCompileTime <= MatrixType::ColsAtCompileTime, ret = !( (QRPreconditioner == NoQRPreconditioner) || (Case == PreconditionIfMoreColsThanRows && bool(a)) || (Case == PreconditionIfMoreRowsThanCols && bool(b)) ) }; }; template<typename MatrixType, int QRPreconditioner, int Case, bool DoAnything = qr_preconditioner_should_do_anything<MatrixType, QRPreconditioner, Case>::ret > struct qr_preconditioner_impl {}; template<typename MatrixType, int QRPreconditioner, int Case> class qr_preconditioner_impl<MatrixType, QRPreconditioner, Case, false> { public: void allocate(const JacobiSVD<MatrixType, QRPreconditioner>&) {} bool run(JacobiSVD<MatrixType, QRPreconditioner>&, const MatrixType&) { return false; } }; template<typename MatrixType> class qr_preconditioner_impl<MatrixType, FullPivHouseholderQRPreconditioner, PreconditionIfMoreRowsThanCols, true> { public: typedef typename MatrixType::Scalar Scalar; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime }; typedef Matrix<Scalar, 1, RowsAtCompileTime, RowMajor, 1, MaxRowsAtCompileTime> WorkspaceType; void allocate(const JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd) { if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols()) { m_qr.~QRType(); ::new (&m_qr) QRType(svd.rows(), svd.cols()); } if (svd.m_computeFullU) m_workspace.resize(svd.rows()); } bool run(JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix) { if(matrix.rows() > matrix.cols()) { m_qr.compute(matrix); svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>(); if(svd.m_computeFullU) m_qr.matrixQ().evalTo(svd.m_matrixU, m_workspace); if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation(); return true; } return false; } private: typedef FullPivHouseholderQR<MatrixType> QRType; QRType m_qr; WorkspaceType m_workspace; }; template<typename MatrixType> class qr_preconditioner_impl<MatrixType, FullPivHouseholderQRPreconditioner, PreconditionIfMoreColsThanRows, true> { public: typedef typename MatrixType::Scalar Scalar; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, TrOptions = RowsAtCompileTime==1 ? (MatrixType::Options & ~(RowMajor)) : ColsAtCompileTime==1 ? (MatrixType::Options | RowMajor) : MatrixType::Options }; typedef Matrix<Scalar, ColsAtCompileTime, RowsAtCompileTime, TrOptions, MaxColsAtCompileTime, MaxRowsAtCompileTime> TransposeTypeWithSameStorageOrder; void allocate(const JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd) { if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols()) { m_qr.~QRType(); ::new (&m_qr) QRType(svd.cols(), svd.rows()); } m_adjoint.resize(svd.cols(), svd.rows()); if (svd.m_computeFullV) m_workspace.resize(svd.cols()); } bool run(JacobiSVD<MatrixType, FullPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix) { if(matrix.cols() > matrix.rows()) { m_adjoint = matrix.adjoint(); m_qr.compute(m_adjoint); svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); if(svd.m_computeFullV) m_qr.matrixQ().evalTo(svd.m_matrixV, m_workspace); if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); return true; } else return false; } private: typedef FullPivHouseholderQR<TransposeTypeWithSameStorageOrder> QRType; QRType m_qr; TransposeTypeWithSameStorageOrder m_adjoint; typename internal::plain_row_type<MatrixType>::type m_workspace; }; template<typename MatrixType> class qr_preconditioner_impl<MatrixType, ColPivHouseholderQRPreconditioner, PreconditionIfMoreRowsThanCols, true> { public: void allocate(const JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner>& svd) { if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols()) { m_qr.~QRType(); ::new (&m_qr) QRType(svd.rows(), svd.cols()); } if (svd.m_computeFullU) m_workspace.resize(svd.rows()); else if (svd.m_computeThinU) m_workspace.resize(svd.cols()); } bool run(JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix) { if(matrix.rows() > matrix.cols()) { m_qr.compute(matrix); svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>(); if(svd.m_computeFullU) m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace); else if(svd.m_computeThinU) { svd.m_matrixU.setIdentity(matrix.rows(), matrix.cols()); m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixU, m_workspace); } if(svd.computeV()) svd.m_matrixV = m_qr.colsPermutation(); return true; } return false; } private: typedef ColPivHouseholderQR<MatrixType> QRType; QRType m_qr; typename internal::plain_col_type<MatrixType>::type m_workspace; }; template<typename MatrixType> class qr_preconditioner_impl<MatrixType, ColPivHouseholderQRPreconditioner, PreconditionIfMoreColsThanRows, true> { public: typedef typename MatrixType::Scalar Scalar; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, TrOptions = RowsAtCompileTime==1 ? (MatrixType::Options & ~(RowMajor)) : ColsAtCompileTime==1 ? (MatrixType::Options | RowMajor) : MatrixType::Options }; typedef Matrix<Scalar, ColsAtCompileTime, RowsAtCompileTime, TrOptions, MaxColsAtCompileTime, MaxRowsAtCompileTime> TransposeTypeWithSameStorageOrder; void allocate(const JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner>& svd) { if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols()) { m_qr.~QRType(); ::new (&m_qr) QRType(svd.cols(), svd.rows()); } if (svd.m_computeFullV) m_workspace.resize(svd.cols()); else if (svd.m_computeThinV) m_workspace.resize(svd.rows()); m_adjoint.resize(svd.cols(), svd.rows()); } bool run(JacobiSVD<MatrixType, ColPivHouseholderQRPreconditioner>& svd, const MatrixType& matrix) { if(matrix.cols() > matrix.rows()) { m_adjoint = matrix.adjoint(); m_qr.compute(m_adjoint); svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace); else if(svd.m_computeThinV) { svd.m_matrixV.setIdentity(matrix.cols(), matrix.rows()); m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace); } if(svd.computeU()) svd.m_matrixU = m_qr.colsPermutation(); return true; } else return false; } private: typedef ColPivHouseholderQR<TransposeTypeWithSameStorageOrder> QRType; QRType m_qr; TransposeTypeWithSameStorageOrder m_adjoint; typename internal::plain_row_type<MatrixType>::type m_workspace; }; template<typename MatrixType> class qr_preconditioner_impl<MatrixType, HouseholderQRPreconditioner, PreconditionIfMoreRowsThanCols, true> { public: void allocate(const JacobiSVD<MatrixType, HouseholderQRPreconditioner>& svd) { if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols()) { m_qr.~QRType(); ::new (&m_qr) QRType(svd.rows(), svd.cols()); } if (svd.m_computeFullU) m_workspace.resize(svd.rows()); else if (svd.m_computeThinU) m_workspace.resize(svd.cols()); } bool run(JacobiSVD<MatrixType, HouseholderQRPreconditioner>& svd, const MatrixType& matrix) { if(matrix.rows() > matrix.cols()) { m_qr.compute(matrix); svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>(); if(svd.m_computeFullU) m_qr.householderQ().evalTo(svd.m_matrixU, m_workspace); else if(svd.m_computeThinU) { svd.m_matrixU.setIdentity(matrix.rows(), matrix.cols()); m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixU, m_workspace); } if(svd.computeV()) svd.m_matrixV.setIdentity(matrix.cols(), matrix.cols()); return true; } return false; } private: typedef HouseholderQR<MatrixType> QRType; QRType m_qr; typename internal::plain_col_type<MatrixType>::type m_workspace; }; template<typename MatrixType> class qr_preconditioner_impl<MatrixType, HouseholderQRPreconditioner, PreconditionIfMoreColsThanRows, true> { public: typedef typename MatrixType::Scalar Scalar; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, Options = MatrixType::Options }; typedef Matrix<Scalar, ColsAtCompileTime, RowsAtCompileTime, Options, MaxColsAtCompileTime, MaxRowsAtCompileTime> TransposeTypeWithSameStorageOrder; void allocate(const JacobiSVD<MatrixType, HouseholderQRPreconditioner>& svd) { if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols()) { m_qr.~QRType(); ::new (&m_qr) QRType(svd.cols(), svd.rows()); } if (svd.m_computeFullV) m_workspace.resize(svd.cols()); else if (svd.m_computeThinV) m_workspace.resize(svd.rows()); m_adjoint.resize(svd.cols(), svd.rows()); } bool run(JacobiSVD<MatrixType, HouseholderQRPreconditioner>& svd, const MatrixType& matrix) { if(matrix.cols() > matrix.rows()) { m_adjoint = matrix.adjoint(); m_qr.compute(m_adjoint); svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.rows(),matrix.rows()).template triangularView<Upper>().adjoint(); if(svd.m_computeFullV) m_qr.householderQ().evalTo(svd.m_matrixV, m_workspace); else if(svd.m_computeThinV) { svd.m_matrixV.setIdentity(matrix.cols(), matrix.rows()); m_qr.householderQ().applyThisOnTheLeft(svd.m_matrixV, m_workspace); } if(svd.computeU()) svd.m_matrixU.setIdentity(matrix.rows(), matrix.rows()); return true; } else return false; } private: typedef HouseholderQR<TransposeTypeWithSameStorageOrder> QRType; QRType m_qr; TransposeTypeWithSameStorageOrder m_adjoint; typename internal::plain_row_type<MatrixType>::type m_workspace; }; template<typename MatrixType, int QRPreconditioner> struct svd_precondition_2x2_block_to_be_real<MatrixType, QRPreconditioner, false> { typedef JacobiSVD<MatrixType, QRPreconditioner> SVD; typedef typename MatrixType::RealScalar RealScalar; static bool run(typename SVD::WorkMatrixType&, SVD&, Index, Index, RealScalar&) { return true; } }; template<typename MatrixType, int QRPreconditioner> struct svd_precondition_2x2_block_to_be_real<MatrixType, QRPreconditioner, true> { typedef JacobiSVD<MatrixType, QRPreconditioner> SVD; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; static bool run(typename SVD::WorkMatrixType& work_matrix, SVD& svd, Index p, Index q, RealScalar& maxDiagEntry) { using std::sqrt; using std::abs; Scalar z; JacobiRotation<Scalar> rot; RealScalar n = sqrt(numext::abs2(work_matrix.coeff(p,p)) + numext::abs2(work_matrix.coeff(q,p))); const RealScalar considerAsZero = (std::numeric_limits<RealScalar>::min)(); const RealScalar precision = NumTraits<Scalar>::epsilon(); if(n==0) { work_matrix.coeffRef(p,p) = work_matrix.coeffRef(q,p) = Scalar(0); if(abs(numext::imag(work_matrix.coeff(p,q)))>considerAsZero) { z = abs(work_matrix.coeff(p,q)) / work_matrix.coeff(p,q); work_matrix.row(p) *= z; if(svd.computeU()) svd.m_matrixU.col(p) *= conj(z); } if(abs(numext::imag(work_matrix.coeff(q,q)))>considerAsZero) { z = abs(work_matrix.coeff(q,q)) / work_matrix.coeff(q,q); work_matrix.row(q) *= z; if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); } } else { rot.c() = conj(work_matrix.coeff(p,p)) / n; rot.s() = work_matrix.coeff(q,p) / n; work_matrix.applyOnTheLeft(p,q,rot); if(svd.computeU()) svd.m_matrixU.applyOnTheRight(p,q,rot.adjoint()); if(abs(numext::imag(work_matrix.coeff(p,q)))>considerAsZero) { z = abs(work_matrix.coeff(p,q)) / work_matrix.coeff(p,q); work_matrix.col(q) *= z; if(svd.computeV()) svd.m_matrixV.col(q) *= z; } if(abs(numext::imag(work_matrix.coeff(q,q)))>considerAsZero) { z = abs(work_matrix.coeff(q,q)) / work_matrix.coeff(q,q); work_matrix.row(q) *= z; if(svd.computeU()) svd.m_matrixU.col(q) *= conj(z); } } maxDiagEntry = numext::maxi<RealScalar>(maxDiagEntry,numext::maxi<RealScalar>(abs(work_matrix.coeff(p,p)), abs(work_matrix.coeff(q,q)))); RealScalar threshold = numext::maxi<RealScalar>(considerAsZero, precision * maxDiagEntry); return abs(work_matrix.coeff(p,q))>threshold || abs(work_matrix.coeff(q,p)) > threshold; } }; template<typename _MatrixType, int QRPreconditioner> struct traits<JacobiSVD<_MatrixType,QRPreconditioner> > { typedef _MatrixType MatrixType; }; } # 487 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" template<typename _MatrixType, int QRPreconditioner> class JacobiSVD : public SVDBase<JacobiSVD<_MatrixType,QRPreconditioner> > { typedef SVDBase<JacobiSVD> Base; public: typedef _MatrixType MatrixType; typedef typename MatrixType::Scalar Scalar; typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, DiagSizeAtCompileTime = (((int)RowsAtCompileTime == 0 || (int)ColsAtCompileTime == 0) ? 0 : ((int)RowsAtCompileTime == 1 || (int)ColsAtCompileTime == 1) ? 1 : ((int)RowsAtCompileTime == Dynamic || (int)ColsAtCompileTime == Dynamic) ? Dynamic : ((int)RowsAtCompileTime <= (int)ColsAtCompileTime) ? (int)RowsAtCompileTime : (int)ColsAtCompileTime), MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, MaxDiagSizeAtCompileTime = (((int)MaxRowsAtCompileTime == 0 || (int)MaxColsAtCompileTime == 0) ? 0 : ((int)MaxRowsAtCompileTime == 1 || (int)MaxColsAtCompileTime == 1) ? 1 : ((int)MaxRowsAtCompileTime == Dynamic && (int)MaxColsAtCompileTime == Dynamic) ? Dynamic : ((int)MaxRowsAtCompileTime == Dynamic) ? (int)MaxColsAtCompileTime : ((int)MaxColsAtCompileTime == Dynamic) ? (int)MaxRowsAtCompileTime : ((int)MaxRowsAtCompileTime <= (int)MaxColsAtCompileTime) ? (int)MaxRowsAtCompileTime : (int)MaxColsAtCompileTime), MatrixOptions = MatrixType::Options }; typedef typename Base::MatrixUType MatrixUType; typedef typename Base::MatrixVType MatrixVType; typedef typename Base::SingularValuesType SingularValuesType; typedef typename internal::plain_row_type<MatrixType>::type RowType; typedef typename internal::plain_col_type<MatrixType>::type ColType; typedef Matrix<Scalar, DiagSizeAtCompileTime, DiagSizeAtCompileTime, MatrixOptions, MaxDiagSizeAtCompileTime, MaxDiagSizeAtCompileTime> WorkMatrixType; JacobiSVD() {} # 531 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" JacobiSVD(Index rows, Index cols, unsigned int computationOptions = 0) { allocate(rows, cols, computationOptions); } # 546 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" explicit JacobiSVD(const MatrixType& matrix, unsigned int computationOptions = 0) { compute(matrix, computationOptions); } # 561 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" JacobiSVD& compute(const MatrixType& matrix, unsigned int computationOptions); JacobiSVD& compute(const MatrixType& matrix) { return compute(matrix, m_computationOptions); } using Base::computeU; using Base::computeV; using Base::rows; using Base::cols; using Base::rank; private: void allocate(Index rows, Index cols, unsigned int computationOptions); protected: using Base::m_matrixU; using Base::m_matrixV; using Base::m_singularValues; using Base::m_isInitialized; using Base::m_isAllocated; using Base::m_usePrescribedThreshold; using Base::m_computeFullU; using Base::m_computeThinU; using Base::m_computeFullV; using Base::m_computeThinV; using Base::m_computationOptions; using Base::m_nonzeroSingularValues; using Base::m_rows; using Base::m_cols; using Base::m_diagSize; using Base::m_prescribedThreshold; WorkMatrixType m_workMatrix; template<typename __MatrixType, int _QRPreconditioner, bool _IsComplex> friend struct internal::svd_precondition_2x2_block_to_be_real; template<typename __MatrixType, int _QRPreconditioner, int _Case, bool _DoAnything> friend struct internal::qr_preconditioner_impl; internal::qr_preconditioner_impl<MatrixType, QRPreconditioner, internal::PreconditionIfMoreColsThanRows> m_qr_precond_morecols; internal::qr_preconditioner_impl<MatrixType, QRPreconditioner, internal::PreconditionIfMoreRowsThanCols> m_qr_precond_morerows; MatrixType m_scaledMatrix; }; template<typename MatrixType, int QRPreconditioner> void JacobiSVD<MatrixType, QRPreconditioner>::allocate(Index rows, Index cols, unsigned int computationOptions) { ((rows >= 0 && cols >= 0) ? static_cast<void> (0) : __assert_fail ("rows >= 0 && cols >= 0", "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h", 615, __PRETTY_FUNCTION__)); if (m_isAllocated && rows == m_rows && cols == m_cols && computationOptions == m_computationOptions) { return; } m_rows = rows; m_cols = cols; m_isInitialized = false; m_isAllocated = true; m_computationOptions = computationOptions; m_computeFullU = (computationOptions & ComputeFullU) != 0; m_computeThinU = (computationOptions & ComputeThinU) != 0; m_computeFullV = (computationOptions & ComputeFullV) != 0; m_computeThinV = (computationOptions & ComputeThinV) != 0; ((!(m_computeFullU && m_computeThinU) && "JacobiSVD: you can't ask for both full and thin U") ? static_cast<void> (0) : __assert_fail ("!(m_computeFullU && m_computeThinU) && \"JacobiSVD: you can't ask for both full and thin U\"", "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h", 634, __PRETTY_FUNCTION__)); ((!(m_computeFullV && m_computeThinV) && "JacobiSVD: you can't ask for both full and thin V") ? static_cast<void> (0) : __assert_fail ("!(m_computeFullV && m_computeThinV) && \"JacobiSVD: you can't ask for both full and thin V\"", "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h", 635, __PRETTY_FUNCTION__)); (((!(m_computeThinU || m_computeThinV) || (MatrixType::ColsAtCompileTime==Dynamic)) && "JacobiSVD: thin U and V are only available when your matrix has a dynamic number of columns.") ? static_cast<void> (0) : __assert_fail ("(!(m_computeThinU || m_computeThinV) || (MatrixType::ColsAtCompileTime==Dynamic)) && \"JacobiSVD: thin U and V are only available when your matrix has a dynamic number of columns.\"", "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" # 636 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" , 637 # 636 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" , __PRETTY_FUNCTION__)) ; if (QRPreconditioner == FullPivHouseholderQRPreconditioner) { ((!(m_computeThinU || m_computeThinV) && "JacobiSVD: can't compute thin U or thin V with the FullPivHouseholderQR preconditioner. " "Use the ColPivHouseholderQR preconditioner instead.") ? static_cast<void> (0) : __assert_fail ("!(m_computeThinU || m_computeThinV) && \"JacobiSVD: can't compute thin U or thin V with the FullPivHouseholderQR preconditioner. \" \"Use the ColPivHouseholderQR preconditioner instead.\"", "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" # 640 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" , 642 # 640 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" , __PRETTY_FUNCTION__)) ; } m_diagSize = (std::min)(m_rows, m_cols); m_singularValues.resize(m_diagSize); if(RowsAtCompileTime==Dynamic) m_matrixU.resize(m_rows, m_computeFullU ? m_rows : m_computeThinU ? m_diagSize : 0); if(ColsAtCompileTime==Dynamic) m_matrixV.resize(m_cols, m_computeFullV ? m_cols : m_computeThinV ? m_diagSize : 0); m_workMatrix.resize(m_diagSize, m_diagSize); if(m_cols>m_rows) m_qr_precond_morecols.allocate(*this); if(m_rows>m_cols) m_qr_precond_morerows.allocate(*this); if(m_rows!=m_cols) m_scaledMatrix.resize(rows,cols); } template<typename MatrixType, int QRPreconditioner> JacobiSVD<MatrixType, QRPreconditioner>& JacobiSVD<MatrixType, QRPreconditioner>::compute(const MatrixType& matrix, unsigned int computationOptions) { using std::abs; allocate(matrix.rows(), matrix.cols(), computationOptions); const RealScalar precision = RealScalar(2) * NumTraits<Scalar>::epsilon(); const RealScalar considerAsZero = (std::numeric_limits<RealScalar>::min)(); RealScalar scale = matrix.cwiseAbs().maxCoeff(); if(scale==RealScalar(0)) scale = RealScalar(1); if(m_rows!=m_cols) { m_scaledMatrix = matrix / scale; m_qr_precond_morecols.run(*this, m_scaledMatrix); m_qr_precond_morerows.run(*this, m_scaledMatrix); } else { m_workMatrix = matrix.block(0,0,m_diagSize,m_diagSize) / scale; if(m_computeFullU) m_matrixU.setIdentity(m_rows,m_rows); if(m_computeThinU) m_matrixU.setIdentity(m_rows,m_diagSize); if(m_computeFullV) m_matrixV.setIdentity(m_cols,m_cols); if(m_computeThinV) m_matrixV.setIdentity(m_cols, m_diagSize); } RealScalar maxDiagEntry = m_workMatrix.cwiseAbs().diagonal().maxCoeff(); bool finished = false; while(!finished) { finished = true; for(Index p = 1; p < m_diagSize; ++p) { for(Index q = 0; q < p; ++q) { RealScalar threshold = numext::maxi<RealScalar>(considerAsZero, precision * maxDiagEntry); if(abs(m_workMatrix.coeff(p,q))>threshold || abs(m_workMatrix.coeff(q,p)) > threshold) { finished = false; if(internal::svd_precondition_2x2_block_to_be_real<MatrixType, QRPreconditioner>::run(m_workMatrix, *this, p, q, maxDiagEntry)) { JacobiRotation<RealScalar> j_left, j_right; internal::real_2x2_jacobi_svd(m_workMatrix, p, q, &j_left, &j_right); m_workMatrix.applyOnTheLeft(p,q,j_left); if(computeU()) m_matrixU.applyOnTheRight(p,q,j_left.transpose()); m_workMatrix.applyOnTheRight(p,q,j_right); if(computeV()) m_matrixV.applyOnTheRight(p,q,j_right); maxDiagEntry = numext::maxi<RealScalar>(maxDiagEntry,numext::maxi<RealScalar>(abs(m_workMatrix.coeff(p,p)), abs(m_workMatrix.coeff(q,q)))); } } } } } for(Index i = 0; i < m_diagSize; ++i) { if(NumTraits<Scalar>::IsComplex && abs(numext::imag(m_workMatrix.coeff(i,i)))>considerAsZero) { RealScalar a = abs(m_workMatrix.coeff(i,i)); m_singularValues.coeffRef(i) = abs(a); if(computeU()) m_matrixU.col(i) *= m_workMatrix.coeff(i,i)/a; } else { RealScalar a = numext::real(m_workMatrix.coeff(i,i)); m_singularValues.coeffRef(i) = abs(a); if(computeU() && (a<RealScalar(0))) m_matrixU.col(i) = -m_matrixU.col(i); } } m_singularValues *= scale; m_nonzeroSingularValues = m_diagSize; for(Index i = 0; i < m_diagSize; i++) { Index pos; RealScalar maxRemainingSingularValue = m_singularValues.tail(m_diagSize-i).maxCoeff(&pos); if(maxRemainingSingularValue == RealScalar(0)) { m_nonzeroSingularValues = i; break; } if(pos) { pos += i; std::swap(m_singularValues.coeffRef(i), m_singularValues.coeffRef(pos)); if(computeU()) m_matrixU.col(pos).swap(m_matrixU.col(i)); if(computeV()) m_matrixV.col(pos).swap(m_matrixV.col(i)); } } m_isInitialized = true; return *this; } # 795 "eigen-3.3.7/Eigen/src/SVD/JacobiSVD.h" template<typename Derived> JacobiSVD<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::jacobiSvd(unsigned int computationOptions) const { return JacobiSVD<PlainObject>(*this, computationOptions); } } # 38 "eigen-3.3.7/Eigen/SVD" 2 # 1 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" 1 # 25 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" namespace Eigen { template<typename _MatrixType> class BDCSVD; namespace internal { template<typename _MatrixType> struct traits<BDCSVD<_MatrixType> > { typedef _MatrixType MatrixType; }; } # 66 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" template<typename _MatrixType> class BDCSVD : public SVDBase<BDCSVD<_MatrixType> > { typedef SVDBase<BDCSVD> Base; public: using Base::rows; using Base::cols; using Base::computeU; using Base::computeV; typedef _MatrixType MatrixType; typedef typename MatrixType::Scalar Scalar; typedef typename NumTraits<typename MatrixType::Scalar>::Real RealScalar; typedef typename NumTraits<RealScalar>::Literal Literal; enum { RowsAtCompileTime = MatrixType::RowsAtCompileTime, ColsAtCompileTime = MatrixType::ColsAtCompileTime, DiagSizeAtCompileTime = (((int)RowsAtCompileTime == 0 || (int)ColsAtCompileTime == 0) ? 0 : ((int)RowsAtCompileTime == 1 || (int)ColsAtCompileTime == 1) ? 1 : ((int)RowsAtCompileTime == Dynamic || (int)ColsAtCompileTime == Dynamic) ? Dynamic : ((int)RowsAtCompileTime <= (int)ColsAtCompileTime) ? (int)RowsAtCompileTime : (int)ColsAtCompileTime), MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime, MaxDiagSizeAtCompileTime = (((int)MaxRowsAtCompileTime == 0 || (int)MaxColsAtCompileTime == 0) ? 0 : ((int)MaxRowsAtCompileTime == 1 || (int)MaxColsAtCompileTime == 1) ? 1 : ((int)MaxRowsAtCompileTime == Dynamic && (int)MaxColsAtCompileTime == Dynamic) ? Dynamic : ((int)MaxRowsAtCompileTime == Dynamic) ? (int)MaxColsAtCompileTime : ((int)MaxColsAtCompileTime == Dynamic) ? (int)MaxRowsAtCompileTime : ((int)MaxRowsAtCompileTime <= (int)MaxColsAtCompileTime) ? (int)MaxRowsAtCompileTime : (int)MaxColsAtCompileTime), MatrixOptions = MatrixType::Options }; typedef typename Base::MatrixUType MatrixUType; typedef typename Base::MatrixVType MatrixVType; typedef typename Base::SingularValuesType SingularValuesType; typedef Matrix<Scalar, Dynamic, Dynamic, ColMajor> MatrixX; typedef Matrix<RealScalar, Dynamic, Dynamic, ColMajor> MatrixXr; typedef Matrix<RealScalar, Dynamic, 1> VectorType; typedef Array<RealScalar, Dynamic, 1> ArrayXr; typedef Array<Index,1,Dynamic> ArrayXi; typedef Ref<ArrayXr> ArrayRef; typedef Ref<ArrayXi> IndicesRef; BDCSVD() : m_algoswap(16), m_numIters(0) {} # 118 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" BDCSVD(Index rows, Index cols, unsigned int computationOptions = 0) : m_algoswap(16), m_numIters(0) { allocate(rows, cols, computationOptions); } # 134 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" BDCSVD(const MatrixType& matrix, unsigned int computationOptions = 0) : m_algoswap(16), m_numIters(0) { compute(matrix, computationOptions); } ~BDCSVD() { } # 154 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" BDCSVD& compute(const MatrixType& matrix, unsigned int computationOptions); BDCSVD& compute(const MatrixType& matrix) { return compute(matrix, this->m_computationOptions); } void setSwitchSize(int s) { ((s>3 && "BDCSVD the size of the algo switch has to be greater than 3") ? static_cast<void> (0) : __assert_fail ("s>3 && \"BDCSVD the size of the algo switch has to be greater than 3\"", "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h", 169, __PRETTY_FUNCTION__)); m_algoswap = s; } private: void allocate(Index rows, Index cols, unsigned int computationOptions); void divide(Index firstCol, Index lastCol, Index firstRowW, Index firstColW, Index shift); void computeSVDofM(Index firstCol, Index n, MatrixXr& U, VectorType& singVals, MatrixXr& V); void computeSingVals(const ArrayRef& col0, const ArrayRef& diag, const IndicesRef& perm, VectorType& singVals, ArrayRef shifts, ArrayRef mus); void perturbCol0(const ArrayRef& col0, const ArrayRef& diag, const IndicesRef& perm, const VectorType& singVals, const ArrayRef& shifts, const ArrayRef& mus, ArrayRef zhat); void computeSingVecs(const ArrayRef& zhat, const ArrayRef& diag, const IndicesRef& perm, const VectorType& singVals, const ArrayRef& shifts, const ArrayRef& mus, MatrixXr& U, MatrixXr& V); void deflation43(Index firstCol, Index shift, Index i, Index size); void deflation44(Index firstColu , Index firstColm, Index firstRowW, Index firstColW, Index i, Index j, Index size); void deflation(Index firstCol, Index lastCol, Index k, Index firstRowW, Index firstColW, Index shift); template<typename HouseholderU, typename HouseholderV, typename NaiveU, typename NaiveV> void copyUV(const HouseholderU &householderU, const HouseholderV &householderV, const NaiveU &naiveU, const NaiveV &naivev); void structured_update(Block<MatrixXr,Dynamic,Dynamic> A, const MatrixXr &B, Index n1); static RealScalar secularEq(RealScalar x, const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, const ArrayRef& diagShifted, RealScalar shift); protected: MatrixXr m_naiveU, m_naiveV; MatrixXr m_computed; Index m_nRec; ArrayXr m_workspace; ArrayXi m_workspaceI; int m_algoswap; bool m_isTranspose, m_compU, m_compV; using Base::m_singularValues; using Base::m_diagSize; using Base::m_computeFullU; using Base::m_computeFullV; using Base::m_computeThinU; using Base::m_computeThinV; using Base::m_matrixU; using Base::m_matrixV; using Base::m_isInitialized; using Base::m_nonzeroSingularValues; public: int m_numIters; }; template<typename MatrixType> void BDCSVD<MatrixType>::allocate(Index rows, Index cols, unsigned int computationOptions) { m_isTranspose = (cols > rows); if (Base::allocate(rows, cols, computationOptions)) return; m_computed = MatrixXr::Zero(m_diagSize + 1, m_diagSize ); m_compU = computeV(); m_compV = computeU(); if (m_isTranspose) std::swap(m_compU, m_compV); if (m_compU) m_naiveU = MatrixXr::Zero(m_diagSize + 1, m_diagSize + 1 ); else m_naiveU = MatrixXr::Zero(2, m_diagSize + 1 ); if (m_compV) m_naiveV = MatrixXr::Zero(m_diagSize, m_diagSize); m_workspace.resize((m_diagSize+1)*(m_diagSize+1)*3); m_workspaceI.resize(3*m_diagSize); } template<typename MatrixType> BDCSVD<MatrixType>& BDCSVD<MatrixType>::compute(const MatrixType& matrix, unsigned int computationOptions) { allocate(matrix.rows(), matrix.cols(), computationOptions); using std::abs; const RealScalar considerZero = (std::numeric_limits<RealScalar>::min)(); if(matrix.cols() < m_algoswap) { JacobiSVD<MatrixType> jsvd(matrix,computationOptions); if(computeU()) m_matrixU = jsvd.matrixU(); if(computeV()) m_matrixV = jsvd.matrixV(); m_singularValues = jsvd.singularValues(); m_nonzeroSingularValues = jsvd.nonzeroSingularValues(); m_isInitialized = true; return *this; } RealScalar scale = matrix.cwiseAbs().maxCoeff(); if(scale==Literal(0)) scale = Literal(1); MatrixX copy; if (m_isTranspose) copy = matrix.adjoint()/scale; else copy = matrix/scale; internal::UpperBidiagonalization<MatrixX> bid(copy); m_naiveU.setZero(); m_naiveV.setZero(); m_computed.topRows(m_diagSize) = bid.bidiagonal().toDenseMatrix().transpose(); m_computed.template bottomRows<1>().setZero(); divide(0, m_diagSize - 1, 0, 0, 0); for (int i=0; i<m_diagSize; i++) { RealScalar a = abs(m_computed.coeff(i, i)); m_singularValues.coeffRef(i) = a * scale; if (a<considerZero) { m_nonzeroSingularValues = i; m_singularValues.tail(m_diagSize - i - 1).setZero(); break; } else if (i == m_diagSize - 1) { m_nonzeroSingularValues = i + 1; break; } } if(m_isTranspose) copyUV(bid.householderV(), bid.householderU(), m_naiveV, m_naiveU); else copyUV(bid.householderU(), bid.householderV(), m_naiveU, m_naiveV); m_isInitialized = true; return *this; } template<typename MatrixType> template<typename HouseholderU, typename HouseholderV, typename NaiveU, typename NaiveV> void BDCSVD<MatrixType>::copyUV(const HouseholderU &householderU, const HouseholderV &householderV, const NaiveU &naiveU, const NaiveV &naiveV) { if (computeU()) { Index Ucols = m_computeThinU ? m_diagSize : householderU.cols(); m_matrixU = MatrixX::Identity(householderU.cols(), Ucols); m_matrixU.topLeftCorner(m_diagSize, m_diagSize) = naiveV.template cast<Scalar>().topLeftCorner(m_diagSize, m_diagSize); householderU.applyThisOnTheLeft(m_matrixU); } if (computeV()) { Index Vcols = m_computeThinV ? m_diagSize : householderV.cols(); m_matrixV = MatrixX::Identity(householderV.cols(), Vcols); m_matrixV.topLeftCorner(m_diagSize, m_diagSize) = naiveU.template cast<Scalar>().topLeftCorner(m_diagSize, m_diagSize); householderV.applyThisOnTheLeft(m_matrixV); } } # 339 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" template<typename MatrixType> void BDCSVD<MatrixType>::structured_update(Block<MatrixXr,Dynamic,Dynamic> A, const MatrixXr &B, Index n1) { Index n = A.rows(); if(n>100) { Index n2 = n - n1; Map<MatrixXr> A1(m_workspace.data() , n1, n); Map<MatrixXr> A2(m_workspace.data()+ n1*n, n2, n); Map<MatrixXr> B1(m_workspace.data()+ n*n, n, n); Map<MatrixXr> B2(m_workspace.data()+2*n*n, n, n); Index k1=0, k2=0; for(Index j=0; j<n; ++j) { if( (A.col(j).head(n1).array()!=Literal(0)).any() ) { A1.col(k1) = A.col(j).head(n1); B1.row(k1) = B.row(j); ++k1; } if( (A.col(j).tail(n2).array()!=Literal(0)).any() ) { A2.col(k2) = A.col(j).tail(n2); B2.row(k2) = B.row(j); ++k2; } } A.topRows(n1).noalias() = A1.leftCols(k1) * B1.topRows(k1); A.bottomRows(n2).noalias() = A2.leftCols(k2) * B2.topRows(k2); } else { Map<MatrixXr,Aligned> tmp(m_workspace.data(),n,n); tmp.noalias() = A*B; A = tmp; } } # 390 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" template<typename MatrixType> void BDCSVD<MatrixType>::divide (Index firstCol, Index lastCol, Index firstRowW, Index firstColW, Index shift) { using std::pow; using std::sqrt; using std::abs; const Index n = lastCol - firstCol + 1; const Index k = n/2; const RealScalar considerZero = (std::numeric_limits<RealScalar>::min)(); RealScalar alphaK; RealScalar betaK; RealScalar r0; RealScalar lambda, phi, c0, s0; VectorType l, f; if (n < m_algoswap) { JacobiSVD<MatrixXr> b(m_computed.block(firstCol, firstCol, n + 1, n), ComputeFullU | (m_compV ? ComputeFullV : 0)); if (m_compU) m_naiveU.block(firstCol, firstCol, n + 1, n + 1).real() = b.matrixU(); else { m_naiveU.row(0).segment(firstCol, n + 1).real() = b.matrixU().row(0); m_naiveU.row(1).segment(firstCol, n + 1).real() = b.matrixU().row(n); } if (m_compV) m_naiveV.block(firstRowW, firstColW, n, n).real() = b.matrixV(); m_computed.block(firstCol + shift, firstCol + shift, n + 1, n).setZero(); m_computed.diagonal().segment(firstCol + shift, n) = b.singularValues().head(n); return; } alphaK = m_computed(firstCol + k, firstCol + k); betaK = m_computed(firstCol + k + 1, firstCol + k); divide(k + 1 + firstCol, lastCol, k + 1 + firstRowW, k + 1 + firstColW, shift); divide(firstCol, k - 1 + firstCol, firstRowW, firstColW + 1, shift + 1); if (m_compU) { lambda = m_naiveU(firstCol + k, firstCol + k); phi = m_naiveU(firstCol + k + 1, lastCol + 1); } else { lambda = m_naiveU(1, firstCol + k); phi = m_naiveU(0, lastCol + 1); } r0 = sqrt((abs(alphaK * lambda) * abs(alphaK * lambda)) + abs(betaK * phi) * abs(betaK * phi)); if (m_compU) { l = m_naiveU.row(firstCol + k).segment(firstCol, k); f = m_naiveU.row(firstCol + k + 1).segment(firstCol + k + 1, n - k - 1); } else { l = m_naiveU.row(1).segment(firstCol, k); f = m_naiveU.row(0).segment(firstCol + k + 1, n - k - 1); } if (m_compV) m_naiveV(firstRowW+k, firstColW) = Literal(1); if (r0<considerZero) { c0 = Literal(1); s0 = Literal(0); } else { c0 = alphaK * lambda / r0; s0 = betaK * phi / r0; } if (m_compU) { MatrixXr q1 (m_naiveU.col(firstCol + k).segment(firstCol, k + 1)); for (Index i = firstCol + k - 1; i >= firstCol; i--) m_naiveU.col(i + 1).segment(firstCol, k + 1) = m_naiveU.col(i).segment(firstCol, k + 1); m_naiveU.col(firstCol).segment( firstCol, k + 1) = (q1 * c0); m_naiveU.col(lastCol + 1).segment(firstCol, k + 1) = (q1 * ( - s0)); m_naiveU.col(firstCol).segment(firstCol + k + 1, n - k) = m_naiveU.col(lastCol + 1).segment(firstCol + k + 1, n - k) * s0; m_naiveU.col(lastCol + 1).segment(firstCol + k + 1, n - k) *= c0; } else { RealScalar q1 = m_naiveU(0, firstCol + k); for (Index i = firstCol + k - 1; i >= firstCol; i--) m_naiveU(0, i + 1) = m_naiveU(0, i); m_naiveU(0, firstCol) = (q1 * c0); m_naiveU(0, lastCol + 1) = (q1 * ( - s0)); m_naiveU(1, firstCol) = m_naiveU(1, lastCol + 1) *s0; m_naiveU(1, lastCol + 1) *= c0; m_naiveU.row(1).segment(firstCol + 1, k).setZero(); m_naiveU.row(0).segment(firstCol + k + 1, n - k - 1).setZero(); } m_computed(firstCol + shift, firstCol + shift) = r0; m_computed.col(firstCol + shift).segment(firstCol + shift + 1, k) = alphaK * l.transpose().real(); m_computed.col(firstCol + shift).segment(firstCol + shift + k + 1, n - k - 1) = betaK * f.transpose().real(); deflation(firstCol, lastCol, k, firstRowW, firstColW, shift); # 532 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" MatrixXr UofSVD, VofSVD; VectorType singVals; computeSVDofM(firstCol + shift, n, UofSVD, singVals, VofSVD); if (m_compU) structured_update(m_naiveU.block(firstCol, firstCol, n + 1, n + 1), UofSVD, (n+2)/2); else { Map<Matrix<RealScalar,2,Dynamic>,Aligned> tmp(m_workspace.data(),2,n+1); tmp.noalias() = m_naiveU.middleCols(firstCol, n+1) * UofSVD; m_naiveU.middleCols(firstCol, n + 1) = tmp; } if (m_compV) structured_update(m_naiveV.block(firstRowW, firstColW, n, n), VofSVD, (n+1)/2); m_computed.block(firstCol + shift, firstCol + shift, n, n).setZero(); m_computed.block(firstCol + shift, firstCol + shift, n, n).diagonal() = singVals; } # 570 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" template <typename MatrixType> void BDCSVD<MatrixType>::computeSVDofM(Index firstCol, Index n, MatrixXr& U, VectorType& singVals, MatrixXr& V) { const RealScalar considerZero = (std::numeric_limits<RealScalar>::min)(); using std::abs; ArrayRef col0 = m_computed.col(firstCol).segment(firstCol, n); m_workspace.head(n) = m_computed.block(firstCol, firstCol, n, n).diagonal(); ArrayRef diag = m_workspace.head(n); diag(0) = Literal(0); singVals.resize(n); U.resize(n+1, n+1); if (m_compV) V.resize(n, n); # 593 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" Index actual_n = n; while(actual_n>1 && diag(actual_n-1)==Literal(0)) --actual_n; Index m = 0; for(Index k=0;k<actual_n;++k) if(abs(col0(k))>considerZero) m_workspaceI(m++) = k; Map<ArrayXi> perm(m_workspaceI.data(),m); Map<ArrayXr> shifts(m_workspace.data()+1*n, n); Map<ArrayXr> mus(m_workspace.data()+2*n, n); Map<ArrayXr> zhat(m_workspace.data()+3*n, n); # 612 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" computeSingVals(col0, diag, perm, singVals, shifts, mus); # 638 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" perturbCol0(col0, diag, perm, singVals, shifts, mus, zhat); # 647 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" computeSingVecs(zhat, diag, perm, singVals, shifts, mus, U, V); # 666 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" for(Index i=0; i<actual_n-1; ++i) { if(singVals(i)>singVals(i+1)) { using std::swap; swap(singVals(i),singVals(i+1)); U.col(i).swap(U.col(i+1)); if(m_compV) V.col(i).swap(V.col(i+1)); } } singVals.head(actual_n).reverseInPlace(); U.leftCols(actual_n).rowwise().reverseInPlace(); if (m_compV) V.leftCols(actual_n).rowwise().reverseInPlace(); } template <typename MatrixType> typename BDCSVD<MatrixType>::RealScalar BDCSVD<MatrixType>::secularEq(RealScalar mu, const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, const ArrayRef& diagShifted, RealScalar shift) { Index m = perm.size(); RealScalar res = Literal(1); for(Index i=0; i<m; ++i) { Index j = perm(i); res += (col0(j) / (diagShifted(j) - mu)) * (col0(j) / (diag(j) + shift + mu)); } return res; } template <typename MatrixType> void BDCSVD<MatrixType>::computeSingVals(const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, VectorType& singVals, ArrayRef shifts, ArrayRef mus) { using std::abs; using std::swap; using std::sqrt; Index n = col0.size(); Index actual_n = n; while(actual_n>1 && col0(actual_n-1)==Literal(0)) --actual_n; for (Index k = 0; k < n; ++k) { if (col0(k) == Literal(0) || actual_n==1) { singVals(k) = k==0 ? col0(0) : diag(k); mus(k) = Literal(0); shifts(k) = k==0 ? col0(0) : diag(k); continue; } RealScalar left = diag(k); RealScalar right; if(k==actual_n-1) right = (diag(actual_n-1) + col0.matrix().norm()); else { Index l = k+1; while(col0(l)==Literal(0)) { ++l; ; } right = diag(l); } RealScalar mid = left + (right-left) / Literal(2); RealScalar fMid = secularEq(mid, col0, diag, perm, diag, Literal(0)); # 766 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" RealScalar shift = (k == actual_n-1 || fMid > Literal(0)) ? left : right; Map<ArrayXr> diagShifted(m_workspace.data()+4*n, n); diagShifted = diag - shift; RealScalar muPrev, muCur; if (shift == left) { muPrev = (right - left) * RealScalar(0.1); if (k == actual_n-1) muCur = right - left; else muCur = (right - left) * RealScalar(0.5); } else { muPrev = -(right - left) * RealScalar(0.1); muCur = -(right - left) * RealScalar(0.5); } RealScalar fPrev = secularEq(muPrev, col0, diag, perm, diagShifted, shift); RealScalar fCur = secularEq(muCur, col0, diag, perm, diagShifted, shift); if (abs(fPrev) < abs(fCur)) { swap(fPrev, fCur); swap(muPrev, muCur); } bool useBisection = fPrev*fCur>Literal(0); while (fCur!=Literal(0) && abs(muCur - muPrev) > Literal(8) * NumTraits<RealScalar>::epsilon() * numext::maxi<RealScalar>(abs(muCur), abs(muPrev)) && abs(fCur - fPrev)>NumTraits<RealScalar>::epsilon() && !useBisection) { ++m_numIters; RealScalar a = (fCur - fPrev) / (Literal(1)/muCur - Literal(1)/muPrev); RealScalar b = fCur - a / muCur; RealScalar muZero = -a/b; RealScalar fZero = secularEq(muZero, col0, diag, perm, diagShifted, shift); muPrev = muCur; fPrev = fCur; muCur = muZero; fCur = fZero; if (shift == left && (muCur < Literal(0) || muCur > right - left)) useBisection = true; if (shift == right && (muCur < -(right - left) || muCur > Literal(0))) useBisection = true; if (abs(fCur)>abs(fPrev)) useBisection = true; } if (useBisection) { RealScalar leftShifted, rightShifted; if (shift == left) { leftShifted = numext::maxi<RealScalar>( (std::numeric_limits<RealScalar>::min)(), Literal(2) * abs(col0(k)) / sqrt((std::numeric_limits<RealScalar>::max)()) ); ; rightShifted = (k==actual_n-1) ? right : ((right - left) * RealScalar(0.51)); } else { leftShifted = -(right - left) * RealScalar(0.51); if(k+1<n) rightShifted = -numext::maxi<RealScalar>( (std::numeric_limits<RealScalar>::min)(), abs(col0(k+1)) / sqrt((std::numeric_limits<RealScalar>::max)()) ); else rightShifted = -(std::numeric_limits<RealScalar>::min)(); } RealScalar fLeft = secularEq(leftShifted, col0, diag, perm, diagShifted, shift); # 860 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" ; while (rightShifted - leftShifted > Literal(2) * NumTraits<RealScalar>::epsilon() * numext::maxi<RealScalar>(abs(leftShifted), abs(rightShifted))) { RealScalar midShifted = (leftShifted + rightShifted) / Literal(2); fMid = secularEq(midShifted, col0, diag, perm, diagShifted, shift); if (fLeft * fMid < Literal(0)) { rightShifted = midShifted; } else { leftShifted = midShifted; fLeft = fMid; } } muCur = (leftShifted + rightShifted) / Literal(2); } singVals[k] = shift + muCur; shifts[k] = shift; mus[k] = muCur; } } template <typename MatrixType> void BDCSVD<MatrixType>::perturbCol0 (const ArrayRef& col0, const ArrayRef& diag, const IndicesRef &perm, const VectorType& singVals, const ArrayRef& shifts, const ArrayRef& mus, ArrayRef zhat) { using std::sqrt; Index n = col0.size(); Index m = perm.size(); if(m==0) { zhat.setZero(); return; } Index last = perm(m-1); for (Index k = 0; k < n; ++k) { if (col0(k) == Literal(0)) zhat(k) = Literal(0); else { RealScalar dk = diag(k); RealScalar prod = (singVals(last) + dk) * (mus(last) + (shifts(last) - dk)); for(Index l = 0; l<m; ++l) { Index i = perm(l); if(i!=k) { Index j = i<k ? i : perm(l-1); prod *= ((singVals(j)+dk) / ((diag(i)+dk))) * ((mus(j)+(shifts(j)-dk)) / ((diag(i)-dk))); } } RealScalar tmp = sqrt(prod); zhat(k) = col0(k) > Literal(0) ? tmp : -tmp; } } } template <typename MatrixType> void BDCSVD<MatrixType>::computeSingVecs (const ArrayRef& zhat, const ArrayRef& diag, const IndicesRef &perm, const VectorType& singVals, const ArrayRef& shifts, const ArrayRef& mus, MatrixXr& U, MatrixXr& V) { Index n = zhat.size(); Index m = perm.size(); for (Index k = 0; k < n; ++k) { if (zhat(k) == Literal(0)) { U.col(k) = VectorType::Unit(n+1, k); if (m_compV) V.col(k) = VectorType::Unit(n, k); } else { U.col(k).setZero(); for(Index l=0;l<m;++l) { Index i = perm(l); U(i,k) = zhat(i)/(((diag(i) - shifts(k)) - mus(k)) )/( (diag(i) + singVals[k])); } U(n,k) = Literal(0); U.col(k).normalize(); if (m_compV) { V.col(k).setZero(); for(Index l=1;l<m;++l) { Index i = perm(l); V(i,k) = diag(i) * zhat(i) / (((diag(i) - shifts(k)) - mus(k)) )/( (diag(i) + singVals[k])); } V(0,k) = Literal(-1); V.col(k).normalize(); } } } U.col(n) = VectorType::Unit(n+1, n); } template <typename MatrixType> void BDCSVD<MatrixType>::deflation43(Index firstCol, Index shift, Index i, Index size) { using std::abs; using std::sqrt; using std::pow; Index start = firstCol + shift; RealScalar c = m_computed(start, start); RealScalar s = m_computed(start+i, start); RealScalar r = numext::hypot(c,s); if (r == Literal(0)) { m_computed(start+i, start+i) = Literal(0); return; } m_computed(start,start) = r; m_computed(start+i, start) = Literal(0); m_computed(start+i, start+i) = Literal(0); JacobiRotation<RealScalar> J(c/r,-s/r); if (m_compU) m_naiveU.middleRows(firstCol, size+1).applyOnTheRight(firstCol, firstCol+i, J); else m_naiveU.applyOnTheRight(firstCol, firstCol+i, J); } template <typename MatrixType> void BDCSVD<MatrixType>::deflation44(Index firstColu , Index firstColm, Index firstRowW, Index firstColW, Index i, Index j, Index size) { using std::abs; using std::sqrt; using std::conj; using std::pow; RealScalar c = m_computed(firstColm+i, firstColm); RealScalar s = m_computed(firstColm+j, firstColm); RealScalar r = sqrt(numext::abs2(c) + numext::abs2(s)); # 1039 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" if (r==Literal(0)) { m_computed(firstColm + i, firstColm + i) = m_computed(firstColm + j, firstColm + j); return; } c/=r; s/=r; m_computed(firstColm + i, firstColm) = r; m_computed(firstColm + j, firstColm + j) = m_computed(firstColm + i, firstColm + i); m_computed(firstColm + j, firstColm) = Literal(0); JacobiRotation<RealScalar> J(c,-s); if (m_compU) m_naiveU.middleRows(firstColu, size+1).applyOnTheRight(firstColu + i, firstColu + j, J); else m_naiveU.applyOnTheRight(firstColu+i, firstColu+j, J); if (m_compV) m_naiveV.middleRows(firstRowW, size).applyOnTheRight(firstColW + i, firstColW + j, J); } template <typename MatrixType> void BDCSVD<MatrixType>::deflation(Index firstCol, Index lastCol, Index k, Index firstRowW, Index firstColW, Index shift) { using std::sqrt; using std::abs; const Index length = lastCol + 1 - firstCol; Block<MatrixXr,Dynamic,1> col0(m_computed, firstCol+shift, firstCol+shift, length, 1); Diagonal<MatrixXr> fulldiag(m_computed); VectorBlock<Diagonal<MatrixXr>,Dynamic> diag(fulldiag, firstCol+shift, length); const RealScalar considerZero = (std::numeric_limits<RealScalar>::min)(); RealScalar maxDiag = diag.tail((std::max)(Index(1),length-1)).cwiseAbs().maxCoeff(); RealScalar epsilon_strict = numext::maxi<RealScalar>(considerZero,NumTraits<RealScalar>::epsilon() * maxDiag); RealScalar epsilon_coarse = Literal(8) * NumTraits<RealScalar>::epsilon() * numext::maxi<RealScalar>(col0.cwiseAbs().maxCoeff(), maxDiag); # 1085 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" if (diag(0) < epsilon_coarse) { diag(0) = epsilon_coarse; } for (Index i=1;i<length;++i) if (abs(col0(i)) < epsilon_strict) { col0(i) = Literal(0); } for (Index i=1;i<length; i++) if (diag(i) < epsilon_coarse) { deflation43(firstCol, shift, i, length); } # 1121 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" { bool total_deflation = (col0.tail(length-1).array()<considerZero).all(); Index *permutation = m_workspaceI.data(); { permutation[0] = 0; Index p = 1; for(Index i=1; i<length; ++i) if(abs(diag(i))<considerZero) permutation[p++] = i; Index i=1, j=k+1; for( ; p < length; ++p) { if (i > k) permutation[p] = j++; else if (j >= length) permutation[p] = i++; else if (diag(i) < diag(j)) permutation[p] = j++; else permutation[p] = i++; } } if(total_deflation) { for(Index i=1; i<length; ++i) { Index pi = permutation[i]; if(abs(diag(pi))<considerZero || diag(0)<diag(pi)) permutation[i-1] = permutation[i]; else { permutation[i-1] = 0; break; } } } Index *realInd = m_workspaceI.data()+length; Index *realCol = m_workspaceI.data()+2*length; for(int pos = 0; pos< length; pos++) { realCol[pos] = pos; realInd[pos] = pos; } for(Index i = total_deflation?0:1; i < length; i++) { const Index pi = permutation[length - (total_deflation ? i+1 : i)]; const Index J = realCol[pi]; using std::swap; swap(diag(i), diag(J)); if(i!=0 && J!=0) swap(col0(i), col0(J)); if (m_compU) m_naiveU.col(firstCol+i).segment(firstCol, length + 1).swap(m_naiveU.col(firstCol+J).segment(firstCol, length + 1)); else m_naiveU.col(firstCol+i).segment(0, 2) .swap(m_naiveU.col(firstCol+J).segment(0, 2)); if (m_compV) m_naiveV.col(firstColW + i).segment(firstRowW, length).swap(m_naiveV.col(firstColW + J).segment(firstRowW, length)); const Index realI = realInd[i]; realCol[realI] = J; realCol[pi] = i; realInd[J] = realI; realInd[i] = pi; } } { Index i = length-1; while(i>0 && (abs(diag(i))<considerZero || abs(col0(i))<considerZero)) --i; for(; i>1;--i) if( (diag(i) - diag(i-1)) < NumTraits<RealScalar>::epsilon()*maxDiag ) { ; deflation44(firstCol, firstCol + shift, firstRowW, firstColW, i-1, i, length); } } # 1227 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" } # 1236 "eigen-3.3.7/Eigen/src/SVD/BDCSVD.h" template<typename Derived> BDCSVD<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::bdcSvd(unsigned int computationOptions) const { return BDCSVD<PlainObject>(*this, computationOptions); } } # 39 "eigen-3.3.7/Eigen/SVD" 2 # 48 "eigen-3.3.7/Eigen/SVD" # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 12 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" #pragma GCC diagnostic pop # 49 "eigen-3.3.7/Eigen/SVD" 2 # 16 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/LU" 1 # 13 "eigen-3.3.7/Eigen/LU" # 1 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" 1 # 49 "eigen-3.3.7/Eigen/src/Core/util/DisableStupidWarnings.h" #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wshadow" #pragma GCC diagnostic ignored "-Wtype-limits" # 14 "eigen-3.3.7/Eigen/LU" 2 # 26 "eigen-3.3.7/Eigen/LU" # 1 "eigen-3.3.7/Eigen/src/misc/Kernel.h" 1 # 13 "eigen-3.3.7/Eigen/src/misc/Kernel.h" namespace Eigen { namespace internal { template<typename DecompositionType> struct traits<kernel_retval_base<DecompositionType> > { typedef typename DecompositionType::MatrixType MatrixType; typedef Matrix< typename MatrixType::Scalar, MatrixType::ColsAtCompileTime, Dynamic, MatrixType::Options, MatrixType::MaxColsAtCompileTime, MatrixType::MaxColsAtCompileTime > ReturnType; }; template<typename _DecompositionType> struct kernel_retval_base : public ReturnByValue<kernel_retval_base<_DecompositionType> > { typedef _DecompositionType DecompositionType; typedef ReturnByValue<kernel_retval_base> Base; explicit kernel_retval_base(const DecompositionType& dec) : m_dec(dec), m_rank(dec.rank()), m_cols(m_rank==dec.cols() ? 1 : dec.cols() - m_rank) {} inline Index rows() const { return m_dec.cols(); } inline Index cols() const { return m_cols; } inline Index rank() const { return m_rank; } inline const DecompositionType& dec() const { return m_dec; } template<typename Dest> inline void evalTo(Dest& dst) const { static_cast<const kernel_retval<DecompositionType>*>(this)->evalTo(dst); } protected: const DecompositionType& m_dec; Index m_rank, m_cols; }; } # 77 "eigen-3.3.7/Eigen/src/misc/Kernel.h" } # 27 "eigen-3.3.7/Eigen/LU" 2 # 1 "eigen-3.3.7/Eigen/src/misc/Image.h" 1 # 13 "eigen-3.3.7/Eigen/src/misc/Image.h" namespace Eigen { namespace internal { template<typename DecompositionType> struct traits<image_retval_base<DecompositionType> > { typedef typename DecompositionType::MatrixType MatrixType; typedef Matrix< typename MatrixType::Scalar, MatrixType::RowsAtCompileTime, Dynamic, MatrixType::Options, MatrixType::MaxRowsAtCompileTime, MatrixType::MaxColsAtCompileTime > ReturnType; }; template<typename _DecompositionType> struct image_retval_base : public ReturnByValue<image_retval_base<_DecompositionType> > { typedef _DecompositionType DecompositionType; typedef typename DecompositionType::MatrixType MatrixType; typedef ReturnByValue<image_retval_base> Base; image_retval_base(const DecompositionType& dec, const MatrixType& originalMatrix) : m_dec(dec), m_rank(dec.rank()), m_cols(m_rank == 0 ? 1 : m_rank), m_originalMatrix(originalMatrix) {} inline Index rows() const { return m_dec.rows(); } inline Index cols() const { return m_cols; } inline Index rank() const { return m_rank; } inline const DecompositionType& dec() const { return m_dec; } inline const MatrixType& originalMatrix() const { return m_originalMatrix; } template<typename Dest> inline void evalTo(Dest& dst) const { static_cast<const image_retval<DecompositionType>*>(this)->evalTo(dst); } protected: const DecompositionType& m_dec; Index m_rank, m_cols; const MatrixType& m_originalMatrix; }; } # 80 "eigen-3.3.7/Eigen/src/misc/Image.h" } # 28 "eigen-3.3.7/Eigen/LU" 2 # 1 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" 1 # 13 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" namespace Eigen { namespace internal { template<typename _MatrixType> struct traits<FullPivLU<_MatrixType> > : traits<_MatrixType> { typedef MatrixXpr XprKind; typedef SolverStorage StorageKind; enum { Flags = 0 }; }; } # 59 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" template<typename _MatrixType> class FullPivLU : public SolverBase<FullPivLU<_MatrixType> > { public: typedef _MatrixType MatrixType; typedef SolverBase<FullPivLU> Base; typedef typename Eigen::internal::traits<FullPivLU>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<FullPivLU>::type Nested; typedef typename Eigen::internal::traits<FullPivLU>::StorageKind StorageKind; typedef typename Eigen::internal::traits<FullPivLU>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<FullPivLU>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<FullPivLU>::ColsAtCompileTime, Flags = Eigen::internal::traits<FullPivLU>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; enum { MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime }; typedef typename internal::plain_row_type<MatrixType, StorageIndex>::type IntRowVectorType; typedef typename internal::plain_col_type<MatrixType, StorageIndex>::type IntColVectorType; typedef PermutationMatrix<ColsAtCompileTime, MaxColsAtCompileTime> PermutationQType; typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> PermutationPType; typedef typename MatrixType::PlainObject PlainObject; FullPivLU(); FullPivLU(Index rows, Index cols); template<typename InputType> explicit FullPivLU(const EigenBase<InputType>& matrix); template<typename InputType> explicit FullPivLU(EigenBase<InputType>& matrix); # 118 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" template<typename InputType> FullPivLU& compute(const EigenBase<InputType>& matrix) { m_lu = matrix.derived(); computeInPlace(); return *this; } inline const MatrixType& matrixLU() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 133, __PRETTY_FUNCTION__)); return m_lu; } # 144 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" inline Index nonzeroPivots() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 146, __PRETTY_FUNCTION__)); return m_nonzero_pivots; } RealScalar maxPivot() const { return m_maxpivot; } inline const PermutationPType& permutationP() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 161, __PRETTY_FUNCTION__)); return m_p; } inline const PermutationQType& permutationQ() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 171, __PRETTY_FUNCTION__)); return m_q; } # 189 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" inline const internal::kernel_retval<FullPivLU> kernel() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 191, __PRETTY_FUNCTION__)); return internal::kernel_retval<FullPivLU>(*this); } # 214 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" inline const internal::image_retval<FullPivLU> image(const MatrixType& originalMatrix) const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 217, __PRETTY_FUNCTION__)); return internal::image_retval<FullPivLU>(*this, originalMatrix); } # 241 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" template<typename Rhs> inline const Solve<FullPivLU, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 245, __PRETTY_FUNCTION__)); return Solve<FullPivLU, Rhs>(*this, b.derived()); } inline RealScalar rcond() const { ((m_isInitialized && "PartialPivLU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"PartialPivLU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 254, __PRETTY_FUNCTION__)); return internal::rcond_estimate_helper(m_l1_norm, *this); } # 273 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" typename internal::traits<MatrixType>::Scalar determinant() const; # 292 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" FullPivLU& setThreshold(const RealScalar& threshold) { m_usePrescribedThreshold = true; m_prescribedThreshold = threshold; return *this; } # 307 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" FullPivLU& setThreshold(Default_t) { m_usePrescribedThreshold = false; return *this; } RealScalar threshold() const { ((m_isInitialized || m_usePrescribedThreshold) ? static_cast<void> (0) : __assert_fail ("m_isInitialized || m_usePrescribedThreshold", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 319, __PRETTY_FUNCTION__)); return m_usePrescribedThreshold ? m_prescribedThreshold : NumTraits<Scalar>::epsilon() * m_lu.diagonalSize(); } inline Index rank() const { using std::abs; ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 335, __PRETTY_FUNCTION__)); RealScalar premultiplied_threshold = abs(m_maxpivot) * threshold(); Index result = 0; for(Index i = 0; i < m_nonzero_pivots; ++i) result += (abs(m_lu.coeff(i,i)) > premultiplied_threshold); return result; } inline Index dimensionOfKernel() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 351, __PRETTY_FUNCTION__)); return cols() - rank(); } # 362 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" inline bool isInjective() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 364, __PRETTY_FUNCTION__)); return rank() == cols(); } # 375 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" inline bool isSurjective() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 377, __PRETTY_FUNCTION__)); return rank() == rows(); } inline bool isInvertible() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 389, __PRETTY_FUNCTION__)); return isInjective() && (m_lu.rows() == m_lu.cols()); } # 400 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" inline const Inverse<FullPivLU> inverse() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 402, __PRETTY_FUNCTION__)); ((m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_lu.rows() == m_lu.cols() && \"You can't take the inverse of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 403, __PRETTY_FUNCTION__)); return Inverse<FullPivLU>(*this); } MatrixType reconstructedMatrix() const; inline Index rows() const { return m_lu.rows(); } inline Index cols() const { return m_lu.cols(); } template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const; template<bool Conjugate, typename RhsType, typename DstType> void _solve_impl_transposed(const RhsType &rhs, DstType &dst) const; protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } void computeInPlace(); MatrixType m_lu; PermutationPType m_p; PermutationQType m_q; IntColVectorType m_rowsTranspositions; IntRowVectorType m_colsTranspositions; Index m_nonzero_pivots; RealScalar m_l1_norm; RealScalar m_maxpivot, m_prescribedThreshold; signed char m_det_pq; bool m_isInitialized, m_usePrescribedThreshold; }; template<typename MatrixType> FullPivLU<MatrixType>::FullPivLU() : m_isInitialized(false), m_usePrescribedThreshold(false) { } template<typename MatrixType> FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols) : m_lu(rows, cols), m_p(rows), m_q(cols), m_rowsTranspositions(rows), m_colsTranspositions(cols), m_isInitialized(false), m_usePrescribedThreshold(false) { } template<typename MatrixType> template<typename InputType> FullPivLU<MatrixType>::FullPivLU(const EigenBase<InputType>& matrix) : m_lu(matrix.rows(), matrix.cols()), m_p(matrix.rows()), m_q(matrix.cols()), m_rowsTranspositions(matrix.rows()), m_colsTranspositions(matrix.cols()), m_isInitialized(false), m_usePrescribedThreshold(false) { compute(matrix.derived()); } template<typename MatrixType> template<typename InputType> FullPivLU<MatrixType>::FullPivLU(EigenBase<InputType>& matrix) : m_lu(matrix.derived()), m_p(matrix.rows()), m_q(matrix.cols()), m_rowsTranspositions(matrix.rows()), m_colsTranspositions(matrix.cols()), m_isInitialized(false), m_usePrescribedThreshold(false) { computeInPlace(); } template<typename MatrixType> void FullPivLU<MatrixType>::computeInPlace() { check_template_parameters(); ((m_lu.rows()<=NumTraits<int>::highest() && m_lu.cols()<=NumTraits<int>::highest()) ? static_cast<void> (0) : __assert_fail ("m_lu.rows()<=NumTraits<int>::highest() && m_lu.cols()<=NumTraits<int>::highest()", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 495, __PRETTY_FUNCTION__)); m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff(); const Index size = m_lu.diagonalSize(); const Index rows = m_lu.rows(); const Index cols = m_lu.cols(); m_rowsTranspositions.resize(m_lu.rows()); m_colsTranspositions.resize(m_lu.cols()); Index number_of_transpositions = 0; m_nonzero_pivots = size; m_maxpivot = RealScalar(0); for(Index k = 0; k < size; ++k) { Index row_of_biggest_in_corner, col_of_biggest_in_corner; typedef internal::scalar_score_coeff_op<Scalar> Scoring; typedef typename Scoring::result_type Score; Score biggest_in_corner; biggest_in_corner = m_lu.bottomRightCorner(rows-k, cols-k) .unaryExpr(Scoring()) .maxCoeff(&row_of_biggest_in_corner, &col_of_biggest_in_corner); row_of_biggest_in_corner += k; col_of_biggest_in_corner += k; if(biggest_in_corner==Score(0)) { m_nonzero_pivots = k; for(Index i = k; i < size; ++i) { m_rowsTranspositions.coeffRef(i) = i; m_colsTranspositions.coeffRef(i) = i; } break; } RealScalar abs_pivot = internal::abs_knowing_score<Scalar>()(m_lu(row_of_biggest_in_corner, col_of_biggest_in_corner), biggest_in_corner); if(abs_pivot > m_maxpivot) m_maxpivot = abs_pivot; m_rowsTranspositions.coeffRef(k) = row_of_biggest_in_corner; m_colsTranspositions.coeffRef(k) = col_of_biggest_in_corner; if(k != row_of_biggest_in_corner) { m_lu.row(k).swap(m_lu.row(row_of_biggest_in_corner)); ++number_of_transpositions; } if(k != col_of_biggest_in_corner) { m_lu.col(k).swap(m_lu.col(col_of_biggest_in_corner)); ++number_of_transpositions; } if(k<rows-1) m_lu.col(k).tail(rows-k-1) /= m_lu.coeff(k,k); if(k<size-1) m_lu.block(k+1,k+1,rows-k-1,cols-k-1).noalias() -= m_lu.col(k).tail(rows-k-1) * m_lu.row(k).tail(cols-k-1); } m_p.setIdentity(rows); for(Index k = size-1; k >= 0; --k) m_p.applyTranspositionOnTheRight(k, m_rowsTranspositions.coeff(k)); m_q.setIdentity(cols); for(Index k = 0; k < size; ++k) m_q.applyTranspositionOnTheRight(k, m_colsTranspositions.coeff(k)); m_det_pq = (number_of_transpositions%2) ? -1 : 1; m_isInitialized = true; } template<typename MatrixType> typename internal::traits<MatrixType>::Scalar FullPivLU<MatrixType>::determinant() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 585, __PRETTY_FUNCTION__)); ((m_lu.rows() == m_lu.cols() && "You can't take the determinant of a non-square matrix!") ? static_cast<void> (0) : __assert_fail ("m_lu.rows() == m_lu.cols() && \"You can't take the determinant of a non-square matrix!\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 586, __PRETTY_FUNCTION__)); return Scalar(m_det_pq) * Scalar(m_lu.diagonal().prod()); } template<typename MatrixType> MatrixType FullPivLU<MatrixType>::reconstructedMatrix() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 596, __PRETTY_FUNCTION__)); const Index smalldim = (std::min)(m_lu.rows(), m_lu.cols()); MatrixType res(m_lu.rows(),m_lu.cols()); res = m_lu.leftCols(smalldim) .template triangularView<UnitLower>().toDenseMatrix() * m_lu.topRows(smalldim) .template triangularView<Upper>().toDenseMatrix(); res = m_p.inverse() * res; res = res * m_q.inverse(); return res; } namespace internal { template<typename _MatrixType> struct kernel_retval<FullPivLU<_MatrixType> > : kernel_retval_base<FullPivLU<_MatrixType> > { typedef typename FullPivLU<_MatrixType>::MatrixType MatrixType; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef Eigen::internal::kernel_retval_base<FullPivLU<_MatrixType> > Base; using Base::dec; using Base::rank; using Base::rows; using Base::cols; kernel_retval(const FullPivLU<_MatrixType>& dec) : Base(dec) {} enum { MaxSmallDimAtCompileTime = (((int)MatrixType::MaxColsAtCompileTime == 0 || (int)MatrixType::MaxRowsAtCompileTime == 0) ? 0 : ((int)MatrixType::MaxColsAtCompileTime == 1 || (int)MatrixType::MaxRowsAtCompileTime == 1) ? 1 : ((int)MatrixType::MaxColsAtCompileTime == Dynamic && (int)MatrixType::MaxRowsAtCompileTime == Dynamic) ? Dynamic : ((int)MatrixType::MaxColsAtCompileTime == Dynamic) ? (int)MatrixType::MaxRowsAtCompileTime : ((int)MatrixType::MaxRowsAtCompileTime == Dynamic) ? (int)MatrixType::MaxColsAtCompileTime : ((int)MatrixType::MaxColsAtCompileTime <= (int)MatrixType::MaxRowsAtCompileTime) ? (int)MatrixType::MaxColsAtCompileTime : (int)MatrixType::MaxRowsAtCompileTime) }; template<typename Dest> void evalTo(Dest& dst) const { using std::abs; const Index cols = dec().matrixLU().cols(), dimker = cols - rank(); if(dimker == 0) { dst.setZero(); return; } # 658 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank()); RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold(); Index p = 0; for(Index i = 0; i < dec().nonzeroPivots(); ++i) if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold) pivots.coeffRef(p++) = i; ; Matrix<typename MatrixType::Scalar, Dynamic, Dynamic, MatrixType::Options, MaxSmallDimAtCompileTime, MatrixType::MaxColsAtCompileTime> m(dec().matrixLU().block(0, 0, rank(), cols)); for(Index i = 0; i < rank(); ++i) { if(i) m.row(i).head(i).setZero(); m.row(i).tail(cols-i) = dec().matrixLU().row(pivots.coeff(i)).tail(cols-i); } m.block(0, 0, rank(), rank()); m.block(0, 0, rank(), rank()).template triangularView<StrictlyLower>().setZero(); for(Index i = 0; i < rank(); ++i) m.col(i).swap(m.col(pivots.coeff(i))); m.topLeftCorner(rank(), rank()) .template triangularView<Upper>().solveInPlace( m.topRightCorner(rank(), dimker) ); for(Index i = rank()-1; i >= 0; --i) m.col(i).swap(m.col(pivots.coeff(i))); for(Index i = 0; i < rank(); ++i) dst.row(dec().permutationQ().indices().coeff(i)) = -m.row(i).tail(dimker); for(Index i = rank(); i < cols; ++i) dst.row(dec().permutationQ().indices().coeff(i)).setZero(); for(Index k = 0; k < dimker; ++k) dst.coeffRef(dec().permutationQ().indices().coeff(rank()+k), k) = Scalar(1); } }; template<typename _MatrixType> struct image_retval<FullPivLU<_MatrixType> > : image_retval_base<FullPivLU<_MatrixType> > { typedef typename FullPivLU<_MatrixType>::MatrixType MatrixType; typedef typename MatrixType::Scalar Scalar; typedef typename MatrixType::RealScalar RealScalar; typedef Eigen::internal::image_retval_base<FullPivLU<_MatrixType> > Base; using Base::dec; using Base::originalMatrix; using Base::rank; using Base::rows; using Base::cols; image_retval(const FullPivLU<_MatrixType>& dec, const MatrixType& originalMatrix) : Base(dec, originalMatrix) {} enum { MaxSmallDimAtCompileTime = (((int)MatrixType::MaxColsAtCompileTime == 0 || (int)MatrixType::MaxRowsAtCompileTime == 0) ? 0 : ((int)MatrixType::MaxColsAtCompileTime == 1 || (int)MatrixType::MaxRowsAtCompileTime == 1) ? 1 : ((int)MatrixType::MaxColsAtCompileTime == Dynamic && (int)MatrixType::MaxRowsAtCompileTime == Dynamic) ? Dynamic : ((int)MatrixType::MaxColsAtCompileTime == Dynamic) ? (int)MatrixType::MaxRowsAtCompileTime : ((int)MatrixType::MaxRowsAtCompileTime == Dynamic) ? (int)MatrixType::MaxColsAtCompileTime : ((int)MatrixType::MaxColsAtCompileTime <= (int)MatrixType::MaxRowsAtCompileTime) ? (int)MatrixType::MaxColsAtCompileTime : (int)MatrixType::MaxRowsAtCompileTime) }; template<typename Dest> void evalTo(Dest& dst) const { using std::abs; if(rank() == 0) { dst.setZero(); return; } Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank()); RealScalar premultiplied_threshold = dec().maxPivot() * dec().threshold(); Index p = 0; for(Index i = 0; i < dec().nonzeroPivots(); ++i) if(abs(dec().matrixLU().coeff(i,i)) > premultiplied_threshold) pivots.coeffRef(p++) = i; ; for(Index i = 0; i < rank(); ++i) dst.col(i) = originalMatrix().col(dec().permutationQ().indices().coeff(pivots.coeff(i))); } }; } template<typename _MatrixType> template<typename RhsType, typename DstType> void FullPivLU<_MatrixType>::_solve_impl(const RhsType &rhs, DstType &dst) const { # 757 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" const Index rows = this->rows(), cols = this->cols(), nonzero_pivots = this->rank(); ((rhs.rows() == rows) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == rows", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 760, __PRETTY_FUNCTION__)); const Index smalldim = (std::min)(rows, cols); if(nonzero_pivots == 0) { dst.setZero(); return; } typename RhsType::PlainObject c(rhs.rows(), rhs.cols()); c = permutationP() * rhs; m_lu.topLeftCorner(smalldim,smalldim) .template triangularView<UnitLower>() .solveInPlace(c.topRows(smalldim)); if(rows>cols) c.bottomRows(rows-cols) -= m_lu.bottomRows(rows-cols) * c.topRows(cols); m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots) .template triangularView<Upper>() .solveInPlace(c.topRows(nonzero_pivots)); for(Index i = 0; i < nonzero_pivots; ++i) dst.row(permutationQ().indices().coeff(i)) = c.row(i); for(Index i = nonzero_pivots; i < m_lu.cols(); ++i) dst.row(permutationQ().indices().coeff(i)).setZero(); } template<typename _MatrixType> template<bool Conjugate, typename RhsType, typename DstType> void FullPivLU<_MatrixType>::_solve_impl_transposed(const RhsType &rhs, DstType &dst) const { # 808 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" const Index rows = this->rows(), cols = this->cols(), nonzero_pivots = this->rank(); ((rhs.rows() == cols) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == cols", "eigen-3.3.7/Eigen/src/LU/FullPivLU.h", 810, __PRETTY_FUNCTION__)); const Index smalldim = (std::min)(rows, cols); if(nonzero_pivots == 0) { dst.setZero(); return; } typename RhsType::PlainObject c(rhs.rows(), rhs.cols()); c = permutationQ().inverse() * rhs; if (Conjugate) { m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots) .template triangularView<Upper>() .adjoint() .solveInPlace(c.topRows(nonzero_pivots)); m_lu.topLeftCorner(smalldim, smalldim) .template triangularView<UnitLower>() .adjoint() .solveInPlace(c.topRows(smalldim)); } else { m_lu.topLeftCorner(nonzero_pivots, nonzero_pivots) .template triangularView<Upper>() .transpose() .solveInPlace(c.topRows(nonzero_pivots)); m_lu.topLeftCorner(smalldim, smalldim) .template triangularView<UnitLower>() .transpose() .solveInPlace(c.topRows(smalldim)); } PermutationPType invp = permutationP().inverse().eval(); for(Index i = 0; i < smalldim; ++i) dst.row(invp.indices().coeff(i)) = c.row(i); for(Index i = smalldim; i < rows; ++i) dst.row(invp.indices().coeff(i)).setZero(); } namespace internal { template<typename DstXprType, typename MatrixType> struct Assignment<DstXprType, Inverse<FullPivLU<MatrixType> >, internal::assign_op<typename DstXprType::Scalar,typename FullPivLU<MatrixType>::Scalar>, Dense2Dense> { typedef FullPivLU<MatrixType> LuType; typedef Inverse<LuType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename MatrixType::Scalar> &) { dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); } }; } # 882 "eigen-3.3.7/Eigen/src/LU/FullPivLU.h" template<typename Derived> inline const FullPivLU<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::fullPivLu() const { return FullPivLU<PlainObject>(eval()); } } # 29 "eigen-3.3.7/Eigen/LU" 2 # 1 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" 1 # 14 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" namespace Eigen { namespace internal { template<typename _MatrixType> struct traits<PartialPivLU<_MatrixType> > : traits<_MatrixType> { typedef MatrixXpr XprKind; typedef SolverStorage StorageKind; typedef traits<_MatrixType> BaseTraits; enum { Flags = BaseTraits::Flags & RowMajorBit, CoeffReadCost = Dynamic }; }; template<typename T,typename Derived> struct enable_if_ref; template<typename T,typename Derived> struct enable_if_ref<Ref<T>,Derived> { typedef Derived type; }; } # 75 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" template<typename _MatrixType> class PartialPivLU : public SolverBase<PartialPivLU<_MatrixType> > { public: typedef _MatrixType MatrixType; typedef SolverBase<PartialPivLU> Base; typedef typename Eigen::internal::traits<PartialPivLU>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<PartialPivLU>::type Nested; typedef typename Eigen::internal::traits<PartialPivLU>::StorageKind StorageKind; typedef typename Eigen::internal::traits<PartialPivLU>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<PartialPivLU>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<PartialPivLU>::ColsAtCompileTime, Flags = Eigen::internal::traits<PartialPivLU>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; enum { MaxRowsAtCompileTime = MatrixType::MaxRowsAtCompileTime, MaxColsAtCompileTime = MatrixType::MaxColsAtCompileTime }; typedef PermutationMatrix<RowsAtCompileTime, MaxRowsAtCompileTime> PermutationType; typedef Transpositions<RowsAtCompileTime, MaxRowsAtCompileTime> TranspositionType; typedef typename MatrixType::PlainObject PlainObject; PartialPivLU(); explicit PartialPivLU(Index size); # 115 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" template<typename InputType> explicit PartialPivLU(const EigenBase<InputType>& matrix); # 125 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" template<typename InputType> explicit PartialPivLU(EigenBase<InputType>& matrix); template<typename InputType> PartialPivLU& compute(const EigenBase<InputType>& matrix) { m_lu = matrix.derived(); compute(); return *this; } inline const MatrixType& matrixLU() const { ((m_isInitialized && "PartialPivLU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"PartialPivLU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 143, __PRETTY_FUNCTION__)); return m_lu; } inline const PermutationType& permutationP() const { ((m_isInitialized && "PartialPivLU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"PartialPivLU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 151, __PRETTY_FUNCTION__)); return m_p; } # 173 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" template<typename Rhs> inline const Solve<PartialPivLU, Rhs> solve(const MatrixBase<Rhs>& b) const { ((m_isInitialized && "PartialPivLU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"PartialPivLU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 177, __PRETTY_FUNCTION__)); return Solve<PartialPivLU, Rhs>(*this, b.derived()); } inline RealScalar rcond() const { ((m_isInitialized && "PartialPivLU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"PartialPivLU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 186, __PRETTY_FUNCTION__)); return internal::rcond_estimate_helper(m_l1_norm, *this); } # 197 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" inline const Inverse<PartialPivLU> inverse() const { ((m_isInitialized && "PartialPivLU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"PartialPivLU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 199, __PRETTY_FUNCTION__)); return Inverse<PartialPivLU>(*this); } # 216 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" Scalar determinant() const; MatrixType reconstructedMatrix() const; inline Index rows() const { return m_lu.rows(); } inline Index cols() const { return m_lu.cols(); } template<typename RhsType, typename DstType> void _solve_impl(const RhsType &rhs, DstType &dst) const { ((rhs.rows() == m_lu.rows()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == m_lu.rows()", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 234, __PRETTY_FUNCTION__)); dst = permutationP() * rhs; m_lu.template triangularView<UnitLower>().solveInPlace(dst); m_lu.template triangularView<Upper>().solveInPlace(dst); } template<bool Conjugate, typename RhsType, typename DstType> void _solve_impl_transposed(const RhsType &rhs, DstType &dst) const { ((rhs.rows() == m_lu.cols()) ? static_cast<void> (0) : __assert_fail ("rhs.rows() == m_lu.cols()", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 256, __PRETTY_FUNCTION__)); if (Conjugate) { dst = m_lu.template triangularView<Upper>().adjoint().solve(rhs); m_lu.template triangularView<UnitLower>().adjoint().solveInPlace(dst); } else { dst = m_lu.template triangularView<Upper>().transpose().solve(rhs); m_lu.template triangularView<UnitLower>().transpose().solveInPlace(dst); } dst = permutationP().transpose() * dst; } protected: static void check_template_parameters() { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {}; } void compute(); MatrixType m_lu; PermutationType m_p; TranspositionType m_rowsTranspositions; RealScalar m_l1_norm; signed char m_det_p; bool m_isInitialized; }; template<typename MatrixType> PartialPivLU<MatrixType>::PartialPivLU() : m_lu(), m_p(), m_rowsTranspositions(), m_l1_norm(0), m_det_p(0), m_isInitialized(false) { } template<typename MatrixType> PartialPivLU<MatrixType>::PartialPivLU(Index size) : m_lu(size, size), m_p(size), m_rowsTranspositions(size), m_l1_norm(0), m_det_p(0), m_isInitialized(false) { } template<typename MatrixType> template<typename InputType> PartialPivLU<MatrixType>::PartialPivLU(const EigenBase<InputType>& matrix) : m_lu(matrix.rows(),matrix.cols()), m_p(matrix.rows()), m_rowsTranspositions(matrix.rows()), m_l1_norm(0), m_det_p(0), m_isInitialized(false) { compute(matrix.derived()); } template<typename MatrixType> template<typename InputType> PartialPivLU<MatrixType>::PartialPivLU(EigenBase<InputType>& matrix) : m_lu(matrix.derived()), m_p(matrix.rows()), m_rowsTranspositions(matrix.rows()), m_l1_norm(0), m_det_p(0), m_isInitialized(false) { compute(); } namespace internal { template<typename Scalar, int StorageOrder, typename PivIndex> struct partial_lu_impl { typedef Map<Matrix<Scalar, Dynamic, Dynamic, StorageOrder> > MapLU; typedef Block<MapLU, Dynamic, Dynamic> MatrixType; typedef Block<MatrixType,Dynamic,Dynamic> BlockType; typedef typename MatrixType::RealScalar RealScalar; # 365 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" static Index unblocked_lu(MatrixType& lu, PivIndex* row_transpositions, PivIndex& nb_transpositions) { typedef scalar_score_coeff_op<Scalar> Scoring; typedef typename Scoring::result_type Score; const Index rows = lu.rows(); const Index cols = lu.cols(); const Index size = (std::min)(rows,cols); nb_transpositions = 0; Index first_zero_pivot = -1; for(Index k = 0; k < size; ++k) { Index rrows = rows-k-1; Index rcols = cols-k-1; Index row_of_biggest_in_col; Score biggest_in_corner = lu.col(k).tail(rows-k).unaryExpr(Scoring()).maxCoeff(&row_of_biggest_in_col); row_of_biggest_in_col += k; row_transpositions[k] = PivIndex(row_of_biggest_in_col); if(biggest_in_corner != Score(0)) { if(k != row_of_biggest_in_col) { lu.row(k).swap(lu.row(row_of_biggest_in_col)); ++nb_transpositions; } lu.col(k).tail(rrows) /= lu.coeff(k,k); } else if(first_zero_pivot==-1) { first_zero_pivot = k; } if(k<rows-1) lu.bottomRightCorner(rrows,rcols).noalias() -= lu.col(k).tail(rrows) * lu.row(k).tail(rcols); } return first_zero_pivot; } # 426 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" static Index blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256) { MapLU lu1(lu_data,StorageOrder==RowMajor?rows:luStride,StorageOrder==RowMajor?luStride:cols); MatrixType lu(lu1,0,0,rows,cols); const Index size = (std::min)(rows,cols); if(size<=16) { return unblocked_lu(lu, row_transpositions, nb_transpositions); } Index blockSize; { blockSize = size/8; blockSize = (blockSize/16)*16; blockSize = (std::min)((std::max)(blockSize,Index(8)), maxBlockSize); } nb_transpositions = 0; Index first_zero_pivot = -1; for(Index k = 0; k < size; k+=blockSize) { Index bs = (std::min)(size-k,blockSize); Index trows = rows - k - bs; Index tsize = size - k - bs; BlockType A_0(lu,0,0,rows,k); BlockType A_2(lu,0,k+bs,rows,tsize); BlockType A11(lu,k,k,bs,bs); BlockType A12(lu,k,k+bs,bs,tsize); BlockType A21(lu,k+bs,k,trows,bs); BlockType A22(lu,k+bs,k+bs,trows,tsize); PivIndex nb_transpositions_in_panel; Index ret = blocked_lu(trows+bs, bs, &lu.coeffRef(k,k), luStride, row_transpositions+k, nb_transpositions_in_panel, 16); if(ret>=0 && first_zero_pivot==-1) first_zero_pivot = k+ret; nb_transpositions += nb_transpositions_in_panel; for(Index i=k; i<k+bs; ++i) { Index piv = (row_transpositions[i] += internal::convert_index<PivIndex>(k)); A_0.row(i).swap(A_0.row(piv)); } if(trows) { for(Index i=k;i<k+bs; ++i) A_2.row(i).swap(A_2.row(row_transpositions[i])); A11.template triangularView<UnitLower>().solveInPlace(A12); A22.noalias() -= A21 * A12; } } return first_zero_pivot; } }; template<typename MatrixType, typename TranspositionType> void partial_lu_inplace(MatrixType& lu, TranspositionType& row_transpositions, typename TranspositionType::StorageIndex& nb_transpositions) { ((lu.cols() == row_transpositions.size()) ? static_cast<void> (0) : __assert_fail ("lu.cols() == row_transpositions.size()", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 504, __PRETTY_FUNCTION__)); (((&row_transpositions.coeffRef(1)-&row_transpositions.coeffRef(0)) == 1) ? static_cast<void> (0) : __assert_fail ("(&row_transpositions.coeffRef(1)-&row_transpositions.coeffRef(0)) == 1", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 505, __PRETTY_FUNCTION__)); partial_lu_impl <typename MatrixType::Scalar, MatrixType::Flags&RowMajorBit?RowMajor:ColMajor, typename TranspositionType::StorageIndex> ::blocked_lu(lu.rows(), lu.cols(), &lu.coeffRef(0,0), lu.outerStride(), &row_transpositions.coeffRef(0), nb_transpositions); } } template<typename MatrixType> void PartialPivLU<MatrixType>::compute() { check_template_parameters(); ((m_lu.rows()<NumTraits<int>::highest()) ? static_cast<void> (0) : __assert_fail ("m_lu.rows()<NumTraits<int>::highest()", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 520, __PRETTY_FUNCTION__)); m_l1_norm = m_lu.cwiseAbs().colwise().sum().maxCoeff(); ((m_lu.rows() == m_lu.cols() && "PartialPivLU is only for square (and moreover invertible) matrices") ? static_cast<void> (0) : __assert_fail ("m_lu.rows() == m_lu.cols() && \"PartialPivLU is only for square (and moreover invertible) matrices\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 524, __PRETTY_FUNCTION__)); const Index size = m_lu.rows(); m_rowsTranspositions.resize(size); typename TranspositionType::StorageIndex nb_transpositions; internal::partial_lu_inplace(m_lu, m_rowsTranspositions, nb_transpositions); m_det_p = (nb_transpositions%2) ? -1 : 1; m_p = m_rowsTranspositions; m_isInitialized = true; } template<typename MatrixType> typename PartialPivLU<MatrixType>::Scalar PartialPivLU<MatrixType>::determinant() const { ((m_isInitialized && "PartialPivLU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"PartialPivLU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 541, __PRETTY_FUNCTION__)); return Scalar(m_det_p) * m_lu.diagonal().prod(); } template<typename MatrixType> MatrixType PartialPivLU<MatrixType>::reconstructedMatrix() const { ((m_isInitialized && "LU is not initialized.") ? static_cast<void> (0) : __assert_fail ("m_isInitialized && \"LU is not initialized.\"", "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h", 551, __PRETTY_FUNCTION__)); MatrixType res = m_lu.template triangularView<UnitLower>().toDenseMatrix() * m_lu.template triangularView<Upper>(); res = m_p.inverse() * res; return res; } namespace internal { template<typename DstXprType, typename MatrixType> struct Assignment<DstXprType, Inverse<PartialPivLU<MatrixType> >, internal::assign_op<typename DstXprType::Scalar,typename PartialPivLU<MatrixType>::Scalar>, Dense2Dense> { typedef PartialPivLU<MatrixType> LuType; typedef Inverse<LuType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename LuType::Scalar> &) { dst = src.nestedExpression().solve(MatrixType::Identity(src.rows(), src.cols())); } }; } # 587 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" template<typename Derived> inline const PartialPivLU<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::partialPivLu() const { return PartialPivLU<PlainObject>(eval()); } # 602 "eigen-3.3.7/Eigen/src/LU/PartialPivLU.h" template<typename Derived> inline const PartialPivLU<typename MatrixBase<Derived>::PlainObject> MatrixBase<Derived>::lu() const { return PartialPivLU<PlainObject>(eval()); } } # 30 "eigen-3.3.7/Eigen/LU" 2 # 38 "eigen-3.3.7/Eigen/LU" # 1 "eigen-3.3.7/Eigen/src/LU/Determinant.h" 1 # 13 "eigen-3.3.7/Eigen/src/LU/Determinant.h" namespace Eigen { namespace internal { template<typename Derived> inline const typename Derived::Scalar bruteforce_det3_helper (const MatrixBase<Derived>& matrix, int a, int b, int c) { return matrix.coeff(0,a) * (matrix.coeff(1,b) * matrix.coeff(2,c) - matrix.coeff(1,c) * matrix.coeff(2,b)); } template<typename Derived> const typename Derived::Scalar bruteforce_det4_helper (const MatrixBase<Derived>& matrix, int j, int k, int m, int n) { return (matrix.coeff(j,0) * matrix.coeff(k,1) - matrix.coeff(k,0) * matrix.coeff(j,1)) * (matrix.coeff(m,2) * matrix.coeff(n,3) - matrix.coeff(n,2) * matrix.coeff(m,3)); } template<typename Derived, int DeterminantType = Derived::RowsAtCompileTime > struct determinant_impl { static inline typename traits<Derived>::Scalar run(const Derived& m) { if(Derived::ColsAtCompileTime==Dynamic && m.rows()==0) return typename traits<Derived>::Scalar(1); return m.partialPivLu().determinant(); } }; template<typename Derived> struct determinant_impl<Derived, 1> { static inline typename traits<Derived>::Scalar run(const Derived& m) { return m.coeff(0,0); } }; template<typename Derived> struct determinant_impl<Derived, 2> { static inline typename traits<Derived>::Scalar run(const Derived& m) { return m.coeff(0,0) * m.coeff(1,1) - m.coeff(1,0) * m.coeff(0,1); } }; template<typename Derived> struct determinant_impl<Derived, 3> { static inline typename traits<Derived>::Scalar run(const Derived& m) { return bruteforce_det3_helper(m,0,1,2) - bruteforce_det3_helper(m,1,0,2) + bruteforce_det3_helper(m,2,0,1); } }; template<typename Derived> struct determinant_impl<Derived, 4> { static typename traits<Derived>::Scalar run(const Derived& m) { return bruteforce_det4_helper(m,0,1,2,3) - bruteforce_det4_helper(m,0,2,1,3) + bruteforce_det4_helper(m,0,3,1,2) + bruteforce_det4_helper(m,1,2,0,3) - bruteforce_det4_helper(m,1,3,0,2) + bruteforce_det4_helper(m,2,3,0,1); } }; } template<typename Derived> inline typename internal::traits<Derived>::Scalar MatrixBase<Derived>::determinant() const { ((rows() == cols()) ? static_cast<void> (0) : __assert_fail ("rows() == cols()", "eigen-3.3.7/Eigen/src/LU/Determinant.h", 94, __PRETTY_FUNCTION__)); typedef typename internal::nested_eval<Derived,Base::RowsAtCompileTime>::type Nested; return internal::determinant_impl<typename internal::remove_all<Nested>::type>::run(derived()); } } # 39 "eigen-3.3.7/Eigen/LU" 2 # 1 "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" 1 # 14 "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" namespace Eigen { namespace internal { template<typename MatrixType, typename ResultType, int Size = MatrixType::RowsAtCompileTime> struct compute_inverse { static inline void run(const MatrixType& matrix, ResultType& result) { result = matrix.partialPivLu().inverse(); } }; template<typename MatrixType, typename ResultType, int Size = MatrixType::RowsAtCompileTime> struct compute_inverse_and_det_with_check { }; template<typename MatrixType, typename ResultType> struct compute_inverse<MatrixType, ResultType, 1> { static inline void run(const MatrixType& matrix, ResultType& result) { typedef typename MatrixType::Scalar Scalar; internal::evaluator<MatrixType> matrixEval(matrix); result.coeffRef(0,0) = Scalar(1) / matrixEval.coeff(0,0); } }; template<typename MatrixType, typename ResultType> struct compute_inverse_and_det_with_check<MatrixType, ResultType, 1> { static inline void run( const MatrixType& matrix, const typename MatrixType::RealScalar& absDeterminantThreshold, ResultType& result, typename ResultType::Scalar& determinant, bool& invertible ) { using std::abs; determinant = matrix.coeff(0,0); invertible = abs(determinant) > absDeterminantThreshold; if(invertible) result.coeffRef(0,0) = typename ResultType::Scalar(1) / determinant; } }; template<typename MatrixType, typename ResultType> inline void compute_inverse_size2_helper( const MatrixType& matrix, const typename ResultType::Scalar& invdet, ResultType& result) { result.coeffRef(0,0) = matrix.coeff(1,1) * invdet; result.coeffRef(1,0) = -matrix.coeff(1,0) * invdet; result.coeffRef(0,1) = -matrix.coeff(0,1) * invdet; result.coeffRef(1,1) = matrix.coeff(0,0) * invdet; } template<typename MatrixType, typename ResultType> struct compute_inverse<MatrixType, ResultType, 2> { static inline void run(const MatrixType& matrix, ResultType& result) { typedef typename ResultType::Scalar Scalar; const Scalar invdet = typename MatrixType::Scalar(1) / matrix.determinant(); compute_inverse_size2_helper(matrix, invdet, result); } }; template<typename MatrixType, typename ResultType> struct compute_inverse_and_det_with_check<MatrixType, ResultType, 2> { static inline void run( const MatrixType& matrix, const typename MatrixType::RealScalar& absDeterminantThreshold, ResultType& inverse, typename ResultType::Scalar& determinant, bool& invertible ) { using std::abs; typedef typename ResultType::Scalar Scalar; determinant = matrix.determinant(); invertible = abs(determinant) > absDeterminantThreshold; if(!invertible) return; const Scalar invdet = Scalar(1) / determinant; compute_inverse_size2_helper(matrix, invdet, inverse); } }; template<typename MatrixType, int i, int j> inline typename MatrixType::Scalar cofactor_3x3(const MatrixType& m) { enum { i1 = (i+1) % 3, i2 = (i+2) % 3, j1 = (j+1) % 3, j2 = (j+2) % 3 }; return m.coeff(i1, j1) * m.coeff(i2, j2) - m.coeff(i1, j2) * m.coeff(i2, j1); } template<typename MatrixType, typename ResultType> inline void compute_inverse_size3_helper( const MatrixType& matrix, const typename ResultType::Scalar& invdet, const Matrix<typename ResultType::Scalar,3,1>& cofactors_col0, ResultType& result) { result.row(0) = cofactors_col0 * invdet; result.coeffRef(1,0) = cofactor_3x3<MatrixType,0,1>(matrix) * invdet; result.coeffRef(1,1) = cofactor_3x3<MatrixType,1,1>(matrix) * invdet; result.coeffRef(1,2) = cofactor_3x3<MatrixType,2,1>(matrix) * invdet; result.coeffRef(2,0) = cofactor_3x3<MatrixType,0,2>(matrix) * invdet; result.coeffRef(2,1) = cofactor_3x3<MatrixType,1,2>(matrix) * invdet; result.coeffRef(2,2) = cofactor_3x3<MatrixType,2,2>(matrix) * invdet; } template<typename MatrixType, typename ResultType> struct compute_inverse<MatrixType, ResultType, 3> { static inline void run(const MatrixType& matrix, ResultType& result) { typedef typename ResultType::Scalar Scalar; Matrix<typename MatrixType::Scalar,3,1> cofactors_col0; cofactors_col0.coeffRef(0) = cofactor_3x3<MatrixType,0,0>(matrix); cofactors_col0.coeffRef(1) = cofactor_3x3<MatrixType,1,0>(matrix); cofactors_col0.coeffRef(2) = cofactor_3x3<MatrixType,2,0>(matrix); const Scalar det = (cofactors_col0.cwiseProduct(matrix.col(0))).sum(); const Scalar invdet = Scalar(1) / det; compute_inverse_size3_helper(matrix, invdet, cofactors_col0, result); } }; template<typename MatrixType, typename ResultType> struct compute_inverse_and_det_with_check<MatrixType, ResultType, 3> { static inline void run( const MatrixType& matrix, const typename MatrixType::RealScalar& absDeterminantThreshold, ResultType& inverse, typename ResultType::Scalar& determinant, bool& invertible ) { using std::abs; typedef typename ResultType::Scalar Scalar; Matrix<Scalar,3,1> cofactors_col0; cofactors_col0.coeffRef(0) = cofactor_3x3<MatrixType,0,0>(matrix); cofactors_col0.coeffRef(1) = cofactor_3x3<MatrixType,1,0>(matrix); cofactors_col0.coeffRef(2) = cofactor_3x3<MatrixType,2,0>(matrix); determinant = (cofactors_col0.cwiseProduct(matrix.col(0))).sum(); invertible = abs(determinant) > absDeterminantThreshold; if(!invertible) return; const Scalar invdet = Scalar(1) / determinant; compute_inverse_size3_helper(matrix, invdet, cofactors_col0, inverse); } }; template<typename Derived> inline const typename Derived::Scalar general_det3_helper (const MatrixBase<Derived>& matrix, int i1, int i2, int i3, int j1, int j2, int j3) { return matrix.coeff(i1,j1) * (matrix.coeff(i2,j2) * matrix.coeff(i3,j3) - matrix.coeff(i2,j3) * matrix.coeff(i3,j2)); } template<typename MatrixType, int i, int j> inline typename MatrixType::Scalar cofactor_4x4(const MatrixType& matrix) { enum { i1 = (i+1) % 4, i2 = (i+2) % 4, i3 = (i+3) % 4, j1 = (j+1) % 4, j2 = (j+2) % 4, j3 = (j+3) % 4 }; return general_det3_helper(matrix, i1, i2, i3, j1, j2, j3) + general_det3_helper(matrix, i2, i3, i1, j1, j2, j3) + general_det3_helper(matrix, i3, i1, i2, j1, j2, j3); } template<int Arch, typename Scalar, typename MatrixType, typename ResultType> struct compute_inverse_size4 { static void run(const MatrixType& matrix, ResultType& result) { result.coeffRef(0,0) = cofactor_4x4<MatrixType,0,0>(matrix); result.coeffRef(1,0) = -cofactor_4x4<MatrixType,0,1>(matrix); result.coeffRef(2,0) = cofactor_4x4<MatrixType,0,2>(matrix); result.coeffRef(3,0) = -cofactor_4x4<MatrixType,0,3>(matrix); result.coeffRef(0,2) = cofactor_4x4<MatrixType,2,0>(matrix); result.coeffRef(1,2) = -cofactor_4x4<MatrixType,2,1>(matrix); result.coeffRef(2,2) = cofactor_4x4<MatrixType,2,2>(matrix); result.coeffRef(3,2) = -cofactor_4x4<MatrixType,2,3>(matrix); result.coeffRef(0,1) = -cofactor_4x4<MatrixType,1,0>(matrix); result.coeffRef(1,1) = cofactor_4x4<MatrixType,1,1>(matrix); result.coeffRef(2,1) = -cofactor_4x4<MatrixType,1,2>(matrix); result.coeffRef(3,1) = cofactor_4x4<MatrixType,1,3>(matrix); result.coeffRef(0,3) = -cofactor_4x4<MatrixType,3,0>(matrix); result.coeffRef(1,3) = cofactor_4x4<MatrixType,3,1>(matrix); result.coeffRef(2,3) = -cofactor_4x4<MatrixType,3,2>(matrix); result.coeffRef(3,3) = cofactor_4x4<MatrixType,3,3>(matrix); result /= (matrix.col(0).cwiseProduct(result.row(0).transpose())).sum(); } }; template<typename MatrixType, typename ResultType> struct compute_inverse<MatrixType, ResultType, 4> : compute_inverse_size4<Architecture::Target, typename MatrixType::Scalar, MatrixType, ResultType> { }; template<typename MatrixType, typename ResultType> struct compute_inverse_and_det_with_check<MatrixType, ResultType, 4> { static inline void run( const MatrixType& matrix, const typename MatrixType::RealScalar& absDeterminantThreshold, ResultType& inverse, typename ResultType::Scalar& determinant, bool& invertible ) { using std::abs; determinant = matrix.determinant(); invertible = abs(determinant) > absDeterminantThreshold; if(invertible) compute_inverse<MatrixType, ResultType>::run(matrix, inverse); } }; } namespace internal { template<typename DstXprType, typename XprType> struct Assignment<DstXprType, Inverse<XprType>, internal::assign_op<typename DstXprType::Scalar,typename XprType::Scalar>, Dense2Dense> { typedef Inverse<XprType> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<typename DstXprType::Scalar,typename XprType::Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); const int Size = (((int)XprType::ColsAtCompileTime <= (int)DstXprType::ColsAtCompileTime) ? (int)XprType::ColsAtCompileTime : (int)DstXprType::ColsAtCompileTime); ; ((( (Size<=1) || (Size>4) || (extract_data(src.nestedExpression())!=extract_data(dst))) && "Aliasing problem detected in inverse(), you need to do inverse().eval() here.") ? static_cast<void> (0) : __assert_fail ("( (Size<=1) || (Size>4) || (extract_data(src.nestedExpression())!=extract_data(dst))) && \"Aliasing problem detected in inverse(), you need to do inverse().eval() here.\"", "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" # 302 "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" , 303 # 302 "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" , __PRETTY_FUNCTION__)) ; typedef typename internal::nested_eval<XprType,XprType::ColsAtCompileTime>::type ActualXprType; typedef typename internal::remove_all<ActualXprType>::type ActualXprTypeCleanded; ActualXprType actual_xpr(src.nestedExpression()); compute_inverse<ActualXprTypeCleanded, DstXprType>::run(actual_xpr, dst); } }; } # 334 "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" template<typename Derived> inline const Inverse<Derived> MatrixBase<Derived>::inverse() const { if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsInteger)>::THIS_FUNCTION_IS_NOT_FOR_INTEGER_NUMERIC_TYPES) {} ((rows() == cols()) ? static_cast<void> (0) : __assert_fail ("rows() == cols()", "eigen-3.3.7/Eigen/src/LU/InverseImpl.h", 338, __PRETTY_FUNCTION__)); return Inverse<Derived>(derived()); } # 360 "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" template<typename Derived> template<typename ResultType> inline void MatrixBase<Derived>::computeInverseAndDetWithCheck( ResultType& inverse, typename ResultType::Scalar& determinant, bool& invertible, const RealScalar& absDeterminantThreshold ) const { ((rows() == cols()) ? static_cast<void> (0) : __assert_fail ("rows() == cols()", "eigen-3.3.7/Eigen/src/LU/InverseImpl.h", 370, __PRETTY_FUNCTION__)); typedef typename internal::conditional< RowsAtCompileTime == 2, typename internal::remove_all<typename internal::nested_eval<Derived, 2>::type>::type, PlainObject >::type MatrixType; internal::compute_inverse_and_det_with_check<MatrixType, ResultType>::run (derived(), absDeterminantThreshold, inverse, determinant, invertible); } # 399 "eigen-3.3.7/Eigen/src/LU/InverseImpl.h" template<typename Derived> template<typename ResultType> inline void MatrixBase<Derived>::computeInverseWithCheck( ResultType& inverse, bool& invertible, const RealScalar& absDeterminantThreshold ) const { Scalar determinant; ((rows() == cols()) ? static_cast<void> (0) : __assert_fail ("rows() == cols()", "eigen-3.3.7/Eigen/src/LU/InverseImpl.h", 409, __PRETTY_FUNCTION__)); computeInverseAndDetWithCheck(inverse,determinant,invertible,absDeterminantThreshold); } } # 40 "eigen-3.3.7/Eigen/LU" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 12 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" #pragma GCC diagnostic pop # 48 "eigen-3.3.7/Eigen/LU" 2 # 17 "eigen-3.3.7/Eigen/Geometry" 2 # 36 "eigen-3.3.7/Eigen/Geometry" # 1 "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h" 1 # 14 "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h" namespace Eigen { # 27 "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h" template<typename Derived> template<typename OtherDerived> inline typename MatrixBase<Derived>::template cross_product_return_type<OtherDerived>::type MatrixBase<Derived>::cross(const MatrixBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime && Derived::SizeAtCompileTime==3)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime==3)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} typename internal::nested_eval<Derived,2>::type lhs(derived()); typename internal::nested_eval<OtherDerived,2>::type rhs(other.derived()); return typename cross_product_return_type<OtherDerived>::type( numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)), numext::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)), numext::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0)) ); } namespace internal { template< int Arch,typename VectorLhs,typename VectorRhs, typename Scalar = typename VectorLhs::Scalar, bool Vectorizable = bool((VectorLhs::Flags&VectorRhs::Flags)&PacketAccessBit)> struct cross3_impl { static inline typename internal::plain_matrix_type<VectorLhs>::type run(const VectorLhs& lhs, const VectorRhs& rhs) { return typename internal::plain_matrix_type<VectorLhs>::type( numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)), numext::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)), numext::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0)), 0 ); } }; } # 79 "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h" template<typename Derived> template<typename OtherDerived> inline typename MatrixBase<Derived>::PlainObject MatrixBase<Derived>::cross3(const MatrixBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime && Derived::SizeAtCompileTime==4)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime==4)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} typedef typename internal::nested_eval<Derived,2>::type DerivedNested; typedef typename internal::nested_eval<OtherDerived,2>::type OtherDerivedNested; DerivedNested lhs(derived()); OtherDerivedNested rhs(other.derived()); return internal::cross3_impl<Architecture::Target, typename internal::remove_all<DerivedNested>::type, typename internal::remove_all<OtherDerivedNested>::type>::run(lhs,rhs); } # 106 "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h" template<typename ExpressionType, int Direction> template<typename OtherDerived> const typename VectorwiseOp<ExpressionType,Direction>::CrossReturnType VectorwiseOp<ExpressionType,Direction>::cross(const MatrixBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime==3)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<Scalar, typename OtherDerived::Scalar>::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {} typename internal::nested_eval<ExpressionType,2>::type mat(_expression()); typename internal::nested_eval<OtherDerived,2>::type vec(other.derived()); CrossReturnType res(_expression().rows(),_expression().cols()); if(Direction==Vertical) { ((CrossReturnType::RowsAtCompileTime==3 && "the matrix must have exactly 3 rows") ? static_cast<void> (0) : __assert_fail ("CrossReturnType::RowsAtCompileTime==3 && \"the matrix must have exactly 3 rows\"", "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h", 122, __PRETTY_FUNCTION__)); res.row(0) = (mat.row(1) * vec.coeff(2) - mat.row(2) * vec.coeff(1)).conjugate(); res.row(1) = (mat.row(2) * vec.coeff(0) - mat.row(0) * vec.coeff(2)).conjugate(); res.row(2) = (mat.row(0) * vec.coeff(1) - mat.row(1) * vec.coeff(0)).conjugate(); } else { ((CrossReturnType::ColsAtCompileTime==3 && "the matrix must have exactly 3 columns") ? static_cast<void> (0) : __assert_fail ("CrossReturnType::ColsAtCompileTime==3 && \"the matrix must have exactly 3 columns\"", "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h", 129, __PRETTY_FUNCTION__)); res.col(0) = (mat.col(1) * vec.coeff(2) - mat.col(2) * vec.coeff(1)).conjugate(); res.col(1) = (mat.col(2) * vec.coeff(0) - mat.col(0) * vec.coeff(2)).conjugate(); res.col(2) = (mat.col(0) * vec.coeff(1) - mat.col(1) * vec.coeff(0)).conjugate(); } return res; } namespace internal { template<typename Derived, int Size = Derived::SizeAtCompileTime> struct unitOrthogonal_selector { typedef typename plain_matrix_type<Derived>::type VectorType; typedef typename traits<Derived>::Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef Matrix<Scalar,2,1> Vector2; static inline VectorType run(const Derived& src) { VectorType perp = VectorType::Zero(src.size()); Index maxi = 0; Index sndi = 0; src.cwiseAbs().maxCoeff(&maxi); if (maxi==0) sndi = 1; RealScalar invnm = RealScalar(1)/(Vector2() << src.coeff(sndi),src.coeff(maxi)).finished().norm(); perp.coeffRef(maxi) = -numext::conj(src.coeff(sndi)) * invnm; perp.coeffRef(sndi) = numext::conj(src.coeff(maxi)) * invnm; return perp; } }; template<typename Derived> struct unitOrthogonal_selector<Derived,3> { typedef typename plain_matrix_type<Derived>::type VectorType; typedef typename traits<Derived>::Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; static inline VectorType run(const Derived& src) { VectorType perp; if((!isMuchSmallerThan(src.x(), src.z())) || (!isMuchSmallerThan(src.y(), src.z()))) { RealScalar invnm = RealScalar(1)/src.template head<2>().norm(); perp.coeffRef(0) = -numext::conj(src.y())*invnm; perp.coeffRef(1) = numext::conj(src.x())*invnm; perp.coeffRef(2) = 0; } else { RealScalar invnm = RealScalar(1)/src.template tail<2>().norm(); perp.coeffRef(0) = 0; perp.coeffRef(1) = -numext::conj(src.z())*invnm; perp.coeffRef(2) = numext::conj(src.y())*invnm; } return perp; } }; template<typename Derived> struct unitOrthogonal_selector<Derived,2> { typedef typename plain_matrix_type<Derived>::type VectorType; static inline VectorType run(const Derived& src) { return VectorType(-numext::conj(src.y()), numext::conj(src.x())).normalized(); } }; } # 224 "eigen-3.3.7/Eigen/src/Geometry/OrthoMethods.h" template<typename Derived> typename MatrixBase<Derived>::PlainObject MatrixBase<Derived>::unitOrthogonal() const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {} return internal::unitOrthogonal_selector<Derived>::run(derived()); } } # 37 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/EulerAngles.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/EulerAngles.h" namespace Eigen { # 35 "eigen-3.3.7/Eigen/src/Geometry/EulerAngles.h" template<typename Derived> inline Matrix<typename MatrixBase<Derived>::Scalar,3,1> MatrixBase<Derived>::eulerAngles(Index a0, Index a1, Index a2) const { using std::atan2; using std::sin; using std::cos; if (Eigen::internal::static_assertion<static_cast<bool>(Derived::RowsAtCompileTime==3 && Derived::ColsAtCompileTime==3)>::THIS_METHOD_IS_ONLY_FOR_MATRICES_OF_A_SPECIFIC_SIZE) {} Matrix<Scalar,3,1> res; typedef Matrix<typename Derived::Scalar,2,1> Vector2; const Index odd = ((a0+1)%3 == a1) ? 0 : 1; const Index i = a0; const Index j = (a0 + 1 + odd)%3; const Index k = (a0 + 2 - odd)%3; if (a0==a2) { res[0] = atan2(coeff(j,i), coeff(k,i)); if((odd && res[0]<Scalar(0)) || ((!odd) && res[0]>Scalar(0))) { if(res[0] > Scalar(0)) { res[0] -= Scalar(3.141592653589793238462643383279502884197169399375105820974944592307816406L); } else { res[0] += Scalar(3.141592653589793238462643383279502884197169399375105820974944592307816406L); } Scalar s2 = Vector2(coeff(j,i), coeff(k,i)).norm(); res[1] = -atan2(s2, coeff(i,i)); } else { Scalar s2 = Vector2(coeff(j,i), coeff(k,i)).norm(); res[1] = atan2(s2, coeff(i,i)); } # 83 "eigen-3.3.7/Eigen/src/Geometry/EulerAngles.h" Scalar s1 = sin(res[0]); Scalar c1 = cos(res[0]); res[2] = atan2(c1*coeff(j,k)-s1*coeff(k,k), c1*coeff(j,j) - s1 * coeff(k,j)); } else { res[0] = atan2(coeff(j,k), coeff(k,k)); Scalar c2 = Vector2(coeff(i,i), coeff(i,j)).norm(); if((odd && res[0]<Scalar(0)) || ((!odd) && res[0]>Scalar(0))) { if(res[0] > Scalar(0)) { res[0] -= Scalar(3.141592653589793238462643383279502884197169399375105820974944592307816406L); } else { res[0] += Scalar(3.141592653589793238462643383279502884197169399375105820974944592307816406L); } res[1] = atan2(-coeff(i,k), -c2); } else res[1] = atan2(-coeff(i,k), c2); Scalar s1 = sin(res[0]); Scalar c1 = cos(res[0]); res[2] = atan2(s1*coeff(k,i)-c1*coeff(j,i), c1*coeff(j,j) - s1 * coeff(k,j)); } if (!odd) res = -res; return res; } } # 38 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h" namespace Eigen { # 30 "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h" namespace internal { template<typename MatrixType,int Direction> struct traits<Homogeneous<MatrixType,Direction> > : traits<MatrixType> { typedef typename traits<MatrixType>::StorageKind StorageKind; typedef typename ref_selector<MatrixType>::type MatrixTypeNested; typedef typename remove_reference<MatrixTypeNested>::type _MatrixTypeNested; enum { RowsPlusOne = (MatrixType::RowsAtCompileTime != Dynamic) ? int(MatrixType::RowsAtCompileTime) + 1 : Dynamic, ColsPlusOne = (MatrixType::ColsAtCompileTime != Dynamic) ? int(MatrixType::ColsAtCompileTime) + 1 : Dynamic, RowsAtCompileTime = Direction==Vertical ? RowsPlusOne : MatrixType::RowsAtCompileTime, ColsAtCompileTime = Direction==Horizontal ? ColsPlusOne : MatrixType::ColsAtCompileTime, MaxRowsAtCompileTime = RowsAtCompileTime, MaxColsAtCompileTime = ColsAtCompileTime, TmpFlags = _MatrixTypeNested::Flags & HereditaryBits, Flags = ColsAtCompileTime==1 ? (TmpFlags & ~RowMajorBit) : RowsAtCompileTime==1 ? (TmpFlags | RowMajorBit) : TmpFlags }; }; template<typename MatrixType,typename Lhs> struct homogeneous_left_product_impl; template<typename MatrixType,typename Rhs> struct homogeneous_right_product_impl; } template<typename MatrixType,int _Direction> class Homogeneous : public MatrixBase<Homogeneous<MatrixType,_Direction> >, internal::no_assignment_operator { public: typedef MatrixType NestedExpression; enum { Direction = _Direction }; typedef MatrixBase<Homogeneous> Base; typedef typename Eigen::internal::traits<Homogeneous>::Scalar Scalar; typedef typename Eigen::NumTraits<Scalar>::Real RealScalar; typedef typename Base::CoeffReturnType CoeffReturnType; typedef typename Eigen::internal::ref_selector<Homogeneous>::type Nested; typedef typename Eigen::internal::traits<Homogeneous>::StorageKind StorageKind; typedef typename Eigen::internal::traits<Homogeneous>::StorageIndex StorageIndex; enum { RowsAtCompileTime = Eigen::internal::traits<Homogeneous>::RowsAtCompileTime, ColsAtCompileTime = Eigen::internal::traits<Homogeneous>::ColsAtCompileTime, Flags = Eigen::internal::traits<Homogeneous>::Flags, SizeAtCompileTime = Base::SizeAtCompileTime, MaxSizeAtCompileTime = Base::MaxSizeAtCompileTime, IsVectorAtCompileTime = Base::IsVectorAtCompileTime }; using Base::derived; using Base::const_cast_derived; typedef typename Base::PacketScalar PacketScalar; explicit inline Homogeneous(const MatrixType& matrix) : m_matrix(matrix) {} inline Index rows() const { return m_matrix.rows() + (int(Direction)==Vertical ? 1 : 0); } inline Index cols() const { return m_matrix.cols() + (int(Direction)==Horizontal ? 1 : 0); } const NestedExpression& nestedExpression() const { return m_matrix; } template<typename Rhs> inline const Product<Homogeneous,Rhs> operator* (const MatrixBase<Rhs>& rhs) const { ((int(Direction)==Horizontal) ? static_cast<void> (0) : __assert_fail ("int(Direction)==Horizontal", "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h", 84, __PRETTY_FUNCTION__)); return Product<Homogeneous,Rhs>(*this,rhs.derived()); } template<typename Lhs> friend inline const Product<Lhs,Homogeneous> operator* (const MatrixBase<Lhs>& lhs, const Homogeneous& rhs) { ((int(Direction)==Vertical) ? static_cast<void> (0) : __assert_fail ("int(Direction)==Vertical", "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h", 92, __PRETTY_FUNCTION__)); return Product<Lhs,Homogeneous>(lhs.derived(),rhs); } template<typename Scalar, int Dim, int Mode, int Options> friend inline const Product<Transform<Scalar,Dim,Mode,Options>, Homogeneous > operator* (const Transform<Scalar,Dim,Mode,Options>& lhs, const Homogeneous& rhs) { ((int(Direction)==Vertical) ? static_cast<void> (0) : __assert_fail ("int(Direction)==Vertical", "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h", 100, __PRETTY_FUNCTION__)); return Product<Transform<Scalar,Dim,Mode,Options>, Homogeneous>(lhs,rhs); } template<typename Func> inline typename internal::result_of<Func(Scalar,Scalar)>::type redux(const Func& func) const { return func(m_matrix.redux(func), Scalar(1)); } protected: typename MatrixType::Nested m_matrix; }; # 128 "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h" template<typename Derived> inline typename MatrixBase<Derived>::HomogeneousReturnType MatrixBase<Derived>::homogeneous() const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {}; return HomogeneousReturnType(derived()); } # 146 "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h" template<typename ExpressionType, int Direction> inline Homogeneous<ExpressionType,Direction> VectorwiseOp<ExpressionType,Direction>::homogeneous() const { return HomogeneousReturnType(_expression()); } # 170 "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h" template<typename Derived> inline const typename MatrixBase<Derived>::HNormalizedReturnType MatrixBase<Derived>::hnormalized() const { if (Eigen::internal::static_assertion<static_cast<bool>(Derived::IsVectorAtCompileTime)>::YOU_TRIED_CALLING_A_VECTOR_METHOD_ON_A_MATRIX) {}; return ConstStartMinusOne(derived(),0,0, ColsAtCompileTime==1?size()-1:1, ColsAtCompileTime==1?1:size()-1) / coeff(size()-1); } # 194 "eigen-3.3.7/Eigen/src/Geometry/Homogeneous.h" template<typename ExpressionType, int Direction> inline const typename VectorwiseOp<ExpressionType,Direction>::HNormalizedReturnType VectorwiseOp<ExpressionType,Direction>::hnormalized() const { return HNormalized_Block(_expression(),0,0, Direction==Vertical ? _expression().rows()-1 : _expression().rows(), Direction==Horizontal ? _expression().cols()-1 : _expression().cols()).cwiseQuotient( Replicate<HNormalized_Factors, Direction==Vertical ? HNormalized_SizeMinusOne : 1, Direction==Horizontal ? HNormalized_SizeMinusOne : 1> (HNormalized_Factors(_expression(), Direction==Vertical ? _expression().rows()-1:0, Direction==Horizontal ? _expression().cols()-1:0, Direction==Vertical ? 1 : _expression().rows(), Direction==Horizontal ? 1 : _expression().cols()), Direction==Vertical ? _expression().rows()-1 : 1, Direction==Horizontal ? _expression().cols()-1 : 1)); } namespace internal { template<typename MatrixOrTransformType> struct take_matrix_for_product { typedef MatrixOrTransformType type; static const type& run(const type &x) { return x; } }; template<typename Scalar, int Dim, int Mode,int Options> struct take_matrix_for_product<Transform<Scalar, Dim, Mode, Options> > { typedef Transform<Scalar, Dim, Mode, Options> TransformType; typedef typename internal::add_const<typename TransformType::ConstAffinePart>::type type; static type run (const TransformType& x) { return x.affine(); } }; template<typename Scalar, int Dim, int Options> struct take_matrix_for_product<Transform<Scalar, Dim, Projective, Options> > { typedef Transform<Scalar, Dim, Projective, Options> TransformType; typedef typename TransformType::MatrixType type; static const type& run (const TransformType& x) { return x.matrix(); } }; template<typename MatrixType,typename Lhs> struct traits<homogeneous_left_product_impl<Homogeneous<MatrixType,Vertical>,Lhs> > { typedef typename take_matrix_for_product<Lhs>::type LhsMatrixType; typedef typename remove_all<MatrixType>::type MatrixTypeCleaned; typedef typename remove_all<LhsMatrixType>::type LhsMatrixTypeCleaned; typedef typename make_proper_matrix_type< typename traits<MatrixTypeCleaned>::Scalar, LhsMatrixTypeCleaned::RowsAtCompileTime, MatrixTypeCleaned::ColsAtCompileTime, MatrixTypeCleaned::PlainObject::Options, LhsMatrixTypeCleaned::MaxRowsAtCompileTime, MatrixTypeCleaned::MaxColsAtCompileTime>::type ReturnType; }; template<typename MatrixType,typename Lhs> struct homogeneous_left_product_impl<Homogeneous<MatrixType,Vertical>,Lhs> : public ReturnByValue<homogeneous_left_product_impl<Homogeneous<MatrixType,Vertical>,Lhs> > { typedef typename traits<homogeneous_left_product_impl>::LhsMatrixType LhsMatrixType; typedef typename remove_all<LhsMatrixType>::type LhsMatrixTypeCleaned; typedef typename remove_all<typename LhsMatrixTypeCleaned::Nested>::type LhsMatrixTypeNested; homogeneous_left_product_impl(const Lhs& lhs, const MatrixType& rhs) : m_lhs(take_matrix_for_product<Lhs>::run(lhs)), m_rhs(rhs) {} inline Index rows() const { return m_lhs.rows(); } inline Index cols() const { return m_rhs.cols(); } template<typename Dest> void evalTo(Dest& dst) const { dst = Block<const LhsMatrixTypeNested, LhsMatrixTypeNested::RowsAtCompileTime, LhsMatrixTypeNested::ColsAtCompileTime==Dynamic?Dynamic:LhsMatrixTypeNested::ColsAtCompileTime-1> (m_lhs,0,0,m_lhs.rows(),m_lhs.cols()-1) * m_rhs; dst += m_lhs.col(m_lhs.cols()-1).rowwise() .template replicate<MatrixType::ColsAtCompileTime>(m_rhs.cols()); } typename LhsMatrixTypeCleaned::Nested m_lhs; typename MatrixType::Nested m_rhs; }; template<typename MatrixType,typename Rhs> struct traits<homogeneous_right_product_impl<Homogeneous<MatrixType,Horizontal>,Rhs> > { typedef typename make_proper_matrix_type<typename traits<MatrixType>::Scalar, MatrixType::RowsAtCompileTime, Rhs::ColsAtCompileTime, MatrixType::PlainObject::Options, MatrixType::MaxRowsAtCompileTime, Rhs::MaxColsAtCompileTime>::type ReturnType; }; template<typename MatrixType,typename Rhs> struct homogeneous_right_product_impl<Homogeneous<MatrixType,Horizontal>,Rhs> : public ReturnByValue<homogeneous_right_product_impl<Homogeneous<MatrixType,Horizontal>,Rhs> > { typedef typename remove_all<typename Rhs::Nested>::type RhsNested; homogeneous_right_product_impl(const MatrixType& lhs, const Rhs& rhs) : m_lhs(lhs), m_rhs(rhs) {} inline Index rows() const { return m_lhs.rows(); } inline Index cols() const { return m_rhs.cols(); } template<typename Dest> void evalTo(Dest& dst) const { dst = m_lhs * Block<const RhsNested, RhsNested::RowsAtCompileTime==Dynamic?Dynamic:RhsNested::RowsAtCompileTime-1, RhsNested::ColsAtCompileTime> (m_rhs,0,0,m_rhs.rows()-1,m_rhs.cols()); dst += m_rhs.row(m_rhs.rows()-1).colwise() .template replicate<MatrixType::RowsAtCompileTime>(m_lhs.rows()); } typename MatrixType::Nested m_lhs; typename Rhs::Nested m_rhs; }; template<typename ArgType,int Direction> struct evaluator_traits<Homogeneous<ArgType,Direction> > { typedef typename storage_kind_to_evaluator_kind<typename ArgType::StorageKind>::Kind Kind; typedef HomogeneousShape Shape; }; template<> struct AssignmentKind<DenseShape,HomogeneousShape> { typedef Dense2Dense Kind; }; template<typename ArgType,int Direction> struct unary_evaluator<Homogeneous<ArgType,Direction>, IndexBased> : evaluator<typename Homogeneous<ArgType,Direction>::PlainObject > { typedef Homogeneous<ArgType,Direction> XprType; typedef typename XprType::PlainObject PlainObject; typedef evaluator<PlainObject> Base; explicit unary_evaluator(const XprType& op) : Base(), m_temp(op) { ::new (static_cast<Base*>(this)) Base(m_temp); } protected: PlainObject m_temp; }; template< typename DstXprType, typename ArgType, typename Scalar> struct Assignment<DstXprType, Homogeneous<ArgType,Vertical>, internal::assign_op<Scalar,typename ArgType::Scalar>, Dense2Dense> { typedef Homogeneous<ArgType,Vertical> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<Scalar,typename ArgType::Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); dst.template topRows<ArgType::RowsAtCompileTime>(src.nestedExpression().rows()) = src.nestedExpression(); dst.row(dst.rows()-1).setOnes(); } }; template< typename DstXprType, typename ArgType, typename Scalar> struct Assignment<DstXprType, Homogeneous<ArgType,Horizontal>, internal::assign_op<Scalar,typename ArgType::Scalar>, Dense2Dense> { typedef Homogeneous<ArgType,Horizontal> SrcXprType; static void run(DstXprType &dst, const SrcXprType &src, const internal::assign_op<Scalar,typename ArgType::Scalar> &) { Index dstRows = src.rows(); Index dstCols = src.cols(); if((dst.rows()!=dstRows) || (dst.cols()!=dstCols)) dst.resize(dstRows, dstCols); dst.template leftCols<ArgType::ColsAtCompileTime>(src.nestedExpression().cols()) = src.nestedExpression(); dst.col(dst.cols()-1).setOnes(); } }; template<typename LhsArg, typename Rhs, int ProductTag> struct generic_product_impl<Homogeneous<LhsArg,Horizontal>, Rhs, HomogeneousShape, DenseShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Homogeneous<LhsArg,Horizontal>& lhs, const Rhs& rhs) { homogeneous_right_product_impl<Homogeneous<LhsArg,Horizontal>, Rhs>(lhs.nestedExpression(), rhs).evalTo(dst); } }; template<typename Lhs,typename Rhs> struct homogeneous_right_product_refactoring_helper { enum { Dim = Lhs::ColsAtCompileTime, Rows = Lhs::RowsAtCompileTime }; typedef typename Rhs::template ConstNRowsBlockXpr<Dim>::Type LinearBlockConst; typedef typename remove_const<LinearBlockConst>::type LinearBlock; typedef typename Rhs::ConstRowXpr ConstantColumn; typedef Replicate<const ConstantColumn,Rows,1> ConstantBlock; typedef Product<Lhs,LinearBlock,LazyProduct> LinearProduct; typedef CwiseBinaryOp<internal::scalar_sum_op<typename Lhs::Scalar,typename Rhs::Scalar>, const LinearProduct, const ConstantBlock> Xpr; }; template<typename Lhs, typename Rhs, int ProductTag> struct product_evaluator<Product<Lhs, Rhs, LazyProduct>, ProductTag, HomogeneousShape, DenseShape> : public evaluator<typename homogeneous_right_product_refactoring_helper<typename Lhs::NestedExpression,Rhs>::Xpr> { typedef Product<Lhs, Rhs, LazyProduct> XprType; typedef homogeneous_right_product_refactoring_helper<typename Lhs::NestedExpression,Rhs> helper; typedef typename helper::ConstantBlock ConstantBlock; typedef typename helper::Xpr RefactoredXpr; typedef evaluator<RefactoredXpr> Base; explicit product_evaluator(const XprType& xpr) : Base( xpr.lhs().nestedExpression() .lazyProduct( xpr.rhs().template topRows<helper::Dim>(xpr.lhs().nestedExpression().cols()) ) + ConstantBlock(xpr.rhs().row(xpr.rhs().rows()-1),xpr.lhs().rows(), 1) ) {} }; template<typename Lhs, typename RhsArg, int ProductTag> struct generic_product_impl<Lhs, Homogeneous<RhsArg,Vertical>, DenseShape, HomogeneousShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Homogeneous<RhsArg,Vertical>& rhs) { homogeneous_left_product_impl<Homogeneous<RhsArg,Vertical>, Lhs>(lhs, rhs.nestedExpression()).evalTo(dst); } }; template<typename Lhs, typename RhsArg, int ProductTag> struct generic_product_impl<Lhs, Homogeneous<RhsArg,Vertical>, TriangularShape, HomogeneousShape, ProductTag> { template<typename Dest> static void evalTo(Dest& dst, const Lhs& lhs, const Homogeneous<RhsArg,Vertical>& rhs) { dst.noalias() = lhs * rhs.eval(); } }; template<typename Lhs,typename Rhs> struct homogeneous_left_product_refactoring_helper { enum { Dim = Rhs::RowsAtCompileTime, Cols = Rhs::ColsAtCompileTime }; typedef typename Lhs::template ConstNColsBlockXpr<Dim>::Type LinearBlockConst; typedef typename remove_const<LinearBlockConst>::type LinearBlock; typedef typename Lhs::ConstColXpr ConstantColumn; typedef Replicate<const ConstantColumn,1,Cols> ConstantBlock; typedef Product<LinearBlock,Rhs,LazyProduct> LinearProduct; typedef CwiseBinaryOp<internal::scalar_sum_op<typename Lhs::Scalar,typename Rhs::Scalar>, const LinearProduct, const ConstantBlock> Xpr; }; template<typename Lhs, typename Rhs, int ProductTag> struct product_evaluator<Product<Lhs, Rhs, LazyProduct>, ProductTag, DenseShape, HomogeneousShape> : public evaluator<typename homogeneous_left_product_refactoring_helper<Lhs,typename Rhs::NestedExpression>::Xpr> { typedef Product<Lhs, Rhs, LazyProduct> XprType; typedef homogeneous_left_product_refactoring_helper<Lhs,typename Rhs::NestedExpression> helper; typedef typename helper::ConstantBlock ConstantBlock; typedef typename helper::Xpr RefactoredXpr; typedef evaluator<RefactoredXpr> Base; explicit product_evaluator(const XprType& xpr) : Base( xpr.lhs().template leftCols<helper::Dim>(xpr.rhs().nestedExpression().rows()) .lazyProduct( xpr.rhs().nestedExpression() ) + ConstantBlock(xpr.lhs().col(xpr.lhs().cols()-1),1,xpr.rhs().cols()) ) {} }; template<typename Scalar, int Dim, int Mode,int Options, typename RhsArg, int ProductTag> struct generic_product_impl<Transform<Scalar,Dim,Mode,Options>, Homogeneous<RhsArg,Vertical>, DenseShape, HomogeneousShape, ProductTag> { typedef Transform<Scalar,Dim,Mode,Options> TransformType; template<typename Dest> static void evalTo(Dest& dst, const TransformType& lhs, const Homogeneous<RhsArg,Vertical>& rhs) { homogeneous_left_product_impl<Homogeneous<RhsArg,Vertical>, TransformType>(lhs, rhs.nestedExpression()).evalTo(dst); } }; template<typename ExpressionType, int Side, bool Transposed> struct permutation_matrix_product<ExpressionType, Side, Transposed, HomogeneousShape> : public permutation_matrix_product<ExpressionType, Side, Transposed, DenseShape> {}; } } # 40 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/RotationBase.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/RotationBase.h" namespace Eigen { namespace internal { template<typename RotationDerived, typename MatrixType, bool IsVector=MatrixType::IsVectorAtCompileTime> struct rotation_base_generic_product_selector; } # 28 "eigen-3.3.7/Eigen/src/Geometry/RotationBase.h" template<typename Derived, int _Dim> class RotationBase { public: enum { Dim = _Dim }; typedef typename internal::traits<Derived>::Scalar Scalar; typedef Matrix<Scalar,Dim,Dim> RotationMatrixType; typedef Matrix<Scalar,Dim,1> VectorType; public: inline const Derived& derived() const { return *static_cast<const Derived*>(this); } inline Derived& derived() { return *static_cast<Derived*>(this); } inline RotationMatrixType toRotationMatrix() const { return derived().toRotationMatrix(); } inline RotationMatrixType matrix() const { return derived().toRotationMatrix(); } inline Derived inverse() const { return derived().inverse(); } inline Transform<Scalar,Dim,Isometry> operator*(const Translation<Scalar,Dim>& t) const { return Transform<Scalar,Dim,Isometry>(*this) * t; } inline RotationMatrixType operator*(const UniformScaling<Scalar>& s) const { return toRotationMatrix() * s.factor(); } template<typename OtherDerived> inline typename internal::rotation_base_generic_product_selector<Derived,OtherDerived,OtherDerived::IsVectorAtCompileTime>::ReturnType operator*(const EigenBase<OtherDerived>& e) const { return internal::rotation_base_generic_product_selector<Derived,OtherDerived>::run(derived(), e.derived()); } template<typename OtherDerived> friend inline RotationMatrixType operator*(const EigenBase<OtherDerived>& l, const Derived& r) { return l.derived() * r.toRotationMatrix(); } friend inline Transform<Scalar,Dim,Affine> operator*(const DiagonalMatrix<Scalar,Dim>& l, const Derived& r) { Transform<Scalar,Dim,Affine> res(r); res.linear().applyOnTheLeft(l); return res; } template<int Mode, int Options> inline Transform<Scalar,Dim,Mode> operator*(const Transform<Scalar,Dim,Mode,Options>& t) const { return toRotationMatrix() * t; } template<typename OtherVectorType> inline VectorType _transformVector(const OtherVectorType& v) const { return toRotationMatrix() * v; } }; namespace internal { template<typename RotationDerived, typename MatrixType> struct rotation_base_generic_product_selector<RotationDerived,MatrixType,false> { enum { Dim = RotationDerived::Dim }; typedef Matrix<typename RotationDerived::Scalar,Dim,Dim> ReturnType; static inline ReturnType run(const RotationDerived& r, const MatrixType& m) { return r.toRotationMatrix() * m; } }; template<typename RotationDerived, typename Scalar, int Dim, int MaxDim> struct rotation_base_generic_product_selector< RotationDerived, DiagonalMatrix<Scalar,Dim,MaxDim>, false > { typedef Transform<Scalar,Dim,Affine> ReturnType; static inline ReturnType run(const RotationDerived& r, const DiagonalMatrix<Scalar,Dim,MaxDim>& m) { ReturnType res(r); res.linear() *= m; return res; } }; template<typename RotationDerived,typename OtherVectorType> struct rotation_base_generic_product_selector<RotationDerived,OtherVectorType,true> { enum { Dim = RotationDerived::Dim }; typedef Matrix<typename RotationDerived::Scalar,Dim,1> ReturnType; static inline ReturnType run(const RotationDerived& r, const OtherVectorType& v) { return r._transformVector(v); } }; } template<typename _Scalar, int _Rows, int _Cols, int _Storage, int _MaxRows, int _MaxCols> template<typename OtherDerived> Matrix<_Scalar, _Rows, _Cols, _Storage, _MaxRows, _MaxCols> ::Matrix(const RotationBase<OtherDerived,ColsAtCompileTime>& r) { if (Eigen::internal::static_assertion<static_cast<bool>(Matrix::RowsAtCompileTime==int(OtherDerived::Dim) && Matrix::ColsAtCompileTime==int(OtherDerived::Dim))>::THIS_METHOD_IS_ONLY_FOR_MATRICES_OF_A_SPECIFIC_SIZE) {} *this = r.toRotationMatrix(); } template<typename _Scalar, int _Rows, int _Cols, int _Storage, int _MaxRows, int _MaxCols> template<typename OtherDerived> Matrix<_Scalar, _Rows, _Cols, _Storage, _MaxRows, _MaxCols>& Matrix<_Scalar, _Rows, _Cols, _Storage, _MaxRows, _MaxCols> ::operator=(const RotationBase<OtherDerived,ColsAtCompileTime>& r) { if (Eigen::internal::static_assertion<static_cast<bool>(Matrix::RowsAtCompileTime==int(OtherDerived::Dim) && Matrix::ColsAtCompileTime==int(OtherDerived::Dim))>::THIS_METHOD_IS_ONLY_FOR_MATRICES_OF_A_SPECIFIC_SIZE) {} return *this = r.toRotationMatrix(); } namespace internal { # 181 "eigen-3.3.7/Eigen/src/Geometry/RotationBase.h" template<typename Scalar, int Dim> static inline Matrix<Scalar,2,2> toRotationMatrix(const Scalar& s) { if (Eigen::internal::static_assertion<static_cast<bool>(Dim==2)>::YOU_MADE_A_PROGRAMMING_MISTAKE) {} return Rotation2D<Scalar>(s).toRotationMatrix(); } template<typename Scalar, int Dim, typename OtherDerived> static inline Matrix<Scalar,Dim,Dim> toRotationMatrix(const RotationBase<OtherDerived,Dim>& r) { return r.toRotationMatrix(); } template<typename Scalar, int Dim, typename OtherDerived> static inline const MatrixBase<OtherDerived>& toRotationMatrix(const MatrixBase<OtherDerived>& mat) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::RowsAtCompileTime==Dim && OtherDerived::ColsAtCompileTime==Dim)>::YOU_MADE_A_PROGRAMMING_MISTAKE) {} return mat; } } } # 41 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Rotation2D.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/Rotation2D.h" namespace Eigen { # 32 "eigen-3.3.7/Eigen/src/Geometry/Rotation2D.h" namespace internal { template<typename _Scalar> struct traits<Rotation2D<_Scalar> > { typedef _Scalar Scalar; }; } template<typename _Scalar> class Rotation2D : public RotationBase<Rotation2D<_Scalar>,2> { typedef RotationBase<Rotation2D<_Scalar>,2> Base; public: using Base::operator*; enum { Dim = 2 }; typedef _Scalar Scalar; typedef Matrix<Scalar,2,1> Vector2; typedef Matrix<Scalar,2,2> Matrix2; protected: Scalar m_angle; public: explicit inline Rotation2D(const Scalar& a) : m_angle(a) {} Rotation2D() {} template<typename Derived> explicit Rotation2D(const MatrixBase<Derived>& m) { fromRotationMatrix(m.derived()); } inline Scalar angle() const { return m_angle; } inline Scalar& angle() { return m_angle; } inline Scalar smallestPositiveAngle() const { Scalar tmp = numext::fmod(m_angle,Scalar(2*3.141592653589793238462643383279502884197169399375105820974944592307816406L)); return tmp<Scalar(0) ? tmp + Scalar(2*3.141592653589793238462643383279502884197169399375105820974944592307816406L) : tmp; } inline Scalar smallestAngle() const { Scalar tmp = numext::fmod(m_angle,Scalar(2*3.141592653589793238462643383279502884197169399375105820974944592307816406L)); if(tmp>Scalar(3.141592653589793238462643383279502884197169399375105820974944592307816406L)) tmp -= Scalar(2*3.141592653589793238462643383279502884197169399375105820974944592307816406L); else if(tmp<-Scalar(3.141592653589793238462643383279502884197169399375105820974944592307816406L)) tmp += Scalar(2*3.141592653589793238462643383279502884197169399375105820974944592307816406L); return tmp; } inline Rotation2D inverse() const { return Rotation2D(-m_angle); } inline Rotation2D operator*(const Rotation2D& other) const { return Rotation2D(m_angle + other.m_angle); } inline Rotation2D& operator*=(const Rotation2D& other) { m_angle += other.m_angle; return *this; } Vector2 operator* (const Vector2& vec) const { return toRotationMatrix() * vec; } template<typename Derived> Rotation2D& fromRotationMatrix(const MatrixBase<Derived>& m); Matrix2 toRotationMatrix() const; # 123 "eigen-3.3.7/Eigen/src/Geometry/Rotation2D.h" template<typename Derived> Rotation2D& operator=(const MatrixBase<Derived>& m) { return fromRotationMatrix(m.derived()); } inline Rotation2D slerp(const Scalar& t, const Rotation2D& other) const { Scalar dist = Rotation2D(other.m_angle-m_angle).smallestAngle(); return Rotation2D(m_angle + dist*t); } template<typename NewScalarType> inline typename internal::cast_return_type<Rotation2D,Rotation2D<NewScalarType> >::type cast() const { return typename internal::cast_return_type<Rotation2D,Rotation2D<NewScalarType> >::type(*this); } template<typename OtherScalarType> inline explicit Rotation2D(const Rotation2D<OtherScalarType>& other) { m_angle = Scalar(other.angle()); } static inline Rotation2D Identity() { return Rotation2D(0); } bool isApprox(const Rotation2D& other, const typename NumTraits<Scalar>::Real& prec = NumTraits<Scalar>::dummy_precision()) const { return internal::isApprox(m_angle,other.m_angle, prec); } }; typedef Rotation2D<float> Rotation2Df; typedef Rotation2D<double> Rotation2Dd; template<typename Scalar> template<typename Derived> Rotation2D<Scalar>& Rotation2D<Scalar>::fromRotationMatrix(const MatrixBase<Derived>& mat) { using std::atan2; if (Eigen::internal::static_assertion<static_cast<bool>(Derived::RowsAtCompileTime==2 && Derived::ColsAtCompileTime==2)>::YOU_MADE_A_PROGRAMMING_MISTAKE) {} m_angle = atan2(mat.coeff(1,0), mat.coeff(0,0)); return *this; } template<typename Scalar> typename Rotation2D<Scalar>::Matrix2 Rotation2D<Scalar>::toRotationMatrix(void) const { using std::sin; using std::cos; Scalar sinA = sin(m_angle); Scalar cosA = cos(m_angle); return (Matrix2() << cosA, -sinA, sinA, cosA).finished(); } } # 42 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" namespace Eigen { namespace internal { template<typename Other, int OtherRows=Other::RowsAtCompileTime, int OtherCols=Other::ColsAtCompileTime> struct quaternionbase_assign_impl; } template<class Derived> class QuaternionBase : public RotationBase<Derived, 3> { public: typedef RotationBase<Derived, 3> Base; using Base::operator*; using Base::derived; typedef typename internal::traits<Derived>::Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef typename internal::traits<Derived>::Coefficients Coefficients; typedef typename Coefficients::CoeffReturnType CoeffReturnType; typedef typename internal::conditional<bool(internal::traits<Derived>::Flags&LvalueBit), Scalar&, CoeffReturnType>::type NonConstCoeffReturnType; enum { Flags = Eigen::internal::traits<Derived>::Flags }; typedef Matrix<Scalar,3,1> Vector3; typedef Matrix<Scalar,3,3> Matrix3; typedef AngleAxis<Scalar> AngleAxisType; inline CoeffReturnType x() const { return this->derived().coeffs().coeff(0); } inline CoeffReturnType y() const { return this->derived().coeffs().coeff(1); } inline CoeffReturnType z() const { return this->derived().coeffs().coeff(2); } inline CoeffReturnType w() const { return this->derived().coeffs().coeff(3); } inline NonConstCoeffReturnType x() { return this->derived().coeffs().x(); } inline NonConstCoeffReturnType y() { return this->derived().coeffs().y(); } inline NonConstCoeffReturnType z() { return this->derived().coeffs().z(); } inline NonConstCoeffReturnType w() { return this->derived().coeffs().w(); } inline const VectorBlock<const Coefficients,3> vec() const { return coeffs().template head<3>(); } inline VectorBlock<Coefficients,3> vec() { return coeffs().template head<3>(); } inline const typename internal::traits<Derived>::Coefficients& coeffs() const { return derived().coeffs(); } inline typename internal::traits<Derived>::Coefficients& coeffs() { return derived().coeffs(); } inline QuaternionBase<Derived>& operator=(const QuaternionBase<Derived>& other); template<class OtherDerived> inline Derived& operator=(const QuaternionBase<OtherDerived>& other); # 105 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" Derived& operator=(const AngleAxisType& aa); template<class OtherDerived> Derived& operator=(const MatrixBase<OtherDerived>& m); static inline Quaternion<Scalar> Identity() { return Quaternion<Scalar>(Scalar(1), Scalar(0), Scalar(0), Scalar(0)); } inline QuaternionBase& setIdentity() { coeffs() << Scalar(0), Scalar(0), Scalar(0), Scalar(1); return *this; } inline Scalar squaredNorm() const { return coeffs().squaredNorm(); } inline Scalar norm() const { return coeffs().norm(); } inline void normalize() { coeffs().normalize(); } inline Quaternion<Scalar> normalized() const { return Quaternion<Scalar>(coeffs().normalized()); } template<class OtherDerived> inline Scalar dot(const QuaternionBase<OtherDerived>& other) const { return coeffs().dot(other.coeffs()); } template<class OtherDerived> Scalar angularDistance(const QuaternionBase<OtherDerived>& other) const; Matrix3 toRotationMatrix() const; template<typename Derived1, typename Derived2> Derived& setFromTwoVectors(const MatrixBase<Derived1>& a, const MatrixBase<Derived2>& b); template<class OtherDerived> inline Quaternion<Scalar> operator* (const QuaternionBase<OtherDerived>& q) const; template<class OtherDerived> inline Derived& operator*= (const QuaternionBase<OtherDerived>& q); Quaternion<Scalar> inverse() const; Quaternion<Scalar> conjugate() const; template<class OtherDerived> Quaternion<Scalar> slerp(const Scalar& t, const QuaternionBase<OtherDerived>& other) const; template<class OtherDerived> bool isApprox(const QuaternionBase<OtherDerived>& other, const RealScalar& prec = NumTraits<Scalar>::dummy_precision()) const { return coeffs().isApprox(other.coeffs(), prec); } inline Vector3 _transformVector(const Vector3& v) const; template<typename NewScalarType> inline typename internal::cast_return_type<Derived,Quaternion<NewScalarType> >::type cast() const { return typename internal::cast_return_type<Derived,Quaternion<NewScalarType> >::type(derived()); } }; # 217 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" namespace internal { template<typename _Scalar,int _Options> struct traits<Quaternion<_Scalar,_Options> > { typedef Quaternion<_Scalar,_Options> PlainObject; typedef _Scalar Scalar; typedef Matrix<_Scalar,4,1,_Options> Coefficients; enum{ Alignment = internal::traits<Coefficients>::Alignment, Flags = LvalueBit }; }; } template<typename _Scalar, int _Options> class Quaternion : public QuaternionBase<Quaternion<_Scalar,_Options> > { public: typedef QuaternionBase<Quaternion<_Scalar,_Options> > Base; enum { NeedsAlignment = internal::traits<Quaternion>::Alignment>0 }; typedef _Scalar Scalar; using Base::operator =; inline Quaternion& operator=(const Quaternion& other) { Base::operator=(other); return *this; } using Base::operator*=; typedef typename internal::traits<Quaternion>::Coefficients Coefficients; typedef typename Base::AngleAxisType AngleAxisType; inline Quaternion() {} # 256 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" inline Quaternion(const Scalar& w, const Scalar& x, const Scalar& y, const Scalar& z) : m_coeffs(x, y, z, w){} explicit inline Quaternion(const Scalar* data) : m_coeffs(data) {} template<class Derived> inline Quaternion(const QuaternionBase<Derived>& other) { this->Base::operator=(other); } explicit inline Quaternion(const AngleAxisType& aa) { *this = aa; } template<typename Derived> explicit inline Quaternion(const MatrixBase<Derived>& other) { *this = other; } template<typename OtherScalar, int OtherOptions> explicit inline Quaternion(const Quaternion<OtherScalar, OtherOptions>& other) { m_coeffs = other.coeffs().template cast<Scalar>(); } static Quaternion UnitRandom(); template<typename Derived1, typename Derived2> static Quaternion FromTwoVectors(const MatrixBase<Derived1>& a, const MatrixBase<Derived2>& b); inline Coefficients& coeffs() { return m_coeffs;} inline const Coefficients& coeffs() const { return m_coeffs;} void *operator new(std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(NeedsAlignment)>(size); } void *operator new[](std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(NeedsAlignment)>(size); } void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(NeedsAlignment)>(ptr); } void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(NeedsAlignment)>(ptr); } void operator delete(void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(NeedsAlignment)>(ptr); } void operator delete[](void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(NeedsAlignment)>(ptr); } static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } void operator delete[](void * memory, void *ptr) throw() { return ::operator delete[](memory,ptr); } void* operator new(std::size_t size, const std::nothrow_t&) throw() { try { return Eigen::internal::conditional_aligned_malloc<bool(NeedsAlignment)>(size); } catch (...) { return 0; } } void operator delete(void *ptr, const std::nothrow_t&) throw() { Eigen::internal::conditional_aligned_free<bool(NeedsAlignment)>(ptr); } typedef void eigen_aligned_operator_new_marker_type; protected: Coefficients m_coeffs; static inline void _check_template_params() { if (Eigen::internal::static_assertion<static_cast<bool>((_Options & DontAlign) == _Options)>::INVALID_MATRIX_TEMPLATE_PARAMETERS) {} } }; typedef Quaternion<float> Quaternionf; typedef Quaternion<double> Quaterniond; namespace internal { template<typename _Scalar, int _Options> struct traits<Map<Quaternion<_Scalar>, _Options> > : traits<Quaternion<_Scalar, (int(_Options)&Aligned)==Aligned ? AutoAlign : DontAlign> > { typedef Map<Matrix<_Scalar,4,1>, _Options> Coefficients; }; } namespace internal { template<typename _Scalar, int _Options> struct traits<Map<const Quaternion<_Scalar>, _Options> > : traits<Quaternion<_Scalar, (int(_Options)&Aligned)==Aligned ? AutoAlign : DontAlign> > { typedef Map<const Matrix<_Scalar,4,1>, _Options> Coefficients; typedef traits<Quaternion<_Scalar, (int(_Options)&Aligned)==Aligned ? AutoAlign : DontAlign> > TraitsBase; enum { Flags = TraitsBase::Flags & ~LvalueBit }; }; } # 347 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" template<typename _Scalar, int _Options> class Map<const Quaternion<_Scalar>, _Options > : public QuaternionBase<Map<const Quaternion<_Scalar>, _Options> > { public: typedef QuaternionBase<Map<const Quaternion<_Scalar>, _Options> > Base; typedef _Scalar Scalar; typedef typename internal::traits<Map>::Coefficients Coefficients; using Base::operator =; inline Map& operator=(const Map& other) { Base::operator=(other); return *this; } using Base::operator*=; explicit inline Map(const Scalar* coeffs) : m_coeffs(coeffs) {} inline const Coefficients& coeffs() const { return m_coeffs;} protected: const Coefficients m_coeffs; }; # 384 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" template<typename _Scalar, int _Options> class Map<Quaternion<_Scalar>, _Options > : public QuaternionBase<Map<Quaternion<_Scalar>, _Options> > { public: typedef QuaternionBase<Map<Quaternion<_Scalar>, _Options> > Base; typedef _Scalar Scalar; typedef typename internal::traits<Map>::Coefficients Coefficients; using Base::operator =; inline Map& operator=(const Map& other) { Base::operator=(other); return *this; } using Base::operator*=; explicit inline Map(Scalar* coeffs) : m_coeffs(coeffs) {} inline Coefficients& coeffs() { return m_coeffs; } inline const Coefficients& coeffs() const { return m_coeffs; } protected: Coefficients m_coeffs; }; typedef Map<Quaternion<float>, 0> QuaternionMapf; typedef Map<Quaternion<double>, 0> QuaternionMapd; typedef Map<Quaternion<float>, Aligned> QuaternionMapAlignedf; typedef Map<Quaternion<double>, Aligned> QuaternionMapAlignedd; namespace internal { template<int Arch, class Derived1, class Derived2, typename Scalar> struct quat_product { static inline Quaternion<Scalar> run(const QuaternionBase<Derived1>& a, const QuaternionBase<Derived2>& b){ return Quaternion<Scalar> ( a.w() * b.w() - a.x() * b.x() - a.y() * b.y() - a.z() * b.z(), a.w() * b.x() + a.x() * b.w() + a.y() * b.z() - a.z() * b.y(), a.w() * b.y() + a.y() * b.w() + a.z() * b.x() - a.x() * b.z(), a.w() * b.z() + a.z() * b.w() + a.x() * b.y() - a.y() * b.x() ); } }; } template <class Derived> template <class OtherDerived> inline Quaternion<typename internal::traits<Derived>::Scalar> QuaternionBase<Derived>::operator* (const QuaternionBase<OtherDerived>& other) const { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<typename Derived::Scalar, typename OtherDerived::Scalar>::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {} return internal::quat_product<Architecture::Target, Derived, OtherDerived, typename internal::traits<Derived>::Scalar>::run(*this, other); } template <class Derived> template <class OtherDerived> inline Derived& QuaternionBase<Derived>::operator*= (const QuaternionBase<OtherDerived>& other) { derived() = derived() * other.derived(); return derived(); } # 473 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" template <class Derived> inline typename QuaternionBase<Derived>::Vector3 QuaternionBase<Derived>::_transformVector(const Vector3& v) const { Vector3 uv = this->vec().cross(v); uv += uv; return v + this->w() * uv + this->vec().cross(uv); } template<class Derived> inline QuaternionBase<Derived>& QuaternionBase<Derived>::operator=(const QuaternionBase<Derived>& other) { coeffs() = other.coeffs(); return derived(); } template<class Derived> template<class OtherDerived> inline Derived& QuaternionBase<Derived>::operator=(const QuaternionBase<OtherDerived>& other) { coeffs() = other.coeffs(); return derived(); } template<class Derived> inline Derived& QuaternionBase<Derived>::operator=(const AngleAxisType& aa) { using std::cos; using std::sin; Scalar ha = Scalar(0.5)*aa.angle(); this->w() = cos(ha); this->vec() = sin(ha) * aa.axis(); return derived(); } template<class Derived> template<class MatrixDerived> inline Derived& QuaternionBase<Derived>::operator=(const MatrixBase<MatrixDerived>& xpr) { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<typename Derived::Scalar, typename MatrixDerived::Scalar>::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {} internal::quaternionbase_assign_impl<MatrixDerived>::run(*this, xpr.derived()); return derived(); } template<class Derived> inline typename QuaternionBase<Derived>::Matrix3 QuaternionBase<Derived>::toRotationMatrix(void) const { Matrix3 res; const Scalar tx = Scalar(2)*this->x(); const Scalar ty = Scalar(2)*this->y(); const Scalar tz = Scalar(2)*this->z(); const Scalar twx = tx*this->w(); const Scalar twy = ty*this->w(); const Scalar twz = tz*this->w(); const Scalar txx = tx*this->x(); const Scalar txy = ty*this->x(); const Scalar txz = tz*this->x(); const Scalar tyy = ty*this->y(); const Scalar tyz = tz*this->y(); const Scalar tzz = tz*this->z(); res.coeffRef(0,0) = Scalar(1)-(tyy+tzz); res.coeffRef(0,1) = txy-twz; res.coeffRef(0,2) = txz+twy; res.coeffRef(1,0) = txy+twz; res.coeffRef(1,1) = Scalar(1)-(txx+tzz); res.coeffRef(1,2) = tyz-twx; res.coeffRef(2,0) = txz-twy; res.coeffRef(2,1) = tyz+twx; res.coeffRef(2,2) = Scalar(1)-(txx+tyy); return res; } # 580 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" template<class Derived> template<typename Derived1, typename Derived2> inline Derived& QuaternionBase<Derived>::setFromTwoVectors(const MatrixBase<Derived1>& a, const MatrixBase<Derived2>& b) { using std::sqrt; Vector3 v0 = a.normalized(); Vector3 v1 = b.normalized(); Scalar c = v1.dot(v0); # 597 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" if (c < Scalar(-1)+NumTraits<Scalar>::dummy_precision()) { c = numext::maxi(c,Scalar(-1)); Matrix<Scalar,2,3> m; m << v0.transpose(), v1.transpose(); JacobiSVD<Matrix<Scalar,2,3> > svd(m, ComputeFullV); Vector3 axis = svd.matrixV().col(2); Scalar w2 = (Scalar(1)+c)*Scalar(0.5); this->w() = sqrt(w2); this->vec() = axis * sqrt(Scalar(1) - w2); return derived(); } Vector3 axis = v0.cross(v1); Scalar s = sqrt((Scalar(1)+c)*Scalar(2)); Scalar invs = Scalar(1)/s; this->vec() = axis * invs; this->w() = s * Scalar(0.5); return derived(); } template<typename Scalar, int Options> Quaternion<Scalar,Options> Quaternion<Scalar,Options>::UnitRandom() { using std::sqrt; using std::sin; using std::cos; const Scalar u1 = internal::random<Scalar>(0, 1), u2 = internal::random<Scalar>(0, 2*3.141592653589793238462643383279502884197169399375105820974944592307816406L), u3 = internal::random<Scalar>(0, 2*3.141592653589793238462643383279502884197169399375105820974944592307816406L); const Scalar a = sqrt(1 - u1), b = sqrt(u1); return Quaternion (a * sin(u2), a * cos(u2), b * sin(u3), b * cos(u3)); } # 647 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" template<typename Scalar, int Options> template<typename Derived1, typename Derived2> Quaternion<Scalar,Options> Quaternion<Scalar,Options>::FromTwoVectors(const MatrixBase<Derived1>& a, const MatrixBase<Derived2>& b) { Quaternion quat; quat.setFromTwoVectors(a, b); return quat; } # 663 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" template <class Derived> inline Quaternion<typename internal::traits<Derived>::Scalar> QuaternionBase<Derived>::inverse() const { Scalar n2 = this->squaredNorm(); if (n2 > Scalar(0)) return Quaternion<Scalar>(conjugate().coeffs() / n2); else { return Quaternion<Scalar>(Coefficients::Zero()); } } namespace internal { template<int Arch, class Derived, typename Scalar> struct quat_conj { static inline Quaternion<Scalar> run(const QuaternionBase<Derived>& q){ return Quaternion<Scalar>(q.w(),-q.x(),-q.y(),-q.z()); } }; } template <class Derived> inline Quaternion<typename internal::traits<Derived>::Scalar> QuaternionBase<Derived>::conjugate() const { return internal::quat_conj<Architecture::Target, Derived, typename internal::traits<Derived>::Scalar>::run(*this); } template <class Derived> template <class OtherDerived> inline typename internal::traits<Derived>::Scalar QuaternionBase<Derived>::angularDistance(const QuaternionBase<OtherDerived>& other) const { using std::atan2; Quaternion<Scalar> d = (*this) * other.conjugate(); return Scalar(2) * atan2( d.vec().norm(), numext::abs(d.w()) ); } # 723 "eigen-3.3.7/Eigen/src/Geometry/Quaternion.h" template <class Derived> template <class OtherDerived> Quaternion<typename internal::traits<Derived>::Scalar> QuaternionBase<Derived>::slerp(const Scalar& t, const QuaternionBase<OtherDerived>& other) const { using std::acos; using std::sin; const Scalar one = Scalar(1) - NumTraits<Scalar>::epsilon(); Scalar d = this->dot(other); Scalar absD = numext::abs(d); Scalar scale0; Scalar scale1; if(absD>=one) { scale0 = Scalar(1) - t; scale1 = t; } else { Scalar theta = acos(absD); Scalar sinTheta = sin(theta); scale0 = sin( ( Scalar(1) - t ) * theta) / sinTheta; scale1 = sin( ( t * theta) ) / sinTheta; } if(d<Scalar(0)) scale1 = -scale1; return Quaternion<Scalar>(scale0 * coeffs() + scale1 * other.coeffs()); } namespace internal { template<typename Other> struct quaternionbase_assign_impl<Other,3,3> { typedef typename Other::Scalar Scalar; template<class Derived> static inline void run(QuaternionBase<Derived>& q, const Other& a_mat) { const typename internal::nested_eval<Other,2>::type mat(a_mat); using std::sqrt; Scalar t = mat.trace(); if (t > Scalar(0)) { t = sqrt(t + Scalar(1.0)); q.w() = Scalar(0.5)*t; t = Scalar(0.5)/t; q.x() = (mat.coeff(2,1) - mat.coeff(1,2)) * t; q.y() = (mat.coeff(0,2) - mat.coeff(2,0)) * t; q.z() = (mat.coeff(1,0) - mat.coeff(0,1)) * t; } else { Index i = 0; if (mat.coeff(1,1) > mat.coeff(0,0)) i = 1; if (mat.coeff(2,2) > mat.coeff(i,i)) i = 2; Index j = (i+1)%3; Index k = (j+1)%3; t = sqrt(mat.coeff(i,i)-mat.coeff(j,j)-mat.coeff(k,k) + Scalar(1.0)); q.coeffs().coeffRef(i) = Scalar(0.5) * t; t = Scalar(0.5)/t; q.w() = (mat.coeff(k,j)-mat.coeff(j,k))*t; q.coeffs().coeffRef(j) = (mat.coeff(j,i)+mat.coeff(i,j))*t; q.coeffs().coeffRef(k) = (mat.coeff(k,i)+mat.coeff(i,k))*t; } } }; template<typename Other> struct quaternionbase_assign_impl<Other,4,1> { typedef typename Other::Scalar Scalar; template<class Derived> static inline void run(QuaternionBase<Derived>& q, const Other& vec) { q.coeffs() = vec; } }; } } # 43 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/AngleAxis.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/AngleAxis.h" namespace Eigen { # 41 "eigen-3.3.7/Eigen/src/Geometry/AngleAxis.h" namespace internal { template<typename _Scalar> struct traits<AngleAxis<_Scalar> > { typedef _Scalar Scalar; }; } template<typename _Scalar> class AngleAxis : public RotationBase<AngleAxis<_Scalar>,3> { typedef RotationBase<AngleAxis<_Scalar>,3> Base; public: using Base::operator*; enum { Dim = 3 }; typedef _Scalar Scalar; typedef Matrix<Scalar,3,3> Matrix3; typedef Matrix<Scalar,3,1> Vector3; typedef Quaternion<Scalar> QuaternionType; protected: Vector3 m_axis; Scalar m_angle; public: AngleAxis() {} template<typename Derived> inline AngleAxis(const Scalar& angle, const MatrixBase<Derived>& axis) : m_axis(axis), m_angle(angle) {} template<typename QuatDerived> inline explicit AngleAxis(const QuaternionBase<QuatDerived>& q) { *this = q; } template<typename Derived> inline explicit AngleAxis(const MatrixBase<Derived>& m) { *this = m; } Scalar angle() const { return m_angle; } Scalar& angle() { return m_angle; } const Vector3& axis() const { return m_axis; } Vector3& axis() { return m_axis; } inline QuaternionType operator* (const AngleAxis& other) const { return QuaternionType(*this) * QuaternionType(other); } inline QuaternionType operator* (const QuaternionType& other) const { return QuaternionType(*this) * other; } friend inline QuaternionType operator* (const QuaternionType& a, const AngleAxis& b) { return a * QuaternionType(b); } AngleAxis inverse() const { return AngleAxis(-m_angle, m_axis); } template<class QuatDerived> AngleAxis& operator=(const QuaternionBase<QuatDerived>& q); template<typename Derived> AngleAxis& operator=(const MatrixBase<Derived>& m); template<typename Derived> AngleAxis& fromRotationMatrix(const MatrixBase<Derived>& m); Matrix3 toRotationMatrix(void) const; template<typename NewScalarType> inline typename internal::cast_return_type<AngleAxis,AngleAxis<NewScalarType> >::type cast() const { return typename internal::cast_return_type<AngleAxis,AngleAxis<NewScalarType> >::type(*this); } template<typename OtherScalarType> inline explicit AngleAxis(const AngleAxis<OtherScalarType>& other) { m_axis = other.axis().template cast<Scalar>(); m_angle = Scalar(other.angle()); } static inline const AngleAxis Identity() { return AngleAxis(Scalar(0), Vector3::UnitX()); } bool isApprox(const AngleAxis& other, const typename NumTraits<Scalar>::Real& prec = NumTraits<Scalar>::dummy_precision()) const { return m_axis.isApprox(other.m_axis, prec) && internal::isApprox(m_angle,other.m_angle, prec); } }; typedef AngleAxis<float> AngleAxisf; typedef AngleAxis<double> AngleAxisd; template<typename Scalar> template<typename QuatDerived> AngleAxis<Scalar>& AngleAxis<Scalar>::operator=(const QuaternionBase<QuatDerived>& q) { using std::atan2; using std::abs; Scalar n = q.vec().norm(); if(n<NumTraits<Scalar>::epsilon()) n = q.vec().stableNorm(); if (n != Scalar(0)) { m_angle = Scalar(2)*atan2(n, abs(q.w())); if(q.w() < Scalar(0)) n = -n; m_axis = q.vec() / n; } else { m_angle = Scalar(0); m_axis << Scalar(1), Scalar(0), Scalar(0); } return *this; } template<typename Scalar> template<typename Derived> AngleAxis<Scalar>& AngleAxis<Scalar>::operator=(const MatrixBase<Derived>& mat) { return *this = QuaternionType(mat); } template<typename Scalar> template<typename Derived> AngleAxis<Scalar>& AngleAxis<Scalar>::fromRotationMatrix(const MatrixBase<Derived>& mat) { return *this = QuaternionType(mat); } template<typename Scalar> typename AngleAxis<Scalar>::Matrix3 AngleAxis<Scalar>::toRotationMatrix(void) const { using std::sin; using std::cos; Matrix3 res; Vector3 sin_axis = sin(m_angle) * m_axis; Scalar c = cos(m_angle); Vector3 cos1_axis = (Scalar(1)-c) * m_axis; Scalar tmp; tmp = cos1_axis.x() * m_axis.y(); res.coeffRef(0,1) = tmp - sin_axis.z(); res.coeffRef(1,0) = tmp + sin_axis.z(); tmp = cos1_axis.x() * m_axis.z(); res.coeffRef(0,2) = tmp + sin_axis.y(); res.coeffRef(2,0) = tmp - sin_axis.y(); tmp = cos1_axis.y() * m_axis.z(); res.coeffRef(1,2) = tmp - sin_axis.x(); res.coeffRef(2,1) = tmp + sin_axis.x(); res.diagonal() = (cos1_axis.cwiseProduct(m_axis)).array() + c; return res; } } # 44 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" 1 # 15 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" namespace Eigen { namespace internal { template<typename Transform> struct transform_traits { enum { Dim = Transform::Dim, HDim = Transform::HDim, Mode = Transform::Mode, IsProjective = (int(Mode)==int(Projective)) }; }; template< typename TransformType, typename MatrixType, int Case = transform_traits<TransformType>::IsProjective ? 0 : int(MatrixType::RowsAtCompileTime) == int(transform_traits<TransformType>::HDim) ? 1 : 2, int RhsCols = MatrixType::ColsAtCompileTime> struct transform_right_product_impl; template< typename Other, int Mode, int Options, int Dim, int HDim, int OtherRows=Other::RowsAtCompileTime, int OtherCols=Other::ColsAtCompileTime> struct transform_left_product_impl; template< typename Lhs, typename Rhs, bool AnyProjective = transform_traits<Lhs>::IsProjective || transform_traits<Rhs>::IsProjective> struct transform_transform_product_impl; template< typename Other, int Mode, int Options, int Dim, int HDim, int OtherRows=Other::RowsAtCompileTime, int OtherCols=Other::ColsAtCompileTime> struct transform_construct_from_matrix; template<typename TransformType> struct transform_take_affine_part; template<typename _Scalar, int _Dim, int _Mode, int _Options> struct traits<Transform<_Scalar,_Dim,_Mode,_Options> > { typedef _Scalar Scalar; typedef Eigen::Index StorageIndex; typedef Dense StorageKind; enum { Dim1 = _Dim==Dynamic ? _Dim : _Dim + 1, RowsAtCompileTime = _Mode==Projective ? Dim1 : _Dim, ColsAtCompileTime = Dim1, MaxRowsAtCompileTime = RowsAtCompileTime, MaxColsAtCompileTime = ColsAtCompileTime, Flags = 0 }; }; template<int Mode> struct transform_make_affine; } # 200 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename _Scalar, int _Dim, int _Mode, int _Options> class Transform { public: void *operator new(std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(size); } void *operator new[](std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(size); } void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(ptr); } void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(ptr); } void operator delete(void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(ptr); } void operator delete[](void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(ptr); } static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } void operator delete[](void * memory, void *ptr) throw() { return ::operator delete[](memory,ptr); } void* operator new(std::size_t size, const std::nothrow_t&) throw() { try { return Eigen::internal::conditional_aligned_malloc<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(size); } catch (...) { return 0; } } void operator delete(void *ptr, const std::nothrow_t&) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1))!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim==Dynamic ? Dynamic : (_Dim+1)*(_Dim+1)))%16==0))>(ptr); } typedef void eigen_aligned_operator_new_marker_type; enum { Mode = _Mode, Options = _Options, Dim = _Dim, HDim = _Dim+1, Rows = int(Mode)==(AffineCompact) ? Dim : HDim }; typedef _Scalar Scalar; typedef Eigen::Index StorageIndex; typedef Eigen::Index Index; typedef typename internal::make_proper_matrix_type<Scalar,Rows,HDim,Options>::type MatrixType; typedef const MatrixType ConstMatrixType; typedef Matrix<Scalar,Dim,Dim,Options> LinearMatrixType; typedef Block<MatrixType,Dim,Dim,int(Mode)==(AffineCompact) && (Options&RowMajor)==0> LinearPart; typedef const Block<ConstMatrixType,Dim,Dim,int(Mode)==(AffineCompact) && (Options&RowMajor)==0> ConstLinearPart; typedef typename internal::conditional<int(Mode)==int(AffineCompact), MatrixType&, Block<MatrixType,Dim,HDim> >::type AffinePart; typedef typename internal::conditional<int(Mode)==int(AffineCompact), const MatrixType&, const Block<const MatrixType,Dim,HDim> >::type ConstAffinePart; typedef Matrix<Scalar,Dim,1> VectorType; typedef Block<MatrixType,Dim,1,!(internal::traits<MatrixType>::Flags & RowMajorBit)> TranslationPart; typedef const Block<ConstMatrixType,Dim,1,!(internal::traits<MatrixType>::Flags & RowMajorBit)> ConstTranslationPart; typedef Translation<Scalar,Dim> TranslationType; enum { TransformTimeDiagonalMode = ((Mode==int(Isometry))?Affine:int(Mode)) }; typedef Transform<Scalar,Dim,TransformTimeDiagonalMode> TransformTimeDiagonalReturnType; protected: MatrixType m_matrix; public: inline Transform() { check_template_params(); internal::transform_make_affine<(int(Mode)==Affine) ? Affine : AffineCompact>::run(m_matrix); } inline Transform(const Transform& other) { check_template_params(); m_matrix = other.m_matrix; } inline explicit Transform(const TranslationType& t) { check_template_params(); *this = t; } inline explicit Transform(const UniformScaling<Scalar>& s) { check_template_params(); *this = s; } template<typename Derived> inline explicit Transform(const RotationBase<Derived, Dim>& r) { check_template_params(); *this = r; } inline Transform& operator=(const Transform& other) { m_matrix = other.m_matrix; return *this; } typedef internal::transform_take_affine_part<Transform> take_affine_part; template<typename OtherDerived> inline explicit Transform(const EigenBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<Scalar,typename OtherDerived::Scalar>::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {} ; check_template_params(); internal::transform_construct_from_matrix<OtherDerived,Mode,Options,Dim,HDim>::run(this, other.derived()); } template<typename OtherDerived> inline Transform& operator=(const EigenBase<OtherDerived>& other) { if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<Scalar,typename OtherDerived::Scalar>::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {} ; internal::transform_construct_from_matrix<OtherDerived,Mode,Options,Dim,HDim>::run(this, other.derived()); return *this; } template<int OtherOptions> inline Transform(const Transform<Scalar,Dim,Mode,OtherOptions>& other) { check_template_params(); m_matrix = other.matrix(); } template<int OtherMode,int OtherOptions> inline Transform(const Transform<Scalar,Dim,OtherMode,OtherOptions>& other) { check_template_params(); if (Eigen::internal::static_assertion<static_cast<bool>((!(OtherMode==int(Projective)) || (Mode==int(Projective))))>::YOU_PERFORMED_AN_INVALID_TRANSFORMATION_CONVERSION) {} if (Eigen::internal::static_assertion<static_cast<bool>((!(OtherMode==int(Affine)||OtherMode==int(AffineCompact)) || (Mode!=int(Isometry))))>::YOU_PERFORMED_AN_INVALID_TRANSFORMATION_CONVERSION) {} enum { ModeIsAffineCompact = Mode == int(AffineCompact), OtherModeIsAffineCompact = OtherMode == int(AffineCompact) }; if(ModeIsAffineCompact == OtherModeIsAffineCompact) { m_matrix.template block<Dim,Dim+1>(0,0) = other.matrix().template block<Dim,Dim+1>(0,0); makeAffine(); } else if(OtherModeIsAffineCompact) { typedef typename Transform<Scalar,Dim,OtherMode,OtherOptions>::MatrixType OtherMatrixType; internal::transform_construct_from_matrix<OtherMatrixType,Mode,Options,Dim,HDim>::run(this, other.matrix()); } else { linear() = other.linear(); translation() = other.translation(); } } template<typename OtherDerived> Transform(const ReturnByValue<OtherDerived>& other) { check_template_params(); other.evalTo(*this); } template<typename OtherDerived> Transform& operator=(const ReturnByValue<OtherDerived>& other) { other.evalTo(*this); return *this; } # 384 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" Index rows() const { return int(Mode)==int(Projective) ? m_matrix.cols() : (m_matrix.cols()-1); } Index cols() const { return m_matrix.cols(); } inline Scalar operator() (Index row, Index col) const { return m_matrix(row,col); } inline Scalar& operator() (Index row, Index col) { return m_matrix(row,col); } inline const MatrixType& matrix() const { return m_matrix; } inline MatrixType& matrix() { return m_matrix; } inline ConstLinearPart linear() const { return ConstLinearPart(m_matrix,0,0); } inline LinearPart linear() { return LinearPart(m_matrix,0,0); } inline ConstAffinePart affine() const { return take_affine_part::run(m_matrix); } inline AffinePart affine() { return take_affine_part::run(m_matrix); } inline ConstTranslationPart translation() const { return ConstTranslationPart(m_matrix,0,Dim); } inline TranslationPart translation() { return TranslationPart(m_matrix,0,Dim); } # 439 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename OtherDerived> inline const typename internal::transform_right_product_impl<Transform, OtherDerived>::ResultType operator * (const EigenBase<OtherDerived> &other) const { return internal::transform_right_product_impl<Transform, OtherDerived>::run(*this,other.derived()); } # 451 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename OtherDerived> friend inline const typename internal::transform_left_product_impl<OtherDerived,Mode,Options,_Dim,_Dim+1>::ResultType operator * (const EigenBase<OtherDerived> &a, const Transform &b) { return internal::transform_left_product_impl<OtherDerived,Mode,Options,Dim,HDim>::run(a.derived(),b); } template<typename DiagonalDerived> inline const TransformTimeDiagonalReturnType operator * (const DiagonalBase<DiagonalDerived> &b) const { TransformTimeDiagonalReturnType res(*this); res.linearExt() *= b; return res; } template<typename DiagonalDerived> friend inline TransformTimeDiagonalReturnType operator * (const DiagonalBase<DiagonalDerived> &a, const Transform &b) { TransformTimeDiagonalReturnType res; res.linear().noalias() = a*b.linear(); res.translation().noalias() = a*b.translation(); if (Mode!=int(AffineCompact)) res.matrix().row(Dim) = b.matrix().row(Dim); return res; } template<typename OtherDerived> inline Transform& operator*=(const EigenBase<OtherDerived>& other) { return *this = *this * other; } inline const Transform operator * (const Transform& other) const { return internal::transform_transform_product_impl<Transform,Transform>::run(*this,other); } # 524 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<int OtherMode,int OtherOptions> inline typename internal::transform_transform_product_impl<Transform,Transform<Scalar,Dim,OtherMode,OtherOptions> >::ResultType operator * (const Transform<Scalar,Dim,OtherMode,OtherOptions>& other) const { return internal::transform_transform_product_impl<Transform,Transform<Scalar,Dim,OtherMode,OtherOptions> >::run(*this,other); } void setIdentity() { m_matrix.setIdentity(); } static const Transform Identity() { return Transform(MatrixType::Identity()); } template<typename OtherDerived> inline Transform& scale(const MatrixBase<OtherDerived> &other); template<typename OtherDerived> inline Transform& prescale(const MatrixBase<OtherDerived> &other); inline Transform& scale(const Scalar& s); inline Transform& prescale(const Scalar& s); template<typename OtherDerived> inline Transform& translate(const MatrixBase<OtherDerived> &other); template<typename OtherDerived> inline Transform& pretranslate(const MatrixBase<OtherDerived> &other); template<typename RotationType> inline Transform& rotate(const RotationType& rotation); template<typename RotationType> inline Transform& prerotate(const RotationType& rotation); Transform& shear(const Scalar& sx, const Scalar& sy); Transform& preshear(const Scalar& sx, const Scalar& sy); inline Transform& operator=(const TranslationType& t); inline Transform& operator*=(const TranslationType& t) { return translate(t.vector()); } inline Transform operator*(const TranslationType& t) const; inline Transform& operator=(const UniformScaling<Scalar>& t); inline Transform& operator*=(const UniformScaling<Scalar>& s) { return scale(s.factor()); } inline TransformTimeDiagonalReturnType operator*(const UniformScaling<Scalar>& s) const { TransformTimeDiagonalReturnType res = *this; res.scale(s.factor()); return res; } inline Transform& operator*=(const DiagonalMatrix<Scalar,Dim>& s) { linearExt() *= s; return *this; } template<typename Derived> inline Transform& operator=(const RotationBase<Derived,Dim>& r); template<typename Derived> inline Transform& operator*=(const RotationBase<Derived,Dim>& r) { return rotate(r.toRotationMatrix()); } template<typename Derived> inline Transform operator*(const RotationBase<Derived,Dim>& r) const; const LinearMatrixType rotation() const; template<typename RotationMatrixType, typename ScalingMatrixType> void computeRotationScaling(RotationMatrixType *rotation, ScalingMatrixType *scaling) const; template<typename ScalingMatrixType, typename RotationMatrixType> void computeScalingRotation(ScalingMatrixType *scaling, RotationMatrixType *rotation) const; template<typename PositionDerived, typename OrientationType, typename ScaleDerived> Transform& fromPositionOrientationScale(const MatrixBase<PositionDerived> &position, const OrientationType& orientation, const MatrixBase<ScaleDerived> &scale); inline Transform inverse(TransformTraits traits = (TransformTraits)Mode) const; const Scalar* data() const { return m_matrix.data(); } Scalar* data() { return m_matrix.data(); } template<typename NewScalarType> inline typename internal::cast_return_type<Transform,Transform<NewScalarType,Dim,Mode,Options> >::type cast() const { return typename internal::cast_return_type<Transform,Transform<NewScalarType,Dim,Mode,Options> >::type(*this); } template<typename OtherScalarType> inline explicit Transform(const Transform<OtherScalarType,Dim,Mode,Options>& other) { check_template_params(); m_matrix = other.matrix().template cast<Scalar>(); } bool isApprox(const Transform& other, const typename NumTraits<Scalar>::Real& prec = NumTraits<Scalar>::dummy_precision()) const { return m_matrix.isApprox(other.m_matrix, prec); } void makeAffine() { internal::transform_make_affine<int(Mode)>::run(m_matrix); } inline Block<MatrixType,int(Mode)==int(Projective)?HDim:Dim,Dim> linearExt() { return m_matrix.template block<int(Mode)==int(Projective)?HDim:Dim,Dim>(0,0); } inline const Block<MatrixType,int(Mode)==int(Projective)?HDim:Dim,Dim> linearExt() const { return m_matrix.template block<int(Mode)==int(Projective)?HDim:Dim,Dim>(0,0); } inline Block<MatrixType,int(Mode)==int(Projective)?HDim:Dim,1> translationExt() { return m_matrix.template block<int(Mode)==int(Projective)?HDim:Dim,1>(0,Dim); } inline const Block<MatrixType,int(Mode)==int(Projective)?HDim:Dim,1> translationExt() const { return m_matrix.template block<int(Mode)==int(Projective)?HDim:Dim,1>(0,Dim); } protected: static inline void check_template_params() { if (Eigen::internal::static_assertion<static_cast<bool>((Options & (DontAlign|RowMajor)) == Options)>::INVALID_MATRIX_TEMPLATE_PARAMETERS) {} } }; typedef Transform<float,2,Isometry> Isometry2f; typedef Transform<float,3,Isometry> Isometry3f; typedef Transform<double,2,Isometry> Isometry2d; typedef Transform<double,3,Isometry> Isometry3d; typedef Transform<float,2,Affine> Affine2f; typedef Transform<float,3,Affine> Affine3f; typedef Transform<double,2,Affine> Affine2d; typedef Transform<double,3,Affine> Affine3d; typedef Transform<float,2,AffineCompact> AffineCompact2f; typedef Transform<float,3,AffineCompact> AffineCompact3f; typedef Transform<double,2,AffineCompact> AffineCompact2d; typedef Transform<double,3,AffineCompact> AffineCompact3d; typedef Transform<float,2,Projective> Projective2f; typedef Transform<float,3,Projective> Projective3f; typedef Transform<double,2,Projective> Projective2d; typedef Transform<double,3,Projective> Projective3d; # 841 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename Scalar, int Dim, int Mode, int Options> template<typename OtherDerived> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::scale(const MatrixBase<OtherDerived> &other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime==int(Dim))>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} if (Eigen::internal::static_assertion<static_cast<bool>(Mode!=int(Isometry))>::THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) {} linearExt().noalias() = (linearExt() * other.asDiagonal()); return *this; } template<typename Scalar, int Dim, int Mode, int Options> inline Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::scale(const Scalar& s) { if (Eigen::internal::static_assertion<static_cast<bool>(Mode!=int(Isometry))>::THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) {} linearExt() *= s; return *this; } template<typename Scalar, int Dim, int Mode, int Options> template<typename OtherDerived> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::prescale(const MatrixBase<OtherDerived> &other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime==int(Dim))>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} if (Eigen::internal::static_assertion<static_cast<bool>(Mode!=int(Isometry))>::THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) {} affine().noalias() = (other.asDiagonal() * affine()); return *this; } template<typename Scalar, int Dim, int Mode, int Options> inline Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::prescale(const Scalar& s) { if (Eigen::internal::static_assertion<static_cast<bool>(Mode!=int(Isometry))>::THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) {} m_matrix.template topRows<Dim>() *= s; return *this; } template<typename Scalar, int Dim, int Mode, int Options> template<typename OtherDerived> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::translate(const MatrixBase<OtherDerived> &other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime==int(Dim))>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} translationExt() += linearExt() * other; return *this; } template<typename Scalar, int Dim, int Mode, int Options> template<typename OtherDerived> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::pretranslate(const MatrixBase<OtherDerived> &other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherDerived::IsVectorAtCompileTime && OtherDerived::SizeAtCompileTime==int(Dim))>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} if(int(Mode)==int(Projective)) affine() += other * m_matrix.row(Dim); else translation() += other; return *this; } # 939 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename Scalar, int Dim, int Mode, int Options> template<typename RotationType> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::rotate(const RotationType& rotation) { linearExt() *= internal::toRotationMatrix<Scalar,Dim>(rotation); return *this; } # 955 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename Scalar, int Dim, int Mode, int Options> template<typename RotationType> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::prerotate(const RotationType& rotation) { m_matrix.template block<Dim,HDim>(0,0) = internal::toRotationMatrix<Scalar,Dim>(rotation) * m_matrix.template block<Dim,HDim>(0,0); return *this; } template<typename Scalar, int Dim, int Mode, int Options> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::shear(const Scalar& sx, const Scalar& sy) { if (Eigen::internal::static_assertion<static_cast<bool>(int(Dim)==2)>::YOU_MADE_A_PROGRAMMING_MISTAKE) {} if (Eigen::internal::static_assertion<static_cast<bool>(Mode!=int(Isometry))>::THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) {} VectorType tmp = linear().col(0)*sy + linear().col(1); linear() << linear().col(0) + linear().col(1)*sx, tmp; return *this; } template<typename Scalar, int Dim, int Mode, int Options> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::preshear(const Scalar& sx, const Scalar& sy) { if (Eigen::internal::static_assertion<static_cast<bool>(int(Dim)==2)>::YOU_MADE_A_PROGRAMMING_MISTAKE) {} if (Eigen::internal::static_assertion<static_cast<bool>(Mode!=int(Isometry))>::THIS_METHOD_IS_ONLY_FOR_SPECIFIC_TRANSFORMATIONS) {} m_matrix.template block<Dim,HDim>(0,0) = LinearMatrixType(1, sx, sy, 1) * m_matrix.template block<Dim,HDim>(0,0); return *this; } template<typename Scalar, int Dim, int Mode, int Options> inline Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::operator=(const TranslationType& t) { linear().setIdentity(); translation() = t.vector(); makeAffine(); return *this; } template<typename Scalar, int Dim, int Mode, int Options> inline Transform<Scalar,Dim,Mode,Options> Transform<Scalar,Dim,Mode,Options>::operator*(const TranslationType& t) const { Transform res = *this; res.translate(t.vector()); return res; } template<typename Scalar, int Dim, int Mode, int Options> inline Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::operator=(const UniformScaling<Scalar>& s) { m_matrix.setZero(); linear().diagonal().fill(s.factor()); makeAffine(); return *this; } template<typename Scalar, int Dim, int Mode, int Options> template<typename Derived> inline Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::operator=(const RotationBase<Derived,Dim>& r) { linear() = internal::toRotationMatrix<Scalar,Dim>(r); translation().setZero(); makeAffine(); return *this; } template<typename Scalar, int Dim, int Mode, int Options> template<typename Derived> inline Transform<Scalar,Dim,Mode,Options> Transform<Scalar,Dim,Mode,Options>::operator*(const RotationBase<Derived,Dim>& r) const { Transform res = *this; res.rotate(r.derived()); return res; } # 1056 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename Scalar, int Dim, int Mode, int Options> const typename Transform<Scalar,Dim,Mode,Options>::LinearMatrixType Transform<Scalar,Dim,Mode,Options>::rotation() const { LinearMatrixType result; computeRotationScaling(&result, (LinearMatrixType*)0); return result; } # 1077 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename Scalar, int Dim, int Mode, int Options> template<typename RotationMatrixType, typename ScalingMatrixType> void Transform<Scalar,Dim,Mode,Options>::computeRotationScaling(RotationMatrixType *rotation, ScalingMatrixType *scaling) const { JacobiSVD<LinearMatrixType> svd(linear(), ComputeFullU | ComputeFullV); Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); VectorType sv(svd.singularValues()); sv.coeffRef(0) *= x; if(scaling) scaling->lazyAssign(svd.matrixV() * sv.asDiagonal() * svd.matrixV().adjoint()); if(rotation) { LinearMatrixType m(svd.matrixU()); m.col(0) /= x; rotation->lazyAssign(m * svd.matrixV().adjoint()); } } # 1106 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename Scalar, int Dim, int Mode, int Options> template<typename ScalingMatrixType, typename RotationMatrixType> void Transform<Scalar,Dim,Mode,Options>::computeScalingRotation(ScalingMatrixType *scaling, RotationMatrixType *rotation) const { JacobiSVD<LinearMatrixType> svd(linear(), ComputeFullU | ComputeFullV); Scalar x = (svd.matrixU() * svd.matrixV().adjoint()).determinant(); VectorType sv(svd.singularValues()); sv.coeffRef(0) *= x; if(scaling) scaling->lazyAssign(svd.matrixU() * sv.asDiagonal() * svd.matrixU().adjoint()); if(rotation) { LinearMatrixType m(svd.matrixU()); m.col(0) /= x; rotation->lazyAssign(m * svd.matrixV().adjoint()); } } template<typename Scalar, int Dim, int Mode, int Options> template<typename PositionDerived, typename OrientationType, typename ScaleDerived> Transform<Scalar,Dim,Mode,Options>& Transform<Scalar,Dim,Mode,Options>::fromPositionOrientationScale(const MatrixBase<PositionDerived> &position, const OrientationType& orientation, const MatrixBase<ScaleDerived> &scale) { linear() = internal::toRotationMatrix<Scalar,Dim>(orientation); linear() *= scale.asDiagonal(); translation() = position; makeAffine(); return *this; } namespace internal { template<int Mode> struct transform_make_affine { template<typename MatrixType> static void run(MatrixType &mat) { static const int Dim = MatrixType::ColsAtCompileTime-1; mat.template block<1,Dim>(Dim,0).setZero(); mat.coeffRef(Dim,Dim) = typename MatrixType::Scalar(1); } }; template<> struct transform_make_affine<AffineCompact> { template<typename MatrixType> static void run(MatrixType &) { } }; template<typename TransformType, int Mode=TransformType::Mode> struct projective_transform_inverse { static inline void run(const TransformType&, TransformType&) {} }; template<typename TransformType> struct projective_transform_inverse<TransformType, Projective> { static inline void run(const TransformType& m, TransformType& res) { res.matrix() = m.matrix().inverse(); } }; } # 1200 "eigen-3.3.7/Eigen/src/Geometry/Transform.h" template<typename Scalar, int Dim, int Mode, int Options> Transform<Scalar,Dim,Mode,Options> Transform<Scalar,Dim,Mode,Options>::inverse(TransformTraits hint) const { Transform res; if (hint == Projective) { internal::projective_transform_inverse<Transform>::run(*this, res); } else { if (hint == Isometry) { res.matrix().template topLeftCorner<Dim,Dim>() = linear().transpose(); } else if(hint&Affine) { res.matrix().template topLeftCorner<Dim,Dim>() = linear().inverse(); } else { ((false && "Invalid transform traits in Transform::Inverse") ? static_cast<void> (0) : __assert_fail ("false && \"Invalid transform traits in Transform::Inverse\"", "eigen-3.3.7/Eigen/src/Geometry/Transform.h", 1221, __PRETTY_FUNCTION__)); } res.matrix().template topRightCorner<Dim,1>() = - res.matrix().template topLeftCorner<Dim,Dim>() * translation(); res.makeAffine(); } return res; } namespace internal { template<typename TransformType> struct transform_take_affine_part { typedef typename TransformType::MatrixType MatrixType; typedef typename TransformType::AffinePart AffinePart; typedef typename TransformType::ConstAffinePart ConstAffinePart; static inline AffinePart run(MatrixType& m) { return m.template block<TransformType::Dim,TransformType::HDim>(0,0); } static inline ConstAffinePart run(const MatrixType& m) { return m.template block<TransformType::Dim,TransformType::HDim>(0,0); } }; template<typename Scalar, int Dim, int Options> struct transform_take_affine_part<Transform<Scalar,Dim,AffineCompact, Options> > { typedef typename Transform<Scalar,Dim,AffineCompact,Options>::MatrixType MatrixType; static inline MatrixType& run(MatrixType& m) { return m; } static inline const MatrixType& run(const MatrixType& m) { return m; } }; template<typename Other, int Mode, int Options, int Dim, int HDim> struct transform_construct_from_matrix<Other, Mode,Options,Dim,HDim, Dim,Dim> { static inline void run(Transform<typename Other::Scalar,Dim,Mode,Options> *transform, const Other& other) { transform->linear() = other; transform->translation().setZero(); transform->makeAffine(); } }; template<typename Other, int Mode, int Options, int Dim, int HDim> struct transform_construct_from_matrix<Other, Mode,Options,Dim,HDim, Dim,HDim> { static inline void run(Transform<typename Other::Scalar,Dim,Mode,Options> *transform, const Other& other) { transform->affine() = other; transform->makeAffine(); } }; template<typename Other, int Mode, int Options, int Dim, int HDim> struct transform_construct_from_matrix<Other, Mode,Options,Dim,HDim, HDim,HDim> { static inline void run(Transform<typename Other::Scalar,Dim,Mode,Options> *transform, const Other& other) { transform->matrix() = other; } }; template<typename Other, int Options, int Dim, int HDim> struct transform_construct_from_matrix<Other, AffineCompact,Options,Dim,HDim, HDim,HDim> { static inline void run(Transform<typename Other::Scalar,Dim,AffineCompact,Options> *transform, const Other& other) { transform->matrix() = other.template block<Dim,HDim>(0,0); } }; template<int LhsMode,int RhsMode> struct transform_product_result { enum { Mode = (LhsMode == (int)Projective || RhsMode == (int)Projective ) ? Projective : (LhsMode == (int)Affine || RhsMode == (int)Affine ) ? Affine : (LhsMode == (int)AffineCompact || RhsMode == (int)AffineCompact ) ? AffineCompact : (LhsMode == (int)Isometry || RhsMode == (int)Isometry ) ? Isometry : Projective }; }; template< typename TransformType, typename MatrixType, int RhsCols> struct transform_right_product_impl< TransformType, MatrixType, 0, RhsCols> { typedef typename MatrixType::PlainObject ResultType; static inline ResultType run(const TransformType& T, const MatrixType& other) { return T.matrix() * other; } }; template< typename TransformType, typename MatrixType, int RhsCols> struct transform_right_product_impl< TransformType, MatrixType, 1, RhsCols> { enum { Dim = TransformType::Dim, HDim = TransformType::HDim, OtherRows = MatrixType::RowsAtCompileTime, OtherCols = MatrixType::ColsAtCompileTime }; typedef typename MatrixType::PlainObject ResultType; static inline ResultType run(const TransformType& T, const MatrixType& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherRows==HDim)>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {}; typedef Block<ResultType, Dim, OtherCols, int(MatrixType::RowsAtCompileTime)==Dim> TopLeftLhs; ResultType res(other.rows(),other.cols()); TopLeftLhs(res, 0, 0, Dim, other.cols()).noalias() = T.affine() * other; res.row(OtherRows-1) = other.row(OtherRows-1); return res; } }; template< typename TransformType, typename MatrixType, int RhsCols> struct transform_right_product_impl< TransformType, MatrixType, 2, RhsCols> { enum { Dim = TransformType::Dim, HDim = TransformType::HDim, OtherRows = MatrixType::RowsAtCompileTime, OtherCols = MatrixType::ColsAtCompileTime }; typedef typename MatrixType::PlainObject ResultType; static inline ResultType run(const TransformType& T, const MatrixType& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherRows==Dim)>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {}; typedef Block<ResultType, Dim, OtherCols, true> TopLeftLhs; ResultType res(Replicate<typename TransformType::ConstTranslationPart, 1, OtherCols>(T.translation(),1,other.cols())); TopLeftLhs(res, 0, 0, Dim, other.cols()).noalias() += T.linear() * other; return res; } }; template< typename TransformType, typename MatrixType > struct transform_right_product_impl< TransformType, MatrixType, 2, 1> { typedef typename TransformType::MatrixType TransformMatrix; enum { Dim = TransformType::Dim, HDim = TransformType::HDim, OtherRows = MatrixType::RowsAtCompileTime, WorkingRows = (((int)TransformMatrix::RowsAtCompileTime <= (int)HDim) ? (int)TransformMatrix::RowsAtCompileTime : (int)HDim) }; typedef typename MatrixType::PlainObject ResultType; static inline ResultType run(const TransformType& T, const MatrixType& other) { if (Eigen::internal::static_assertion<static_cast<bool>(OtherRows==Dim)>::YOU_MIXED_MATRICES_OF_DIFFERENT_SIZES) {}; Matrix<typename ResultType::Scalar, Dim+1, 1> rhs; rhs.template head<Dim>() = other; rhs[Dim] = typename ResultType::Scalar(1); Matrix<typename ResultType::Scalar, WorkingRows, 1> res(T.matrix() * rhs); return res.template head<Dim>(); } }; template<typename Other,int Mode, int Options, int Dim, int HDim> struct transform_left_product_impl<Other,Mode,Options,Dim,HDim, HDim,HDim> { typedef Transform<typename Other::Scalar,Dim,Mode,Options> TransformType; typedef typename TransformType::MatrixType MatrixType; typedef Transform<typename Other::Scalar,Dim,Projective,Options> ResultType; static ResultType run(const Other& other,const TransformType& tr) { return ResultType(other * tr.matrix()); } }; template<typename Other, int Options, int Dim, int HDim> struct transform_left_product_impl<Other,AffineCompact,Options,Dim,HDim, HDim,HDim> { typedef Transform<typename Other::Scalar,Dim,AffineCompact,Options> TransformType; typedef typename TransformType::MatrixType MatrixType; typedef Transform<typename Other::Scalar,Dim,Projective,Options> ResultType; static ResultType run(const Other& other,const TransformType& tr) { ResultType res; res.matrix().noalias() = other.template block<HDim,Dim>(0,0) * tr.matrix(); res.matrix().col(Dim) += other.col(Dim); return res; } }; template<typename Other,int Mode, int Options, int Dim, int HDim> struct transform_left_product_impl<Other,Mode,Options,Dim,HDim, Dim,HDim> { typedef Transform<typename Other::Scalar,Dim,Mode,Options> TransformType; typedef typename TransformType::MatrixType MatrixType; typedef TransformType ResultType; static ResultType run(const Other& other,const TransformType& tr) { ResultType res; res.affine().noalias() = other * tr.matrix(); res.matrix().row(Dim) = tr.matrix().row(Dim); return res; } }; template<typename Other, int Options, int Dim, int HDim> struct transform_left_product_impl<Other,AffineCompact,Options,Dim,HDim, Dim,HDim> { typedef Transform<typename Other::Scalar,Dim,AffineCompact,Options> TransformType; typedef typename TransformType::MatrixType MatrixType; typedef TransformType ResultType; static ResultType run(const Other& other,const TransformType& tr) { ResultType res; res.matrix().noalias() = other.template block<Dim,Dim>(0,0) * tr.matrix(); res.translation() += other.col(Dim); return res; } }; template<typename Other,int Mode, int Options, int Dim, int HDim> struct transform_left_product_impl<Other,Mode,Options,Dim,HDim, Dim,Dim> { typedef Transform<typename Other::Scalar,Dim,Mode,Options> TransformType; typedef typename TransformType::MatrixType MatrixType; typedef TransformType ResultType; static ResultType run(const Other& other, const TransformType& tr) { TransformType res; if(Mode!=int(AffineCompact)) res.matrix().row(Dim) = tr.matrix().row(Dim); res.matrix().template topRows<Dim>().noalias() = other * tr.matrix().template topRows<Dim>(); return res; } }; template<typename Scalar, int Dim, int LhsMode, int LhsOptions, int RhsMode, int RhsOptions> struct transform_transform_product_impl<Transform<Scalar,Dim,LhsMode,LhsOptions>,Transform<Scalar,Dim,RhsMode,RhsOptions>,false > { enum { ResultMode = transform_product_result<LhsMode,RhsMode>::Mode }; typedef Transform<Scalar,Dim,LhsMode,LhsOptions> Lhs; typedef Transform<Scalar,Dim,RhsMode,RhsOptions> Rhs; typedef Transform<Scalar,Dim,ResultMode,LhsOptions> ResultType; static ResultType run(const Lhs& lhs, const Rhs& rhs) { ResultType res; res.linear() = lhs.linear() * rhs.linear(); res.translation() = lhs.linear() * rhs.translation() + lhs.translation(); res.makeAffine(); return res; } }; template<typename Scalar, int Dim, int LhsMode, int LhsOptions, int RhsMode, int RhsOptions> struct transform_transform_product_impl<Transform<Scalar,Dim,LhsMode,LhsOptions>,Transform<Scalar,Dim,RhsMode,RhsOptions>,true > { typedef Transform<Scalar,Dim,LhsMode,LhsOptions> Lhs; typedef Transform<Scalar,Dim,RhsMode,RhsOptions> Rhs; typedef Transform<Scalar,Dim,Projective> ResultType; static ResultType run(const Lhs& lhs, const Rhs& rhs) { return ResultType( lhs.matrix() * rhs.matrix() ); } }; template<typename Scalar, int Dim, int LhsOptions, int RhsOptions> struct transform_transform_product_impl<Transform<Scalar,Dim,AffineCompact,LhsOptions>,Transform<Scalar,Dim,Projective,RhsOptions>,true > { typedef Transform<Scalar,Dim,AffineCompact,LhsOptions> Lhs; typedef Transform<Scalar,Dim,Projective,RhsOptions> Rhs; typedef Transform<Scalar,Dim,Projective> ResultType; static ResultType run(const Lhs& lhs, const Rhs& rhs) { ResultType res; res.matrix().template topRows<Dim>() = lhs.matrix() * rhs.matrix(); res.matrix().row(Dim) = rhs.matrix().row(Dim); return res; } }; template<typename Scalar, int Dim, int LhsOptions, int RhsOptions> struct transform_transform_product_impl<Transform<Scalar,Dim,Projective,LhsOptions>,Transform<Scalar,Dim,AffineCompact,RhsOptions>,true > { typedef Transform<Scalar,Dim,Projective,LhsOptions> Lhs; typedef Transform<Scalar,Dim,AffineCompact,RhsOptions> Rhs; typedef Transform<Scalar,Dim,Projective> ResultType; static ResultType run(const Lhs& lhs, const Rhs& rhs) { ResultType res(lhs.matrix().template leftCols<Dim>() * rhs.matrix()); res.matrix().col(Dim) += lhs.matrix().col(Dim); return res; } }; } } # 45 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Translation.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/Translation.h" namespace Eigen { # 29 "eigen-3.3.7/Eigen/src/Geometry/Translation.h" template<typename _Scalar, int _Dim> class Translation { public: void *operator new(std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(size); } void *operator new[](std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(size); } void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(ptr); } void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(ptr); } void operator delete(void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(ptr); } void operator delete[](void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(ptr); } static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } void operator delete[](void * memory, void *ptr) throw() { return ::operator delete[](memory,ptr); } void* operator new(std::size_t size, const std::nothrow_t&) throw() { try { return Eigen::internal::conditional_aligned_malloc<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(size); } catch (...) { return 0; } } void operator delete(void *ptr, const std::nothrow_t&) throw() { Eigen::internal::conditional_aligned_free<bool(((_Dim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_Dim))%16==0))>(ptr); } typedef void eigen_aligned_operator_new_marker_type; enum { Dim = _Dim }; typedef _Scalar Scalar; typedef Matrix<Scalar,Dim,1> VectorType; typedef Matrix<Scalar,Dim,Dim> LinearMatrixType; typedef Transform<Scalar,Dim,Affine> AffineTransformType; typedef Transform<Scalar,Dim,Isometry> IsometryTransformType; protected: VectorType m_coeffs; public: Translation() {} inline Translation(const Scalar& sx, const Scalar& sy) { ((Dim==2) ? static_cast<void> (0) : __assert_fail ("Dim==2", "eigen-3.3.7/Eigen/src/Geometry/Translation.h", 58, __PRETTY_FUNCTION__)); m_coeffs.x() = sx; m_coeffs.y() = sy; } inline Translation(const Scalar& sx, const Scalar& sy, const Scalar& sz) { ((Dim==3) ? static_cast<void> (0) : __assert_fail ("Dim==3", "eigen-3.3.7/Eigen/src/Geometry/Translation.h", 65, __PRETTY_FUNCTION__)); m_coeffs.x() = sx; m_coeffs.y() = sy; m_coeffs.z() = sz; } explicit inline Translation(const VectorType& vector) : m_coeffs(vector) {} inline Scalar x() const { return m_coeffs.x(); } inline Scalar y() const { return m_coeffs.y(); } inline Scalar z() const { return m_coeffs.z(); } inline Scalar& x() { return m_coeffs.x(); } inline Scalar& y() { return m_coeffs.y(); } inline Scalar& z() { return m_coeffs.z(); } const VectorType& vector() const { return m_coeffs; } VectorType& vector() { return m_coeffs; } const VectorType& translation() const { return m_coeffs; } VectorType& translation() { return m_coeffs; } inline Translation operator* (const Translation& other) const { return Translation(m_coeffs + other.m_coeffs); } inline AffineTransformType operator* (const UniformScaling<Scalar>& other) const; template<typename OtherDerived> inline AffineTransformType operator* (const EigenBase<OtherDerived>& linear) const; template<typename Derived> inline IsometryTransformType operator*(const RotationBase<Derived,Dim>& r) const { return *this * IsometryTransformType(r); } template<typename OtherDerived> friend inline AffineTransformType operator*(const EigenBase<OtherDerived>& linear, const Translation& t) { AffineTransformType res; res.matrix().setZero(); res.linear() = linear.derived(); res.translation() = linear.derived() * t.m_coeffs; res.matrix().row(Dim).setZero(); res(Dim,Dim) = Scalar(1); return res; } template<int Mode, int Options> inline Transform<Scalar,Dim,Mode> operator* (const Transform<Scalar,Dim,Mode,Options>& t) const { Transform<Scalar,Dim,Mode> res = t; res.pretranslate(m_coeffs); return res; } template<typename Derived> inline typename internal::enable_if<Derived::IsVectorAtCompileTime,VectorType>::type operator* (const MatrixBase<Derived>& vec) const { return m_coeffs + vec.derived(); } Translation inverse() const { return Translation(-m_coeffs); } Translation& operator=(const Translation& other) { m_coeffs = other.m_coeffs; return *this; } static const Translation Identity() { return Translation(VectorType::Zero()); } template<typename NewScalarType> inline typename internal::cast_return_type<Translation,Translation<NewScalarType,Dim> >::type cast() const { return typename internal::cast_return_type<Translation,Translation<NewScalarType,Dim> >::type(*this); } template<typename OtherScalarType> inline explicit Translation(const Translation<OtherScalarType,Dim>& other) { m_coeffs = other.vector().template cast<Scalar>(); } bool isApprox(const Translation& other, const typename NumTraits<Scalar>::Real& prec = NumTraits<Scalar>::dummy_precision()) const { return m_coeffs.isApprox(other.m_coeffs, prec); } }; typedef Translation<float, 2> Translation2f; typedef Translation<double,2> Translation2d; typedef Translation<float, 3> Translation3f; typedef Translation<double,3> Translation3d; template<typename Scalar, int Dim> inline typename Translation<Scalar,Dim>::AffineTransformType Translation<Scalar,Dim>::operator* (const UniformScaling<Scalar>& other) const { AffineTransformType res; res.matrix().setZero(); res.linear().diagonal().fill(other.factor()); res.translation() = m_coeffs; res(Dim,Dim) = Scalar(1); return res; } template<typename Scalar, int Dim> template<typename OtherDerived> inline typename Translation<Scalar,Dim>::AffineTransformType Translation<Scalar,Dim>::operator* (const EigenBase<OtherDerived>& linear) const { AffineTransformType res; res.matrix().setZero(); res.linear() = linear.derived(); res.translation() = m_coeffs; res.matrix().row(Dim).setZero(); res(Dim,Dim) = Scalar(1); return res; } } # 46 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Scaling.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/Scaling.h" namespace Eigen { # 32 "eigen-3.3.7/Eigen/src/Geometry/Scaling.h" template<typename _Scalar> class UniformScaling { public: typedef _Scalar Scalar; protected: Scalar m_factor; public: UniformScaling() {} explicit inline UniformScaling(const Scalar& s) : m_factor(s) {} inline const Scalar& factor() const { return m_factor; } inline Scalar& factor() { return m_factor; } inline UniformScaling operator* (const UniformScaling& other) const { return UniformScaling(m_factor * other.factor()); } template<int Dim> inline Transform<Scalar,Dim,Affine> operator* (const Translation<Scalar,Dim>& t) const; template<int Dim, int Mode, int Options> inline Transform<Scalar,Dim,(int(Mode)==int(Isometry)?Affine:Mode)> operator* (const Transform<Scalar,Dim, Mode, Options>& t) const { Transform<Scalar,Dim,(int(Mode)==int(Isometry)?Affine:Mode)> res = t; res.prescale(factor()); return res; } template<typename Derived> inline typename internal::plain_matrix_type<Derived>::type operator* (const MatrixBase<Derived>& other) const { return other * m_factor; } template<typename Derived,int Dim> inline Matrix<Scalar,Dim,Dim> operator*(const RotationBase<Derived,Dim>& r) const { return r.toRotationMatrix() * m_factor; } inline UniformScaling inverse() const { return UniformScaling(Scalar(1)/m_factor); } template<typename NewScalarType> inline UniformScaling<NewScalarType> cast() const { return UniformScaling<NewScalarType>(NewScalarType(m_factor)); } template<typename OtherScalarType> inline explicit UniformScaling(const UniformScaling<OtherScalarType>& other) { m_factor = Scalar(other.factor()); } bool isApprox(const UniformScaling& other, const typename NumTraits<Scalar>::Real& prec = NumTraits<Scalar>::dummy_precision()) const { return internal::isApprox(m_factor, other.factor(), prec); } }; # 115 "eigen-3.3.7/Eigen/src/Geometry/Scaling.h" template<typename Derived,typename Scalar> CwiseBinaryOp<internal::scalar_product_op<typename internal::traits<Derived>::Scalar,Scalar>, const Derived, const typename internal::plain_constant_type<Derived,Scalar>::type> operator*(const MatrixBase<Derived>& matrix, const UniformScaling<Scalar>& s) { return matrix.derived() * s.factor(); } inline UniformScaling<float> Scaling(float s) { return UniformScaling<float>(s); } inline UniformScaling<double> Scaling(double s) { return UniformScaling<double>(s); } template<typename RealScalar> inline UniformScaling<std::complex<RealScalar> > Scaling(const std::complex<RealScalar>& s) { return UniformScaling<std::complex<RealScalar> >(s); } template<typename Scalar> inline DiagonalMatrix<Scalar,2> Scaling(const Scalar& sx, const Scalar& sy) { return DiagonalMatrix<Scalar,2>(sx, sy); } template<typename Scalar> inline DiagonalMatrix<Scalar,3> Scaling(const Scalar& sx, const Scalar& sy, const Scalar& sz) { return DiagonalMatrix<Scalar,3>(sx, sy, sz); } template<typename Derived> inline const DiagonalWrapper<const Derived> Scaling(const MatrixBase<Derived>& coeffs) { return coeffs.asDiagonal(); } typedef DiagonalMatrix<float, 2> AlignedScaling2f; typedef DiagonalMatrix<double,2> AlignedScaling2d; typedef DiagonalMatrix<float, 3> AlignedScaling3f; typedef DiagonalMatrix<double,3> AlignedScaling3d; template<typename Scalar> template<int Dim> inline Transform<Scalar,Dim,Affine> UniformScaling<Scalar>::operator* (const Translation<Scalar,Dim>& t) const { Transform<Scalar,Dim,Affine> res; res.matrix().setZero(); res.linear().diagonal().fill(factor()); res.translation() = factor() * t.vector(); res(Dim,Dim) = Scalar(1); return res; } } # 47 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Hyperplane.h" 1 # 14 "eigen-3.3.7/Eigen/src/Geometry/Hyperplane.h" namespace Eigen { # 33 "eigen-3.3.7/Eigen/src/Geometry/Hyperplane.h" template <typename _Scalar, int _AmbientDim, int _Options> class Hyperplane { public: void *operator new(std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(size); } void *operator new[](std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(size); } void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(ptr); } void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(ptr); } void operator delete(void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(ptr); } void operator delete[](void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(ptr); } static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } void operator delete[](void * memory, void *ptr) throw() { return ::operator delete[](memory,ptr); } void* operator new(std::size_t size, const std::nothrow_t&) throw() { try { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(size); } catch (...) { return 0; } } void operator delete(void *ptr, const std::nothrow_t&) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim==Dynamic ? Dynamic : _AmbientDim+1))%16==0))>(ptr); } typedef void eigen_aligned_operator_new_marker_type; enum { AmbientDimAtCompileTime = _AmbientDim, Options = _Options }; typedef _Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef Eigen::Index Index; typedef Matrix<Scalar,AmbientDimAtCompileTime,1> VectorType; typedef Matrix<Scalar,Index(AmbientDimAtCompileTime)==Dynamic ? Dynamic : Index(AmbientDimAtCompileTime)+1,1,Options> Coefficients; typedef Block<Coefficients,AmbientDimAtCompileTime,1> NormalReturnType; typedef const Block<const Coefficients,AmbientDimAtCompileTime,1> ConstNormalReturnType; inline Hyperplane() {} template<int OtherOptions> Hyperplane(const Hyperplane<Scalar,AmbientDimAtCompileTime,OtherOptions>& other) : m_coeffs(other.coeffs()) {} inline explicit Hyperplane(Index _dim) : m_coeffs(_dim+1) {} inline Hyperplane(const VectorType& n, const VectorType& e) : m_coeffs(n.size()+1) { normal() = n; offset() = -n.dot(e); } inline Hyperplane(const VectorType& n, const Scalar& d) : m_coeffs(n.size()+1) { normal() = n; offset() = d; } static inline Hyperplane Through(const VectorType& p0, const VectorType& p1) { Hyperplane result(p0.size()); result.normal() = (p1 - p0).unitOrthogonal(); result.offset() = -p0.dot(result.normal()); return result; } static inline Hyperplane Through(const VectorType& p0, const VectorType& p1, const VectorType& p2) { if (Eigen::internal::static_assertion<static_cast<bool>(VectorType::IsVectorAtCompileTime && VectorType::SizeAtCompileTime==3)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} Hyperplane result(p0.size()); VectorType v0(p2 - p0), v1(p1 - p0); result.normal() = v0.cross(v1); RealScalar norm = result.normal().norm(); if(norm <= v0.norm() * v1.norm() * NumTraits<RealScalar>::epsilon()) { Matrix<Scalar,2,3> m; m << v0.transpose(), v1.transpose(); JacobiSVD<Matrix<Scalar,2,3> > svd(m, ComputeFullV); result.normal() = svd.matrixV().col(2); } else result.normal() /= norm; result.offset() = -p0.dot(result.normal()); return result; } explicit Hyperplane(const ParametrizedLine<Scalar, AmbientDimAtCompileTime>& parametrized) { normal() = parametrized.direction().unitOrthogonal(); offset() = -parametrized.origin().dot(normal()); } ~Hyperplane() {} inline Index dim() const { return AmbientDimAtCompileTime==Dynamic ? m_coeffs.size()-1 : Index(AmbientDimAtCompileTime); } void normalize(void) { m_coeffs /= normal().norm(); } inline Scalar signedDistance(const VectorType& p) const { return normal().dot(p) + offset(); } inline Scalar absDistance(const VectorType& p) const { return numext::abs(signedDistance(p)); } inline VectorType projection(const VectorType& p) const { return p - signedDistance(p) * normal(); } inline ConstNormalReturnType normal() const { return ConstNormalReturnType(m_coeffs,0,0,dim(),1); } inline NormalReturnType normal() { return NormalReturnType(m_coeffs,0,0,dim(),1); } inline const Scalar& offset() const { return m_coeffs.coeff(dim()); } inline Scalar& offset() { return m_coeffs(dim()); } inline const Coefficients& coeffs() const { return m_coeffs; } inline Coefficients& coeffs() { return m_coeffs; } VectorType intersection(const Hyperplane& other) const { if (Eigen::internal::static_assertion<static_cast<bool>(VectorType::IsVectorAtCompileTime && VectorType::SizeAtCompileTime==2)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} Scalar det = coeffs().coeff(0) * other.coeffs().coeff(1) - coeffs().coeff(1) * other.coeffs().coeff(0); if(internal::isMuchSmallerThan(det, Scalar(1))) { if(numext::abs(coeffs().coeff(1))>numext::abs(coeffs().coeff(0))) return VectorType(coeffs().coeff(1), -coeffs().coeff(2)/coeffs().coeff(1)-coeffs().coeff(0)); else return VectorType(-coeffs().coeff(2)/coeffs().coeff(0)-coeffs().coeff(1), coeffs().coeff(0)); } else { Scalar invdet = Scalar(1) / det; return VectorType(invdet*(coeffs().coeff(1)*other.coeffs().coeff(2)-other.coeffs().coeff(1)*coeffs().coeff(2)), invdet*(other.coeffs().coeff(0)*coeffs().coeff(2)-coeffs().coeff(0)*other.coeffs().coeff(2))); } } template<typename XprType> inline Hyperplane& transform(const MatrixBase<XprType>& mat, TransformTraits traits = Affine) { if (traits==Affine) { normal() = mat.inverse().transpose() * normal(); m_coeffs /= normal().norm(); } else if (traits==Isometry) normal() = mat * normal(); else { ((0 && "invalid traits value in Hyperplane::transform()") ? static_cast<void> (0) : __assert_fail ("0 && \"invalid traits value in Hyperplane::transform()\"", "eigen-3.3.7/Eigen/src/Geometry/Hyperplane.h", 228, __PRETTY_FUNCTION__)); } return *this; } # 240 "eigen-3.3.7/Eigen/src/Geometry/Hyperplane.h" template<int TrOptions> inline Hyperplane& transform(const Transform<Scalar,AmbientDimAtCompileTime,Affine,TrOptions>& t, TransformTraits traits = Affine) { transform(t.linear(), traits); offset() -= normal().dot(t.translation()); return *this; } template<typename NewScalarType> inline typename internal::cast_return_type<Hyperplane, Hyperplane<NewScalarType,AmbientDimAtCompileTime,Options> >::type cast() const { return typename internal::cast_return_type<Hyperplane, Hyperplane<NewScalarType,AmbientDimAtCompileTime,Options> >::type(*this); } template<typename OtherScalarType,int OtherOptions> inline explicit Hyperplane(const Hyperplane<OtherScalarType,AmbientDimAtCompileTime,OtherOptions>& other) { m_coeffs = other.coeffs().template cast<Scalar>(); } template<int OtherOptions> bool isApprox(const Hyperplane<Scalar,AmbientDimAtCompileTime,OtherOptions>& other, const typename NumTraits<Scalar>::Real& prec = NumTraits<Scalar>::dummy_precision()) const { return m_coeffs.isApprox(other.m_coeffs, prec); } protected: Coefficients m_coeffs; }; } # 48 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/ParametrizedLine.h" 1 # 14 "eigen-3.3.7/Eigen/src/Geometry/ParametrizedLine.h" namespace Eigen { # 29 "eigen-3.3.7/Eigen/src/Geometry/ParametrizedLine.h" template <typename _Scalar, int _AmbientDim, int _Options> class ParametrizedLine { public: void *operator new(std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(size); } void *operator new[](std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(size); } void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } void operator delete(void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } void operator delete[](void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } void operator delete[](void * memory, void *ptr) throw() { return ::operator delete[](memory,ptr); } void* operator new(std::size_t size, const std::nothrow_t&) throw() { try { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(size); } catch (...) { return 0; } } void operator delete(void *ptr, const std::nothrow_t&) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } typedef void eigen_aligned_operator_new_marker_type; enum { AmbientDimAtCompileTime = _AmbientDim, Options = _Options }; typedef _Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; typedef Eigen::Index Index; typedef Matrix<Scalar,AmbientDimAtCompileTime,1,Options> VectorType; inline ParametrizedLine() {} template<int OtherOptions> ParametrizedLine(const ParametrizedLine<Scalar,AmbientDimAtCompileTime,OtherOptions>& other) : m_origin(other.origin()), m_direction(other.direction()) {} inline explicit ParametrizedLine(Index _dim) : m_origin(_dim), m_direction(_dim) {} ParametrizedLine(const VectorType& origin, const VectorType& direction) : m_origin(origin), m_direction(direction) {} template <int OtherOptions> explicit ParametrizedLine(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane); static inline ParametrizedLine Through(const VectorType& p0, const VectorType& p1) { return ParametrizedLine(p0, (p1-p0).normalized()); } ~ParametrizedLine() {} inline Index dim() const { return m_direction.size(); } const VectorType& origin() const { return m_origin; } VectorType& origin() { return m_origin; } const VectorType& direction() const { return m_direction; } VectorType& direction() { return m_direction; } RealScalar squaredDistance(const VectorType& p) const { VectorType diff = p - origin(); return (diff - direction().dot(diff) * direction()).squaredNorm(); } RealScalar distance(const VectorType& p) const { using std::sqrt; return sqrt(squaredDistance(p)); } VectorType projection(const VectorType& p) const { return origin() + direction().dot(p-origin()) * direction(); } VectorType pointAt(const Scalar& t) const; template <int OtherOptions> Scalar intersectionParameter(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const; template <int OtherOptions> Scalar intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const; template <int OtherOptions> VectorType intersectionPoint(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const; template<typename NewScalarType> inline typename internal::cast_return_type<ParametrizedLine, ParametrizedLine<NewScalarType,AmbientDimAtCompileTime,Options> >::type cast() const { return typename internal::cast_return_type<ParametrizedLine, ParametrizedLine<NewScalarType,AmbientDimAtCompileTime,Options> >::type(*this); } template<typename OtherScalarType,int OtherOptions> inline explicit ParametrizedLine(const ParametrizedLine<OtherScalarType,AmbientDimAtCompileTime,OtherOptions>& other) { m_origin = other.origin().template cast<Scalar>(); m_direction = other.direction().template cast<Scalar>(); } bool isApprox(const ParametrizedLine& other, const typename NumTraits<Scalar>::Real& prec = NumTraits<Scalar>::dummy_precision()) const { return m_origin.isApprox(other.m_origin, prec) && m_direction.isApprox(other.m_direction, prec); } protected: VectorType m_origin, m_direction; }; template <typename _Scalar, int _AmbientDim, int _Options> template <int OtherOptions> inline ParametrizedLine<_Scalar, _AmbientDim,_Options>::ParametrizedLine(const Hyperplane<_Scalar, _AmbientDim,OtherOptions>& hyperplane) { if (Eigen::internal::static_assertion<static_cast<bool>(VectorType::IsVectorAtCompileTime && VectorType::SizeAtCompileTime==2)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {} direction() = hyperplane.normal().unitOrthogonal(); origin() = -hyperplane.normal()*hyperplane.offset(); } template <typename _Scalar, int _AmbientDim, int _Options> inline typename ParametrizedLine<_Scalar, _AmbientDim,_Options>::VectorType ParametrizedLine<_Scalar, _AmbientDim,_Options>::pointAt(const _Scalar& t) const { return origin() + (direction()*t); } template <typename _Scalar, int _AmbientDim, int _Options> template <int OtherOptions> inline _Scalar ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersectionParameter(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const { return -(hyperplane.offset()+hyperplane.normal().dot(origin())) / hyperplane.normal().dot(direction()); } template <typename _Scalar, int _AmbientDim, int _Options> template <int OtherOptions> inline _Scalar ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const { return intersectionParameter(hyperplane); } template <typename _Scalar, int _AmbientDim, int _Options> template <int OtherOptions> inline typename ParametrizedLine<_Scalar, _AmbientDim,_Options>::VectorType ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersectionPoint(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const { return pointAt(intersectionParameter(hyperplane)); } } # 49 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/AlignedBox.h" 1 # 13 "eigen-3.3.7/Eigen/src/Geometry/AlignedBox.h" namespace Eigen { # 29 "eigen-3.3.7/Eigen/src/Geometry/AlignedBox.h" template <typename _Scalar, int _AmbientDim> class AlignedBox { public: void *operator new(std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(size); } void *operator new[](std::size_t size) { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(size); } void operator delete(void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } void operator delete[](void * ptr) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } void operator delete(void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } void operator delete[](void * ptr, std::size_t ) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } static void *operator new(std::size_t size, void *ptr) { return ::operator new(size,ptr); } static void *operator new[](std::size_t size, void* ptr) { return ::operator new[](size,ptr); } void operator delete(void * memory, void *ptr) throw() { return ::operator delete(memory,ptr); } void operator delete[](void * memory, void *ptr) throw() { return ::operator delete[](memory,ptr); } void* operator new(std::size_t size, const std::nothrow_t&) throw() { try { return Eigen::internal::conditional_aligned_malloc<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(size); } catch (...) { return 0; } } void operator delete(void *ptr, const std::nothrow_t&) throw() { Eigen::internal::conditional_aligned_free<bool(((_AmbientDim)!=Eigen::Dynamic) && ((sizeof(_Scalar)*(_AmbientDim))%16==0))>(ptr); } typedef void eigen_aligned_operator_new_marker_type; enum { AmbientDimAtCompileTime = _AmbientDim }; typedef _Scalar Scalar; typedef NumTraits<Scalar> ScalarTraits; typedef Eigen::Index Index; typedef typename ScalarTraits::Real RealScalar; typedef typename ScalarTraits::NonInteger NonInteger; typedef Matrix<Scalar,AmbientDimAtCompileTime,1> VectorType; typedef CwiseBinaryOp<internal::scalar_sum_op<Scalar>, const VectorType, const VectorType> VectorTypeSum; enum CornerType { Min=0, Max=1, BottomLeft=0, BottomRight=1, TopLeft=2, TopRight=3, BottomLeftFloor=0, BottomRightFloor=1, TopLeftFloor=2, TopRightFloor=3, BottomLeftCeil=4, BottomRightCeil=5, TopLeftCeil=6, TopRightCeil=7 }; inline AlignedBox() { if (AmbientDimAtCompileTime!=Dynamic) setEmpty(); } inline explicit AlignedBox(Index _dim) : m_min(_dim), m_max(_dim) { setEmpty(); } template<typename OtherVectorType1, typename OtherVectorType2> inline AlignedBox(const OtherVectorType1& _min, const OtherVectorType2& _max) : m_min(_min), m_max(_max) {} template<typename Derived> inline explicit AlignedBox(const MatrixBase<Derived>& p) : m_min(p), m_max(m_min) { } ~AlignedBox() {} inline Index dim() const { return AmbientDimAtCompileTime==Dynamic ? m_min.size() : Index(AmbientDimAtCompileTime); } inline bool isNull() const { return isEmpty(); } inline void setNull() { setEmpty(); } inline bool isEmpty() const { return (m_min.array() > m_max.array()).any(); } inline void setEmpty() { m_min.setConstant( ScalarTraits::highest() ); m_max.setConstant( ScalarTraits::lowest() ); } inline const VectorType& (min)() const { return m_min; } inline VectorType& (min)() { return m_min; } inline const VectorType& (max)() const { return m_max; } inline VectorType& (max)() { return m_max; } inline const CwiseBinaryOp<internal::scalar_quotient_op<typename internal::traits<VectorTypeSum>::Scalar,RealScalar>, const VectorTypeSum, const typename internal::plain_constant_type<VectorTypeSum,RealScalar>::type> center() const { return (m_min+m_max)/RealScalar(2); } inline const CwiseBinaryOp< internal::scalar_difference_op<Scalar,Scalar>, const VectorType, const VectorType> sizes() const { return m_max - m_min; } inline Scalar volume() const { return sizes().prod(); } inline CwiseBinaryOp< internal::scalar_difference_op<Scalar,Scalar>, const VectorType, const VectorType> diagonal() const { return sizes(); } # 146 "eigen-3.3.7/Eigen/src/Geometry/AlignedBox.h" inline VectorType corner(CornerType corner) const { if (Eigen::internal::static_assertion<static_cast<bool>(_AmbientDim <= 3)>::THIS_METHOD_IS_ONLY_FOR_VECTORS_OF_A_SPECIFIC_SIZE) {}; VectorType res; Index mult = 1; for(Index d=0; d<dim(); ++d) { if( mult & corner ) res[d] = m_max[d]; else res[d] = m_min[d]; mult *= 2; } return res; } inline VectorType sample() const { VectorType r(dim()); for(Index d=0; d<dim(); ++d) { if(!ScalarTraits::IsInteger) { r[d] = m_min[d] + (m_max[d]-m_min[d]) * internal::random<Scalar>(Scalar(0), Scalar(1)); } else r[d] = internal::random(m_min[d], m_max[d]); } return r; } template<typename Derived> inline bool contains(const MatrixBase<Derived>& p) const { typename internal::nested_eval<Derived,2>::type p_n(p.derived()); return (m_min.array()<=p_n.array()).all() && (p_n.array()<=m_max.array()).all(); } inline bool contains(const AlignedBox& b) const { return (m_min.array()<=(b.min)().array()).all() && ((b.max)().array()<=m_max.array()).all(); } inline bool intersects(const AlignedBox& b) const { return (m_min.array()<=(b.max)().array()).all() && ((b.min)().array()<=m_max.array()).all(); } template<typename Derived> inline AlignedBox& extend(const MatrixBase<Derived>& p) { typename internal::nested_eval<Derived,2>::type p_n(p.derived()); m_min = m_min.cwiseMin(p_n); m_max = m_max.cwiseMax(p_n); return *this; } inline AlignedBox& extend(const AlignedBox& b) { m_min = m_min.cwiseMin(b.m_min); m_max = m_max.cwiseMax(b.m_max); return *this; } inline AlignedBox& clamp(const AlignedBox& b) { m_min = m_min.cwiseMax(b.m_min); m_max = m_max.cwiseMin(b.m_max); return *this; } inline AlignedBox intersection(const AlignedBox& b) const {return AlignedBox(m_min.cwiseMax(b.m_min), m_max.cwiseMin(b.m_max)); } inline AlignedBox merged(const AlignedBox& b) const { return AlignedBox(m_min.cwiseMin(b.m_min), m_max.cwiseMax(b.m_max)); } template<typename Derived> inline AlignedBox& translate(const MatrixBase<Derived>& a_t) { const typename internal::nested_eval<Derived,2>::type t(a_t.derived()); m_min += t; m_max += t; return *this; } template<typename Derived> inline Scalar squaredExteriorDistance(const MatrixBase<Derived>& p) const; inline Scalar squaredExteriorDistance(const AlignedBox& b) const; template<typename Derived> inline NonInteger exteriorDistance(const MatrixBase<Derived>& p) const { using std::sqrt; return sqrt(NonInteger(squaredExteriorDistance(p))); } inline NonInteger exteriorDistance(const AlignedBox& b) const { using std::sqrt; return sqrt(NonInteger(squaredExteriorDistance(b))); } template<typename NewScalarType> inline typename internal::cast_return_type<AlignedBox, AlignedBox<NewScalarType,AmbientDimAtCompileTime> >::type cast() const { return typename internal::cast_return_type<AlignedBox, AlignedBox<NewScalarType,AmbientDimAtCompileTime> >::type(*this); } template<typename OtherScalarType> inline explicit AlignedBox(const AlignedBox<OtherScalarType,AmbientDimAtCompileTime>& other) { m_min = (other.min)().template cast<Scalar>(); m_max = (other.max)().template cast<Scalar>(); } bool isApprox(const AlignedBox& other, const RealScalar& prec = ScalarTraits::dummy_precision()) const { return m_min.isApprox(other.m_min, prec) && m_max.isApprox(other.m_max, prec); } protected: VectorType m_min, m_max; }; template<typename Scalar,int AmbientDim> template<typename Derived> inline Scalar AlignedBox<Scalar,AmbientDim>::squaredExteriorDistance(const MatrixBase<Derived>& a_p) const { typename internal::nested_eval<Derived,2*AmbientDim>::type p(a_p.derived()); Scalar dist2(0); Scalar aux; for (Index k=0; k<dim(); ++k) { if( m_min[k] > p[k] ) { aux = m_min[k] - p[k]; dist2 += aux*aux; } else if( p[k] > m_max[k] ) { aux = p[k] - m_max[k]; dist2 += aux*aux; } } return dist2; } template<typename Scalar,int AmbientDim> inline Scalar AlignedBox<Scalar,AmbientDim>::squaredExteriorDistance(const AlignedBox& b) const { Scalar dist2(0); Scalar aux; for (Index k=0; k<dim(); ++k) { if( m_min[k] > b.m_max[k] ) { aux = m_min[k] - b.m_max[k]; dist2 += aux*aux; } else if( b.m_min[k] > m_max[k] ) { aux = b.m_min[k] - m_max[k]; dist2 += aux*aux; } } return dist2; } # 383 "eigen-3.3.7/Eigen/src/Geometry/AlignedBox.h" typedef AlignedBox<int, 1> AlignedBox1i; typedef AlignedBox<int, 2> AlignedBox2i; typedef AlignedBox<int, 3> AlignedBox3i; typedef AlignedBox<int, 4> AlignedBox4i; typedef AlignedBox<int, Dynamic> AlignedBoxXi; typedef AlignedBox<float, 1> AlignedBox1f; typedef AlignedBox<float, 2> AlignedBox2f; typedef AlignedBox<float, 3> AlignedBox3f; typedef AlignedBox<float, 4> AlignedBox4f; typedef AlignedBox<float, Dynamic> AlignedBoxXf; typedef AlignedBox<double, 1> AlignedBox1d; typedef AlignedBox<double, 2> AlignedBox2d; typedef AlignedBox<double, 3> AlignedBox3d; typedef AlignedBox<double, 4> AlignedBox4d; typedef AlignedBox<double, Dynamic> AlignedBoxXd; } # 50 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Geometry/Umeyama.h" 1 # 19 "eigen-3.3.7/Eigen/src/Geometry/Umeyama.h" namespace Eigen { namespace internal { template<typename MatrixType, typename OtherMatrixType> struct umeyama_transform_matrix_type { enum { MinRowsAtCompileTime = (((int)MatrixType::RowsAtCompileTime == 0 || (int)OtherMatrixType::RowsAtCompileTime == 0) ? 0 : ((int)MatrixType::RowsAtCompileTime == 1 || (int)OtherMatrixType::RowsAtCompileTime == 1) ? 1 : ((int)MatrixType::RowsAtCompileTime == Dynamic || (int)OtherMatrixType::RowsAtCompileTime == Dynamic) ? Dynamic : ((int)MatrixType::RowsAtCompileTime <= (int)OtherMatrixType::RowsAtCompileTime) ? (int)MatrixType::RowsAtCompileTime : (int)OtherMatrixType::RowsAtCompileTime), HomogeneousDimension = int(MinRowsAtCompileTime) == Dynamic ? Dynamic : int(MinRowsAtCompileTime)+1 }; typedef Matrix<typename traits<MatrixType>::Scalar, HomogeneousDimension, HomogeneousDimension, AutoAlign | (traits<MatrixType>::Flags & RowMajorBit ? RowMajor : ColMajor), HomogeneousDimension, HomogeneousDimension > type; }; } # 93 "eigen-3.3.7/Eigen/src/Geometry/Umeyama.h" template <typename Derived, typename OtherDerived> typename internal::umeyama_transform_matrix_type<Derived, OtherDerived>::type umeyama(const MatrixBase<Derived>& src, const MatrixBase<OtherDerived>& dst, bool with_scaling = true) { typedef typename internal::umeyama_transform_matrix_type<Derived, OtherDerived>::type TransformationMatrixType; typedef typename internal::traits<TransformationMatrixType>::Scalar Scalar; typedef typename NumTraits<Scalar>::Real RealScalar; if (Eigen::internal::static_assertion<static_cast<bool>(!NumTraits<Scalar>::IsComplex)>::NUMERIC_TYPE_MUST_BE_REAL) {} if (Eigen::internal::static_assertion<static_cast<bool>((internal::is_same<Scalar, typename internal::traits<OtherDerived>::Scalar>::value))>::YOU_MIXED_DIFFERENT_NUMERIC_TYPES__YOU_NEED_TO_USE_THE_CAST_METHOD_OF_MATRIXBASE_TO_CAST_NUMERIC_TYPES_EXPLICITLY) {} enum { Dimension = (((int)Derived::RowsAtCompileTime == 0 || (int)OtherDerived::RowsAtCompileTime == 0) ? 0 : ((int)Derived::RowsAtCompileTime == 1 || (int)OtherDerived::RowsAtCompileTime == 1) ? 1 : ((int)Derived::RowsAtCompileTime == Dynamic || (int)OtherDerived::RowsAtCompileTime == Dynamic) ? Dynamic : ((int)Derived::RowsAtCompileTime <= (int)OtherDerived::RowsAtCompileTime) ? (int)Derived::RowsAtCompileTime : (int)OtherDerived::RowsAtCompileTime) }; typedef Matrix<Scalar, Dimension, 1> VectorType; typedef Matrix<Scalar, Dimension, Dimension> MatrixType; typedef typename internal::plain_matrix_type_row_major<Derived>::type RowMajorMatrixType; const Index m = src.rows(); const Index n = src.cols(); const RealScalar one_over_n = RealScalar(1) / static_cast<RealScalar>(n); const VectorType src_mean = src.rowwise().sum() * one_over_n; const VectorType dst_mean = dst.rowwise().sum() * one_over_n; const RowMajorMatrixType src_demean = src.colwise() - src_mean; const RowMajorMatrixType dst_demean = dst.colwise() - dst_mean; const Scalar src_var = src_demean.rowwise().squaredNorm().sum() * one_over_n; const MatrixType sigma = one_over_n * dst_demean * src_demean.transpose(); JacobiSVD<MatrixType> svd(sigma, ComputeFullU | ComputeFullV); TransformationMatrixType Rt = TransformationMatrixType::Identity(m+1,m+1); VectorType S = VectorType::Ones(m); if ( svd.matrixU().determinant() * svd.matrixV().determinant() < 0 ) S(m-1) = -1; Rt.block(0,0,m,m).noalias() = svd.matrixU() * S.asDiagonal() * svd.matrixV().transpose(); if (with_scaling) { const Scalar c = Scalar(1)/src_var * svd.singularValues().dot(S); Rt.col(m).head(m) = dst_mean; Rt.col(m).head(m).noalias() -= c*Rt.topLeftCorner(m,m)*src_mean; Rt.block(0,0,m,m) *= c; } else { Rt.col(m).head(m) = dst_mean; Rt.col(m).head(m).noalias() -= Rt.topLeftCorner(m,m)*src_mean; } return Rt; } } # 51 "eigen-3.3.7/Eigen/Geometry" 2 # 1 "eigen-3.3.7/Eigen/src/Core/util/ReenableStupidWarnings.h" 1 # 59 "eigen-3.3.7/Eigen/Geometry" 2 # 2 "t.cc" 2 struct m34 { float m[3][4]; }; typedef Eigen::Transform<double, 3, Eigen::AffineCompact, Eigen::DontAlign> Trafo3d; typedef Eigen::Map<Eigen::Matrix<float,3,4,Eigen::RowMajor> > mapType; Trafo3d func34(m34 mat) { Trafo3d mR = Trafo3d( mapType ( (float *)mat.m ).cast<double>() ); return mR; }
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