Emulating a CPU in C++ #21 (6502) - ADC Absolute

In this video i implement tests for ADC (Add with Carry) to get just the absolute addressing mode working. The rest of the addressing modes are going to be dealt with in the next video. Also, i'm not dealing with decimal mode here, just binary addition.
Links:
Source for this project: github.com/davepoo/6502Emulator
Google Test: github.com/google/googletest
6502 Information: www.obelisk.me.uk/6502/
Timestamps
0:00 Intro
0:42 0 + 0 test
3:57 0 + 0 implemented
7:00 Refactoring the test
14:35 0 + 0 + carry test
15:17 Adding the carry
16:09 Testing unsigned overflow
18:27 Setting the carry flag
20:46 Testing negative result
23:45 Setting the negative flag
24:23 Testing -ve signed overflow
28:50 Setting the overflow flag
33:17 Testing +ve signed overflow
36:58 Basic addition tests
44:44 Closing comments

[@jamesExiledLegends]

You can detect carry with carryInput being a 1 or 0 (a&b) | (a&carryInput) | (b&carryInput) that way you dont need bigger number

[@DerykRobosson]

0:02 Typo in the test class name at the beginning of the video, "Registger" on line 4. 36:14 Update N comment value to be 1 on line 151.

[@twobob]

Interesting edge cases

[@M4RC90]

The title says Immediate but you've actually done Absolute here.

[@DavePoo]

Thanks, fixed it.

[@Handskemager]

Would a 16 or 32 bit cpu be more difficult or just more time consuming to make?

[@DavePoo]

I think it's not the number of bits that make it more complex but the number of features the CPU has. A modern CPU has all sorts of crazy instructions and floating point as well. But if you look at something like the Motorola 68000, it's got many of the features of the 6502 except it has a lot more registers (and it can multiply and divide, how advanced!), so the opcode set is much larger and you would need a different approach to the giant switch statement that I used in this emulator.