maxtruxa

#include "StdAfx.h"
#include <cmath>

bresenham_line::bresenham_line()
    : _x{}, _y{}, _error{}, _first_iteration{} { }

void bresenham_line::initialize(point_t const& start, point_t const& end)
{
    this->initialize(start.X, start.Y, end.X, end.Y);
}

maxtruxa

#include <iostream>
#include <memory>

int main() {
    struct my_type {
        void poke() { std::cout << "poke\n"; }
    };
    typedef my_type* my_type_ptr;

    struct my_deleter {

maxtruxa

template<typename TMapIterator>
class key_iterator : public TMapIterator
{
public:
    typedef typename TMapIterator::value_type::first_type key_type;

    key_iterator() : TMapIterator() { }
    key_iterator(TMapIterator iter) : TMapIterator(iter) { }

    key_type* operator->()

maxtruxa

Example Paths

Examples below use the following paths:

Windows	Posix
C:\Foo\Bar\Baz.xyz	/foo/bar/baz.xyz

Path Decomposition

maxtruxa

//
// The MIT License (MIT)
//
// Copyright (c) 2013-2014 Max Truxa
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to deal in
// the Software without restriction, including without limitation the rights to
// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software is furnished to do so,

maxtruxa

//
// The MIT License (MIT)
//
// Copyright (c) 2013-2014 Max Truxa
//
// Permission is hereby granted, free of charge, to any person obtaining a copy of
// this software and associated documentation files (the "Software"), to deal in
// the Software without restriction, including without limitation the rights to
// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
// the Software, and to permit persons to whom the Software is furnished to do so,