|
|
|
- しほこ おとじま
- 5 years ago
- Views:
Transcription
1 JavaScript try-catch JavaScript JavaScript try-catch try-catch try-catch try-catch try-catch try-catch try-catch try-catch try-catch
2
3 JavaScript (suspend ) try-catch try-catch try-catch try-catch try-catch try-catch try-catch
4 try-catch try-cacth Tak A 39 A
5 try-catch try-catch try-catch try-catch try-catch CallObserver try-catch
6 JavaScript JavaScript Sekiguchi [4] Pettyjohn [6] Loitsch[5] Sekiguchi [4] Java Pettyjohn [6] MSIL.Net
7 1. 2 Loitsch[5] JavaScript JavaScript try-catch 5 try-catch 6 2
8 Scheme[1][2] call-with-current-continuation (call/cc) 2.1 call/cc 2.1: call-with-current-continuation 1 (define cont ()) 2 (begin 3 (display a) 4 (call/cc 5 (lambda (c) 6 (set! cont c) 7 (display b))) 8 (display c)) ;; => abc 9 (cont) ;;=> c 10 (cont) ;;=> c call/cc call/cc 2.1 call/cc (diaplay c) cont (diaplay c)
9 2.1 4 cont (diaplay c) call/cc (non-local exit) (co-routine) 2.2 call/cc 2.2: call-with-current-continuation 1 (call/cc 2 (lambda (break) 3 (let loop ((x 5)) 4 (if (< x 0) (break break )) 5 (display x) 6 (newline) 7 (loop ( x 1))))) 4 break C longjump call/cc JavaScript Web Ajax JavaScript JavaScript JavaScript
10 Clinger[3] 2.3 try-catch ( 2.1 ) 2.1 suspend 2.1 throw ( ) 2.3 fibonacci try-catch
11 : (k1 k3) catch 2.3: 1 // 2 var fib = function( x ){ 3 return ( x <= 1)?x : fib( x 1)+fib( x 2); 4 }; 5 // 6 var fib = function ( x ) { 7 var t1, t2, t3, t4, t5, t6; 8 var k1 = function() { 9 t1 = x <= 1.0; 10 if (t1) { 11 return x; 12 } 13 t2 = x 1.0; 14 try { 15 t3 = fib( t2 ); 16 } catch ( ex ) { 17 if ( ex instanceof ContinationException ) { 18 ex.push(function ( t3 ) { // ( ) 19 return k2( t3 ); 20 }); 21 } 22 throw ex; 23 } 24 return k2(t3); 25 }; 26 var k2 = function( t3 ){ 27 t4 = x 2.0; 28 try { 29 t5 = fib( t4 ); 30 } catch ( ex ) { 31 if ( ex instanceof ContinationException ) { 32 ex.push(function( t5, t3 ){ // ( ) 33 return k3( t5, t3 ); 34 }); 35 } 36 throw ex; 37 } 38 return k3( t5, t3 ); 39 };
12 var k3 = function( t5, t3 ){ 41 t6 = t3 + t5; 42 return t6; 43 }; 44 return k1(); 45 }; JavaScript try-catch try-catch try-catch f1 g 2 2.2: try-catch
13 try-catch JavaScript JavaScript
14 [4][6][5] 3.1 (suspend ) suspend suspend suspend 1 suspend( < > ) suspend suspend (current continuation) < > < > suspend 3.1 suspend sleep 3.1: suspend (sleep) 1 function sleep( ms ) { 2 suspend( function( cont ){ 3 settimeout( cont, ms ); 4 } ); 5 }; 3.2 suspend
15 3.2 try-catch : suspend 1 function suspend( func ) { 2 var cex =newcontinuationexception(); 3 cex.setfunc( func ); 4 throw cex; 5 } suspend throw ( 3.1 ) suspend (2 ) (3 ) throw (4 ) 3.1: 3.2 try-catch : 1 var f1 = function( x, g ) { 2 print( f1: +x); 3 return g(); 4 };
16 3.2 try-catch 11 A 3.4 A f1 1 var f1 = function (x, g) { 2 var t1, t2; 3 t1 = f1: +x; 4 print(t1); // safecall 5 t2 = g(); // unsafecall 6 return t2; 7 }; 3.4: A A try-catch try-catch : try-catch 1 var f1 = function ( x, g ) { 2 var t1, t2; 3 var k1 = function() { 4 t1 = f1: +x; 5 print( t1 ); 6 try { 7 t2 = g(); 8 } catch ( ex ) { 9 if ( ex instanceof ContinuationException ) { 10 ex.pushframe(function( t2 ){ 11 k2( t2 ); 12 }); 13 } 14 throw ex; 15 } 16 return k2( t2 ); 17 }; 18 var k2 = function( t2 ) { 19 return t2; 20 }; 21 return k1(); 22 }; g (7 ) try catch throw 2.1 throw ( 3.1 )
17 3.2 try-catch 12
18 4. try-catch 13 4 try-catch try-catch try-catch try-catch try-catch try-catch try-catch : 1 // 2 var f = function ( i ) { 3 if( i < 1)return; 4 f( i 1); 5 }; 6 // 7 var f =(function(){
19 4.1 try-catch 14 8 // try catch 9 var funca = function ( i ) { 10 if( i < 1)return; 11 f( i 1); 12 }; 13 // try catch 14 var funcb = function ( i ) { 15 if ( i < 1)return; 16 t1 = i 1.0; 17 try { f( t1 ); } catch( ex ) { 18 / / 19 } 20 }; 21 var currentfunc = funcb; 22 var self = function( i ){ currentfunc( i ); }; 23 / / 24 return self; 25 })(); 3 try-ctach (1) try-ctach (2) try-ctach (3) :
20 4.2 try-catch 15 (2) try-catch try-catch (1) (1) (1) try-catch (3) (2) (3) try-catch 4.2 try-catch try-catch try-catch try-catch try-catch try-catch try-catch try-catch ( 4.3 ) try-catch
21 4.2 try-catch : try-catch 4.3: try-catch try-catch try-catch try-catch trycatch try-catch try-catch ( 4.4 )
22 4.2 try-catch : try-catch try-catch try-catch try-catch [7] 2
23 4.3 try-catch try-catch try-catch try-catch try-catch try-catch try-catch try-catch try-catch
24 5. try-catch 19 5 try-catch : 1 var f1 = function( x, g ) { 2 print( f1: +x); 3 return g(); 4 }; 5.2: 1 var f1 =(function(){ 2 // status 3 var state = FUNC B; // 4 var call count = 0; // f1 5 var is access = false; // 6 // low cost 7 var funca = function f1( x, g ) { 8 print( f1: +x); 9 return g(); 10 }; 11 // high cost 12 var funcb = function f1( x, g ) { 13 / try cacth / 14 }; 15 // return function 16 var self = function( x, g ) { call count; 18 // 19 if ( FailCapture.flg ) { 20 state = FUNC B; 21 return funcb( x, g );; 22 } 23 return self.body(x, y, z); 24 }; 25 // self.body try catch (2 )
25 5. try-catch self.body = function( x, g ){ 27 var result; 28 // FUNC B call 29 if ( CallObserver.isPassWhite() ) 30 CallObserver.inc(); 31 result = funcb( x, g ); 32 if ( CallObserver.isPassWhite() ) 33 CallObserver.dec(); 34 return result; 35 }; 36 // check 37 self.check = function(){ 38 if ( call count > T FUNCAL COUNT && 39! is access) { 40 self.chagefunc(func A); 41 return true; 42 } 43 return false; 44 }; 45 // chage 46 self.chagefunc = function ( state ) { 47 / try catch / 48 }; 49 self.accessstate = function(){ 50 return state; 51 }; 52 self.info = function() { 53 return { 54 state: state, 55 call count: call count, 56 is access: is access 57 }; 58 }; 59 self.fname = f1 ; 60 Profiler.registFunction( self ); 61 return self; 62 })(); try-catch f1 (funca) try-catch f1 (funcb) try-catch funcb funca self.body funcb funca
26 funcb ( ) try-catch state try-catch 4 call count 5 is access 26 self.body try-catch (funcb) try-catch f1 (funca) try-catch f1 (funcb) state FUNC B is access false state FUNC A is access false is access true call count 5.1 state
27 : 5.2 self.body self.check self.chagefunc self.body state self.check self.chagefunc( FUNC A) self.body funca state FUNC A f1 try-catch self.chagefunc try-catch state self.body 5.3 self.chagefunc
28 : 2 1 self.chagefunc = function ( state ) { 2 if ( state ) { 3 state = FUNC A; 4 self.body = function( x, g ) { 5 var result; 6 ++ call count; 7 CallObserver.passWhite(); 8 result = funca(x, y, z); 9 if ( CallObserver.black count() === 0 ) 10 CallObserver.reset(); 11 return result; 12 }; 13 } else { 14 state = FUNC B; 15 self.body = function( x, g ) { 16 var result; call count; 18 if ( CallObserver.isPassWhite() ) 19 CallObserver.inc(); 20 result = funcb( x, g ); 21 if ( CallObserver.isPassWhite() ) 22 CallObserver.dec(); 23 return result; 24 }; 25 } 26 }; self.chagefunc state FUNC A state FUNC A self.body funca self.chagefunc state FUNC B state FUNC B self.body funcb CallObserver.isPassWhite CallObserver.inc CallObserver.dec try-catch try-catch
29 try-catch CallObserver CallObserver : 1 var CallObserver =(function() { 2 var black count = 0; 3 var pass through white = false; 4 return { 5 inc: function() { 6 ++black count; 7 }, 8 dec: function() { 9 black count; 10 if ( black count === 0 ) 11 pass through white = false; 12 if ( black count < 0) 13 throw black exception ; 14 }, 15 passwhite: function() { 16 pass through white =true; 17 }, 18 reset: function() { 19 pass through white = false; 20 black count = 0; 21 }, 22 ispasswhite: function() { 23 return pass through white; 24 }, 25 black count: function() { 26 return black count; 27 } 28 }; 29 })(); CallObserver ( pass through white) try-catch try-catch ( black count) try-catch try-catch try-catch 5.3 CallObserber
30 : try-catch 5.3: CallObserver try-catch ( CallObserver.passWhite ) try-catch ( )
31 try-catch 1 ( ) 0 try-catch catch Profiler call count ( self.check ) try-catch f2 try-catch : ( 70 ) main 50 g 50 f1 80 f2 200
32 5.5 try-cacth : 5.5: try-catch 5.5 try-cacth funcb : try-catch 1 var funcb = function f1( x, g ) { 2 var t1, t2; 3 4 var k1 = function() { 5 t1 = f1: +x; 6 print(t1); 7 var loop flg =true; 8 while ( loop flg ) { 9 loop flg = false; 10 try { 11 t2 = g(); 12 } catch ( ex ) {
33 5.5 try-cacth if( ex instanceof FailCaptureException && 14 CallObserver.black count() > 0){ 15 CallObserver.dec(); 16 throw ex; 17 } 18 if( ex instanceof FailCaptureException && CallObserver.isPassWhite() ) { 19 FailCapture.flg = true; // 20 loop flg =true; 21 CallObserver.reset(); 22 } 23 if ( ex instanceof ContinuationException ) { 24 ex.pushframe(function( t2 ){ 25 k2( t2 ); 26 }); 27 is access =true; 28 } 29 if(!(ex instanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 30 throw ex; 31 } 32 } 33 } 34 return k2( t2 ); 35 }; 36 var k2 = function( t2 ) { 37 return t2; 38 }; 39 return k1(); 40 }; loop flg while try-catch goto loop flg true catch is access true is access true 5.1 try-catch CallObserver.dec throw 18 22
34 5.5 try-cacth 29 true (FailCapture.flg true try-catch ) CallObserver
35 JavaScript (Mozilla SpiderMonkey Google V8) CPU Intel Core i5(1.7 GHz) 4GB(1333 MHz DDR3) OS MacOSX(10.9.1) 6.1 Tak Tak suspend try-catch try-catch Tak try-catch Tak try-catch 1 function tak(x, y, z) { 2 if (x <= y) returnz; 3 return tak(tak(x 1, y, z), 4 tak(y 1, z, x), 5 tak(z 1, x, y)); 6 } 6.1: Tak Tak(15, 10, 0) try-catch 3
36 try-catch 6.1: Tak (s) SpiderMonkey v (try-catch ) (try-catch ) task1 task2 ( 6.1 ) task1 task2 tak task1 tak1( 14, 8, 0 ) task2 tak2( 10, 5, 0 ) task1 Tak suspend Tak suspend task2 Tak suspend task2 4 task2 task1 task1 (try-catch ) task2 6.2: Tak 1 var Resume1, Resume2; 2 var tak1 = function (x, y, z) { 3 if (x <= y) returnz; 4 return tak1(tak1(x 1, y, z),
37 tak1(y 1, z, x), 6 tak1(z 1, x, y)); 7 }; 8 var tak2 = function (x, y, z) { 9 if (x <= y) returnz; 10 if ( x === 7 && y === 1 ) // Tak suspend 11 suspend( function( cont ) { 12 Resume2 = cont; 13 if (!Resume1){ 14 toplevel( task1 ); 15 return; 16 } 17 Resume1(); // 18 } ); 19 return tak2(tak2(x 1, y, z), 20 tak2(y 1, z, x), 21 tak2(z 1, x, y)); 22 }; 23 var task1 = function() { 24 tak1( 14, 8, 0 ); 25 suspend( function( cont ){ // task1 suspend 26 Resume1 = cont; 27 if (!Resume2) { 28 toplevel(function(){ task2( 3);}); 29 return; 30 } 31 Resume2(); // 32 } ); 33 task1(); 34 }; 35 var task2 = function ( i ) { 36 if (i < 0) 37 return; 38 tak2( 10, 5, 0 ); 39 print( task2: +i); 40 task2( i 1); 41 }; 42 toplevel( task1 ); suspend try-catch
38 : (s) SpiderMonkey v (try-catch ) (try-catch ) :
39 suspend safecall suspend unsafecall unsafecall unsafefunction safefunction unsafe- Function safefunction unsafecall safecall : sample 1 var Resume; 2 // unsafefunction 3 var f1 = function( x, g ) { 4 print( f1: +x); // safecall 5 return g(); // unsafecall 6 }; 7 // safefunction 8 var f2 = function( x ) { 9 print( f2: +x); // safecall 10 return f3( x 10 ); // safecall 11 }; 12 // safefunction 13 var f3 = function( x ) { 14 print( f3: +x); // safecall 15 return x + 1; 16 }; 17 // unsafefunction 18 var g = function () { 19 suspend(function( cont ){ // (unsafecall) 20 print( suspend );
40 Resume = cont; 22 }); 23 }; 24 // unsafefunction 25 var main = function (){ 26 f2( 1 ); // safecall 27 f1( 2, g ); // unsafecall 28 f2( 3 ); // safecall 29 }; f1 unsafe unsafe
41 (try-catch) try-catch [4][6][5] try-catch try-catch try-catch try-catch try-catch try-catch try-catch JavaScript
42 37
43 38 [1],, SCHEME,, 2000.(ISBN ) [2] R. Kelsey, W. Clinger, J. Rees (eds.), Revised5 Report on the Algorithmic Language Scheme, Higher-Order and Symbolic Computation, 11(1), September, 1998 and ACM SIGPLAN Notices, 33(9), October, schemers.org/documents/standards/r5rs/. [3] William D Clinger, Anne H Hartheimer, and Eric M Ost. Implementation strategies for first-class continuations. In Journal of Higher Order and Symbolic Computation, 12(1), 1999, pages [4] Sekiguchi, T., Sakamoto, T., and Yonezawa, A. Portable implementation of continuation operators in imperative languages by exception handling. Lecture Notes in Computer Science 2022 (2001), pp [5] Florian Loitsch, Exceptional Continuations in JavaScript, Proceedings of the 2007 Workshop on Scheme and Functional Programming, pp [6] G. Pettyjohn, J. Clements, J. Marshall, S. Krishnamurthi, and M. Felleisen. Con- tinuations from generalized stack inspection. In International Conference on Functional Programming 2005, pp [7].. 74, pp
44 A. 39 A A.1 A.1: 1 // 2 const FUNC B = false; 3 const FUNC A = true; 4 5 const T FUNCAL COUNT = 5; // 6 7 // ( ) 8 var Resume1 = null; 9 var Resume2 = null; // 12 // 13 function Continuation () { 14 this.frames = []; 15 } 16 Continuation.prototype.pushFrame = function ( f ) { 17 this.frames.push( f ); 18 }; 19 Continuation.prototype.isEmpty = function () { 20 return this.frames.length === 0; 21 }; 22 Continuation.prototype.setFrames = function( frames ) { 23 this.frames = this.frames.concat( frames ); 24 }; // 27 Continuation.prototype.execCont = function () { 28 var temp = null; 29 var cont = this; 30 var f; 31 try { 32 while (!this.isempty() ) { f = cont.frames.shift(); 35 temp = f( temp ); } 38 return temp;
45 A } catch (ex){ if ( exinstanceof ContinuationException ) { 43 ex.setframes( cont.frames ); // suspend 46 var result = ex.execfunc(); 47 return result; 48 } 49 throw ex; } 53 }; // 56 function ContinuationException () { 57 this.contination = new Continuation(); 58 }; 59 ContinuationException.prototype.pushFrame = function( frame ) { 60 this.contination.pushframe( frame ); 61 }; 62 ContinuationException.prototype.setFrames = function( frames ) { 63 this.contination.setframes( frames ); 64 }; 65 ContinuationException.prototype.setFunc = function( func ) { 66 this.func = func; 67 }; 68 ContinuationException.prototype.execFunc = function() { 69 var that = this; 70 this.func( function(){ 71 that.contination.execcont(); }); 72 }; ContinuationException.prototype.getContinuation = function() { 75 return this.contination; 76 }; // 79 // suspend 80 function suspend( func ) { if ( CallObserver.isPassWhite() ) { 83 print( throw new FailCaptureException(); ); 84 throw new FailCaptureException(); 85 } FailCapture.flg = false; 88 var cex = new ContinuationException(); 89 cex.setfunc( func ); 90 throw cex; 91 } // 94 // Main Routine TopLevel 95 function toplevel( main ) { 96 var loop flg = true; while ( loop flg ) {
46 A loop flg = false; 100 try { print( top ); 103 main(); 104 return; } catch (ex){ // 109 if ( exinstanceof FailCaptureException ) { 110 CallObserver.reset(); 111 print( re-exec ); 112 FailCapture.flg = true; // 113 loop flg = true; 114 } // 117 if ( exinstanceof ContinuationException ) { 118 // suspend 119 ex.execfunc(); 120 return; 121 } 122 if (!( exinstanceof FailCaptureException) ) { 123 throw ex; 124 } 125 } 126 } 127 }; // 130 var Profiler = (function() { // index 133 var seek index = 0; 134 // var check func count = 0; // 137 var watch funcs = []; // 140 var all funcs = {}; var switchtohighspeed = function( index ) { 143 var func = watch funcs.splice(index, 1); 144 var func name = func.fname; 145 func.switchspeed( FUNC A); 146 }; var switchtolowspeed = function( func name ){ 149 var func = all funcs[ func name ]; func.switchspeed( FUNC B); 152 }; // accessor 155 return { 156 // regist 157 registfunction: function ( func ) { 158 all funcs[func.fname] = func;
47 A watch funcs.push( func ); 160 }, // check 163 checkfunctions: function () { 164 var length = watch funcs.length; 165 while (seek index < length) { 166 print(watch funcs[ seek index ].fname); 167 watch funcs[ seek index ].check(); seek index; 169 } 170 seek index = 0; 171 }, init: function() { 174 for( key in all funcs ) { 175 watch funcs.push( all funcs[key] ); 176 } 177 }, swichallhigh: function() { for ( i in watch funcs ){ 182 // print(watch funcs[i].accessstate()); 183 watch funcs[i].switchspeed( FUNC A); 184 // print(watch funcs[i].accessstate()); 185 } }, swichalllow: function() { 188 for ( i in watch funcs ){ 189 watch funcs[i].switchspeed( FUNC B); 190 } 191 }, infofunctions: function() { 192 for ( name in all funcs ) { 193 var obj = all funcs[name].info(); 194 print( name: + name + \n state: + obj.state + \n call_count: + obj.call count + \n is_access: + obj.is access); 198 print( --- ); 199 } 200 } }; 203 })(); // 206 // 207 function FailCaptureException() {} // 210 // 211 var FailCapture = new Object(); 212 // FailCapture.setFuncFlg = false; 213 FailCapture.flg = false; var CallObserver = (function() { 216 var black count = 0; 217 var pass white = false; 218
48 A return { 220 plus: function(){ black count; 222 }, 223 minus: function(){ 224 black count; 225 if ( black count === 0 ) 226 pass white = false; if ( black count < 0) { 229 throw black exception ; 230 } 231 }, 232 passwhite: function(){ 233 pass white = true; 234 }, 235 reset: function(){ 236 pass white = false; 237 black count = 0; 238 }, 239 ispasswhite: function(){ 240 return pass white; 241 }, 242 black count: function() { 243 return black count; 244 } 245 }; 246 })(); // 250 // 251 var tak1 = (function(){ 252 // status 253 var state = FUNC B; 254 var call count = 0; 255 var is access = false; var funca = function (x, y, z) { 258 if (x <= y)return z; 259 return tak1(tak1(x 1, y, z), 260 tak1(y 1, z, x), 261 tak1(z 1, x, y)); 262 }; var funcb = function (x, y, z) { 265 var t1, t2, t3, t4, t5, t6, t7, t8; 266 var k1 = function() { 267 t1 = x <= y; 268 if (t1) 269 return z; 270 t2 = x 1.0; 271 var loop flg = true; 272 while ( loop flg ) { 273 loop flg = false; 274 try { 275 t3 = tak1(t2, y, z); 276 } catch (ex){ 277 if( exinstanceof FailCaptureException && 278 CallObserver.black count() > 0){
49 A CallObserver.minus(); 280 is access = true; 281 throw ex; 282 } 283 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 284 FailCapture.flg = true; // 285 is access = true; 286 loop flg = true; 287 CallObserver.reset(); 288 } 289 if ( exinstanceof ContinuationException ) { 290 is access = true; 291 ex.pushframe(function( t3 ) { 292 return k2( t3 ); 293 }); 294 } 295 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 296 throw ex; 297 } 298 } 299 } 300 return k2( t3 ); 301 }; var k2 = function ( t3 ) { 304 t4 = y 1.0; 305 var loop flg = true; 306 while ( loop flg ) { 307 loop flg = false; 308 try { 309 t5 = tak1(t4, z, x); 310 } catch (ex){ 311 if( exinstanceof FailCaptureException && 312 CallObserver.black count() > 0){ 313 CallObserver.minus(); 314 is access = true; 315 throw ex; 316 } 317 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 318 FailCapture.flg = true; // 319 loop flg = true; 320 is access = true; 321 CallObserver.reset(); 322 } 323 if ( exinstanceof ContinuationException ) { 324 is access = true; 325 ex.pushframe(function( t5 ){ 326 return k3( t3, t5 ); 327 }); 328 } 329 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 330 throw ex; 331 } 332 } 333 } 334 return k3( t3, t5 ); 335 }; 336
50 A var k3 = function( t3, t5 ) { 338 t6 = z 1.0; 339 var loop flg = true; 340 while ( loop flg ) { 341 loop flg = false; 342 try { 343 t7 = tak1(t6, x, y); 344 } catch (ex){ 345 if( exinstanceof FailCaptureException && 346 CallObserver.black count() > 0){ 347 CallObserver.minus(); 348 is access = true; 349 throw ex; 350 } 351 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 352 FailCapture.flg = true; // 353 loop flg = true; 354 is access = true; 355 CallObserver.reset(); 356 } 357 if ( exinstanceof ContinuationException ) { 358 is access = true; 359 ex.pushframe(function( t7 ){ 360 return k4( t3, t5, t7 ); 361 }); 362 } 363 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 364 throw ex; 365 } 366 } 367 } 368 return k4( t3, t5, t7 ); 369 }; var k4 = function( t3, t5, t7 ) { 372 var loop flg = true; 373 while ( loop flg ) { 374 loop flg = false; 375 try { 376 t8 = tak1( t3, t5, t7 ); 377 } catch (ex){ 378 if( exinstanceof FailCaptureException && 379 CallObserver.black count() > 0){ 380 CallObserver.minus(); 381 is access = true; 382 throw ex; 383 } if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 386 FailCapture.flg = true; // 387 loop flg = true; 388 is access = true; 389 CallObserver.reset(); 390 } if ( exinstanceof ContinuationException ) { 393 is access = true; 394 ex.pushframe(function( t8 ){ 395 return t8;
51 A }); 397 } 398 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 399 throw ex; 400 } 401 } 402 } 403 return t8; 404 }; 405 return k1(); 406 }; // return function 409 var self = function( x, y, z ) { 410 var result; 411 // 412 if (FailCapture.flg is access) { 413 // print( FailCapture.flg, self.fname, is access); 414 // is access = true; call count; 416 state = FUNC B; 417 result = funcb( x, y, z ); 418 return result; 419 } 420 return self.body( x, y, z ); 421 }; 422 self.body = function( x, y, z ){ 423 var result; call count; 425 // FUNC B function 426 if ( CallObserver.isPassWhite() ) 427 CallObserver.plus(); 428 result = funcb( x, y, z ); 429 if ( CallObserver.isPassWhite() ) 430 CallObserver.minus(); 431 return result; 432 }; 433 // check 434 self.check = function(){ 435 if ( call count > T FUNCAL COUNT && 436! is access) { 437 self.switchspeed(func A); 438 return true; 439 } 440 return false; 441 }; 442 // switch 443 self.switchspeed = function ( state ) { 444 if ( state ) { 445 state = FUNC A; 446 print( high ); 447 self.body = function( x, y, z ){ call count; 449 return funca(x, y, z); 450 }; 451 } else { 452 state = FUNC B; 453 self.body = function( x, y, z ) { 454 var result;
52 A call count; 456 // FUNC B function 457 if ( CallObserver.isPassWhite() ) 458 CallObserver.plus(); 459 result = funcb( x, y, z ); 460 if ( CallObserver.isPassWhite() ) 461 CallObserver.minus(); 462 return result; 463 }; 464 } 465 }; 466 self.info = function() { 467 return { 468 state: state, 469 call count: call count, 470 is access: is access 471 }; 472 }; 473 self.fname = "tak1"; 474 self.accessstate = function(){ 475 return state; 476 }; 477 Profiler.registFunction( self ); 478 return self; 479 })(); var tak2 = (function(){ 482 // status 483 var state = FUNC B; 484 var call count = 0; 485 var is access = false; var funca = function ( x, y, z ) { 488 if (x <= y)return z; 489 if (x===7&&y===1)// Tak suspend 490 suspend( function( cont ) { 491 Resume2 = cont; 492 if (!Resume1){ 493 toplevel( taskloop1 ); 494 return; 495 } 496 Resume1(); // 497 } ); 498 return tak2(tak2(x 1, y, z), 499 tak2(y 1, z, x), 500 tak2(z 1, x, y)); 501 }; var funcb = function (x, y, z) { 504 var t1, t2, t3, t4, t5, t6, t7, t8; var k1 = function() { 507 t1 = x <= y; 508 if (t1) 509 return z; 510 var loop flg = true; 511 while ( loop flg ) { 512 loop flg = false; 513 try { 514 if (x===7&&y===1)//
53 A return suspend( function( cont ){ 516 // print( suspend2 ); 517 Resume2 = cont; 518 if (Resume1===null) 519 toplevel( taskloop1 ); 520 if (Resume1!==null) 521 Resume1(); 522 } ); 523 } catch (ex){ if( exinstanceof FailCaptureException && 526 CallObserver.black count() > 0){ 527 CallObserver.minus(); 528 is access = true; 529 throw ex; 530 } 531 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 532 FailCapture.flg = true; // 533 loop flg = true; 534 is access = true; 535 CallObserver.reset(); 536 } 537 if ( exinstanceof ContinuationException ) { 538 is access = true; 539 ex.pushframe(function() { 540 return k2(); 541 }); 542 } 543 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 544 throw ex; 545 } 546 } 547 } 548 return k2(); 549 }; 550 var k2 = function(){ 551 t2 = x 1.0; 552 var loop flg = true; 553 while ( loop flg ) { 554 loop flg = false; 555 try { 556 t3 = tak2( t2, y, z ); 557 } catch (ex){ 558 if( exinstanceof FailCaptureException && 559 CallObserver.black count() > 0){ 560 CallObserver.minus(); 561 is access = true; 562 throw ex; 563 } 564 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 565 FailCapture.flg = true; // 566 loop flg = true; 567 is access = true; 568 CallObserver.reset(); 569 } 570 if ( exinstanceof ContinuationException ) { 571 is access = true; 572 ex.pushframe(function( t3 ) { 573 return k3( t3 );
54 A }); 575 } 576 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 577 throw ex; 578 } 579 } 580 } 581 return k3( t3 ); 582 }; var k3 = function( t3 ) { 585 t4 = y 1.0; 586 var loop flg = true; 587 while ( loop flg ) { 588 loop flg = false; 589 try { 590 t5 = tak2( t4, z, x ); 591 } catch (ex){ 592 if( exinstanceof FailCaptureException && 593 CallObserver.black count() > 0){ 594 CallObserver.minus(); 595 is access = true; 596 throw ex; 597 } 598 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 599 FailCapture.flg = true; // 600 loop flg = true; 601 is access = true; 602 CallObserver.reset(); 603 } 604 if ( exinstanceof ContinuationException ) { 605 is access = true; 606 ex.pushframe(function( t5 ) { 607 return k4( t3, t5 ); 608 }); 609 } 610 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 611 throw ex; 612 } 613 } 614 } 615 return k4( t3, t5 ); 616 }; 617 var k4 = function( t3, t5 ) { 618 t6 = z 1.0; 619 var loop flg = true; 620 while ( loop flg ) { 621 loop flg = false; 622 try { 623 t7 = tak2( t6, x, y ); 624 } catch (ex){ 625 if( exinstanceof FailCaptureException && 626 CallObserver.black count() > 0){ 627 CallObserver.minus(); 628 is access = true; 629 throw ex; 630 } 631 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) {
55 A FailCapture.flg = true; // 633 loop flg = true; 634 is access = true; 635 CallObserver.reset(); 636 } 637 if ( exinstanceof ContinuationException ) { 638 is access = true; 639 ex.pushframe(function( t7 ) { 640 return k5( t3, t5, t7 ); 641 }); 642 } 643 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 644 throw ex; 645 } 646 } 647 } 648 return k5( t3, t5, t7 ); 649 }; 650 var k5 = function( t3, t5, t7 ) { 651 var loop flg = true; 652 while ( loop flg ) { 653 loop flg = false; 654 try { 655 t8 = tak2(t3, t5, t7); 656 } catch (ex){ 657 if( exinstanceof FailCaptureException && 658 CallObserver.black count() > 0){ 659 CallObserver.minus(); 660 is access = true; 661 throw ex; 662 } 663 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 664 FailCapture.flg = true; // 665 loop flg = true; 666 is access = true; 667 CallObserver.reset(); 668 } 669 if ( exinstanceof ContinuationException ) { 670 is access = true; 671 ex.pushframe(function( t8 ) { 672 return k6( t3, t5, t7, t8 ); 673 }); 674 } 675 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 676 throw ex; 677 } 678 } 679 } 680 return k6( t3, t5, t7, t8 ); 681 }; 682 var k6 = function( t3, t5, t7, t8 ){ 683 return t8; 684 }; 685 return k1(); 686 }; // return function 689 var self = function( x, y, z ) {
56 A var result; 691 // 692 if (FailCapture.flg is access) { 693 is access = true; call count; 695 state = FUNC B; 696 result = funcb( x, y, z ); 697 return result; 698 } 699 return self.body(x, y, z); 700 }; 701 self.body = function( x, y, z ){ 702 var result; call count; 704 // FUNC B function 705 if ( CallObserver.isPassWhite() ) 706 CallObserver.plus(); 707 result = funcb( x, y, z ); 708 if ( CallObserver.isPassWhite() ) 709 CallObserver.minus(); 710 return result; 711 }; 712 // check 713 self.check = function(){ 714 if ( call count > T FUNCAL COUNT && 715! is access) { 716 self.switchspeed(func A); 717 return true; 718 } 719 return false; 720 }; 721 // switch 722 self.switchspeed = function ( state ) { 723 if ( state ) { 724 state = FUNC A; 725 self.body = function( x, y, z ) { 726 var result; call count; 728 CallObserver.passWhite(); 729 result = funca( x, y, z ); 730 if ( CallObserver.black count() === 0 ) 731 CallObserver.reset(); 732 return result; 733 }; 734 } else { 735 state = FUNC B; 736 self.body = function( x, y, z ) { 737 var result; call count; 739 // FUNC B function 740 if ( CallObserver.isPassWhite() ) 741 CallObserver.plus(); 742 result = funcb( x, y, z ); 743 if ( CallObserver.isPassWhite() ) 744 CallObserver.minus(); 745 return result; 746 }; 747 } 748 }; 749 self.info = function() {
57 A return { 751 state: state, 752 call count: call count, 753 is access: is access 754 }; 755 }; 756 self.fname = "tak2"; 757 self.accessstate = function(){ 758 return state; 759 }; 760 Profiler.registFunction( self ); 761 return self; 762 })(); var taskloop1 = (function() { // status 767 var state = FUNC B; 768 var call count = 0; 769 var is access = false; var funca = function(){ 772 print( tak1 ); 773 tak1( 14, 8, 0 ); 774 // print( tak1 ); 775 suspend( function( cont ) { 776 Resume1 = cont; 777 if (!Resume2) { 778 toplevel(function(){ taskloop2( 3 ); }); 779 return; 780 } 781 Resume2(); 782 } ); 783 taskloop1(); 784 }; var funcb = function() { 787 var k1 = function(){ 788 var loop flg = true; 789 while ( loop flg ) { 790 loop flg = false; 791 try { 792 // print( tak1 ); 793 tak1( 14, 8, 0 ); 794 } catch (ex){ 795 if( exinstanceof FailCaptureException && 796 CallObserver.black count() > 0){ 797 CallObserver.minus(); 798 is access = true; 799 throw ex; 800 } 801 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 802 FailCapture.flg = true; // 803 loop flg = true; 804 is access = true; 805 CallObserver.reset(); 806 } 807 if ( exinstanceof ContinuationException ) { 808 is access = true; 809 ex.pushframe(function() {
58 A return k2(); 811 }); 812 } 813 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 814 throw ex; 815 } 816 } 817 } 818 return k2(); 819 }; var k2 = function() { 822 var loop flg = true; 823 while ( loop flg ) { 824 loop flg = false; 825 try { 826 suspend( function( cont ){ 827 Resume1 = cont; 828 if (Resume2 ===null) 829 toplevel(function(){ taskloop2( 3 ); }); 830 if (Resume2!==null) 831 Resume2(); 832 } ); 833 } catch (ex){ 834 if( exinstanceof FailCaptureException && 835 CallObserver.black count() > 0){ 836 is access = true; 837 CallObserver.minus(); 838 throw ex; 839 } 840 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 841 FailCapture.flg = true; // 842 loop flg = true; 843 is access = true; 844 CallObserver.reset(); 845 } 846 if ( exinstanceof ContinuationException ) { 847 is access = true; 848 ex.pushframe(function() { 849 return k3(); 850 }); 851 } 852 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 853 throw ex; 854 } 855 } 856 } 857 return k3(); 858 }; 859 var k3 = function(){ 860 taskloop1(); 861 }; 862 return k1(); 863 }; 864 // return function 865 var self = function() { 866 var result; 867 // print( fail );
59 A // 870 if ( FailCapture.flg is access) { 871 is access = true; call count; 873 state = FUNC B; 874 result = funcb(); 875 return result; 876 } 877 return self.body(); 878 }; 879 self.body = function(){ 880 var result; call count; 882 // FUNC B function 883 if ( CallObserver.isPassWhite() ) 884 CallObserver.plus(); 885 result = funcb(); 886 if ( CallObserver.isPassWhite() ) 887 CallObserver.minus(); 888 return result; 889 }; 890 // check 891 self.check = function(){ 892 if ( call count > T FUNCAL COUNT && 893! is access) { 894 self.switchspeed(func A); 895 return true; 896 } 897 return false; 898 }; // switch 901 self.switchspeed = function ( state ) { 902 if ( state ) { 903 state = FUNC A; 904 print( high ); 905 self.body = function() { 906 var result; call count; 908 CallObserver.passWhite(); 909 result = funca(); 910 if ( CallObserver.black count() === 0 ) 911 CallObserver.reset(); 912 return result; 913 }; 914 } else { 915 state = FUNC B; 916 self.body = function( ) { 917 var result; call count; 919 // FUNC B function 920 if ( CallObserver.isPassWhite() ) 921 CallObserver.plus(); 922 result = funcb(); 923 if ( CallObserver.isPassWhite() ) 924 CallObserver.minus(); 925 return result; 926 }; 927 }
60 A }; 929 self.info = function() { 930 return { 931 state: state, 932 call count: call count, 933 is access: is access 934 }; 935 }; 936 self.fname = "taskloop1"; 937 self.accessstate = function(){ 938 return state; 939 }; 940 Profiler.registFunction( self ); 941 return self; 942 })(); var taskloop2 = (function(){ // status 947 var state = FUNC B; 948 var call count = 0; 949 var is access = false; var funca = function ( i ) { 952 if (i < 0) 953 return; 954 tak2( 10, 5, 0 ); 955 print( task2: +i); 956 task2( i 1); 957 }; var funcb = function ( i ) { var k1 = function() { 962 if (i < 0) 963 return; 964 var loop flg = true; 965 while ( loop flg ) { 966 loop flg = false; 967 try { 968 tak2( 10, 5, 0 ); 969 } catch (ex){ 970 if( exinstanceof FailCaptureException && 971 CallObserver.black count() > 0){ 972 CallObserver.minus(); 973 is access = true; 974 throw ex; 975 } 976 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 977 FailCapture.flg = true; // 978 loop flg = true; 979 CallObserver.reset(); 980 is access = true; 981 } 982 if ( exinstanceof ContinuationException ) { 983 is access = true; 984 ex.pushframe(function() { 985 k2(); 986 }); 987 }
61 A if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 989 throw ex; 990 } 991 } 992 } 993 k2(); 994 }; var k2 = function(){ 997 var loop flg = true; 998 while ( loop flg ) { 999 loop flg = false; 1000 try { 1001 print( taskloop2 +i); 1002 taskloop2( i 1); 1003 } catch (ex){ 1004 if( exinstanceof FailCaptureException && 1005 CallObserver.black count() > 0){ 1006 CallObserver.minus(); 1007 is access = true; 1008 throw ex; 1009 } 1010 if( exinstanceof FailCaptureException && CallObserver.isPassWhite() ) { 1011 FailCapture.flg = true; // 1012 loop flg = true; 1013 is access = true; 1014 CallObserver.reset(); 1015 } 1016 if ( exinstanceof ContinuationException ) { 1017 is access = true; 1018 } 1019 if(!(exinstanceof FailCaptureException && CallObserver.isPassWhite() ) ) { 1020 throw ex; 1021 } 1022 } 1023 } 1024 }; 1025 return k1(); 1026 }; 1027 // return function 1028 var self = function( i ) { 1029 var result; 1030 // 1031 if (FailCapture.flg is access) { call count; 1033 state = FUNC B; 1034 result = funcb( i ); 1035 return result; 1036 } 1037 return self.body( i ); 1038 }; 1039 self.body = function( i ){ 1040 var result; call count; 1042 // FUNC B function 1043 if ( CallObserver.isPassWhite() ) 1044 CallObserver.plus(); 1045 result = funcb( i );
62 A if ( CallObserver.isPassWhite() ) 1047 CallObserver.minus(); 1048 return result; 1049 }; 1050 // check 1051 self.check = function(){ 1052 if ( call count > T FUNCAL COUNT && 1053! is access) { 1054 self.switchspeed(func A); 1055 return true; 1056 } 1057 return false; 1058 }; 1059 // switch 1060 self.switchspeed = function ( state ) { 1061 print( switchspeed ); 1062 print(state); 1063 if ( state ) { 1064 state = FUNC A; 1065 print( high ); 1066 self.body = function( i ) { 1067 var result; call count; 1069 CallObserver.passWhite(); 1070 result = funca( i ); 1071 if ( CallObserver.black count() === 0 ) 1072 CallObserver.reset(); 1073 return result; 1074 }; 1075 } else { 1076 state = FUNC B; 1077 self.body = function( i ) { 1078 var result; call count; 1080 // FUNC B function 1081 if ( CallObserver.isPassWhite() ) 1082 CallObserver.plus(); 1083 result = funcb( i ); 1084 if ( CallObserver.isPassWhite() ) 1085 CallObserver.minus(); 1086 return result; 1087 }; 1088 } 1089 }; 1090 self.info = function() { 1091 return { 1092 state: state, 1093 call count: call count, 1094 is access: is access 1095 }; 1096 }; 1097 self.fname = "taskloop2"; 1098 self.accessstate = function(){ 1099 return state; 1100 }; 1101 Profiler.registFunction( self ); 1102 return self; 1103 })(); //
63 A Profiler.swichAllHigh(); 1107 Profiler.infoFunctions(); 1108 toplevel(taskloop1);
shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (..
![shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (..](/thumbs/93/111616220.jpg "shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (..")
arisa@pllab.is.ocha.ac.jp asai@is.ocha.ac.jp shift / reset CPS shift / reset CPS CPS 1 [3, 5] goto try/catch raise call/cc [17] control/prompt [8], shift/reset [5] control/prompt, shift/reset call/cc (continuationpassing
東京工業大学情報理工学院 AO 入試 活動実績報告書 氏名 ( よみ ): 大岡山花子 ( おおおかやまはなこ ) 高等学校 : 県立 高等学校 (2019 年 3 月 卒業 卒業予定 ) 活動実績概要 (150 字程度 ): JavaScript ではコールバックを多用することがある. これはプロ
東京工業大学情報理工学院 AO 入試 活動実績報告書 氏名 ( よみ ): 大岡山花子 ( おおおかやまはなこ ) 高等学校 : 県立 高等学校 (2019 年 3 月 卒業 卒業予定 ) 活動実績概要 (150 字程度 ): JavaScript ではコールバックを多用することがある. これはプログラム全体の見通しを悪くするため, コールバック地獄と呼ばれる. そこで JavaScript でコールバック地獄が起こる原因と既存の解決方法について調査した.
Int Int 29 print Int fmt tostring 2 2 [19] ML ML [19] ML Emacs Standard ML M M ::= x c λx.m M M let x = M in M end (M) x c λx.
![Int Int 29 print Int fmt tostring 2 2 [19] ML ML [19] ML Emacs Standard ML M M ::= x c λx.m M M let x = M in M end (M) x c λx.](/thumbs/93/111616248.jpg "Int Int 29 print Int fmt tostring 2 2 [19] ML ML [19] ML Emacs Standard ML M M ::= x c λx.m M M let x = M in M end (M) x c λx.")
1, 2 1 m110057@shibaura-it.ac.jp 2 sasano@sic.shibaura-it.ac.jp Eclipse Visual Studio ML Standard ML Emacs 1 ( IDE ) IDE C C++ Java IDE IDE IDE IDE Eclipse Java IDE Java Standard ML 1 print (Int. 1 Int
Java演習(4) -- 変数と型 --
50 20 20 5 (20, 20) O 50 100 150 200 250 300 350 x (reserved 50 100 y 50 20 20 5 (20, 20) (1)(Blocks1.java) import javax.swing.japplet; import java.awt.graphics; (reserved public class Blocks1 extends
やさしいJavaプログラミング －Great Ideas for Java Programming サンプルPDF
pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) pref : 2004/6/5 (11:8) 3 5 14 18 21 23 23 24 28 29 29 31 32 34 35 35 36 38 40 44 44 45 46 49 49 50 pref : 2004/6/5 (11:8) 50 51 52 54 55 56 57 58 59 60 61
(CC Attribution) Lisp 2.1 (Gauche )
http://www.flickr.com/photos/dust/3603580129/ (CC Attribution) Lisp 2.1 (Gauche ) 2 2000EY-Office 3 4 Lisp 5 New York The lisps Sammy Tunis flickr lisp http://www.flickr.com/photos/dust/3603580129/ (CC
paper.pdf
Cop: Web 1,a) 1,b) GUI, UI,,., GUI, Java Swing., Web HTML CSS,. CSS,, CSS,.,, HTML CSS Cop. Cop, JavaScript,,. Cop, Web,. Web, HTML, CSS, JavaScript, 1., GUI, Web., HTML CSS (UI), JavaScript, Web GUI.
新・明解Java入門
537,... 224,... 224,... 32, 35,... 188, 216, 312 -... 38 -... 38 --... 102 --... 103 -=... 111 -classpath... 379 '... 106, 474!... 57, 97!=... 56 "... 14, 476 %... 38 %=... 111 &... 240, 247 &&... 66,
javascript key
Associate Professor Department of International Social Studies KYOAI GAKUEN UNIVERSITY Email: ogashiwa@c.kyoai.ac.jp, ogashiwa@wide.ad.jp sample
26 Web 1353001 27 2 10
1353001 Web Gmail Google Maps Web. Web. Web,,. Web,. Web. Web Web. Web Web. Web Web Web ( ).,.. Web,...,,.,.,... Web,,.. 26 Web 1353001 27 2 10 1 1 3 2 5 2.1 Web... 5 2.2 Web... 6 2.3 Web..................
Emacs ML let start ::= exp (1) exp ::= (2) fn id exp (3) ::= (4) (5) ::= id (6) const (7) (exp) (8) let val id = exp in
Emacs, {l06050,sasano}@sic.shibaura-it.ac.jp Eclipse Visual Studio Standard ML Haskell Emacs 1 Eclipse Visual Studio variable not found LR(1) let Emacs Emacs Emacs Java Emacs JDEE [3] JDEE Emacs Java 2
Exam : 1z1-809-JPN Title : Java SE 8 Programmer II Vendor : Oracle Version : DEMO Get Latest & Valid 1z1-809-JPN Exam's Question and Answers 1 from Ac
Actual4Test http://www.actual4test.com Actual4test - actual test exam dumps-pass for IT exams Exam : 1z1-809-JPN Title : Java SE 8 Programmer II Vendor : Oracle Version : DEMO Get Latest & Valid 1z1-809-JPN
maegaki_4_suzuki_yuusuke.pdf
JavaScript, ECMA262 5.1(June 2011) TC39 Conformance Suite Test262 Building modern JavaScript Engine YUSUKE SUZUKI, We implemented an engine that is fully compliant with ECMA262 5.1 (June 2011) and confirmed
解きながら学ぶJava入門編
44 // class Negative { System.out.print(""); int n = stdin.nextint(); if (n < 0) System.out.println(""); -10 Ÿ 35 Ÿ 0 n if statement if ( ) if i f ( ) if n < 0 < true false true false boolean literalboolean
listings-ext
(6) Python (2) ( ) ohsaki@kwansei.ac.jp 5 Python (2) 1 5.1 (statement)........................... 1 5.2 (scope)......................... 11 5.3 (subroutine).................... 14 5 Python (2) Python 5.1
JEB Plugin 開発チュートリアル 第4回
Japan Computer Emergency Response Team Coordination Center 電子署名者 : Japan Computer Emergency Response Team Coordination Center DN : c=jp, st=tokyo, l=chiyoda-ku, email=office@jpcert.or.jp, o=japan Computer
23 Study on Generation of Sudoku Problems with Fewer Clues
23 Study on Generation of Sudoku Problems with Fewer Clues 1120254 2012 3 1 9 9 21 18 i Abstract Study on Generation of Sudoku Problems with Fewer Clues Norimasa NASU Sudoku is puzzle a kind of pencil
Condition DAQ condition condition 2 3 XML key value
Condition DAQ condition 2009 6 10 2009 7 2 2009 7 3 2010 8 3 1 2 2 condition 2 3 XML key value 3 4 4 4.1............................. 5 4.2...................... 5 5 6 6 Makefile 7 7 9 7.1 Condition.h.............................
1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A B f : A B 4 (i) f (ii) f (iii) C 2 g, h: C A f g = f h g = h (iv) C 2 g, h: B C g f = h f g = h 4 (1) (i) (iii) (2) (iii) (i) (3) (ii) (iv) (4)
¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/97/134738565.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse")
I Exercise on Programming I http://bit.ly/oitprog1 1, 2 of 14 ( RD S ) I 1, 2 of 14 1 / 44 Ruby Ruby ( RD S ) I 1, 2 of 14 2 / 44 7 5 9 2 9 3 3 2 6 5 1 3 2 5 6 4 7 8 4 5 2 7 9 6 4 7 1 3 ( RD S ) I 1, 2
つくって学ぶプログラミング言語 RubyによるScheme処理系の実装
Ruby Scheme 2013-04-16 ( )! SICP *1 ;-) SchemeR SICP MIT * 1 Structure and Interpretaion of Computer Programs 2nd ed.: 2 i SchemeR Ruby Ruby Ruby Ruby & 3.0 Ruby ii https://github.com/ichusrlocalbin/scheme_in_ruby
I 2 tutimura/ I 2 p.1/??
I 2 tutimura@mist.i.u-tokyo.ac.jp http://www.misojiro.t.u-tokyo.ac.jp/ tutimura/ 2002 4 25 I 2 p.1/?? / / Makefile I 2 p.2/?? Makefile make GNU make I 2 p.3/?? Makefile L A T E X I 2 p.4/?? core (1) gcc,
Introduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for
Introduction Purpose This training course demonstrates the use of the High-performance Embedded Workshop (HEW), a key tool for developing software for embedded systems that use microcontrollers (MCUs)
Java updated
Java 2003.07.14 updated 3 1 Java 5 1.1 Java................................. 5 1.2 Java..................................... 5 1.3 Java................................ 6 1.3.1 Java.......................
cpp1.dvi
2017 c 1 C++ (1) C C++, C++, C 11, 12 13 (1) 14 (2) 11 1 n C++ //, [List 11] 1: #include // C 2: 3: int main(void) { 4: std::cout
Parametric Polymorphism
ML 2 2011/04/19 Parametric Polymorphism Type Polymorphism ? : val hd_int : int list - > int val hd_bool : bool list - > bool val hd_i_x_b : (int * bool) list - > int * bool etc. let hd_int = function (x
1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A, B Z Z m, n Z m n m, n A m, n B m=n (1) A, B (2) A B = A B = Z/ π : Z Z/ (3) A B Z/ (4) Z/ A, B (5) f : Z Z f(n) = n f = g π g : Z/ Z A, B (6)
「プログラミング言語」 SICP 第4章 ～超言語的抽象～ その6
SICP 4 6 igarashi@kuis.kyoto-u.ac.jp July 21, 2015 ( ) SICP 4 ( 6) July 21, 2015 1 / 30 4.3: Variations on a Scheme Non-deterministic Computing 4.3.1: amb 4.3.2: 4.3.3: amb ( ) SICP 4 ( 6) July 21, 2015
JavaScript 1.! DOM Ajax Shelley Powers,, JavaScript David Flanagan, JavaScript 2
JavaScript (2) 1 JavaScript 1.! 1. 2. 3. DOM 4. 2. 3. Ajax Shelley Powers,, JavaScript David Flanagan, JavaScript 2 (1) var a; a = 8; a = 3 + 4; a = 8 3; a = 8 * 2; a = 8 / 2; a = 8 % 3; 1 a++; ++a; (++
main.dvi
Dec. 3, 1998 http://www.jaist.ac.jp/ kaiya/ 1??...? : Java RMI http://www.jaist.ac.jp/ kaiya/ 2 ( ) [1] [2] Bertrand Meyer. The Next Software Breakthrough. COMPUTER, Vol. 30, No. 7, pp. 113 114, Jul. 1997.
CodeIgniter Con 2011, Tokyo Japan, February
CodeIgniter Con 2011, Tokyo Japan, February 19 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 http://www.iviking.org/fx.php/ 25 26 10 27 28 29 30 31
Dive into Algebraic Effects
Dive into Algebraic Effects びしょ じょ ML Days #2 September 16, 2018 やること Algebraic Effects を伝道 Algebraic Effects is 何 Algebraic Effects が使える言語 Algebraic Effects の活用事例 研究のご紹介先日 JSSST でポスター発表した内容を紹介シマス 目次 自己紹介
CX-Checker CX-Checker (1)XPath (2)DOM (3) 3 XPath CX-Checker. MISRA-C 62%(79/127) SQMlint 76%(13/17) XPath CX-Checker 3. CX-Checker 4., MISRA-C CX- Ch
CX-Checker: C 1 1 2 3 4 5 1 CX-Checker CX-Checker XPath DOM 3 CX-Checker MISRA-C CX-Checker: A Customizable Coding Checker for C TOSHINORI OSUKA, 1 TAKASHI KOBAYASHI, 1 JUNICHI MASE, 2 NORITOSHI ATSUMI,
コーディング基準.PDF
Java Java Java Java.java.class 1 private public package import / //////////////////////////////////////////////////////////////////////////////// // // // // ////////////////////////////////////////////////////////////////////////////////
untitled
30 callcc yhara ( ( ) (1) callcc (2) callcc (3) callcc callcc Continuation callcc (1) (2) (3) (1) (2) (3) (4) class Foo def f p 1 callcc{ cc return cc} p 2 class Bar def initialize @cc = Foo.new.f def
Java (9) 1 Lesson Java System.out.println() 1 Java API 1 Java Java 1
Java (9) 1 Lesson 7 2008-05-20 Java System.out.println() 1 Java API 1 Java Java 1 GUI 2 Java 3 1.1 5 3 1.0 10.0, 1.0, 0.5 5.0, 3.0, 0.3 4.0, 1.0, 0.6 1 2 4 3, ( 2 3 2 1.2 Java (stream) 4 1 a 5 (End of
PBASIC 2.5 PBASIC 2.5 $PBASIC directive PIN type New DEBUG control characters DEBUGIN Line continuation for comma-delimited lists IF THEN ELSE * SELEC
PBASIC 2.5 PBASIC 2.5 BASIC Stamp Editor / Development System Version 2.0 Beta Release 2 2.0 PBASIC BASIC StampR PBASIC PBASIC PBASIC 2.5 Parallax, Inc. PBASIC 2.5 PBASIC 2.5 support@microbot-ed.com 1
Web Web Web Web i
28 Research of password manager using pattern lock and user certificate 1170369 2017 2 28 Web Web Web Web i Abstract Research of password manager using pattern lock and user certificate Takuya Mimoto In
double float
2015 3 13 1 2 2 3 2.1.......................... 3 2.2............................. 3 3 4 3.1............................... 4 3.2 double float......................... 5 3.3 main.......................
TopLink å SampleClient.java... 5 Ò readallsample() querysample() cachesample() Ç..
lê~åäé= qçéiáåâ= NMÖENMKNKPF Volume2 Creation Date: Mar 04, 2005 Last Update: Aug 22, 2005 Version 1.0 ...3... 3 TopLink å...4 1... 4... 4 SampleClient.java... 5 Ò... 8... 9... 10 readallsample()... 11
,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
2 Mar Java (2) Java 3 Java (1) Java 19),20) Scheme Java car public static void Lcar(BCI bci) { Object x = bci.vs[bci.vsbase + 1]; if (!(x instan
![2 Mar Java (2) Java 3 Java (1) Java 19),20) Scheme Java car public static void Lcar(BCI bci) { Object x = bci.vs[bci.vsbase + 1]; if (!(x instan](/thumbs/92/108203049.jpg "2 Mar Java (2) Java 3 Java (1) Java 19),20) Scheme Java car public static void Lcar(BCI bci) { Object x = bci.vs[bci.vsbase + 1]; if (!(x instan")
Vol. 44 No. SIG 4(PRO 17) Mar. 2003 Java Lisp Java Lisp (1) Lisp Java (2) (3) Java Java Lisp Lisp Lisp IEEE Scheme 3,500 100 K A Lisp Driver to Be Embedded in Java Applications Taiichi Yuasa We present
すばやく小さくはじめられる HTML5 CSS3 JavaScriptで 青森のコンテンツをつくる 青森大学ソフトウェア情報学部 小久保 温(こくぼ あつし) alert('x=' + x); var styletable = { normal: "default", syncing: "syncing", failed:
VB.NETコーディング標準
(C) Copyright 2002 Java ( ) VB.NET C# AS-IS extremeprogramming-jp@objectclub.esm.co.jp bata@gold.ocn.ne.jp Copyright (c) 2000,2001 Eiwa System Management, Inc. Object Club Kenji Hiranabe02/09/26 Copyright
., White-Box, White-Box. White-Box.,, White-Box., Maple [11], 2. 1, QE, QE, 1 Redlog [7], QEPCAD [9], SyNRAC [8] 3 QE., 2 Brown White-Box. 3 White-Box
![., White-Box, White-Box. White-Box.,, White-Box., Maple [11], 2. 1, QE, QE, 1 Redlog [7], QEPCAD [9], SyNRAC [8] 3 QE., 2 Brown White-Box. 3 White-Box](/thumbs/91/105919953.jpg "., White-Box, White-Box. White-Box.,, White-Box., Maple [11], 2. 1, QE, QE, 1 Redlog [7], QEPCAD [9], SyNRAC [8] 3 QE., 2 Brown White-Box. 3 White-Box")
White-Box Takayuki Kunihiro Graduate School of Pure and Applied Sciences, University of Tsukuba Hidenao Iwane ( ) / Fujitsu Laboratories Ltd. / National Institute of Informatics. Yumi Wada Graduate School
New version (2.15.1) of Specview is now available Dismiss Windows Specview.bat set spv= Specview set jhome= JAVA (C:\Program Files\Java\jre<version>\
![New version (2.15.1) of Specview is now available Dismiss Windows Specview.bat set spv= Specview set jhome= JAVA (C:\Program Files\Java\jre<version>\](/thumbs/92/109450602.jpg "New version (2.15.1) of Specview is now available Dismiss Windows Specview.bat set spv= Specview set jhome= JAVA (C:\Program Files\Java\jre<version>\")
Specview VO 2012 2012/3/26 Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page http://www.stsci.edu/resources/software hardware/specview http://specview.stsci.edu/javahelp/main.html
,4) 1 P% P%P=2.5 5%!%! (1) = (2) l l Figure 1 A compilation flow of the proposing sampling based architecture simulation
1 1 1 1 SPEC CPU 2000 EQUAKE 1.6 50 500 A Parallelizing Compiler Cooperative Multicore Architecture Simulator with Changeover Mechanism of Simulation Modes GAKUHO TAGUCHI 1 YOUICHI ABE 1 KEIJI KIMURA 1
Java プログラミング Ⅰ 3 回目変 数 今日の講義講義で学ぶ内容 変数とは 変数の使い方 キーボード入力の仕方 変 数 変 数 一時的に値を記憶させておく機能 変数は 型 ( データ型 ) と識別子をもちます 2 型 ( データ型 ) 変数に記憶する値の種類変数の型は 記憶できる値の種類と範囲
Java プログラミング Ⅰ 3 回目変 数 今日の講義講義で学ぶ内容 変数とは 変数の使い方 キーボード入力の仕方 変 数 変 数 一時的に値を記憶させておく機能 変数は 型 ( データ型 ) と識別子をもちます 2 型 ( データ型 ) 変数に記憶する値の種類変数の型は 記憶できる値の種類と範囲を決定します 次の型が利用でき これらの型は特に基本型とよばれます 基本型 値の種類 値の範囲 boolean
連載講座 : 高生産並列言語を使いこなす (4) ゲーム木探索の並列化 田浦健次朗 東京大学大学院情報理工学系研究科, 情報基盤センター 目次 1 準備 問題の定義 αβ 法 16 2 αβ 法の並列化 概要 Young Brothers Wa
連載講座 : 高生産並列言語を使いこなす (4) ゲーム木探索の並列化 田浦健次朗 東京大学大学院情報理工学系研究科, 情報基盤センター 目次 1 準備 16 1.1 問題の定義 16 1.2 αβ 法 16 2 αβ 法の並列化 17 2.1 概要 17 2.2 Young Brothers Wait Concept 17 2.3 段数による逐次化 18 2.4 適応的な待機 18 2. 強制終了
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 5 3. 4. 5. A0 (1) A, B A B f K K A ϕ 1, ϕ 2 f ϕ 1 = f ϕ 2 ϕ 1 = ϕ 2 (2) N A 1, A 2, A 3,... N A n X N n X N, A n N n=1 1 A1 d (d 2) A (, k A k = O), A O. f
For_Beginners_CAPL.indd
CAPL Vector Japan Co., Ltd. 目次 1 CAPL 03 2 CAPL 03 3 CAPL 03 4 CAPL 04 4.1 CAPL 4.2 CAPL 4.3 07 5 CAPL 08 5.1 CANoe 5.2 CANalyzer 6 CAPL 10 7 CAPL 11 7.1 CAPL 7.2 CAPL 7.3 CAPL 7.4 CAPL 16 7.5 18 8 CAPL
r1.dvi
2014 1 2014.4.10 0 / 1 / 2 / 3 Lisp 4 5 ( ) 1 (5 1 ) 5 1 1.1? 0 1 (bit sequence) 5 101 3 11 2 (binary system) 2 1000 8 1 ( ) ( )? ( 1) r1 1000 1001 r2 1002... r3 1: (memory) (address) CPU (instruction)
JavaScript の使い方
JavaScript Release10.5 JavaScript NXJ JavaScript JavaScript JavaScript 2 JavaScript JavaScript JavaScript NXJ JavaScript 1: JavaScript 2: JavaScript 3: JavaScript 4: 1 1: JavaScript JavaScript NXJ Static
解きながら学ぶC++入門編
!... 38!=... 35 "... 112 " "... 311 " "... 4, 264 #... 371 #define... 126, 371 #endif... 369 #if... 369 #ifndef... 369 #include... 3, 311 #undef... 371 %... 17, 18 %=... 85 &... 222 &... 203 &&... 40 &=...
Thread
14 2013 7 16 14.1....................................... 14 1 14.2 Thread................................... 14 1 14.3............................. 14 5 14.4....................................... 14 10
2
Haskell ( ) kazu@iij.ad.jp 1 2 Blub Paul Graham http://practical-scheme.net/trans/beating-the-averages-j.html Blub Blub Blub Blub 3 Haskell Sebastian Sylvan http://www.haskell.org/haskellwiki/why_haskell_matters...
class IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value =
Part2-1-3 Java (*) (*).class Java public static final 1 class IntCell { private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value
SCM (v0201) ( ) SCM 2 SCM 3 SCM SCM 2.1 SCM SCM SCM (1) MS-DOS (2) Microsoft(R) Windows 95 (C)Copyright Microsoft Corp
SCM (v0201) ( ) 14 4 20 1 SCM 2 SCM 3 SCM 4 5 2 SCM 2.1 SCM SCM 2 1 2 SCM (1) MS-DOS (2) Microsoft(R) Windows 95 (C)Copyright Microsoft Corp 1981-1996. 1 (3) C:\WINDOWS>cd.. C:\>cd scm C:\SCM> C:\SCM>
haskell.gby
Haskell 1 2 3 Haskell ( ) 4 Haskell Lisper 5 Haskell = Haskell 6 Haskell Haskell... 7 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 div 2 3 4 map even [1,2,3,4]
ML λ λ 1 λ 1.1 λ λ λ e (λ ) ::= x ( ) λx.e (λ ) e 1 e 2 ( ) ML λx.e Objective Caml fun x -> e x e let 1
2005 sumii@ecei.tohoku.ac.jp 2005 6 24 ML λ λ 1 λ 1.1 λ λ λ e (λ ) ::= x ( ) λx.e (λ ) e 1 e 2 ( ) ML λx.e Objective Caml fun x -> e x e let 1 let λ 1 let x = e1 in e2 (λx.e 2 )e 1 e 1 x e 2 λ 3 λx.(λy.e)
アルゴリズムとデータ構造１
1 2005 7 22 22 (sakai.keiichi@kochi sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2005/index.html tech.ac.jp/k1sakai/lecture/alg/2005/index.html f(0) = 1, f(x) =
新版明解Ｃ言語 実践編
2 List - "max.h" a, b max List - max "max.h" #define max(a, b) ((a) > (b)? (a) : (b)) max List -2 List -2 max #include "max.h" int x, y; printf("x"); printf("y"); scanf("%d", &x); scanf("%d", &y); printf("max(x,
untitled
JavaScript HP JavaScript JavaScript Web JavaScript Web JavaScript JavaScript JavaScript HTML HTML HTML JavaScript 1. JavaScript ON/OFF 2. JavaScript 3. 4. 5. 6. 7. 8. 9. 10. if 11. if 12. switch 13. 14.
6-1
6-1 (data type) 6-2 6-3 ML, Haskell, Scala Lisp, Prolog (setq x 123) (+ x 456) (setq x "abc") (+ x 456) ; 6-4 ( ) subtype INDEX is INTEGER range -10..10; type DAY is (MON, TUE, WED, THU, FRI, SAT, SUN);
untitled
CA Easytrieve CA Technologies CA Easytrieve P 3 7 P 8 30 16 DB2 IMS IMS ADABAS JCL OS 2 Copyright 2012 CA. All rights reserved. CA Easytrieve CA Easytrieve CA Easytrieve CA Easytrieve COBOL,PL/I 3 Copyright
DEIM Forum 2019 H2-2 SuperSQL SuperSQL SQL SuperSQL Web SuperSQL DBMS Pi
DEIM Forum 2019 H2-2 SuperSQL 223 8522 3 14 1 E-mail: {terui,goto}@db.ics.keio.ac.jp, toyama@ics.keio.ac.jp SuperSQL SQL SuperSQL Web SuperSQL DBMS PipelineDB SuperSQL Web Web 1 SQL SuperSQL HTML SuperSQL
Vol.55 No (Jan. 2014) saccess 6 saccess 7 saccess 2. [3] p.33 * B (A) (B) (C) (D) (E) (F) *1 [3], [4] Web PDF a m
![Vol.55 No (Jan. 2014) saccess 6 saccess 7 saccess 2. [3] p.33 * B (A) (B) (C) (D) (E) (F) *1 [3], [4] Web PDF a m](/thumbs/92/108648363.jpg "Vol.55 No (Jan. 2014) saccess 6 saccess 7 saccess 2. [3] p.33 * B (A) (B) (C) (D) (E) (F) *1 [3], [4] Web PDF a m")
Vol.55 No.1 2 15 (Jan. 2014) 1,a) 2,3,b) 4,3,c) 3,d) 2013 3 18, 2013 10 9 saccess 1 1 saccess saccess Design and Implementation of an Online Tool for Database Education Hiroyuki Nagataki 1,a) Yoshiaki
GIMP
(JavaScript ) Javascript 1. 2 2. 3. A, K, Q, J, 10, 9, 8, 7, 4. 5. 6. 7. J Q K A 8. 9. 6 10. 11. 12. 13. A- K- Q- J- 10-9 8 7 JavaScript.png 1 GIMP 200 300 2 var ctx; function init()
3 3.1 algebraic datatype data k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] B
![3 3.1 algebraic datatype data k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] B](/thumbs/102/156825138.jpg "3 3.1 algebraic datatype data k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] B")
3 3.1 algebraic datatype data 1 2... k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] Bob String y Charlie Foo Double Integer Alice 3.14 [1,2],
e-learning station 1) 2) 1) 3) 2) 2) 1) 4) e-learning Station 16 e-learning e-learning key words: e-learning LMS CMS A Trial and Prospect of Kumamoto
e-learning station 1) 2) 1) 3) 2) 2) 1) 4) e-learning Station 16 e-learning e-learning key words: e-learninglms CMS A Trial and Prospect of Kumamoto University e-learning Station Hiroshi Nakano 1) Kazuhisa
B 20 Web
B 20 Web 0753018 21 1 29 1 1 6 2 8 3 UI 10 3.1........................ 10 3.2 Web............ 11 3.3......... 12 4 UI 14 4.1 Web....................... 15 4.2 Web........... 16 4.3 Web....................
GIMP
(JavaScript ) Javascript 2 1. 2 2. 52 3. A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3, 2 4. 13 5. 6. 7. 8. 9. 13 10. 11. 12. JavaScript.png 1 GIMP 200 300 2 var ctx; function init() { var
0.2 Button TextBox: menu tab 2
Specview VO 2012 2012/9/27 Specview Specview STSCI(Space Telescope SCience Institute) VO Specview Web page http://www.stsci.edu/resources/software hardware/specview http://specview.stsci.edu/javahelp/main.html
独立行政法人情報通信研究機構 Development of the Information Analysis System WISDOM KIDAWARA Yutaka NICT Knowledge Clustered Group researched and developed the infor
独立行政法人情報通信研究機構 KIDAWARA Yutaka NICT Knowledge Clustered Group researched and developed the information analysis system WISDOM as a research result of the second medium-term plan. WISDOM has functions that
1. IEEE Xplore 1.1. IEEE Xplore Institute of electrical and Electronics Engineers (IEEE) Institution of Electrical Engineers (IEE) 12, IEEE Xpl
IEL Online IEEE Xplore2.0 - IEEE/IEE Electronic Library Online - 1. IEEE XPLORE... 2 1. IEEE XPLORE... 2 1.1.... 2 1.2. IEEE XPLORE... 2 1.3. IEEE XPLORE... 3 1.4. IEEE XPLORE... 3 2.... 4 2.1.... 5 2.2....
fiš„v3.dvi
(2001) 49 2 261 275 Web 1 1 2001 2 21 2001 4 26 Windows OS Web Windows OS, DELPHI, 1. Windows OS. DELPHI Web DELPHI ALGOL PASCAL VISUAL BASIC C++ JAVA DELPHI Windows OS Linux OS KyLix Mac OS (ver 10) JAVA
.NETプログラマー早期育成ドリル ～VB編 付録 文法早見表～
.NET プログラマー早期育成ドリル VB 編 付録文法早見表 本資料は UUM01W:.NET プログラマー早期育成ドリル VB 編コードリーディング もしくは UUM02W:.NET プログラマー早期育成ドリル VB 編コードライティング を ご購入頂いた方にのみ提供される資料です 資料内容の転載はご遠慮下さい VB プログラミング文法早見表 < 基本文法 > 名前空間の定義 Namespace
2 2 3 dbxtool dbx (GUI) dbxtool dbx C++ Oracle Solaris Studio 12.2 examples/debugger/debug_tutorial 1. cp -r /opt/solstudio12.2/examples/de
Oracle Solaris Studio 12.2 dbxtool 2010 9 2 2 3 dbxtool 7 15 24 44 dbx (GUI) dbxtool dbx C++ Oracle Solaris Studio 12.2 examples/debugger/debug_tutorial 1. cp -r /opt/solstudio12.2/examples/debugger/debug_tutorial
Java (5) 1 Lesson 3: x 2 +4x +5 f(x) =x 2 +4x +5 x f(10) x Java , 3.0,..., 10.0, 1.0, 2.0,... flow rate (m**3/s) "flow
Java (5) 1 Lesson 3: 2008-05-20 2 x 2 +4x +5 f(x) =x 2 +4x +5 x f(10) x Java 1.1 10 10 0 1.0 2.0, 3.0,..., 10.0, 1.0, 2.0,... flow rate (m**3/s) "flowrate.dat" 10 8 6 4 2 0 0 5 10 15 20 25 time (s) 1 1
PowerPoint Presentation
UML 2004 7 9 10 ... OOP UML 10 Copyright 2004 Akira HIRASAWA all rights reserved. 2 1. 2. 3. 4. UML 5. Copyright 2004 Akira HIRASAWA all rights reserved. 3 1..... Copyright 2004 Akira HIRASAWA all rights
: Name, Tel name tel (! ) name : Name! Tel tel ( % ) 3. HTML. : Name % Tel name tel 2. 2,., [ ]!, [ ]!, [ ]!,. [! [, ]! ]!,,. ( [ ], ),. : [Name], nam
![: Name, Tel name tel (! ) name : Name! Tel tel ( % ) 3. HTML. : Name % Tel name tel 2. 2,., [ ]!, [ ]!, [ ]!,. [! [, ]! ]!,,. ( [ ], ),. : [Name], nam](/thumbs/91/105870020.jpg ": Name, Tel name tel (! ) name : Name! Tel tel ( % ) 3. HTML. : Name % Tel name tel 2. 2,., [ ]!, [ ]!, [ ]!,. [! [, ]! ]!,,. ( [ ], ),. : [Name], nam")
DEIM Forum 2010 F6-1 SuperSQL Ajax 223 8522 3 14 1 E-mail: kabu@db.ics.keio.ac.jp, toyama@ics.keio.ac.jp SuperSQL Ajax, GUI, GUI,, Ajax SuperSQL, HTML, Ajax, RIA Abstract Layout Function Extends for Generating
untitled
Caché Agenda InterSystems Caché 2009.1.NET Gateway (2009.1) Truncate Caché Databases ( ( Studio Caché ObjectScript SQL Object Security InterSystems (200x.1, 200x.2) 5.2 : 2006/6 2007.1 : 2007/6 2008.1
Boo Boo 2 Boo 2.NET Framework SDK 2 Subversion 2 2 Java 4 NAnt 5 Boo 5 5 Boo if 11 for 11 range 12 break continue 13 pass
Boo Boo 2 Boo 2.NET Framework SDK 2 Subversion 2 2 Java 4 NAnt 5 Boo 5 5 Boo 6 6 7 9 10 11 if 11 for 11 range 12 break continue 13 pass 13 13 14 15 15 23 23 24 24 24 25 import 26 27-1- Boo Boo Python CLI.NET
TEX American Mathematical Society PostScript Adobe Systems Incorporated
P A D manual ( pad2ps 3.1j ) (seiichi@muraoka.info.waseda.ac.jp) 1996 11 2 TEX American Mathematical Society PostScript Adobe Systems Incorporated pad2ps PAD PAD (Problem Analysis Diagram) C 1 2 PAD PAD
exec.dvi
2018 c 6, Mini-C C++ 6211 611, 61, print,,, (run ),,, (int ), 7, x, x "a" 3 "b" 4 "x" 10 (, ), x STL map 1 + 2, 1 2,, x = ;, 1, 2 x { 1 ; 2 ; ; m, if ( ) { 1 else { 2, 1,, 2 0, 1, 3 0, 2,,, main 6 1 ,,
2004 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 2
Living with Mac OS X in Lambda 21 2004 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 1 2004 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 2 2004
MacOSXLambdaJava.aw
Living with Mac OS X in Lambda 21 2005 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 1 2005 Copyright by Tatsuo Minohara Programming with Mac OS X in Lambda 21 - page 2 2005
VDM-SL VDM VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web bool
VDM-SL VDM++ 23 6 28 VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web 2 1 3 1.1............................................... 3 1.1.1 bool......................................... 3 1.1.2 real rat int
Scheme Hygienic Macro stibear (@stibear1996) 1 Scheme Scheme Lisp Lisp Common Lisp Emacs Lisp Clojure Scheme 1 Lisp Lisp Lisp Lisp Homoiconicity Lisper 2 Common Lisp gensym Scheme Common Lisp Scheme Lisp-1
FileMaker ODBC and JDBC Guide
FileMaker 13 ODBC JDBC 2004-2013 FileMaker, Inc. All Rights Reserved. FileMaker, Inc. 5201 Patrick Henry Drive Santa Clara, California 95054 FileMaker Bento FileMaker, Inc. FileMaker WebDirect Bento FileMaker,
ALG ppt
2012 6 21 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2012/index.html 1 l l O(1) l l l 2 (123 ) l l l l () l H(k) = k mod n (k:, n: ) l l 3 4 public class MyHashtable
2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN
![2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN](/thumbs/93/113095957.jpg "2006 [3] Scratch Squeak PEN [4] PenFlowchart 2 3 PenFlowchart 4 PenFlowchart PEN xdncl PEN [5] PEN xdncl DNCL 1 1 [6] 1 PEN Fig. 1 The PEN")
PenFlowchart 1,a) 2,b) 3,c) 2015 3 4 2015 5 12, 2015 9 5 PEN & PenFlowchart PEN Evaluation of the Effectiveness of Programming Education with Flowcharts Using PenFlowchart Wataru Nakanishi 1,a) Takeo Tatsumi
r3.dvi
2012 3 / Lisp(2) 2012.4.19 1 Lisp 1.1 Lisp Lisp (1) (setq) (2) (3) setq defun (defun (... &aux...)...) ( ) ( nil ) [1]> (defun sisoku (x y &aux wa sa sho seki) (setq wa (+ x y)) (setq sa (- x y)) (setq
2
1 2 3 4 5 6 7 8 tbody tr div [_im_enclosure] div [_im_repeater] span [_im_enclosure] span [_im_repeater] ol li ul li select option 9 10
Javaセキュアコーディングセミナー東京 第4回 メソッドとセキュリティ 演習解説
Japan Computer Emergency Response Team Coordination Center 電子署名者 : Japan Computer Emergency Response Team Coordination Center DN : c=jp, st=tokyo, l=chiyoda-ku, email=office@jpcert.or.jp, o=japan Computer
28 Docker Design and Implementation of Program Evaluation System Using Docker Virtualized Environment
28 Docker Design and Implementation of Program Evaluation System Using Docker Virtualized Environment 1170288 2017 2 28 Docker,.,,.,,.,,.,. Docker.,..,., Web, Web.,.,.,, CPU,,. i ., OS..,, OS, VirtualBox,.,
untitled
2011 6 20 (sakai.keiichi@kochi-tech.ac.jp) http://www.info.kochi-tech.ac.jp/k1sakai/lecture/alg/2011/index.html tech.ac.jp/k1sakai/lecture/alg/2011/index.html html 1 O(1) O(1) 2 (123) () H(k) = k mod n
C
C 1 2 1.1........................... 2 1.2........................ 2 1.3 make................................................ 3 1.4....................................... 5 1.4.1 strip................................................