Goals: Add links that are reasonable and good explanations of how stuff works. No hype and no vendor content if possible. Practical first-hand accounts of models in prod eagerly sought.

**Note: In all below, slave can also mean interconnect
Portable Version KEYS: | |
P6Z3T-UYJC9-YAK3F-APN9M-6ZDSD | |
FGZPK-93CWX-Q33Y6-D5URV-YXC3X | |
9CZQX-9YAQA-PF33L-XVUQH-NSD48 | |
8RZ3L-H3Y5L-W2RY5-Z5M8N-C7Z2U | |
CCZNU-LW3LF-K9V2T-MYZFF-94667 | |
EWZM6-3W4UX-KH922-C96GK-VGBH2 | |
Standard Version KEYS: | |
4AZNW-S2YHE-LLMWM-J6EL8-7QKDL |
As tested on Linux:
I think I’ve figured out most parts of the cubical type theory papers; I’m going to take a shot to explain it informally in the format of Q&As. I prefer using syntax or terminologies that fit better rather than the more standard ones.
Q: What is cubical type theory?
A: It’s a type theory giving homotopy type theory its computational meaning.
Q: What is homotopy type theory then?
A: It’s traditional type theory (which refers to Martin-Löf type theory in this Q&A) augmented with higher inductive types and the univalence axiom.
What is strict aliasing? First we will describe what is aliasing and then we can learn what being strict about it means.
In C and C++ aliasing has to do with what expression types we are allowed to access stored values through. In both C and C++ the standard specifies which expression types are allowed to alias which types. The compiler and optimizer are allowed to assume we follow the aliasing rules strictly, hence the term strict aliasing rule. If we attempt to access a value using a type not allowed it is classified as undefined behavior(UB). Once we have undefined behavior all bets are off, the results of our program are no longer reliable.
Unfortunately with strict aliasing violations, we will often obtain the results we expect, leaving the possibility the a future version of a compiler with a new optimization will break code we th
www.iuqerfsodp9ifjaposdfjhgosurijfaewrwergwea.com
is up the virus exits instead of infecting the host. (source: malwarebytes). This domain has been sinkholed, stopping the spread of the worm. Will not work if proxied (source).update: A minor variant of the viru
/** | |
** tishion#163.com | |
** 2016-01-28 18:52:34 | |
**/ | |
PLDR_DATA_TABLE_ENTRY GetModuleEntryInLoadOrderModuleList(HMODULE hMod) | |
{ | |
PPEB pPeb = NULL; | |
// Get the base address of PEB struct |
I've heard a number of people praise the Greiner-Hormann algorithm for clipping arbitrary polygons. They say it has a certain conceptual simplicity and elegance.
@jasondavies is utilizing Greiner-Hormann for D3's polygon clipping operations (2D and spherical). He recently gave a demo of boolean operations on polygons based on as-of-yet unreleased work here.
His earlier clipping demos can be found here and here.
@w8r has a nice, clean implementation of the algorithm for 2D clipping operations with no dependencies. He provides an adapter for clipping polygon regions defin