jaredcacurak

2016 Deer Lakes Youth Soccer

U10 Girls Spring Schedule

Time	Date	Opponent	Location
12:00 PM	April 2	@Twin Boro	Creekside Park
10:15 AM	April 16	@North Hills	Reis Run Park & Athletic Complex Field 1
10:30 AM	April 23	Shaler	Moskala Field
6:15 PM	April 29	Hampton	Moskala Field
9:00 AM	April 30	@North Hills	Reis Run Park & Athletic Complex Field 2

jaredcacurak

(function () {
    'use strict';

    var _setTimeout = setTimeout;

    setTimeout = function (fn/*, delay, callbackParm1, callbackParm2, etc. */) {
        var delay, callbackParameters;

        delay = arguments[1] || 0;
        callbackParameters = Array.prototype.slice.call(arguments, 2);

jaredcacurak

public static DateTime GetDateOfMostRecent(this DayOfWeek dayOfWeek, DateTime date) {
    return date.DayOfWeek.Equals(dayOfWeek) ? date.Date : GetDateOfMostRecent(dayOfWeek, date.AddDays(-1));
}

jaredcacurak

for i in `ls -t boo*.txt | sed '1,5d'`; do rm -f $i; done

jaredcacurak

function LuhnyBin(creditCard, minLength, maxLength, maskWithChar) {
    if (this instanceof LuhnyBin) {
        this.creditCard = creditCard;
        this.minLength = minLength || 14;
        this.maxLength = maxLength || 16;
        this.maskWithChar = maskWithChar || 'X';
        this.output = this.process(creditCard);
    } else {
        return new LuhnyBin(creditCard, minLength, maxLength, maskWithChar);
    }

jaredcacurak

class NumberMuncher {
    private final Integer value;
 
    NumberMuncher(Integer value) {
        this.value = value;
    }     
 
    List<Integer> digitsToThePowerOf(int power) {
        List<Integer> listOfPowers = new ArrayList<Integer>();
        List<Integer> digits = toDigits();

jaredcacurak

(1..<1000).findAll { it % 3 == 0 || it % 5 == 0 }.sum()

jaredcacurak

(1..100).sum() ** 2 - (1..100).collect { it ** 2 }.sum()

jaredcacurak

def list = [0, 1]
while (list.last() < 4000000) {
  list << list[-1] + list[-2]
}
list.findAll { it % 2 == 0 }.sum()

jaredcacurak

def largestPrimeFactorOf = { BigInteger it, divisor = 1, factors = [] ->
  while (it > 1) { 
    divisor += 1
    while (it % divisor == 0) { 
      factors << divisor
      it /= divisor
    }
  }
  factors.last()
}