| #include <time.h> // Robert Nystrom | |
| #include <stdio.h> // @munificentbob | |
| #include <stdlib.h> // for Ginny | |
| #define r return // 2008-2019 | |
| #define l(a, b, c, d) for (i y=a;y\ | |
| <b; y++) for (int x = c; x < d; x++) | |
| typedef int i;const i H=40;const i W | |
| =80;i m[40][80];i g(i x){r rand()%x; | |
| }void cave(i s){i w=g(10)+5;i h=g(6) | |
| +3;i t=g(W-w-2)+1;i u=g(H-h-2)+1;l(u |
As C programmers, most of us think of pointer arithmetic for multi-dimensional arrays in a nested way:
The address for a 1-dimensional array is base + x.
The address for a 2-dimensional array is base + x + y*x_size for row-major layout and base + y + x*y_size for column-major layout.
The address for a 3-dimensional array is base + x + (y + z*y_size)*x_size for row-column-major layout.
And so on.
| #include <stdio.h> | |
| #include <errno.h> | |
| #include <stdlib.h> | |
| #include <stdint.h> | |
| #include <assert.h> | |
| #include <string.h> | |
| #define streq(a, b) (!strcmp((a), (b))) | |
| #ifndef __USE_GNU | |
| #define __USE_GNU |
| Why do compilers even bother with exploiting undefinedness signed overflow? And what are those | |
| mysterious cases where it helps? | |
| A lot of people (myself included) are against transforms that aggressively exploit undefined behavior, but | |
| I think it's useful to know what compiler writers are accomplishing by this. | |
| TL;DR: C doesn't work very well if int!=register width, but (for backwards compat) int is 32-bit on all | |
| major 64-bit targets, and this causes quite hairy problems for code generation and optimization in some | |
| fairly common cases. The signed overflow UB exploitation is an attempt to work around this. |
| // Xeno | |
| enum Xeno_Kind { | |
| XENO_POINTER, | |
| XENO_AGGREGATE, | |
| XENO_FIRST_PRIMITIVE_TYPE, | |
| XENO_UINT8 = XENO_FIRST_PRIMITIVE_TYPE, | |
| XENO_UINT16, | |
| XENO_UINT32, | |
| XENO_UINT64, |
| <?xml version="1.0" encoding="UTF-8"?> | |
| <opml version="1.0"> | |
| <head> | |
| <title>Graphics, Games, Programming, and Physics Blogs</title> | |
| </head> | |
| <body> | |
| <outline text="Tech News" title="Tech News"> | |
| <outline type="rss" text="Ars Technica" title="Ars Technica" xmlUrl="http://feeds.arstechnica.com/arstechnica/index/" htmlUrl="https://arstechnica.com"/> | |
| <outline type="rss" text="Polygon - Full" title="Polygon - Full" xmlUrl="http://www.polygon.com/rss/index.xml" htmlUrl="https://www.polygon.com/"/> | |
| <outline type="rss" text="Road to VR" title="Road to VR" xmlUrl="http://www.roadtovr.com/feed" htmlUrl="https://www.roadtovr.com"/> |
| static file_fixup * | |
| FixupListSort(file_fixup *List) | |
| { | |
| // This is bog-standard mergesort. | |
| // Base case: 0- and 1-element lists | |
| if (!List || !List->Next) | |
| { | |
| return(List); | |
| } |
| enum { BMAX = 32, BMIN = BMAX / 2, BHEIGHT = 6 }; | |
| struct BNode { | |
| uint32_t length; | |
| Key keys[BMAX]; | |
| union { | |
| BNode *children[BMAX]; | |
| Value values[BMAX]; | |
| }; | |
| }; |
| #pragma once | |
| #include "IconsFontAwesome.h" // from https://github.com/juliettef/IconFontCppHeaders | |
| namespace ImGui | |
| { | |
| inline void SetupImGuiStyle( bool bStyleDark_, float alpha_ ) | |
| { |
Orthodox C++ (sometimes referred as C+) is minimal subset of C++ that improves C, but avoids all unnecessary things from so called Modern C++. It's exactly opposite of what Modern C++ suppose to be.
