Oguzhan KATLI nixiz

## two_singleton_dtor_problem.cpp
#include <stdio.h>

/*
 * Simple template singleton base class
 */
template<typename T>
class Singleton {
protected:
  Singleton() = default;
  Singleton(const Singleton&) = delete;

## const_placement_example.cpp
template <typename T>
void test(T p) {
    (*p)++;                           // increment by value
    p++;                              // increment pointer to next element
}

void testrun1()
{
    int value[2] {0, 1};
    test<int *>(&value[0]);           // 1. compiles and runs successfuly

## blackhole.hpp
#include <everything>

template <typename AnyThing>
[[ noreturn ]] void blackhole(AnyThing *obj)
{
  delete obj;
}

## mersenne_twister_seed_finder.cpp
// MersenneTwisterSeedFinder.cpp
// Copyright (c) Oguzhan KATLI. All rights reserved.

#include <random>
#include <string>
#include <iostream>
#include <thread>
#include <vector>
#include <numeric>
#include <algorithm>

## singleton.hpp
#include <iostream>
#include <string>
#include <memory>
#include <cassert>

template <class T>
class Singleton
{
public:
    using Type = typename std::remove_all_extents<T>::type;

## primitive_template_expressions.cpp
#include <iostream>

namespace dtl // detail
{
  template <typename T1, typename T2 = T1>
  struct carpma_t {
    typedef T1 tipi;
  };

  template <>

## another-fix-parser.cpp
#include <iostream>
#include <string>
#include <string_view>
#include <vector>
#include <algorithm>
#include <execution>

using namespace std;

// fix mesaj tag'leri için kullanılacak parser sınıflarının deklerasyonları

## cache_friendly_programming.cpp
#include <benchmark/benchmark.h>
#include <iostream>
#include <random>
#include <algorithm>
#include <vector>
#include <chrono>
#include <iterator>
#include <execution>

static void count_if_random(benchmark::State& state)

## threadpool.cc
#include <iostream>
#include <memory>
#include <thread>
#include <mutex>
#include <future>
#include <condition_variable>
#include <functional>
#include <vector>
#include <deque>
#include <type_traits>

## cpp20-range-example.cpp
#include <iostream>
#include <vector>
#include <string>
#include <string_view>
#include <chrono>
#include <random>
#include <range/v3/all.hpp>
#include <ranges>

using namespace std;
	#include <stdio.h>

	/*
	* Simple template singleton base class
	*/
	template<typename T>
	class Singleton {
	protected:
	Singleton() = default;
	Singleton(const Singleton&) = delete;
	template <typename T>
	void test(T p) {
	(*p)++; // increment by value
	p++; // increment pointer to next element
	}

	void testrun1()
	{
	int value[2] {0, 1};
	test<int *>(&value[0]); // 1. compiles and runs successfuly
	#include <everything>

	template <typename AnyThing>
	[[ noreturn ]] void blackhole(AnyThing *obj)
	{
	delete obj;
	}
	// MersenneTwisterSeedFinder.cpp
	// Copyright (c) Oguzhan KATLI. All rights reserved.

	#include <random>
	#include <string>
	#include <iostream>
	#include <thread>
	#include <vector>
	#include <numeric>
	#include <algorithm>
	#include <iostream>
	#include <string>
	#include <memory>
	#include <cassert>

	template <class T>
	class Singleton
	{
	public:
	using Type = typename std::remove_all_extents<T>::type;
	#include <iostream>

	namespace dtl // detail
	{
	template <typename T1, typename T2 = T1>
	struct carpma_t {
	typedef T1 tipi;
	};

	template <>
	#include <iostream>
	#include <string>
	#include <string_view>
	#include <vector>
	#include <algorithm>
	#include <execution>

	using namespace std;

	// fix mesaj tag'leri için kullanılacak parser sınıflarının deklerasyonları
	#include <benchmark/benchmark.h>
	#include <iostream>
	#include <random>
	#include <algorithm>
	#include <vector>
	#include <chrono>
	#include <iterator>
	#include <execution>

	static void count_if_random(benchmark::State& state)