Brett Mydske
Brett Mydske (born July 30, 1988 in New Westminster, British Columbia) is a lacrosse player for the Saskatchewan Rush in the National Lacrosse League.[1] Mydske was drafted in the third round (25th overall) in the 2009 NLL Entry Draft by the Rush.
| Born | July 30, 1988 New Westminster, British Columbia, Canada |
|---|---|
| Nationality | Canada |
| Height | 6 ft 4 in (1.93 m) |
| Weight | 205 pounds (93 kg) |
| Position | Defense |
| NLL draft | 25th overall, 2009 Edmonton Rush |
| NLL team | Saskatchewan Rush |
| Pro career | 2010– |
Statistics
NLL
| Regular Season | Playoffs | ||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Season | Team | GP | G | A | Pts | LB | PIM | GP | G | A | Pts | LB | PIM | ||
| 2010 | Edmonton | 15 | 4 | 6 | 10 | 67 | 32 | 2 | 0 | 0 | 0 | 6 | 2 | ||
| 2011 | Edmonton | 16 | 8 | 4 | 12 | 50 | 30 | -- | -- | -- | -- | -- | -- | ||
| 2012 | Edmonton | 16 | 4 | 3 | 7 | 48 | 18 | 3 | 0 | 2 | 2 | 7 | 0 | ||
| 2013 | Edmonton | 16 | 6 | 4 | 10 | 72 | 18 | 1 | 0 | 0 | 0 | 5 | 2 | ||
| 2014 | Edmonton | 18 | 4 | 5 | 9 | 58 | 22 | 3 | 0 | 0 | 0 | 2 | 0 | ||
| 2015 | Edmonton | 18 | 1 | 2 | 3 | 38 | 12 | 5 | 0 | 1 | 1 | 9 | 4 | ||
| 2016 | Saskatchewan | 18 | 2 | 9 | 11 | 70 | 12 | 4 | 1 | 1 | 2 | 14 | 0 | ||
| 2017 | Saskatchewan | 12 | 1 | 3 | 4 | 34 | 19 | -- | -- | -- | -- | -- | -- | ||
| NLL Totals | 129 | 30 | 36 | 66 | 437 | 163 | 18 | 1 | 4 | 5 | 43 | 8 | |||
gollark: All numbers are two's complement because bee you.
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.
References
- "MYDSKE, Brett". Langley Thunder. Archived from the original on February 4, 2013. Retrieved June 24, 2012.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.