aktowns

(function () {
  return {
    
    on_load: function () {
      print("Testing 1 2 3");
    },
    
    on_message: function(user, message) {
      print("NO U " + user);  
    }

aktowns

<link rel="import" href="../core-icon-button/core-icon-button.html">
<link rel="import" href="../core-toolbar/core-toolbar.html">
<link rel="import" href="../core-header-panel/core-header-panel.html">
<link rel="import" href="../code-mirror/code-mirror.html">

<polymer-element name="my-element">

  <template>
    <style>    
      :host {

aktowns

Keybase proof

I hereby claim:

• I am aktowns on github.
• I am ashleyis (https://keybase.io/ashleyis) on keybase.
• I have a public key whose fingerprint is E2B9 2B41 0E6E DCD0 A4D1 2118 CADB 53B1 ABE9 F350

To claim this, I am signing this object:

aktowns

Summary: A garbage collector for C and C++
Name:    gc
Version: 7.4.2
Release: 2%{?dist}

License: BSD
Url:     http://www.hboehm.info/gc/
Source0: http://www.hboehm.info/gc/gc_source/gc-%{version}%{?pre}.tar.gz

aktowns

#!/bin/sh
while true; do
  inotifywait -r -e close_write,moved_to,create "./src"

  if [ -f ./server.pid ]; then kill $(cat server.pid); fi

  crystal build $@
  target=$(basename $@ | sed s/\.cr//)
  echo "Executing $target"
  ./$target &

aktowns

require 'formula'

class Vim <Formula
  url 'ftp://ftp.vim.org/pub/vim/unix/vim-7.3.tar.bz2'
  homepage 'http://www.vim.org'
  md5 '5b9510a17074e2b37d8bb38ae09edbf2'

  depends_on 'ncursesw'
  depends_on 'cscope'

aktowns

let rec omNoms start op from nto =
  if from > nto then start
  else op from (omNoms start op (from + 1) nto) 
 
printfn "%d" (omNoms 0 (+) 1 100)

aktowns

(* 
  Problem 1 
    If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
    Find the sum of all the multiples of 3 or 5 below 1000.
*)
[1..1000]
  |> List.filter (fun n -> (n%3) = 0 || (n%5) = 0)
  |> List.fold (+) 0

aktowns

> let rec fib (start,step,list) =
  if (start > 4000001) then (1,start, start::list)
  else fib (start+step, start, (start::list))

val fib : int * int * int list -> int * int * int list

> let start,max,list = fib (1,1,[])


val start : int = 1

aktowns

(*
  Problem 3
    The prime factors of 13195 are 5, 7, 13 and 29.
    What is the largest prime factor of the number 600851475143 ?
*)
let rec find_factors (count, target, list) =
  if count < 2L then (1L,target,count::list)
  else if (target % count = 0L) then find_factors((count-1L), target, count::list)
  else find_factors((count-1L),target, list)