Christian Sagartz

Christian Sagartz (born 1981) is an Austrian politician of the Austrian People's Party who has been serving as Member of the European Parliament since 2020.

Christian Sagartz

Member of the European Parliament
for Austria
Assumed office
23 January 2020
Personal details
Born (1981-01-16) 16 January 1981
NationalityAustrian
Political party Austrian People's Party
European People's Party

Early life and education

Sagartz holds a BA in political science and a master's degree in political advice.

Political career

Sagartz holds several positions in Pöttsching: councillor (since 2002), vice-mayor (since 2007), and chairman of the town's party in 2006. He was the Burgenland chairman of Young People's Party from 2002 to 2008 and became chairman of the Mattersburg district chapter in 2010. He became a member of the Landtag on 25 October 2005.[1]

Member of the European Parliament, 2020–present

Sagartz has been a Member of the European Parliament since 2020. In parliament, he has since served on the Committee on Development and the Subcommittee on Human Rights.[2]

In addition to his committee assignments, Sagartz is a substitute member of the parliament's delegations to the EU-Albania Stabilisation and Association Parliamentary Committee; the EU-Montenegro Stabilisation and Association Parliamentary Committee; the ACP–EU Joint Parliamentary Assembly; and for relations with South Africa.

gollark: The rest of the instruction consists of variable-width (for fun) target specifiers. The first N target specifiers in an operation are used as destinations and the remaining ones as sources. N varies per opcode. They can be of the form `000DDD` (pop/push from/to stack index DDD), `001EEE` (peek stack index EEE if source, if destination then push onto EEE if it is empty), `010FFFFFFFF` (8-bit immediate value FFFFFFFF; writes are discarded), `011GGGGGGGGGGGGGGGG` (16-bit immediate value GGGGGGGGGGGGGGGG; writes are also discarded), `100[H 31 times]` (31-bit immediate because bee you), `101IIIIIIIIIIIIIIII` (16 bits of memory location relative to the base memory address register of the stack the operation is conditional on), `110JJJJJJJJJJJJJJJJ` (16 bit memory location relative to the top value on that stack instead), `1111LLLMMM` (memory address equal to base memory address of stack LLL plus top of stack MMM), or `1110NNN` (base memory address register of stack MMM).Opcodes (numbered from 0 in order): MOV (1 source, as many destinations as can be parsed validly; the value is copied to all of them), ADD (1 destination, multiple sources), JMP (1 source), NOT (same as MOV), WR (write to output port; multiple sources, first is port number), RE (read from input port; one source for port number, multiple destinations), SUB, AND, OR, XOR, SHR, SHL (bitwise operations), MUL, ROR, ROL, NOP, MUL2 (multiplication with two outputs).
gollark: osmarksISA™️-2028 is a VLIW stack machine. Specifically, it executes a 384-bit instruction composed of 8 48-bit operations in parallel. There are 8 stacks, for safety. Each stack also has an associated base memory address register, which is used in some "addressing modes". Each stack holds 64-bit integers; popping/peeking an empty stack simply returns 0, and the stacks can hold at most 32 items. Exceeding a stack's capacity is runtime undefined behaviour. The operation encoding is: `AABBBCCCCCCCCC`:A = 2-bit conditional operation mode - 0 is "run unconditionally", 1 is "run if top value on stack is 0", 2 is "run if not 0", 3 is "run if first bit is ~~negative~~ 1".B = 3-bit index for the stack to use for the conditional.C = 9-bit opcode (for extensibility).
gollark: By "really fast", I mean "in a few decaminutes, probably".
gollark: I suppose I could just specify it really fast.
gollark: I could, but do I really want to?

References

  1. Profile at Landtag site
  2. Profile at European Parliament
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.