emmanuel

-- Retrieve descendants
-- ====================
-- retrieve descendants of #4

SELECT c.*
FROM Comments AS c
  JOIN TreePaths AS t ON c.comment_id = t.descendant
WHERE t.ancestor = 4;

-- Retrieve ancestors

jckarter

fml

The function manipulation language

"I just implemented Conway's Game of Life in two lines of code. #fml"

pad = x flip[stitch] 0, stitch 0, flip[cat] 0, cat 0
life = pad, neighborhoods[3 3], [ravel, [sum in?: [x @ 4, + 3; 3]]]/2

ik5

{$mode objfpc}{$M+}
program test;

type
  TMyClass = class
    procedure SayHi;
  end;

procedure TMyClass.SayHi;
begin

tangentstorm

{-
 | a dumb little circuit simulator in haskell
 | by tangentstorm, 2012/08/22
 |
 | This basically just calculates values using Ohm's law.
 | it (probably?) only works for simple circuits where there 
 | is a single path from the power source to each node, and
 | from each node back to the power source.
 |
 | many thanks to quicksilver and Axman6 on #haskell for advice

koo5

"The Amazing Interactive Turing Machine" by "J.D. Clemens" 

Section 1 - Bibliographic Data

The story headline is "An Interactive Waste of Time".
The story genre is "Other".
The story description is "You have almost reached the end of your shift. All that remains is to clean one final room, the control room for that weird contraption being built by the scientists here. Carrying your usual equipment, you open the door and step into... The Amazing Interactive Turing Machine!"

Release along with source text and a website.

tangentstorm

## OBERON SYNTAX TO COMPILE:

  FOR x := start TO goal BY step DO
    block 
  END;

## StringTemplate ( generating retro code ):

  for_stmt(id, beg, end, step, block) ::= <<
  ( FOR ) <id>

tangentstorm

[[a[nd
   |rray
   |s
   |sm]
 |b[egin]
 |c[ase
   |lass
   |onst[
        |ructor]]
 |d[e[structor

alexaltair

The first thing that really surprised me today was the flexibility of Ruby's shovel operator, <<. A student in the class had tried the following:

a = [0]
a << a

What do you think a is now? I was sure it would be [0, [0]]. But lo and behold, Ruby sparkles;

a = [0]
a << a

ZachMassia

type Message struct {
        type     string
        midiData [3]byte
        sysexData[255]byte
        sysexLen int
}

func NewBoard() *Board {
        b := &Board{}
        // Start the message loops

tangentstorm

var b4 = (new function() { var EOF='\0',self = {

    d:[], a:[],                             // data and auxiliary/return stack
    defs:[],core:[],scope:[],               // dictionary
    base:10,                                // numbers
    cp:-1, ch:'\x01',ibuf:[],wd:'',         // lexer state
    compiling:false,state:[],target:[],     // compiler state

    def : function (k,v){
        var res=self.defs.length; self.defs.push(v); self.scope[0].push([k,res]); return res },