jeremytregunna

IDENT ::= [A-Za-z`~!@$%^&*_-+=|:/?.><][A-Za-z0-9`~!@$%^&*_-+=|:/?.><]*
sep ::= '\r' '\n' | '\n'
expressions ::= expression+
expression ::= call | string_lit | number_lit | sep
argument_list ::= expression [ ',' expressions ]*
call ::= IDENT? ( '(' argument_list? ')' )?
string_lit ::= '"' ( ANY - '"' ) '"'
sci_notation ::= 'e' ( '+' | '-' )? [0-9]+
hex_lit ::= '0' 'x' [0-9A-Fa-f]+ sci_notation?
number_lit ::= ('0' | [1-9]) [0-9]* sci_notation? | ( '0' | [1-9]) [0-9]* '.' [0-9]* sci_notation? | ( '0' | [1-9] ) [0-9]*

jeremytregunna

#!/bin/sh

. git-simple-common.sh

if [ X"$1" = X"-h" ]; then
	echo "Usage: git develop [new_branch] [parent_branch]"
	echo "	Creates a new branch [new_branch] detached from [parent_branch] or the current"
	echo "	branch, if [parent_branch] is not specified."
	exit 0
fi

jeremytregunna

[0] INS [email protected]:non-fiction% git sync                                                                                                                                                [8:52:57]
Current branch master is up to date.
Counting objects: 8, done.
Delta compression using up to 4 threads.
Compressing objects: 100% (5/5), done.
Writing objects: 100% (5/5), 677 bytes, done.
Total 5 (delta 3), reused 0 (delta 0)
To [email protected]:janeirodigital/non-fiction.git
   7291f90..6510412  master -> master
[0] INS [email protected]:non-fiction% git sync                                                                                                                                                [9:39:59]

jeremytregunna

define i32 @fac(i32) {
entry:
  %"n == 0" = icmp eq i32 %0, 0
  br i1 %"n == 0", label %end, label %iffalse

iffalse:                                          ; preds = %entry
  %"n - 1" = add i32 %0, -1
  %"fac(n - 1)" = call i32 @fac(i32 %"n - 1")
  %"n * fac(n - 1)" = mul i32 %"fac(n - 1)", %0
  br label %end

jeremytregunna

LLVMTypeRef obj_llvm_type(void)
{
	LLVMTypeRef slotsType = LLVMPointerType(sarray_llvm_type(), 0);
	LLVMTypeRef pType = LLVMPointerType(LLVMVoidType(), 0);
	LLVMTypeRef cenvType = LLVMPointerType(cenv_llvm_type(), 0);
	LLVMTypeRef elementTypes[] = { slotsType, pTy, cenvType };
	LLVMTypeRef structType = LLVMStructType(elementTypes, sizeof(elementTypes), 0);
	return structType;
}

jeremytregunna

  access_control.roles_for :any do |role|
    role.allow "/login"
    role.allow "/logout"
    role.allow "/register"
    role.allow "/"
  end

  access_control.roles_for :admin do |role|
    role.protect "/repositories"
  end

jeremytregunna

<%= form_for @company do |f| %>
  <% if @account_id %>
    <%= f.hidden_field :account_id, :value => @account_id %>
  <% end %>
  <p>
    <%= f.label :name, "Company Name" %>
    <%= f.text_field :name %>
  </p>
  <%= fields_for :address do |a| %>
    <p>

jeremytregunna

<%= form_for @company do |f| %>
  <% if @account_id %>
    <%= f.hidden_field :account_id, :value => @account_id %>
  <% end %>
  <p>
    <%= f.label :name, "Company Name" %>
    <%= f.text_field :name %>
  </p>
  <%= f.fields_for :address do |a| %>
    <p>

jeremytregunna

# Method and computer program for deferred computer evaluation

## Abstract

An application (i.e., computer program) translates data into some value by invoking an evaluation function with at least one argument. The arguments are saved in computer memory for later evaluation. The evaluation function returns to the application then, sometime after the evaluation function has returned, the arguments may be evaluated upon successive calls to an evaluation function. By waiting to evaluate the arguments until they are needed, program efficiency may be improved and the impact of the evaluation function on a software performance scenario may be reduced.

## Claims

We claim:

jeremytregunna

tak = method: x, y, z,
  if y < x:
    tak: tak: x - 1, y, z, (tak: y - 1, z, x), (tak: z - 1, x, y)
  else:
    z