• Sort options

# Scott Blomquistsblom

View life.ijs
 life =: 3 : '+./ (1 ,: y) *. 3 4="0 _ +/ +/ 1 0 _1 |."1/"(0 _) 1 0 _1 |./"0 _ y'
View VirtualAccessors.cs
 public class Base { public virtual int Accessor { get; set; } } public class GetOverride: Base { public override int Accessor { get { return base.Accessor - 1;
View Problem1.ma
 n = 1; While[Total[IntegerDigits[n!]] != 8001, n = n + 1]; n
View Example1.m
 (* Project Euler Problem 1 *) (* Find the sum of all the multiples of 3 or 5 below 1000. *) (* StreamSource[#&] is a simple idiom for "a stream of all the natural numbers". *) ints = TakeWhile[StreamSource[# &], # < 1000 &]; (* Choose only the numbers that are multiples of 3 or 5. *) filtered = Select[ints, Mod[#, 3] == 0 || Mod[#, 5] == 0]; (* Sum them. Will probably add Stream/:Total[] since it comes up a lot. *)
View fracgen.m
 frac[1] = {{0, 1}, {1, 1}, {1,0}} frac[n_] := frac[n] = frac[n - 1] ~Riffle~ newFracs[n - 1] newFracs[n_] := Apply[Plus, #] & /@ Partition[frac[n], 2, 1] (* Example usage: *) Map[Apply[Divide, #] &, frac[14]] (* A few very surprising things happen here:
View clojure-reducer.linq
 List ns = new List { 1, 2, 3, 4, 5, 6, 7, 8 }; Func,Func,Func>> mapping = delegate(Func f) { return (Func f1) => ((int r, int i) => f1(r,f(i))); }; Func,Func,Func>> filtering = delegate(Func pred) { return (Func f1) => ((int r, int i) => { if (pred(i)) return f1(r,i);
View GitHubForWindowsPath.cmd
 for /f "usebackq delims=*" %%p in (`powershell -ExecutionPolicy RemoteSigned -Command "& { . \$env:LOCALAPPDATA\GitHub\shell.ps1 ; echo \$env:path }"`) do set path=%%p