ap0ught

Table of Contents

• 0.1. References
  • 0.2. Other cheatsheets
  • 0.3. Manage multiple gcloud config configurations
    • 0.3.1. Switch gcloud context with gcloud config
  • 0.4. Auth
• 0.5. info

ap0ught

using System.Collections;
using System.Collections.Generic;
using UnityEngine;

public class CircularMenu : MonoBehaviour{

	public float radius = 100.0f;
	public float offset = 0.0f;
	
	void Start(){

ap0ught

ap0ught

ap0ught

 void Start() 
     {
        int spawned = 0;
 
        while (spawned < numToSpawn)
        {
           position = new Vector3(Random.Range(100.0F, 1000.0F), 70, Random.Range(100.0F, 1000.0F));
           Instantiate(ammoDrop, position, Quaternion.identity);
           spawned++;
        }

ap0ught

#include <iostream>
#include <iomanip>

#define BINARY(x) 0b##x 

const short UPPER_LEFT = BINARY(100000000);

const short FULL_BOARD = BINARY(111111111);

const short HORIZ_0 = BINARY(111000000);

ap0ught

  // Ant Foraging Simulator
  // Jacob Conrad Martin
  // http://jacobconradmartin.com
  
  import processing.video.*;
  MovieMaker mm;
  
  // *** CONFIG ***
  
  int worldWidth = 400;

ap0ught

using System;

namespace PiDay
{
	// The probability of two random numbers to be coprime is P = 6 / Pi^2
	// So let's generate a bunch of random numbers. Figure out how often they're coprime.
	// Use that percentage as our probabilty and solve for Pi.
	// Pi = sqrt(6 / P)

	// For more info, watch the video where I stole the idea: https://youtu.be/RZBhSi_PwHU

ap0ught

#!/usr/bin/env perl

use strict;
use warnings;

use Getopt::Long;
Getopt::Long::Configure("pass_through");
use Pod::Usage;

our $APP = 'perl_test';

ap0ught

# Patrol the village entrances.
# Build a "fire-trap" when you see an ogre.
# Don't blow up any peasants!

loop:
    self.moveXY(43, 50)
    if self.findNearestEnemy():
        self.buildXY("fire-trap", 43, 50)
    self.moveXY(25, 34)
    if self.findNearestEnemy():