Skip to content

Instantly share code, notes, and snippets.

View MORTAL2000's full-sized avatar

MORTAL MORTAL2000

12 followers · 1 following
View GitHub Profile
@MORTAL2000
MORTAL2000 / vertex_tut00.cpp
Last active July 13, 2016 02:48
#include <SFML/Graphics.hpp>
#include <vector>
void pollEvent(sf::RenderWindow& window)
{
sf::Event event;
while (window.pollEvent(event))
{
if (event.type == sf::Event::Closed)
window.close();
@MORTAL2000
MORTAL2000 / rounded
Created July 11, 2016 07:25
class RoundedRectangleShape : public sf::Shape
{
public:
explicit RoundedRectangleShape(const sf::Vector2f& size = {})
: size(size)
, radius(10.f)
, pointCount(4)
, totalPoints(4 * 4)
{
update();
@MORTAL2000
MORTAL2000 / test00.cpp
Last active July 9, 2016 21:26
#include <SFML/Graphics.hpp>
#include <iostream>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <array>
#include <vector>
#include <utility>
#include <queue>
#include <tuple>
@MORTAL2000
MORTAL2000 / astar.h
Created July 2, 2016 17:22 — forked from codemonkey-uk/astar.h
The C++ header file "astar.h" implements the A* graph search (route finding) algorithm using a C++ function template. The interface is written in an STL like style.
// -------------------------------------------------------------------------
// Filename: astar.h
// Version: 1.24
// Date: 2002/03/08
// Purpose: Provide template for a* algorythm
// (c) T.Frogley 1999-2002
// -------------------------------------------------------------------------
#ifndef ASTAR_H
#define ASTAR_H
@MORTAL2000
MORTAL2000 / sin.cpp
Created July 2, 2016 05:22
//https://codereview.stackexchange.com/questions/133668/constexpr-sin-function-c-14
#include <type_traits>
#include <limits>
#include <array>
#include <cmath>
#include <iostream>
template<std::size_t... Is> struct seq{};
template<std::size_t N, std::size_t... Is>
@MORTAL2000
MORTAL2000 / dijkstra00.cpp
Last active April 21, 2020 20:12
#include <vector>
#include <iostream>
#include <map>
#include <algorithm>
#include <string>
using namespace std;
const char FLOOR = '1' ;
@MORTAL2000
MORTAL2000 / maze00.cpp
Last active July 1, 2016 03:35
/*******************************************************************************************
* Name: Jay Seong *
* Description: Randomly generates a perfect maze using depth-first search algorithm *
* Date: 02/11/2010 *
* Data Structures: Double array of structs for cells, stack for back-tracking *
* Others: fstream is used to save maze into a file *
* *
* NOTE: Transcribed from a YouTube video https://www.youtube.com/watch?v=EvAzVhAii_o by *
* Stephen Pendley to distribute for public use. All credit for this version of the code *
* and it's original goes to Jay Seong. *
@MORTAL2000
MORTAL2000 / binarytree.cpp
Last active August 2, 2019 15:58
#include <iostream>
#include <memory>
#include <stack>
/* A binary tree node has data, pointer to left child
and a pointer to right child */
struct Node
{
Node(int data) : data(data), left(nullptr), right(nullptr) {}
int data;
@MORTAL2000
MORTAL2000 / calc00.cpp
Last active June 30, 2016 05:23
#include<iostream>
#include<cmath>
#include<stdio.h>
#include<cstdlib>
#include<map>
#include<stack>
using namespace std;
int expression_value(string str)
{
@MORTAL2000
MORTAL2000 / chutes_ladders.cpp
Last active June 22, 2016 15:34
//http://codereview.stackexchange.com/questions/132587/sketch-of-chutes-and-ladders-game
#include <iostream>
#include <iomanip>
#include <vector>
#include <random>
#include <algorithm>
#include <array>
#include <vector>
#include <utility>
#include <cmath>