def get_record(file)
  make    = file.gets.chomp
  model   = file.gets.chomp
  colour  = file.gets.chomp
  mileage = file.gets.chomp

require 'rubygems'

# adds the pp method, which stands for "pretty print"
# is useful for visualising long arrays/hashes
require 'pp'

class IceCreamStand  
  def service( person , hooks = Hash.new )
    hooks[:before]['ice cream'] if hooks[:before]
    puts "Ice Cream Stand: Here is some Ice Cream for #{person.name}!"
    hooks[:after]['ice cream'] if hooks[:after]

#include <stdio.h>
int main() {
  char a[]="#include <stdio.h>%2$cint main() {%2$c  char a[]=%3$c%1$s%3$c;%2$c  printf(a,a,10,34);%2$c  return 0;%2$c}";
  printf(a,a,10,34);
  return 0;

# a simple tree that keeps track of the value of a node
# each node tracks it's parent, but parents do not track their children
# so you can only traverse the tree from end to start
class SimpleTree
  

class StoreAndCall
  
  def initialize(&lambda)
    @lambda = lambda # store lambda in instance var, for use in foo
  end

# a possible solution to http://www.ruby-forum.com/topic/201997

require 'rexml/document'
require 'rexml/formatters/pretty'

#include <stdio.h>
#include <stdlib.h>

//argc holds how many parameters the program received when called
//argv holds their values

#include <stdio.h>
#include <stdlib.h>

//argc holds how many parameters the program received when called
//argv holds their values

int i;

# 18 "pass_by_name_vs_pass_by_value.c"
int three_times( int a )
{

#include <stdio.h>
#include <stdarg.h>

void say_hello( char* name ) 
{

#include <stdio.h>

int i;

//pass by name

#include <stdio.h>

void case_test( int outter , int inner )
{
  printf( "before switch: outter=%d , inner=%d\n" , outter , inner );

#include <stdio.h>

int cube( int x )                 { printf("2mul %d\n",x); return x*x*x; }
int sum( int x , int y , int z ) { printf("2add\n"); return x+y+z; }

#include <stdio.h>

int is_greater_than_20 ( int x ){  printf( "FIRST\n"  ); return x > 20 ; }
int is_less_than_30    ( int x ){  printf( "SECOND\n" ); return x < 30 ; }

#include <stdio.h>

int main()
{
  int a = 3;

#include <stdio.h>

int main()
{

#include<stdio.h>

#define FSM
#define STATE(x)      s_##x :
#define NEXTSTATE(x)  goto s_##x

void myFunction(int* values) {
  while(*values) printf("%d\n" , *values++ );
}

int main()

#include <stdio.h>
#include <string.h>

exec sql include sqlca;

#include <stdio.h>

int main()
{
  typedef struct { char* chars; } string;  

#include <stdio.h>

int main()
{
  typedef struct string { char* chars; } Table1 , Table2;

class Setting
  def self.all
    [ Setting.new( 'key1' , 'val1' , 'desc1' ) ,
      Setting.new( 'key2' , 'val2' , 'desc2' ) ,

#initialize variables / constants
print "How many dice do you wish to play with? "
NUMBER_OF_DICE  =  gets.to_i
FAIL_VALUE      =  1
score , turns , rolls  = 0 , 0 , Array.new(NUMBER_OF_DICE)

today = Time.now


# To format the time, you submit a format string to the strftime method
# the options you can use in the string can be seen at

#Learning Ruby chapter 9

#single inheritance
#modules = interfaces from Java
class Hello

#Learning Ruby chapter 7

h = {"a" => 1 , "b" => 2 , 3 => "c" , :x => [1,2,3] , [0,1,2] => [:r,:s,:t]}

puts "pre: h = #{h.inspect}"

#Learning Ruby chapter 6

a = [1,3,5,7]
b = [2,4,6,7]
puts "1 intersection: #{a.inspect} & #{b.inspect} = #{(a&b).inspect}"

#Learning Ruby chapter 5

#hierarchy and reflection
puts "1 #{1.class}"
puts "2 #{1.class.ancestors.inspect}"

#Learning Ruby chapter 4

#strings
puts "1 #{"".empty?}"   #.empty? instead of .length==0
x = String.new("abc")

#Learning Ruby chapter 3

#using conditional
x = 256
puts "1 x=256" if x == 256

#Learning Ruby chapter 2

#blocks: iterate through something
pacific = ["Washington" , "Oregon" , "California" ]
pacific.each do |state|

#Learning Ruby chapter 1
puts "VERSION = #{VERSION}"

#appending a string
puts "1Hello " + "world"

$stdin = DATA

print "Enter your first name: "
fname = gets.chomp

# comments begin with pound

# define a function
def my_function( param1 , param2=5 )
  return param1*param2

//returns the number of matches, where a match is some character in both strings
int find_match( char m[] , char s[] )
{
  //using 384 because it guarantees that no matter how the compiler interprets a char
  //it will have enough room. The union of possible domains should be -128 through 255

#include<stdio.h>

void print_chars( char c , int how_many , char* separator )
{
  while( how_many-- ) 

#include<stdio.h>

#define STR_SIZE 50

typedef struct

puts "VERSION = #{VERSION}"

output = ['five','four','three','two','one','zero']
puts "Input Converted to:"
output=output.reverse

puts "VERSION = #{VERSION}"

my_array = [1,2,3,4]

puts "\nputs my_array"

output = ['five','four','three','two','one','zero']
puts "Input Converted to:"
output=output.reverse

output.each do |text|

my_array = [1,2,3,4]

puts "\nputs my_array"
puts my_array

puts "VERSION = #{VERSION}"


class RPS