João Quinaglia jodros

In the last years I've been asked multiple times about the comparison between raylib and SDL libraries. Unfortunately, my experience with SDL was quite limited so I couldn't provide a good comparison. In the last two years I've learned about SDL and used it to teach at University so I feel that now I can provide a good comparison between both.

Hope it helps future users to better understand this two libraries internals and functionality.

Conventional Commit Messages

See how a minor change to your commit message style can make a difference.

git commit -m"<type>(<optional scope>): <description>" \
  -m"<optional body>" \
  -m"<optional footer>"

Copied from http://code.lancepollard.com/complete-list-of-html-meta-tags/

Basic HTML Meta Tags

<meta charset='UTF-8'>
<meta name='keywords' content='your, tags'>
<meta name='description' content='150 words'>
<meta name='subject' content='your website's subject'>
<meta name='copyright' content='company name'>

	#include <iostream>

	unsigned char tape[30000] = {0};
	unsigned char* ptr = tape;

	void interpret(char* input)
	{
	char current_char;
	unsigned int i, loop;

	Basic
	=====

	[Shift]+[Mod]+[Enter] - launch terminal.

	[Mod]+[b] - show/hide bar.
	[Mod]+[p] - dmenu for running programs like the x-www-browser.
	[Mod]+[Enter] - push acive window from stack to master, or pulls last used window from stack onto master.

	[Mod] + [j / k] - focus on next/previous window in current tag.

	! model
	pc101 Generic 101-key PC
	pc102 Generic 102-key (Intl) PC
	pc104 Generic 104-key PC
	pc105 Generic 105-key (Intl) PC
	dell101 Dell 101-key PC
	latitude Dell Latitude series laptop
	dellm65 Dell Precision M65
	everex Everex STEPnote
	flexpro Keytronic FlexPro

	// Implementação do algoritmo de Dijkstra
	// Teste: http://br.spoj.com/problems/ENGARRAF/

	#include <iostream>
	#include <list>
	#include <queue>
	#define INFINITO 10000000

	using namespace std;

	// Grafos - DFS (busca em profundidade)

	#include <iostream>
	#include <list>
	#include <algorithm> // função find
	#include <stack> // pilha para usar na DFS

	using namespace std;

	class Grafo

	#include <iostream>
	using namespace std;

	class No
	{
	private:
	No esq, dir;
	int chave;

	public:

	// Sobrecarga do operador +

	#include <iostream>

	using namespace std;

	class Complexo
	{
	public:
	int real, imag;