Consolidating Debug Links and Groups
Quotes ▼
Quote 473
Sweet child of mine.
—molly_rocket, 19th April, 2016
[α]15:23
Filter mode:
Topics
Media
(null topic)
🗪Chat Comment
🖮Programming🟉
🗩Speech
🎭
🏟
🔗
Link to: current timestamp
Credits
Host
Casey Muratori
Indexer
Matt Mascarenhas
?
?

Keyboard Navigation

Global Keys

[, < / ], > Jump to previous / next episode
W, K, P / S, J, N Jump to previous / next timestamp
t / T Toggle theatre / SUPERtheatre mode
V Revert filter to original state Y Select link (requires manual Ctrl-c)

Menu toggling

q Quotes r References f Filter y Link c Credits

In-Menu and Index Controls

a
w
s
d
h j k l
←
↑
↓
→

Esc Close menu / unfocus timestamp

Quotes and References Menus and Index

Enter Jump to timestamp

Quotes, References and Credits Menus

o Open URL (in new tab)

Filter Menu

x, Space Toggle category and focus next
X, ShiftSpace Toggle category and focus previous
v Invert topics / media as per focus

Filter and Link Menus

z Toggle filter / linking mode

Credits Menu

Enter Open URL (in new tab)
1:50Recap and set the stage for the day
1:50Recap and set the stage for the day
1:50Recap and set the stage for the day
6:59handmade_debug.cpp: Delete a load of superfluous code
6:59handmade_debug.cpp: Delete a load of superfluous code
6:59handmade_debug.cpp: Delete a load of superfluous code
8:504coder: Rare crash
8:504coder: Rare crash
8:504coder: Rare crash
10:24handmade_debug.h: Rename DEBUGDrawMainMenu to DrawTrees and split it out into a recursive function called DrawTreeLink
10:24handmade_debug.h: Rename DEBUGDrawMainMenu to DrawTrees and split it out into a recursive function called DrawTreeLink
10:24handmade_debug.h: Rename DEBUGDrawMainMenu to DrawTrees and split it out into a recursive function called DrawTreeLink
15:23"Sweet child of mine"α
15:23"Sweet child of mine"α
15:23"Sweet child of mine"α
21:37handmade_debug.cpp: Make DrawTrees call DrawTreeLink
21:37handmade_debug.cpp: Make DrawTrees call DrawTreeLink
21:37handmade_debug.cpp: Make DrawTrees call DrawTreeLink
22:36View our improved profiler and consider how to proceed with it
22:36View our improved profiler and consider how to proceed with it
22:36View our improved profiler and consider how to proceed with it
29:23Debugger: Jump into DrawTrees and inspect the Tree after cloning
29:23Debugger: Jump into DrawTrees and inspect the Tree after cloning
29:23Debugger: Jump into DrawTrees and inspect the Tree after cloning
35:14handmade_debug.h: Turn debug_variable_link into a linked struct with a fake Sentinel and port everything to it
35:14handmade_debug.h: Turn debug_variable_link into a linked struct with a fake Sentinel and port everything to it
35:14handmade_debug.h: Turn debug_variable_link into a linked struct with a fake Sentinel and port everything to it
54:54handmade_shared.h: Make StringsAreEqual handle NULL
54:54handmade_shared.h: Make StringsAreEqual handle NULL
54:54handmade_shared.h: Make StringsAreEqual handle NULL
56:49View our profiler and see that cloning works again
56:49View our profiler and see that cloning works again
56:49View our profiler and see that cloning works again
56:59handmade_debug.cpp: Make CloneVariableLink just do the direct clone and return it
56:59handmade_debug.cpp: Make CloneVariableLink just do the direct clone and return it
56:59handmade_debug.cpp: Make CloneVariableLink just do the direct clone and return it
59:05Test cloning the profiler
59:05Test cloning the profiler
59:05Test cloning the profiler
59:59Q&A
🗩
59:59Q&A
🗩
59:59Q&A
🗩
1:00:43garryjohanson I feel I kinda lost the forecast for the trees this episode. Would you mind recapping?
🗪
1:00:43garryjohanson I feel I kinda lost the forecast for the trees this episode. Would you mind recapping?
🗪
1:00:43garryjohanson I feel I kinda lost the forecast for the trees this episode. Would you mind recapping?
🗪
1:01:06Blackboard: Linked structs
1:01:06Blackboard: Linked structs
1:01:06Blackboard: Linked structs
1:12:52Blackboard: Walking the tree with a recursive function
1:12:52Blackboard: Walking the tree with a recursive function
1:12:52Blackboard: Walking the tree with a recursive function
1:15:38dudeinbasement1 Thoughts on linked lists, and cache friendliness? I found that a simple array, and just copying when it changes length, was way faster
🗪
1:15:38dudeinbasement1 Thoughts on linked lists, and cache friendliness? I found that a simple array, and just copying when it changes length, was way faster
🗪
1:15:38dudeinbasement1 Thoughts on linked lists, and cache friendliness? I found that a simple array, and just copying when it changes length, was way faster
🗪
1:17:08Blackboard: Cache friendliness
1:17:08Blackboard: Cache friendliness
1:17:08Blackboard: Cache friendliness
1:21:12pseudonym73 Concurrency also matters. Linked lists can be better if you need multiple threads working on the list at the same time
🗪
1:21:12pseudonym73 Concurrency also matters. Linked lists can be better if you need multiple threads working on the list at the same time
🗪
1:21:12pseudonym73 Concurrency also matters. Linked lists can be better if you need multiple threads working on the list at the same time
🗪
1:21:48cubercaleb How do you feel about object pools as a sort of middle ground between linked lists and arrays?
🗪
1:21:48cubercaleb How do you feel about object pools as a sort of middle ground between linked lists and arrays?
🗪
1:21:48cubercaleb How do you feel about object pools as a sort of middle ground between linked lists and arrays?
🗪
1:24:19Wrap it up
🗩
1:24:19Wrap it up
🗩
1:24:19Wrap it up
🗩