dazfuller

package permutation

import "sort"

func compare(a, b []int) int {
	for i := 0; i < len(a) && i < len(b); i++ {
		switch {
			case a[i] > b[i]:
				return 1
			case a[i] < b[i]:

dazfuller

using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading;
using System.Threading.Tasks;
using System.Diagnostics;

namespace PLinqDemo
{
    class Demo

dazfuller

#include <algorithm>
#include <iostream>
#include <string>
#include <vector>

using namespace std;

void FindValue(vector<string>& values, std::function<bool (const string&)> f)
{
    auto i = find_if(values.begin(), values.end(), f);

dazfuller

#include <iostream>
#include <string>
#include <vector>

using namespace std;

void cpp_old()
{
    std::vector<std::string> my_collection;
    my_collection.push_back("Hello");

dazfuller

#include <iostream>

#include "auto_return.h"

void Test::SetField(TestEnum t)
{
    _field = t;
}

auto Test::GetField() -> TestEnum

dazfuller

#include <iostream>
#include <map>
#include <string>
#include <vector>

std::map<int, std::vector<std::string>> MyFunction()
{
    std::vector<std::string> v1;
    v1.push_back("Hello");
    v1.push_back("World");

dazfuller

#include <iostream>
#include <map>
#include <string>
#include <vector>

using namespace std;

// Our method which takes an initialization list parameter
template<class T> void MyFunction(initializer_list<T> values)
{

dazfuller

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int main()
{
    vector<string> a = { "Ignoring", "The", "Voices" };
    for (const auto s : a)

dazfuller

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

void PrintList(const vector<int>& list)
{
    for (auto i : list)
    {

dazfuller

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

void PrintList(const vector<int>& list)
{
    for (auto i : list)
    {