원문: Key words for use in RFCs to Indicate Requirement Levels
이 문서는 인터넷 커뮤니티의 최상 현행 규정을 정의하고, 개선을 위해 토론과 제안을
| function LFSR113(a, b, c, d) { | |
| if ((a |= 0) < 1) throw 'a must bigger than 1'; | |
| if ((b |= 0) < 7) throw 'b must bigger than 7'; | |
| if ((c |= 0) < 15) throw 'c must bigger than 15'; | |
| if ((d |= 0) < 127) throw 'd must bigger than 127'; | |
| this.next = function () { | |
| var e = ((a << 6) ^ a) >> 13; | |
| a = ((a & 4294967294) << 18) ^ e; | |
| e = ((b << 2) ^ b) >> 27; | |
| b = ((b & 4294967288) << 2) ^ e; |
| [ | |
| { "keys": ["home"], "command": "move_to", "args": {"to": "bol"} }, | |
| { "keys": ["end"], "command": "move_to", "args": {"to": "eol"} }, | |
| { "keys": ["shift+end"], "command": "move_to", "args": {"to": "eol", "extend": true} }, | |
| { "keys": ["shift+home"], "command": "move_to", "args": {"to": "bol", "extend": true } } | |
| ] |
원문: Key words for use in RFCs to Indicate Requirement Levels
이 문서는 인터넷 커뮤니티의 최상 현행 규정을 정의하고, 개선을 위해 토론과 제안을
| var fs = require('fs'); | |
| var path = require('path'); | |
| postMerge('.'); | |
| function postMerge(currentPath) { | |
| var dir; | |
| var mkdir; | |
| var stat; | |
| stat = fs.statSync(currentPath); |
| Shader "Custom/SplattingTerrain" | |
| { | |
| Properties | |
| { | |
| _R ("R channel Image", 2D) = "white" {} | |
| _G ("G channel Image", 2D) = "white" {} | |
| _B ("B channel Image", 2D) = "white" {} | |
| _A ("A channel Image", 2D) = "white" {} | |
| } | |
| SubShader |
| function drawCircle( graphics:Graphics, x:Number, y:Number, radius:Number ):void | |
| { | |
| var k:Number = 4 / 3 * ( Math.SQRT2 - 1 ); | |
| var a:Number, b:Number, c:Number, d:Number, e:Number; | |
| var ax:Number, bx:Number, cx:Number, dx:Number, ex:Number; | |
| var ay:Number, by:Number, cy:Number, dy:Number, ey:Number; | |
| e = radius; | |
| d = k * radius; | |
| c = 0; | |
| b = -d; |
| import math | |
| def divide(a): | |
| b = int(a / 2) | |
| if a % 2 == 1: | |
| return [b, b + 1] | |
| return [b, b] | |
| def factorization(a): | |
| primes = [] |
| function divide( a:int ):Array | |
| { | |
| var b:int = int( a/2 ); | |
| if( a%2 == 1 ) return [ b, b+1 ]; | |
| else return [ b, b ]; | |
| } | |
| function factorization( a:int ):Array | |
| { | |
| var primes:Array = []; |
| //정수의 인수분해 | |
| function factorization( a:int ):Array | |
| { | |
| var primes:Array = []; | |
| var factor:int = 2; | |
| if( a<2 ) return [ a ]; | |
| while( a>1 ) | |
| { | |
| while( a%factor ) ++factor; | |
| primes.push( factor ); |