r1.dvi

Size: px

Start display at page:

Download "r1.dvi"

はすなあさま
5 years ago
Views:

1 Ruby ( ) --- ( ( ) ( ) ( ) 1 ( ) (?) IT 7K( )?? ( ) ( )? IT ( ) --- ( ) 1 ( ) --- ( ) (?) 2-3% Top-Level ICT Professional 5% ICT Professional 10% 100% 50% 20% Devl. Experiment Adv. ICT Understandings Basic ICT Understandings User Corp. ICT Person ( )( ) / ( ) ( ) ( ) ) (?) ( ) = 3K) + ( ( ) ( ) 1

2 ( ( )?) ( : )( ) I( ) : --- ( (2006) 23( )1020%? Ruby 3.1 ( ) ( ) ( )? Ruby (2007) C Java Ruby? ( )Ruby : I Java Ruby 2006: ( ) ( ) (90) 2 Ruby Java Java ) 2007: 1 / ( ) Ruby Java (A ) Ruby Ruby 5060( ) 2008: 2 ) 1( )50% 3 PDF ( 2 / 2 (B ) / ( ) 2

3 Ruby ( )B ( Java ) 13( GUI) 14( ) B --- Java/ ( ) 1 11 (Ruby ) 3.2 1: / 3.3 2: / if ( ) Ruby 1 def triarea(w, h) def abs1(x) s = (w * h) / 2.0 if x < 0 return s result = -x else result = x 2 ( ) return result irb def abs2(x) if x < 0 return -x irb else return x Java def abs3(x) result = x if x < 0 then result = -x return result ( 1 OK) 3 4 (1 ) 2 / ( ) 2 if while Java Ruby 3

4 while 2 (f(x)=0 ) dx=w/n 2 N+1 ( ) x ( nil) ( ) def integ1(a, b, n) dx = (b - a) / n; s = 0.0 x = a while x < b y = x**2 s = s + y * dx x = x + dx return s def integ2(a, b, n) dx = (b - a) / n; s = 0.0 n.times do i x = a + i * (b - a) / n; y = x**2 s = s + y * dx return s # f(x) # f(x) (?) ( ) for.times do... ( GCD( step ) ) ( ) fizzbuzz 2 if 3 / fizzbuzz : fizz5 buzz Ruby ( ) 3.5 4: ( ) / def gcd(x, y) if x == y return x elsif x > y 3.4 3: /f(x)=0 / return gcd(x-y, y) else return gcd(x, y-x) fizzbuzz Pixel = Struct.new (:r, :g, :b) 2 4

5 initimage( )writeimage( PPM )fillcircle( ) def mypicture initimage fillcircle(150, 30, 60, 255, 100, 70) fillcircle(190, 100, 30, 100, 200, 80) writeimage("t.ppm") 5

6 6

7 7

8 8

9 3.6 5: / / 3.8 7: / class Dog def = = = 3 3 def talk Nputs( my name is def + d puts( speed = def = c def do puts( Vow! ) : / Gauss-Jordan Jacobi def kazuate a = (rand(10000)+10000).to_s[1..4]; count = 0 while true do Gauss-Seidel printf("your guess? ") s = gets; hit = 0; blow = 0 4.times do i 4.times do j if s[i] == a[j] then Euler if i == j then hit = hit + 1 else blow = blow + 1 Runge-Kutta(2) Runge-Kutta(4) 4 if hit == 4 then puts "you win!"; return count = count + 1? if count > 9 then? (2007 puts "you lose! answer = #{a}."; return puts "hit = #{hit}, blow = #{blow}." ) 9

10 2 ( RPG ) RubyHash 3.9 8: / (?) class Buffer Cell = Struct.new(:data, :next) def = Cell.new("EOF", = def at def = def forward if at then = def def print puts(" " top forward insert forward delete head: prev: cur: How How old are head: prev: cur: head: head: head: How prev: How How old old are cur: are prev: are prev: are you? you? you? cur: you? you? tail: EOF tail: EOF tail: EOF tail: EOF cur: tail: EOF : / / A ( ) / $vars = {} class Add def initialize(l, = = r def exec() def to_s() return ( ) class Mul def initialize(l, = = r def exec() def to_s() return ( + * + ) class Lit def = v def exec() def to_s() class Var def = v def exec() return $vars[@left] def to_s() def test $vars[ x ] = 5 e = Add.new(Var.new( x ), Lit.new(1)) puts(e); puts(e.exec) e = Add.new(Lit.new(3), 1 Mul.new(Var.new( x ), Lit.new(2))) 1 puts(e); puts(e.exec) e = Mul.new(Add.new(Var.new( x ), Lit.new(3)), Lit.new(2)) puts(e); puts(e.exec) ( ) irb(main):004:0> test! (x + 1) 6 (3 + (x * 2)) 13 ((x + 3) * 2) 16 10

11 => nil x = 1 x = 1 ; y = x + 1 ; y = x + 1 class Assign < Node def initialize(l, r) = = def exec() v $vars[@left.getleft] = v; return v class Seq < Node def initialize(l, r) = ; def class Loop < Node def initialize(l, r) = L def exec() do v=@right.exec ; return v def test1 e = Seq.new( Assign.new(Var.new( n ), Lit.new(5)), Seq.new( Assign.new(Var.new( x ), Lit.new(1)), Seq.new( Loop.new( Var.new( n ), Seq.new( Assign.new(Var.new( x ), Mul.new(Var.new( x ), Var.new( n ))), Assign.new(Var.new( n ), Sub.new(Var.new( n ), Lit.new(1))))), Var.new( x )))) puts(e) return e.exec ; y ; y : / ( ) ( ) ( ) ( ) JR 2 / Ruby a b $atm = [{ a => 1}, { b => 0, :final => true}] def accept(s) cur = 0 s.length.times do i k = $atm[cur][s[i..i]]; if k == nil then return false else cur = k return $atm[cur][:final] == true Hash Ruby Ruby (64 ) irb(main):006:0> test1 (((n$)=(5#));(((x$)=(1#));(((n$)l(((x$)= ((x$)*(n$)));((n$)=((n$)-(1#)))));(x$)))) => 120 BNF 11

12 : / ( ( ) 1 1 forward algorithmviterbi Ruby Java 2007 ( ) Ruby irb Q. ( Ruby ) Ruby ( ) ( ) Ruby :-) ( Ruby?) ) 5 3 Ruby :? 12

13 Ruby Ruby, Ruby Ruby Ruby = ( ) html ( Ruby, Ruby Q. (OO ) ( ) Ruby 13

14 Ruby / /( )n ( ) ( ) 6, J07, , 2005, , , ,,,, 2008., Ruby,, Tim Bell,,,,

r9.dvi

r9.dvi 2011 9 2011.12.9 Ruby B Web ( ) 1 1.1 2 def delete if at then return @cur = @prev.next = @cur.next (1) EOF (2)@cur 1 ()@prev 1 def exch if at @cur.next == @tail then return a = @prev; b = @cur.next; c