calebsmith

Overall thoughts from sportsApp project:

Get the data model down before moving on.
Determine which views need what parameters. (Which ones take a pk? To what model?)
If it works, commit and push up.

For the final project:

1. Brainstorm ideas and decide on a good project.
    What is the simplest thing that could possibly work?

calebsmith

1. Project structure ( mkvirtualenv, startproject, startapp)
2. commit
3. Models - makemigrations, migrate
4. Admin
5. Enter in example data.
6. Views, Urls, a skeleton of templates. (extends base.html)
7. Commit
8. Templates (focus on variables)
9. Commit

calebsmith

OViiiiiiVViii***:****::*********iiiiiiiiiiiVVViiViiiVVViVViVVVVVVVVVVVVVVVVVVVVV
iiiVViiiiiiii***:****:****i*****iiiiiiiiViiiiViViVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVV
iiiiViiiiiiii********::*:********iiiiiiiiiiiVViiVVVVVVVVVVVVVVVVVVVVVVViiiiiiiVV
iiiiiiiiiiiii********:::*******i***iiiiiiiiiViVVVVVViVVVVViiiiiiiiiiiiiiiiiiiiiV
ii*iiiiiiiiii*VV*****::*:::*****VEEEEOViiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
ii*iiiiiiiiiiii*****:::*:***VEOEEMMEMMEEEEViiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii
VViiiiiiiiiiiii****:::::::*EOEEEEEEEEEEOEEEEiiiiiiiiiiiiiiiiiiiiiiiiiiiii*iiiiii
iiiiiiiiiiii*i*****::::::*OEEEEEEOVOEOEVVEEEMiiiiiiiiiiiiiii*iiiiii*ii*iiiiiiiii
iiiiiiiiiiiiiiii***::::::OEEEOOVOi~:*i:::iEEiOiiiiii*********iiiiiiiiii*ii*iiiii
iiiiiiiiiiiiii****:::::::OEME**::::~::***:VEVOi*i****i*******iii*iiiii**ii*iiiii

calebsmith

-module(funs).

%%% SKI combinators
i(X) -> X.

k(X) ->
    fun(F) -> X end.

s(F) ->
    fun(G) ->

calebsmith

(define (best-fit points)
    ;; Use least-squares estimation to find best fit line for given set of points
    (let* ((sumx (apply + (map car points)))
          (sumy (apply + (map cadr points)))
          (sumxy (apply + (map (lambda (p) (* (car p) (cadr p))) points)))
          (sumx2 (apply + (map (lambda (p) (* (car p) (car p))) points)))
          (n (length points))
          (slope (/ (- sumxy (/ (* sumx sumy) n)) (- sumx2 (/ (* sumx sumx) n))))
          (y-int (/ (- sumy (* slope sumx)) n)))
      (cons slope y-int)))

calebsmith

(define (repeat num arg)
    (let inner ((current 0))
        (if (>= current num)
            #nil
            (cons arg (inner (1+ current))))))

(define (make-range-stream min-x max-x step-x)
    (let inner ((x min-x))
        (cons x (delay
            (if (or (eq? x #nil) (>= (+ step-x x) max-x))

calebsmith

from datetime import datetime

from django.db.models import get_model
from django.contrib.sites.models import Site


def reindex_homepage(site_id=2010, num=50, async=False):
    layout_ids = find_homepage_layout_ids(site_id)
    return reindex(layout_ids, num, async)

calebsmith

#!/bin/bash

function android_get_pkg() {
    # Gets the name of the package
    echo $(aapt dump badging $1 |
        awk -F" " '/package/ {print $2}' |
        awk -F"'" '/name=/ {print $2}'
    )
}

calebsmith

#!/usr/bin/python
"""
A program that counts the number of occurences of words in a file.

Plain text books without copyright can be obtained from Project Gutenberg:
http://www.gutenberg.org/

run 'python counter.py' to see the number of occurrences of the top 200
most commonly used words

calebsmith

DEFSNG A-Z
CLS
SCREEN 12
xp = 320
yp = 240
num = 12


DO
cad = 360 \ num