From 77e7dba1b5c361bcfd52a7b1a7af386dcd8d61fe Mon Sep 17 00:00:00 2001 From: Joshua Potter Date: Mon, 20 Jan 2025 08:49:48 -0700 Subject: [PATCH] Flashcard changes. --- .../plugins/obsidian-to-anki-plugin/data.json | 8 +++-- notes/_journal/2025-01-20.md | 9 ++++++ notes/_journal/{ => 2025-01}/2025-01-19.md | 0 notes/c17/alignment.md | 29 +++++++++---------- 4 files changed, 27 insertions(+), 19 deletions(-) create mode 100644 notes/_journal/2025-01-20.md rename notes/_journal/{ => 2025-01}/2025-01-19.md (100%) diff --git a/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json b/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json index c83d632..4f8f50a 100644 --- a/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json +++ b/notes/.obsidian/plugins/obsidian-to-anki-plugin/data.json @@ -956,7 +956,7 @@ "_journal/2024-10/2024-10-31.md": "8c5e70f566953974f252da9472e527f0", "_journal/2024-10/2024-10-30.md": "054bdbf52843fa2445f6b9f91d5ca46e", "_journal/2024-10/2024-10-29.md": "432b3b073dafd54421ff6f7182ab9a58", - "c17/alignment.md": "a1c0e0ad05827beba761f79b7105eedd", + "c17/alignment.md": "b86d988605530cb3c204fd0a4c87be44", "_journal/2024-11-05.md": "6a599e6bc9dcd12a0940956285ae4d00", "_journal/2024-11-06.md": "c91de8a099cfee2514e1054400996e76", "_journal/2024-11/2024-11-05.md": "79a1304037e18fefa135d576db040784", @@ -1465,12 +1465,14 @@ "_journal/2025-01-16.md": "e3a21059205784a4e88bfe3b4deac7f7", "_journal/2025-01-17.md": "08a5f05bb572db9495bfc2b4feb8e0a9", "_journal/2025-01/2025-01-16.md": "e3a21059205784a4e88bfe3b4deac7f7", - "trigonometry/index.md": "06c82d1cf3789cc8cefd37e6b64fdc4a", + "trigonometry/index.md": "b48577b0c5c6e4d587d597a0fcd08b0f", "geometry/circle.md": "9469e5512a6a92a962985eab99d00606", "_journal/2025-01-18.md": "8655fbf94aeec13efe9b6d2087c1f37e", "_journal/2025-01/2025-01-17.md": "08a5f05bb572db9495bfc2b4feb8e0a9", - "_journal/2025-01-19.md": "2acb8c3c37b9a44f06bac4903efed5ad", + "_journal/2025-01-19.md": "a37c6f534cf5e272619c5f813974afcf", "_journal/2025-01/2025-01-18.md": "7a1655887093f37ffe86309d90459b3b", + "_journal/2025-01-20.md": "2478f31199c1f0c2ffae2616b1ca435d", + "_journal/2025-01/2025-01-19.md": "65a56dcadec4f36c3a801cfb0de1a391", "trigonometry/unit-circle.md": "4a8fb4b5ac1bc2b645f18b0b8079897c" }, "fields_dict": { diff --git a/notes/_journal/2025-01-20.md b/notes/_journal/2025-01-20.md new file mode 100644 index 0000000..f999276 --- /dev/null +++ b/notes/_journal/2025-01-20.md @@ -0,0 +1,9 @@ +--- +title: "2025-01-20" +--- + +- [ ] Anki Flashcards +- [x] KoL +- [x] OGS +- [ ] Sheet Music (10 min.) +- [ ] Korean (Read 1 Story) \ No newline at end of file diff --git a/notes/_journal/2025-01-19.md b/notes/_journal/2025-01/2025-01-19.md similarity index 100% rename from notes/_journal/2025-01-19.md rename to notes/_journal/2025-01/2025-01-19.md diff --git a/notes/c17/alignment.md b/notes/c17/alignment.md index bc9068d..bf9e436 100644 --- a/notes/c17/alignment.md +++ b/notes/c17/alignment.md @@ -674,7 +674,6 @@ struct foo { unsigned bar : 31; }; ``` Back: N/A. This is correct. Reference: “ISO: Programming Languages - C17,” April 2017, [https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf](https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf). -Tags: x86-64 END%% @@ -686,7 +685,6 @@ struct foo { unsigned bar : 32; }; ``` Back: N/A. This is correct. Reference: “ISO: Programming Languages - C17,” April 2017, [https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf](https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf). -Tags: x86-64 END%% @@ -698,13 +696,12 @@ struct foo { unsigned bar : 33; }; ``` Back: The width of a bit-field cannot exceed its types (in this case `unsigned int`). Reference: “ISO: Programming Languages - C17,” April 2017, [https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf](https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf). -Tags: x86-64 END%% %%ANKI Basic -Assume a byte-sized storage unit, no overlapping units, and low-to-high order. How is the following packed in memory? +Assume a byte-sized storage unit, no overlapping units, and low-to-high order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -715,11 +712,11 @@ struct foo { Back: ```c struct foo { + _padding : 4; // 4 bits + signed c : 4; // 4 bits _padding : 2; // 2 bits signed b : 2; // 2 bits signed a : 4; // 4 bits - _padding : 4; // 4 bits - signed c : 4; // 4 bits }; ``` Reference: “ISO: Programming Languages - C17,” April 2017, [https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf](https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf). @@ -728,7 +725,7 @@ END%% %%ANKI Basic -Assume a byte-sized storage unit, overlapping units, and low-to-high order. How is the following packed in memory? +Assume a byte-sized storage unit, overlapping units, and low-to-high order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -739,10 +736,10 @@ struct foo { Back: ```c struct foo { - _padding : 4; // 4 bits - signed a : 4; // 4 bits _padding : 4; // 4 bits signed c : 4; // 4 bits + _padding : 4; // 4 bits + signed a : 4; // 4 bits }; ``` Reference: “ISO: Programming Languages - C17,” April 2017, [https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf](https://www.open-std.org/jtc1/sc22/wg14/www/abq/c17_updated_proposed_fdis.pdf). @@ -751,7 +748,7 @@ END%% %%ANKI Basic -Assume a byte-sized storage unit, overlapping units, and high-to-low order. How is the following packed in memory? +Assume a byte-sized storage unit, overlapping units, and high-to-low order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -774,7 +771,7 @@ END%% %%ANKI Basic -Assume a `32`-bit storage unit, no overlapping units, and low-to-high order. How is the following packed in memory? +Assume a `32`-bit storage unit, no overlapping units, and low-to-high order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -797,7 +794,7 @@ END%% %%ANKI Basic -Assume a byte-sized storage unit, overlapping units, and low-to-high order. How is the following packed in memory? +Assume a byte-sized storage unit, overlapping units, and low-to-high order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -820,7 +817,7 @@ END%% %%ANKI Basic -Assume a `32`-bit storage unit, no overlapping units, and low-to-high order. How is the following packed in memory? +Assume a `32`-bit storage unit, no overlapping units, and low-to-high order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -843,7 +840,7 @@ END%% %%ANKI Basic -Assume a byte-sized storage unit, overlapping units, and high-to-low order. How is the following packed in memory? +Assume a byte-sized storage unit, overlapping units, and high-to-low order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -866,7 +863,7 @@ END%% %%ANKI Basic -Assume a byte-sized storage unit, no overlapping units, and high-to-low order. How is the following packed in memory? +Assume a byte-sized storage unit, no overlapping units, and high-to-low order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4; @@ -890,7 +887,7 @@ END%% %%ANKI Basic -Assume a `32`-bit storage unit, overlapping units, and high-to-low order. How is the following packed in memory? +Assume a `32`-bit storage unit, overlapping units, and high-to-low order on a big-endian machine. How is the following packed in memory? ```c struct foo { signed a : 4;