maxgoren

struct Point {
  int x;
  int y;
  char s;
  bool blocks;
  color_t color;
  bool operator==(const Point& other) const {
    return x == other.x && y == other.y;
  }
  bool operator!=(const Point& other) const {

maxgoren

struct Point {
  int x;
  int y;
  char s;
  bool blocks;
  color_t color;
  bool operator==(const Point& other) const {
    return x == other.x && y == other.y;
  }

maxgoren

//How it works:  automaton()->prep_fields()->place_seeds()->four_five()->flood_fill()->automaton() -> done.
//                                                            v   ^ 
//                                                      count_neighbors()
//How its used: Cave myCave(160, 40);
//              myCave.automaton();
//
//The completed cave is then available as myCave.layout;
#include <array>
#include <vector>
#include <list>

maxgoren

template <typename T>
void shellSort(vector<T>& arr) 
{ 
    int N = arr.size(); 
    for (int gap = N/2; gap > 0; gap /= 2) 
    { 
        for (int i = gap; i < N; i += 1) 
        { 
            int temp = arr[i]; 
            int j; 

maxgoren

#include <iostream>
using namespace std;

struct Student {
    std::string name;
    int age;
    int grade_level;
    double gpa;
};

maxgoren

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct retVals {
        double result;
        char *str;
};

struct retVals* baz(int foo, int bar)

maxgoren

#include <iostream>
using namespace std;

std::pair<double, string> baz(int foo, int bar)
{
    double ans = double(foo)/double(bar);
    return std::make_pair(ans, "Just Because.");
}

int main()

maxgoren

std::tuple<double, string, float, float> baz(int foo, int bar)
{
    double ans = double(foo)/double(bar);
    return std::make_tuple(ans, "Just Because.", float(foo), float(bar));
}

int main()
{
    auto [answer, reply, foo, bar] = baz(8, 3);
    std::cout<<foo<<"/"<<bar<<" = ";

maxgoren

private Node<K,V> getMin(Node<K,V> h)
{
    if (h.leftChild() == null)
         return h;
    return getMin(h.leftChild());
}

private Node<K,V> deleteMin(Node<K,V> h)
{
     if (h.leftChild() == null)

maxgoren

    private Node<K,V> delete(Node<K,V> h, K key)
    {
        if (h == null)
            return null;

        if (key.compareTo(h.key()) < 0)
           h.setLeft(delete(h.leftChild(), key));
        else if (key.compareTo(h.key()) > 0)
           h.setRight(delete(h.rightChild(), key));
        else {