diff --git a/404.html b/404.html new file mode 100644 index 0000000..bdd40bd --- /dev/null +++ b/404.html @@ -0,0 +1 @@ +Eli | Page not found

Error 404: Page not found

The page you were looking for could not be found. Maybe it was moved?

\ No newline at end of file diff --git a/CNAME b/CNAME new file mode 100644 index 0000000..26b3e94 --- /dev/null +++ b/CNAME @@ -0,0 +1 @@ +elihunter173.com diff --git a/asteroids/AstroSpace.otf b/asteroids/AstroSpace.otf new file mode 100644 index 0000000..627380f Binary files /dev/null and b/asteroids/AstroSpace.otf differ diff --git a/asteroids/bundle.js b/asteroids/bundle.js new file mode 100644 index 0000000..cd00573 --- /dev/null +++ b/asteroids/bundle.js @@ -0,0 +1,2 @@ +(()=>{"use strict";var e={d:(r,t)=>{for(var n in t)e.o(t,n)&&!e.o(r,n)&&Object.defineProperty(r,n,{enumerable:!0,get:t[n]})},o:(e,r)=>Object.prototype.hasOwnProperty.call(e,r),r:e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})}},r={};e.r(r),e.d(r,{add:()=>f,angle:()=>O,bezier:()=>R,ceil:()=>y,clone:()=>i,copy:()=>u,create:()=>o,cross:()=>L,dist:()=>X,distance:()=>M,div:()=>Q,divide:()=>d,dot:()=>F,equals:()=>z,exactEquals:()=>K,floor:()=>m,forEach:()=>$,fromValues:()=>l,hermite:()=>B,inverse:()=>P,len:()=>J,length:()=>s,lerp:()=>j,max:()=>g,min:()=>v,mul:()=>Y,multiply:()=>p,negate:()=>A,normalize:()=>E,random:()=>k,rotateX:()=>I,rotateY:()=>U,rotateZ:()=>C,round:()=>b,scale:()=>w,scaleAndAdd:()=>x,set:()=>c,sqrDist:()=>W,sqrLen:()=>Z,squaredDistance:()=>T,squaredLength:()=>S,str:()=>q,sub:()=>H,subtract:()=>h,transformMat3:()=>_,transformMat4:()=>D,transformQuat:()=>V,zero:()=>N});var t=1e-6,n="undefined"!=typeof Float32Array?Float32Array:Array,a=Math.random;function o(){var e=new n(3);return n!=Float32Array&&(e[0]=0,e[1]=0,e[2]=0),e}function i(e){var r=new n(3);return r[0]=e[0],r[1]=e[1],r[2]=e[2],r}function s(e){var r=e[0],t=e[1],n=e[2];return Math.hypot(r,t,n)}function l(e,r,t){var a=new n(3);return a[0]=e,a[1]=r,a[2]=t,a}function u(e,r){return e[0]=r[0],e[1]=r[1],e[2]=r[2],e}function c(e,r,t,n){return e[0]=r,e[1]=t,e[2]=n,e}function f(e,r,t){return e[0]=r[0]+t[0],e[1]=r[1]+t[1],e[2]=r[2]+t[2],e}function h(e,r,t){return e[0]=r[0]-t[0],e[1]=r[1]-t[1],e[2]=r[2]-t[2],e}function p(e,r,t){return e[0]=r[0]*t[0],e[1]=r[1]*t[1],e[2]=r[2]*t[2],e}function d(e,r,t){return e[0]=r[0]/t[0],e[1]=r[1]/t[1],e[2]=r[2]/t[2],e}function y(e,r){return e[0]=Math.ceil(r[0]),e[1]=Math.ceil(r[1]),e[2]=Math.ceil(r[2]),e}function m(e,r){return e[0]=Math.floor(r[0]),e[1]=Math.floor(r[1]),e[2]=Math.floor(r[2]),e}function v(e,r,t){return e[0]=Math.min(r[0],t[0]),e[1]=Math.min(r[1],t[1]),e[2]=Math.min(r[2],t[2]),e}function g(e,r,t){return e[0]=Math.max(r[0],t[0]),e[1]=Math.max(r[1],t[1]),e[2]=Math.max(r[2],t[2]),e}function b(e,r){return e[0]=Math.round(r[0]),e[1]=Math.round(r[1]),e[2]=Math.round(r[2]),e}function w(e,r,t){return e[0]=r[0]*t,e[1]=r[1]*t,e[2]=r[2]*t,e}function x(e,r,t,n){return e[0]=r[0]+t[0]*n,e[1]=r[1]+t[1]*n,e[2]=r[2]+t[2]*n,e}function M(e,r){var t=r[0]-e[0],n=r[1]-e[1],a=r[2]-e[2];return Math.hypot(t,n,a)}function T(e,r){var t=r[0]-e[0],n=r[1]-e[1],a=r[2]-e[2];return t*t+n*n+a*a}function S(e){var r=e[0],t=e[1],n=e[2];return r*r+t*t+n*n}function A(e,r){return e[0]=-r[0],e[1]=-r[1],e[2]=-r[2],e}function P(e,r){return e[0]=1/r[0],e[1]=1/r[1],e[2]=1/r[2],e}function E(e,r){var t=r[0],n=r[1],a=r[2],o=t*t+n*n+a*a;return o>0&&(o=1/Math.sqrt(o)),e[0]=r[0]*o,e[1]=r[1]*o,e[2]=r[2]*o,e}function F(e,r){return e[0]*r[0]+e[1]*r[1]+e[2]*r[2]}function L(e,r,t){var n=r[0],a=r[1],o=r[2],i=t[0],s=t[1],l=t[2];return e[0]=a*l-o*s,e[1]=o*i-n*l,e[2]=n*s-a*i,e}function j(e,r,t,n){var a=r[0],o=r[1],i=r[2];return e[0]=a+n*(t[0]-a),e[1]=o+n*(t[1]-o),e[2]=i+n*(t[2]-i),e}function B(e,r,t,n,a,o){var i=o*o,s=i*(2*o-3)+1,l=i*(o-2)+o,u=i*(o-1),c=i*(3-2*o);return e[0]=r[0]*s+t[0]*l+n[0]*u+a[0]*c,e[1]=r[1]*s+t[1]*l+n[1]*u+a[1]*c,e[2]=r[2]*s+t[2]*l+n[2]*u+a[2]*c,e}function R(e,r,t,n,a,o){var i=1-o,s=i*i,l=o*o,u=s*i,c=3*o*s,f=3*l*i,h=l*o;return e[0]=r[0]*u+t[0]*c+n[0]*f+a[0]*h,e[1]=r[1]*u+t[1]*c+n[1]*f+a[1]*h,e[2]=r[2]*u+t[2]*c+n[2]*f+a[2]*h,e}function k(e,r){r=r||1;var t=2*a()*Math.PI,n=2*a()-1,o=Math.sqrt(1-n*n)*r;return e[0]=Math.cos(t)*o,e[1]=Math.sin(t)*o,e[2]=n*r,e}function D(e,r,t){var n=r[0],a=r[1],o=r[2],i=t[3]*n+t[7]*a+t[11]*o+t[15];return i=i||1,e[0]=(t[0]*n+t[4]*a+t[8]*o+t[12])/i,e[1]=(t[1]*n+t[5]*a+t[9]*o+t[13])/i,e[2]=(t[2]*n+t[6]*a+t[10]*o+t[14])/i,e}function _(e,r,t){var n=r[0],a=r[1],o=r[2];return e[0]=n*t[0]+a*t[3]+o*t[6],e[1]=n*t[1]+a*t[4]+o*t[7],e[2]=n*t[2]+a*t[5]+o*t[8],e}function V(e,r,t){var n=t[0],a=t[1],o=t[2],i=t[3],s=r[0],l=r[1],u=r[2],c=a*u-o*l,f=o*s-n*u,h=n*l-a*s,p=a*h-o*f,d=o*c-n*h,y=n*f-a*c,m=2*i;return c*=m,f*=m,h*=m,p*=2,d*=2,y*=2,e[0]=s+c+p,e[1]=l+f+d,e[2]=u+h+y,e}function I(e,r,t,n){var a=[],o=[];return a[0]=r[0]-t[0],a[1]=r[1]-t[1],a[2]=r[2]-t[2],o[0]=a[0],o[1]=a[1]*Math.cos(n)-a[2]*Math.sin(n),o[2]=a[1]*Math.sin(n)+a[2]*Math.cos(n),e[0]=o[0]+t[0],e[1]=o[1]+t[1],e[2]=o[2]+t[2],e}function U(e,r,t,n){var a=[],o=[];return a[0]=r[0]-t[0],a[1]=r[1]-t[1],a[2]=r[2]-t[2],o[0]=a[2]*Math.sin(n)+a[0]*Math.cos(n),o[1]=a[1],o[2]=a[2]*Math.cos(n)-a[0]*Math.sin(n),e[0]=o[0]+t[0],e[1]=o[1]+t[1],e[2]=o[2]+t[2],e}function C(e,r,t,n){var a=[],o=[];return a[0]=r[0]-t[0],a[1]=r[1]-t[1],a[2]=r[2]-t[2],o[0]=a[0]*Math.cos(n)-a[1]*Math.sin(n),o[1]=a[0]*Math.sin(n)+a[1]*Math.cos(n),o[2]=a[2],e[0]=o[0]+t[0],e[1]=o[1]+t[1],e[2]=o[2]+t[2],e}function O(e,r){var t=e[0],n=e[1],a=e[2],o=r[0],i=r[1],s=r[2],l=Math.sqrt(t*t+n*n+a*a)*Math.sqrt(o*o+i*i+s*s),u=l&&F(e,r)/l;return Math.acos(Math.min(Math.max(u,-1),1))}function N(e){return e[0]=0,e[1]=0,e[2]=0,e}function q(e){return"vec3("+e[0]+", "+e[1]+", "+e[2]+")"}function K(e,r){return e[0]===r[0]&&e[1]===r[1]&&e[2]===r[2]}function z(e,r){var n=e[0],a=e[1],o=e[2],i=r[0],s=r[1],l=r[2];return Math.abs(n-i)<=t*Math.max(1,Math.abs(n),Math.abs(i))&&Math.abs(a-s)<=t*Math.max(1,Math.abs(a),Math.abs(s))&&Math.abs(o-l)<=t*Math.max(1,Math.abs(o),Math.abs(l))}Math.PI,Math.hypot||(Math.hypot=function(){for(var e=0,r=arguments.length;r--;)e+=arguments[r]*arguments[r];return Math.sqrt(e)});var G,H=h,Y=p,Q=d,X=M,W=T,J=s,Z=S,$=(G=o(),function(e,r,t,n,a,o){var i,s;for(r||(r=3),t||(t=0),s=n?Math.min(n*r+t,e.length):e.length,i=t;i=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(r?"Object is not iterable.":"Symbol.iterator is not defined.")}),pe=function(e,r){var t="function"==typeof Symbol&&e[Symbol.iterator];if(!t)return e;var n,a,o=t.call(e),i=[];try{for(;(void 0===r||r-- >0)&&!(n=o.next()).done;)i.push(n.value)}catch(e){a={error:e}}finally{try{n&&!n.done&&(t=o.return)&&t.call(o)}finally{if(a)throw a.error}}return i},de=function(e,r,t){if(t||2===arguments.length)for(var n,a=0,o=r.length;a0)&&!(n=o.next()).done;)i.push(n.value)}catch(e){a={error:e}}finally{try{n&&!n.done&&(t=o.return)&&t.call(o)}finally{if(a)throw a.error}}return i},ke=function(e,r,t){if(t||2===arguments.length)for(var n,a=0,o=r.length;a=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(r?"Object is not iterable.":"Symbol.iterator is not defined.")},_e=be,Ve=function(){function e(e,r,t){void 0===t&&(t=ee());var n=r.vertices.flat(),a=e.createBuffer();if(null==a)throw"could not create webgl buffer";e.bindBuffer(e.ARRAY_BUFFER,a),e.bufferData(e.ARRAY_BUFFER,new Float32Array(n),e.STATIC_DRAW);var o=r.triangles.flat(),i=e.createBuffer();if(null==i)throw"could not create webgl buffer";e.bindBuffer(e.ELEMENT_ARRAY_BUFFER,i),e.bufferData(e.ELEMENT_ARRAY_BUFFER,new Uint16Array(o),e.STATIC_DRAW),this.vertexPosBuffer=a,this.triangleBuffer=i,this.triangleBufferSize=o.length,this.model=r,this.vertexTransform=t}return e.prototype.translate=function(e){re(this.vertexTransform,function(e,r){return e[0]=1,e[1]=0,e[2]=0,e[3]=0,e[4]=0,e[5]=1,e[6]=0,e[7]=0,e[8]=0,e[9]=0,e[10]=1,e[11]=0,e[12]=r[0],e[13]=r[1],e[14]=r[2],e[15]=1,e}(ee(),e),this.vertexTransform)},e.prototype.rotate=function(e){!function(e,r,t){var n=Math.sin(t),a=Math.cos(t),o=r[0],i=r[1],s=r[2],l=r[3],u=r[4],c=r[5],f=r[6],h=r[7];r!==e&&(e[8]=r[8],e[9]=r[9],e[10]=r[10],e[11]=r[11],e[12]=r[12],e[13]=r[13],e[14]=r[14],e[15]=r[15]),e[0]=o*a+u*n,e[1]=i*a+c*n,e[2]=s*a+f*n,e[3]=l*a+h*n,e[4]=u*a-o*n,e[5]=c*a-i*n,e[6]=f*a-s*n,e[7]=h*a-l*n}(this.vertexTransform,this.vertexTransform,e)},e.prototype.pos=function(){return function(e,r){return e[0]=r[12],e[1]=r[13],e[2]=r[14],e}(o(),this.vertexTransform)},e}(),Ie=["aVertexPos"],Ue=["uViewingTransform","uPerspectiveTransform","uVertexTransform","uLights","uNumLights","uEyePos","uFog","uMaterial.ambient","uMaterial.diffuse","uMaterial.specular","uMaterial.shine"];function Ce(e){var r,t,n,a;e.getExtension("OES_standard_derivatives");var o=e.createShader(e.VERTEX_SHADER);if(null==o)throw"could not create webgl shader";if(e.shaderSource(o,"\nprecision highp float;\n\nuniform mat4 uViewingTransform;\nuniform mat4 uPerspectiveTransform;\n\nuniform mat4 uVertexTransform;\n\nattribute vec3 aVertexPos;\nvarying vec4 vSurfacePos;\n\nvoid main(void) {\n vSurfacePos = uVertexTransform * vec4(aVertexPos, 1.0);\n\n gl_Position = uPerspectiveTransform * uViewingTransform * vSurfacePos;\n}\n"),e.compileShader(o),!e.getShaderParameter(o,e.COMPILE_STATUS))throw"error during vertex shader compile: "+e.getShaderInfoLog(o);var i="\n#extension GL_OES_standard_derivatives : enable\n\nprecision highp float;\n\nconst int NUM_SUNS = ".concat(4,";\nconst float FOG_START = ").concat(24..toFixed(10),";\nconst float FOG_END = ").concat(32..toFixed(10),";\nconst vec3 FOG_COLOR = vec3(").concat(_e[0],", ").concat(_e[1],", ").concat(_e[2],");\n\nuniform vec3 uLights[NUM_SUNS];\nuniform int uNumLights;\nuniform vec3 uEyePos;\nuniform int uFog;\n\nstruct Material {\n vec3 ambient;\n vec3 diffuse;\n vec3 specular;\n float shine;\n};\n\nuniform Material uMaterial;\n\nvarying vec4 vSurfacePos;\n\n// The function 1 / (1 + 0.002x^3) == 0.5 at 7.937\nfloat attenuation(float x) {\n if (x < 8.0) {\n return 1.0;\n } else {\n x -= 8.0;\n float a = 1.0 / (1.0 + 0.05*x + 0.004*x*x*x);\n return clamp(a, 0.0, 1.0);\n }\n}\n\nvoid main(void) {\n vec3 color = uMaterial.ambient;\n\n vec3 viewVector = normalize(uEyePos - vSurfacePos.xyz);\n vec3 normalVector = normalize(cross(\n dFdx(vSurfacePos.xyz),\n dFdy(vSurfacePos.xyz)\n ));\n\n for (int i = 0; i < NUM_SUNS; i++) {\n if (i >= uNumLights) {\n break;\n }\n\n vec3 lightVector = normalize(uLights[i] - vSurfacePos.xyz);\n vec3 halfVector = normalize(viewVector + lightVector);\n\n float lightDist = length(uLights[i] - vSurfacePos.xyz);\n float atten = attenuation(lightDist);\n\n vec3 diffuse = atten * uMaterial.diffuse * max(0.0, dot(normalVector, lightVector));\n vec3 specular = atten * uMaterial.specular * pow(max(0.0, dot(normalVector, halfVector)), uMaterial.shine);\n color += diffuse + specular;\n }\n\n float fogFactor = 0.0;\n if (uFog == 1) {\n float dist = length(uEyePos - vSurfacePos.xyz);\n fogFactor = min(1.0, max(0.0, dist - FOG_START) / (FOG_END - FOG_START));\n }\n\n gl_FragColor = vec4(mix(color, FOG_COLOR, fogFactor), 1.0);\n}\n"),s=e.createShader(e.FRAGMENT_SHADER);if(null==s)throw"could not create webgl shader";if(e.shaderSource(s,i),e.compileShader(s),!e.getShaderParameter(s,e.COMPILE_STATUS))throw"error during fragment shader compile: "+e.getShaderInfoLog(s);var l=e.createProgram();if(null==l)throw"could not create webgl program";if(e.attachShader(l,s),e.attachShader(l,o),e.linkProgram(l),!e.getProgramParameter(l,e.LINK_STATUS))throw"error during shader program linking: "+e.getProgramInfoLog(l);e.useProgram(l);var u={attribs:{},uniforms:{}};try{for(var c=De(Ie),f=c.next();!f.done;f=c.next()){var h=f.value,p=e.getAttribLocation(l,h);if(-1==p)throw"invalid attribute ".concat(h);e.enableVertexAttribArray(p),u.attribs[h]=p}}catch(e){r={error:e}}finally{try{f&&!f.done&&(t=c.return)&&t.call(c)}finally{if(r)throw r.error}}try{for(var d=De(Ue),y=d.next();!y.done;y=d.next()){var m=y.value,v=e.getUniformLocation(l,m);u.uniforms[m]=v}}catch(e){n={error:e}}finally{try{y&&!y.done&&(a=d.return)&&a.call(d)}finally{if(n)throw n.error}}return u}function Oe(e,r,t,n,a,o,i){var s,l,u,c;null==i&&(i={fog:!0}),e.clear(e.COLOR_BUFFER_BIT|e.DEPTH_BUFFER_BIT);var f=[],h=0;try{for(var p=De(r),d=p.next();!d.done;d=p.next()){var y=d.value;f.push.apply(f,ke([],Re(y),!1)),h+=1}}catch(e){s={error:e}}finally{try{d&&!d.done&&(l=p.return)&&l.call(p)}finally{if(s)throw s.error}}function m(r){var t,n;t=r.vertexPosBuffer,n=a.attribs.aVertexPos,e.bindBuffer(e.ARRAY_BUFFER,t),e.vertexAttribPointer(n,3,e.FLOAT,!1,0,0),e.uniformMatrix4fv(a.uniforms.uVertexTransform,!1,r.vertexTransform);var o=r.model.material;e.uniform3fv(a.uniforms["uMaterial.ambient"],o.ambient),e.uniform3fv(a.uniforms["uMaterial.diffuse"],o.diffuse),e.uniform3fv(a.uniforms["uMaterial.specular"],o.specular),e.uniform1f(a.uniforms["uMaterial.shine"],o.n),e.bindBuffer(e.ELEMENT_ARRAY_BUFFER,r.triangleBuffer),e.drawElements(e.TRIANGLES,r.triangleBufferSize,e.UNSIGNED_SHORT,0)}e.uniform3fv(a.uniforms.uLights,f),e.uniform1i(a.uniforms.uNumLights,h),e.uniform1i(a.uniforms.uFog,i.fog?1:0),e.uniform3fv(a.uniforms.uEyePos,o.eye),e.uniformMatrix4fv(a.uniforms.uViewingTransform,!1,o.viewingTransform),e.uniformMatrix4fv(a.uniforms.uPerspectiveTransform,!1,o.perspectiveTransform),e.enable(e.DEPTH_TEST);var v=Array.from(t);try{for(var g=De(v),b=g.next();!b.done;b=g.next())m(b.value)}catch(e){u={error:e}}finally{try{b&&!b.done&&(c=g.return)&&c.call(g)}finally{if(u)throw u.error}}e.disable(e.DEPTH_TEST),Array.from(n).forEach(m)}var Ne=function(){function e(e,r){this.getTime=e,this.debounceTime=r,this.lastChange=-r}return e.prototype.reset=function(){this.lastChange=-this.debounceTime},e.prototype.set=function(){this.lastChange=this.getTime()},e.prototype.ready=function(){return this.getTime()-this.lastChange>=this.debounceTime},e.prototype.try=function(e){var r=this.getTime();r-this.lastChange>=this.debounceTime&&(e(),this.lastChange=r)},e}(),qe=function(){function e(){this.pressed=new Set}return e.prototype.register=function(){var e=this;document.addEventListener("keydown",(function(r){e.pressed.add(r.code)})),document.addEventListener("keyup",(function(r){e.pressed.delete(r.code)}))},e}(),Ke=function(e,r){var t,n,a,o,i={label:0,sent:function(){if(1&a[0])throw a[1];return a[1]},trys:[],ops:[]};return o={next:s(0),throw:s(1),return:s(2)},"function"==typeof Symbol&&(o[Symbol.iterator]=function(){return this}),o;function s(o){return function(s){return function(o){if(t)throw new TypeError("Generator is already executing.");for(;i;)try{if(t=1,n&&(a=2&o[0]?n.return:o[0]?n.throw||((a=n.return)&&a.call(n),0):n.next)&&!(a=a.call(n,o[1])).done)return a;switch(n=0,a&&(o=[2&o[0],a.value]),o[0]){case 0:case 1:a=o;break;case 4:return i.label++,{value:o[1],done:!1};case 5:i.label++,n=o[1],o=[0];continue;case 7:o=i.ops.pop(),i.trys.pop();continue;default:if(!((a=(a=i.trys).length>0&&a[a.length-1])||6!==o[0]&&2!==o[0])){i=0;continue}if(3===o[0]&&(!a||o[1]>a[0]&&o[1]0)&&!(n=o.next()).done;)i.push(n.value)}catch(e){a={error:e}}finally{try{n&&!n.done&&(t=o.return)&&t.call(o)}finally{if(a)throw a.error}}return i},Ge=function(e,r,t){if(t||2===arguments.length)for(var n,a=0,o=r.length;a=e.length&&(e=void 0),{value:e&&e[n++],done:!e}}};throw new TypeError(r?"Object is not iterable.":"Symbol.iterator is not defined.")};function Ye(e,r){return(r-e)*Math.random()+e}function Qe(e,r){return Math.min(r[1],Math.max(r[0],e))}function Xe(e){return e*(Math.PI/180)}function We(e,r){return Je(e,[0,r])}function Je(e,r){var t=l(e[0]+1,e[1],e[2]);Math.abs(t[0])<.01&&(t=l(e[0],e[1]+1,e[2])),L(t,e,t),E(t,t);var n=u(o(),e),a=ne(ee(),Ye.apply(void 0,Ge([],ze(r),!1)),t),i=ne(ee(),Ye(0,2*Math.PI),e);return D(n,n,a),D(n,n,i),n}var Ze=1/32,$e=[[1.4,1.8],[.6,.8]],er=[2,1],rr=[100,50],tr=[.005,.1],nr=[.01,.08],ar=[16,32],or=Xe(120),ir=Xe(45),sr=[10,28],lr=[Xe(2.5),Xe(50)],ur=[-1/9,1/15],cr=[80,86],fr=Xe(.3),hr=Math.round(34),pr=.005,dr=[Xe(3),Xe(45)],yr=Xe(120),mr=[.01,.1],vr=200;function gr(e){return[Math.round(.5*e*e+8*e),Math.round(1/8*e*e+4*e+4)]}var br=new Audio("missile.mp3"),wr=new Audio("music.wav");wr.volume=.75,wr.loop=!0;var xr,Mr=function(){function e(e,r){this.want=e,this.current=e,this.speedLimit=r}return e.prototype.set=function(e){this.want=e},e.prototype.get=function(){return this.current},e.prototype.step=function(){this.current+=Qe(this.want-this.current,this.speedLimit)},e}(),Tr=function(){function e(e){this.velocity=o(),this.obj=new Ve(e,Me),this.flame=new Ve(e,Ae),this.flameAccent=new Ve(e,Pe),this.flameAccent.vertexTransform=this.flame.vertexTransform,this.reticle=new Ve(e,Ee),this.reticle.vertexTransform=this.obj.vertexTransform,this.lastFired=Number.NEGATIVE_INFINITY,this.throttle=new Mr(0,ur),this.worldRotation=se(),this.up=l(0,0,-1),this.forward=l(0,1,0),this.right=l(-1,0,0),this.thrusterSfx=new Audio("thruster.wav"),this.thrusterSfx.loop=!0}return e.prototype.objects=function(){return Ke(this,(function(e){switch(e.label){case 0:return[4,this.obj];case 1:return e.sent(),this.throttle.get()>0?[4,this.flame]:[3,4];case 2:return e.sent(),[4,this.flameAccent];case 3:e.sent(),e.label=4;case 4:return[2]}}))},e.prototype.setThrottle=function(e){0!=e&&this.thrusterSfx.play(),this.throttle.set(e)},e.prototype.pitchUp=function(e){this.rotate(e,this.right)},e.prototype.yawLeft=function(e){this.rotate(e,this.up)},e.prototype.rollRight=function(e){this.rotate(e,this.forward)},e.prototype.rotate=function(e,r){var t=le(se(),r,e);ue(this.worldRotation,this.worldRotation,t)},e.prototype.collisionPoints=function(){var e=this;return Se.map((function(r){return D(o(),r,e.obj.vertexTransform)}))},e.prototype.tryFire=function(e){if(!(e.play.ticks-this.lastFired<=30)){this.lastFired=e.play.ticks;var r=br.cloneNode();r.volume=.15,r.play();var t=o();x(t,this.velocity,this.forward,1);var n=new Ve(e.gl,Fe);!function(e,r,t){var n,a,o,i,s,l,u,c,f,h,p,d,y=t[0],m=t[1],v=t[2];r===e?(e[12]=r[0]*y+r[4]*m+r[8]*v+r[12],e[13]=r[1]*y+r[5]*m+r[9]*v+r[13],e[14]=r[2]*y+r[6]*m+r[10]*v+r[14],e[15]=r[3]*y+r[7]*m+r[11]*v+r[15]):(n=r[0],a=r[1],o=r[2],i=r[3],s=r[4],l=r[5],u=r[6],c=r[7],f=r[8],h=r[9],p=r[10],d=r[11],e[0]=n,e[1]=a,e[2]=o,e[3]=i,e[4]=s,e[5]=l,e[6]=u,e[7]=c,e[8]=f,e[9]=h,e[10]=p,e[11]=d,e[12]=n*y+s*m+f*v+r[12],e[13]=a*y+l*m+h*v+r[13],e[14]=o*y+u*m+p*v+r[14],e[15]=i*y+c*m+d*v+r[15])}(n.vertexTransform,n.vertexTransform,Te),re(n.vertexTransform,this.obj.vertexTransform,n.vertexTransform),e.play.missiles.push({birth:e.play.ticks,velocity:t,obj:n})}},e.prototype.eye=function(){var e=this.obj.pos();return x(e,e,this.forward,-.65),x(e,e,this.up,.3),e},e.prototype.camera=function(e){var r,t,n=this.eye(),a=this.throttle.get(),i=(r=a*a)*(t=cr)[1]+(1-r)*t[0];return j(n,e,n,.6),{eye:n,viewingTransform:ie(ee(),n,f(o(),n,this.forward),this.up),perspectiveTransform:oe(ee(),Xe(i),Nr.width/Nr.height,Ze,32)}},e}(),Sr=function(){function e(e,r,t,n){var a=$e[r],i=null!=n?Math.min(a[1],Math.max(a[0],n.radius)):Ye.apply(void 0,Ge([],ze(a),!1)),s=ze(function(e){var r,t,n=e*(2/Math.sqrt(3)),a=[[0,0,0],[n,0,0],[n,0,n],[0,0,n],[0,n,0],[n,n,0],[n,n,n],[0,n,n]].map((function(e){var r=k(o(),(n/2-0)*Math.random()+0);return[e[0]+r[0],e[1]+r[1],e[2]+r[2]]})),i=me({material:JSON.parse(JSON.stringify(Be)),vertices:a,triangles:[[0,1,2],[2,3,0],[4,5,6],[6,7,4],[0,1,4],[4,5,1],[1,2,5],[2,5,6],[2,3,6],[3,6,7],[3,0,7],[0,7,4]]}),s=0;try{for(var l=he(i.vertices),u=l.next();!u.done;u=l.next()){var c=u.value;s+=Math.hypot.apply(Math,de([],pe(c),!1))}}catch(e){r={error:e}}finally{try{u&&!u.done&&(t=l.return)&&t.call(l)}finally{if(r)throw r.error}}return[s/=i.vertices.length,i]}(i),2),l=s[0],u=s[1];if(this.obj=new Ve(e,u),this.radius=l,this.tier=r,this.health=er[r],this.velocity=t,null==n){var c=Ye.apply(void 0,Ge([],ze(tr),!1)),f=k(o());this.rotation=le(se(),f,c)}else this.rotation=n.rotation}return e.prototype.split=function(r){var t=k(o()),n=Ye.apply(void 0,Ge([],ze(nr),!1)),a=x(o(),this.velocity,t,n),i=new e(r,this.tier+1,a,{radius:this.radius/2,rotation:fe(this.rotation)}),s=this.obj.pos();i.obj.translate(s);var l=x(o(),this.velocity,t,-n),u=new e(r,this.tier+1,l,{radius:this.radius/2,rotation:fe(this.rotation)});return u.obj.translate(s),[i,u]},e.prototype.damage=function(){this.health-=1;for(var e=this.obj.model.material,r=this.health/er[this.tier],t=0;t<3;t++){var n=Le[t]*r+je[t]*(1-r);e.ambient[t]=.5*n,e.diffuse[t]=1*n}},e}();function Ar(e,r){var t=e.pos();return[0,1,2].every((function(e){return t[e]-1<=r[e]&&r[e]<=t[e]+1}))}function Pr(e){var r,t,n,a,o,i;return Ke(this,(function(s){switch(s.label){case 0:s.trys.push([0,5,6,7]),r=He(e.play.tieredAsteroids),t=r.next(),s.label=1;case 1:return t.done?[3,4]:(n=t.value,[5,He(n)]);case 2:s.sent(),s.label=3;case 3:return t=r.next(),[3,1];case 4:return[3,7];case 5:return a=s.sent(),o={error:a},[3,7];case 6:try{t&&!t.done&&(i=r.return)&&i.call(r)}finally{if(o)throw o.error}return[7];case 7:return[2]}}))}function Er(e){var r,t,n,a,o,i,s,l,u,c,f,h,p,d,y,m,v;return Ke(this,(function(g){switch(g.label){case 0:return[5,He(e.play.ship.objects())];case 1:if(g.sent(),!e.freecam.showShipCollisions)return[3,9];g.label=2;case 2:g.trys.push([2,7,8,9]),r=He(e.play.ship.collisionPoints()),t=r.next(),g.label=3;case 3:return t.done?[3,6]:(n=t.value,(a=new Ve(e.gl,xe)).translate(n),[4,a]);case 4:g.sent(),g.label=5;case 5:return t=r.next(),[3,3];case 6:return[3,9];case 7:return o=g.sent(),h={error:o},[3,9];case 8:try{t&&!t.done&&(p=r.return)&&p.call(r)}finally{if(h)throw h.error}return[7];case 9:g.trys.push([9,14,15,16]),i=He(e.play.missiles),s=i.next(),g.label=10;case 10:return s.done?[3,13]:[4,s.value.obj];case 11:g.sent(),g.label=12;case 12:return s=i.next(),[3,10];case 13:return[3,16];case 14:return l=g.sent(),d={error:l},[3,16];case 15:try{s&&!s.done&&(y=i.return)&&y.call(i)}finally{if(d)throw d.error}return[7];case 16:g.trys.push([16,21,22,23]),u=He(Pr(e)),c=u.next(),g.label=17;case 17:return c.done?[3,20]:[4,c.value.obj];case 18:g.sent(),g.label=19;case 19:return c=u.next(),[3,17];case 20:return[3,23];case 21:return f=g.sent(),m={error:f},[3,23];case 22:try{c&&!c.done&&(v=u.return)&&v.call(u)}finally{if(m)throw m.error}return[7];case 23:return[5,He(e.play.suns)];case 24:return g.sent(),[2]}}))}function Fr(e){return Ke(this,(function(r){switch(r.label){case 0:return[4,e.play.ship.reticle];case 1:return r.sent(),[2]}}))}function Lr(e){var r,t,n,a,o;return Ke(this,(function(i){switch(i.label){case 0:i.trys.push([0,5,6,7]),r=He(e.play.suns),t=r.next(),i.label=1;case 1:return t.done?[3,4]:[4,t.value.pos()];case 2:i.sent(),i.label=3;case 3:return t=r.next(),[3,1];case 4:return[3,7];case 5:return n=i.sent(),a={error:n},[3,7];case 6:try{t&&!t.done&&(o=r.return)&&o.call(r)}finally{if(a)throw a.error}return[7];case 7:return[2]}}))}function jr(e){e.mode==xr.Menu?requestAnimationFrame((function(){return function(e){var r,t;(function(e){var r,t,n=[];try{for(var a=He(e.menu.asteroids.entries()),o=a.next();!o.done;o=a.next()){var i=ze(o.value,2),s=i[0],l=i[1];M(e.menu.camera.eye,l.obj.pos())>34&&n.push(s)}}catch(e){r={error:e}}finally{try{o&&!o.done&&(t=a.return)&&t.call(a)}finally{if(r)throw r.error}}for(var u=n.length-1;u>=0;u--)e.menu.asteroids.splice(n[u],1)})(e),function(e){for(var r=e.menu.camera;e.menu.asteroids.length<64;){var t=We(r.forward,yr),n=Je(w(o(),t,-1),dr);x(t,r.eye,t,33),w(n,n,Ye.apply(void 0,Ge([],ze(mr),!1)));var a=new Sr(e.gl,1,n);a.velocity=n,a.obj.translate(t),e.menu.asteroids.push(a)}}(e);try{for(var n=He(e.menu.asteroids),a=n.next();!a.done;a=n.next()){var i=a.value;i.obj.translate(i.velocity);var s=ae(ee(),i.rotation);re(i.obj.vertexTransform,i.obj.vertexTransform,s)}}catch(e){r={error:e}}finally{try{a&&!a.done&&(t=n.return)&&t.call(n)}finally{if(r)throw r.error}}e.inputs.keyboard.pressed.has("KeyB")&&e.menu.moveModeDebouncer.try((function(){e.menu.movingCamera?(document.exitPointerLock(),e.menu.movingCamera=!1):(Nr.requestPointerLock(),e.menu.movingCamera=!0)})),e.menu.movingCamera&&Or(e.inputs.keyboard,e.menu.camera),Oe(e.gl,function(e){var r,t,n,a,o;return Ke(this,(function(i){switch(i.label){case 0:i.trys.push([0,5,6,7]),r=He(e.menu.suns),t=r.next(),i.label=1;case 1:return t.done?[3,4]:[4,t.value.pos()];case 2:i.sent(),i.label=3;case 3:return t=r.next(),[3,1];case 4:return[3,7];case 5:return n=i.sent(),a={error:n},[3,7];case 6:try{t&&!t.done&&(o=r.return)&&o.call(r)}finally{if(a)throw a.error}return[7];case 7:return[2]}}))}(e),function(e){var r,t,n,a,o;return Ke(this,(function(i){switch(i.label){case 0:i.trys.push([0,5,6,7]),r=He(e.menu.asteroids),t=r.next(),i.label=1;case 1:return t.done?[3,4]:[4,t.value.obj];case 2:i.sent(),i.label=3;case 3:return t=r.next(),[3,1];case 4:return[3,7];case 5:return n=i.sent(),a={error:n},[3,7];case 6:try{t&&!t.done&&(o=r.return)&&o.call(r)}finally{if(a)throw a.error}return[7];case 7:return[5,He(e.menu.suns)];case 8:return i.sent(),[2]}}))}(e),[],e.shaderInfo,e.menu.camera),jr(e)}(e)})):e.mode==xr.Pause?requestAnimationFrame((function(){return function(e){e.inputs.keyboard.pressed.has("KeyP")&&e.inputs.pauseDebouncer.try((function(){return Dr(e)})),Oe(e.gl,Lr(e),Er(e),Fr(e),e.shaderInfo,e.play.camera),jr(e)}(e)})):e.mode==xr.Play?requestAnimationFrame((function(){return function(e){(function(e){if(null!=e.play.levelFinishedAt){if(e.play.ticks-e.play.levelFinishedAt<30)return;_r(e,e.play.level+1)}e.play.numAsteroids.every((function(e){return 0==e}))&&(e.play.levelFinishedAt=e.play.ticks)})(e),function(e){var r=e.inputs.keyboard;e.inputs.mouseDown&&e.play.ship.tryFire(e),r.pressed.has("KeyP")&&e.inputs.pauseDebouncer.try((function(){return kr(e)})),r.pressed.has("KeyE")&&e.play.ship.rollRight(fr),r.pressed.has("KeyQ")&&e.play.ship.rollRight(-fr),r.pressed.has("KeyW")?e.play.ship.setThrottle(1):e.play.ship.setThrottle(0),r.pressed.has("Space")&&e.play.ship.tryFire(e)}(e),function(e){var r=navigator.getGamepads()[e.inputs.gamepad];if(null!=r){e.play.ship.pitchUp(.003*r.axes[1]),e.play.ship.yawLeft(-.003*r.axes[0]),e.play.ship.rollRight(.003*r.axes[2]),e.play.ship.setThrottle(r.buttons[7].value),(r.buttons[5].pressed||r.buttons[0].pressed)&&e.play.ship.tryFire(e),console.log(r)}}(e),function(e){var r,t,n=[];try{for(var a=He(e.play.suns.entries()),o=a.next();!o.done;o=a.next()){var i=ze(o.value,2),s=i[0],l=i[1];M(e.play.ship.obj.pos(),l.pos())>34&&n.push(s)}}catch(e){r={error:e}}finally{try{o&&!o.done&&(t=a.return)&&t.call(a)}finally{if(r)throw r.error}}for(var u=n.length-1;u>=0;u--)e.play.suns.splice(n[u],1)}(e),function(e){var r,t,n,a,o,i,s=[[],[]];try{for(var l=He(e.play.tieredAsteroids.entries()),u=l.next();!u.done;u=l.next()){var c=ze(u.value,2),f=c[0],h=c[1];try{for(var p=(n=void 0,He(h.entries())),d=p.next();!d.done;d=p.next()){var y=ze(d.value,2),m=y[0],v=y[1];M(e.play.ship.obj.pos(),v.obj.pos())>34&&s[f].push(m)}}catch(e){n={error:e}}finally{try{d&&!d.done&&(a=p.return)&&a.call(p)}finally{if(n)throw n.error}}}}catch(e){r={error:e}}finally{try{u&&!u.done&&(t=l.return)&&t.call(l)}finally{if(r)throw r.error}}try{for(var g=He(s.entries()),b=g.next();!b.done;b=g.next())for(var w=ze(b.value,2),x=(f=w[0],w[1]),T=x.length-1;T>=0;T--)e.play.tieredAsteroids[f].splice(x[T],1)}catch(e){o={error:e}}finally{try{b&&!b.done&&(i=g.return)&&i.call(g)}finally{if(o)throw o.error}}}(e),function(e){for(;e.play.missiles.length>0&&e.play.ticks-e.play.missiles[0].birth>hr;)e.play.missiles.shift()}(e),function(e){for(;e.play.suns.length<4;){var r=new Ve(e.gl,we),t=void 0;x(t=s(e.play.ship.velocity)<1e-10?k(o()):Je(E(o(),e.play.ship.velocity),lr),e.play.ship.obj.pos(),t,33),r.translate(t),e.play.suns.push(r)}}(e),function(e){for(var r=0;r<2;r++)for(;e.play.tieredAsteroids[r].length=0;p--)e.play.missiles.splice(o[p],1)}(e),function(e){var r,t,n,a,i=[];try{for(var l=He(Pr(e)),u=l.next();!u.done;u=l.next()){var c=u.value;try{for(var f=(n=void 0,He(e.play.missiles.entries())),p=f.next();!p.done;p=f.next()){var d=ze(p.value,2),y=d[0],m=d[1];if(M(c.obj.pos(),m.obj.pos())<=c.radius){i.push(y),c.damage();var v=4/3*Math.PI*Math.pow(c.radius,3)*1,g=.4*v*Math.pow(c.radius,2),b=h(o(),m.obj.pos(),c.obj.pos()),w=s(b);E(b,b);var T=Math.abs(F(b,m.velocity)),S=x(o(),m.velocity,b,-T);x(c.velocity,c.velocity,b,.3/v*-T);var A=L(o(),b,S);E(A,A);var P=w*s(S)*.3,j=le(se(),A,P/g);ue(c.rotation,c.rotation,j)}}}catch(e){n={error:e}}finally{try{p&&!p.done&&(a=f.return)&&a.call(f)}finally{if(n)throw n.error}}}}catch(e){r={error:e}}finally{try{u&&!u.done&&(t=l.return)&&t.call(l)}finally{if(r)throw r.error}}for(var B=i.length-1;B>=0;B--)e.play.missiles.splice(i[B],1)}(e),function(e){for(var r,t=0;t<2;t++)for(var n=e.play.tieredAsteroids[t].length-1;n>=0;n--){var a=e.play.tieredAsteroids[t][n];if(a.health<=0){if(t+1<2){var o=a.split(e.gl);(r=e.play.tieredAsteroids[t+1]).push.apply(r,Ge([],ze(o),!1)),e.play.numAsteroids[t+1]+=o.length}e.play.tieredAsteroids[t].splice(n,1),e.play.numAsteroids[t]-=1,e.play.score+=rr[t],Ir(e)}}}(e),function(e){x(e.play.ship.velocity,e.play.ship.velocity,e.play.ship.forward,.001*e.play.ship.throttle.get())}(e),function(e){e.play.ship.obj.translate(e.play.ship.velocity)}(e),function(e){var r,t;try{for(var n=He(e.play.missiles),a=n.next();!a.done;a=n.next()){var o=a.value;o.obj.translate(o.velocity)}}catch(e){r={error:e}}finally{try{a&&!a.done&&(t=n.return)&&t.call(n)}finally{if(r)throw r.error}}}(e),function(e){var r,t;try{for(var n=He(Pr(e)),a=n.next();!a.done;a=n.next()){var i=a.value;i.obj.translate(i.velocity);var s=i.obj.pos();i.obj.translate(w(o(),s,-1));var l=ae(ee(),i.rotation);re(i.obj.vertexTransform,l,i.obj.vertexTransform),i.obj.translate(s)}}catch(e){r={error:e}}finally{try{a&&!a.done&&(t=n.return)&&t.call(n)}finally{if(r)throw r.error}}}(e),null==e.play.levelFinishedAt&&(function(e){var r,t,n,a;try{for(var o=He(Pr(e)),i=o.next();!i.done;i=o.next()){var s=i.value;try{for(var l=(n=void 0,He(e.play.ship.collisionPoints())),u=l.next();!u.done;u=l.next()){var c=u.value;M(s.obj.pos(),c)<=.85*s.radius&&Rr(e)}}catch(e){n={error:e}}finally{try{u&&!u.done&&(a=l.return)&&a.call(l)}finally{if(n)throw n.error}}}}catch(e){r={error:e}}finally{try{i&&!i.done&&(t=o.return)&&t.call(o)}finally{if(r)throw r.error}}}(e),function(e){var r,t,n,a;try{for(var o=He(e.play.suns),i=o.next();!i.done;i=o.next()){var s=i.value;try{for(var l=(n=void 0,He(e.play.ship.collisionPoints())),u=l.next();!u.done;u=l.next())Ar(s,u.value)&&Rr(e)}catch(e){n={error:e}}finally{try{u&&!u.done&&(a=l.return)&&a.call(l)}finally{if(n)throw n.error}}}}catch(e){r={error:e}}finally{try{i&&!i.done&&(t=o.return)&&t.call(o)}finally{if(r)throw r.error}}}(e)),Ur(e),function(e){e.play.camera=e.play.ship.camera(e.play.lastCameraPosition),e.play.lastCameraPosition=e.play.ship.eye()}(e),function(e){var r=e.play.ship;r.throttle.step();var t=r.throttle.get();!function(e,r,t){var n=t[0],a=t[1],o=t[2];e[0]=r[0]*n,e[1]=r[1]*n,e[2]=r[2]*n,e[3]=r[3]*n,e[4]=r[4]*a,e[5]=r[5]*a,e[6]=r[6]*a,e[7]=r[7]*a,e[8]=r[8]*o,e[9]=r[9]*o,e[10]=r[10]*o,e[11]=r[11]*o,e[12]=r[12],e[13]=r[13],e[14]=r[14],e[15]=r[15]}(r.flame.vertexTransform,r.obj.vertexTransform,l(1,t,1));var n=.006*Math.sin(.707106781187*e.play.ticks),a=.004*Math.sin(.809015*e.play.ticks);te(r.flame.vertexTransform,r.flame.vertexTransform,n,l(1,0,0)),te(r.flame.vertexTransform,r.flame.vertexTransform,a,l(0,0,1)),r.thrusterSfx.volume=1*t}(e),function(e){var r,n,a,i,s=e.play.ship,l=(r=o(),n=s.worldRotation,a=2*Math.acos(n[3]),(i=Math.sin(a/2))>t?(r[0]=n[0]/i,r[1]=n[1]/i,r[2]=n[2]/i):(r[0]=1,r[1]=0,r[2]=0),a),u=(Math.log(l)-Math.log(1e-10))/(Math.log(.01)-Math.log(1e-10)),c=.925*(u=Qe(u,[0,1]));(function(e,r,t){e[0]=r[0]*t,e[1]=r[1]*t,e[2]=r[2]*t,e[3]=r[3]*t})(s.worldRotation,s.worldRotation,c),function(e,r){var t=r[0],n=r[1],a=r[2];e[0]=t,e[1]=n,e[2]=a,e[3]=Math.sqrt(Math.abs(1-t*t-n*n-a*a))}(s.worldRotation,s.worldRotation),V(s.forward,s.forward,s.worldRotation),V(s.up,s.up,s.worldRotation),V(s.right,s.right,s.worldRotation);var f=s.obj.pos();s.obj.translate(w(o(),f,-1));var h=ae(ee(),s.worldRotation);re(s.obj.vertexTransform,h,s.obj.vertexTransform),s.obj.translate(f)}(e),e.inputs.keyboard.pressed.has("KeyB")&&e.freecam.freecamModeDebouncer.try((function(){return function(e){e.freecam.camera.sync(e.play.ship,e.play.camera),e.mode=xr.Freecam}(e)})),e.play.ticks+=1,Oe(e.gl,Lr(e),Er(e),Fr(e),e.shaderInfo,e.play.camera),jr(e)}(e)})):e.mode==xr.Freecam&&requestAnimationFrame((function(){return function(e){var r=e.inputs.keyboard;Or(r,e.freecam.camera),r.pressed.has("ArrowLeft")&&e.freecam.generalDebouncer.try((function(){e.play.level=Math.max(1,e.play.level-1),e.play.numAsteroids=gr(e.play.level),Cr(e)})),r.pressed.has("ArrowRight")&&e.freecam.generalDebouncer.try((function(){e.play.level+=1,e.play.numAsteroids=gr(e.play.level),Cr(e)})),r.pressed.has("KeyF")&&e.freecam.generalDebouncer.try((function(){e.freecam.fog=!e.freecam.fog})),r.pressed.has("KeyC")&&e.freecam.generalDebouncer.try((function(){e.freecam.showShipCollisions=!e.freecam.showShipCollisions})),r.pressed.has("KeyB")&&e.freecam.freecamModeDebouncer.try((function(){return function(e){e.mode=xr.Play}(e)})),Oe(e.gl,Lr(e),Er(e),Fr(e),e.shaderInfo,e.freecam.camera,{fog:e.freecam.fog}),jr(e)}(e)}))}function Br(e){qr.time.hidden=!0,qr.score.hidden=!0,qr.level.hidden=!0,qr.mainText.innerHTML="Asteroids",qr.mainText.hidden=!1,qr.menuButton.innerHTML="Start",qr.menuButton.hidden=!1,qr.menuButton.onclick=function(){_r(e,1)},qr.menuButton2.hidden=!0,e.mode=xr.Menu}function Rr(e){qr.time.hidden=!1,qr.score.hidden=!1,qr.level.hidden=!1,qr.mainText.innerHTML="Game Over",qr.mainText.hidden=!1,qr.menuButton.innerHTML="Restart",qr.menuButton.hidden=!1,qr.menuButton.onclick=function(){_r(e,1)},qr.menuButton2.innerHTML="Quit",qr.menuButton2.hidden=!1,qr.menuButton2.onclick=function(){Br(e)},e.play.ship.thrusterSfx.pause(),document.exitPointerLock(),e.mode=xr.Pause}function kr(e){qr.score.hidden=!1,qr.time.hidden=!1,qr.level.hidden=!1,qr.mainText.innerHTML="Pause",qr.mainText.hidden=!1,qr.menuButton.innerHTML="Unpause",qr.menuButton.hidden=!1,qr.menuButton.onclick=function(){Dr(e)},qr.menuButton2.innerHTML="Quit",qr.menuButton2.hidden=!1,qr.menuButton2.onclick=function(){Br(e)},wr.pause(),e.play.ship.thrusterSfx.pause(),document.exitPointerLock(),e.mode=xr.Pause}function Dr(e){qr.time.hidden=!1,qr.score.hidden=!1,qr.level.hidden=!1,qr.mainText.hidden=!0,qr.menuButton.hidden=!0,qr.menuButton2.hidden=!0,wr.play(),Nr.requestPointerLock(),e.mode=xr.Play}function _r(e,r){var t,n;qr.time.hidden=!1,qr.score.hidden=!1,qr.level.hidden=!1,qr.mainText.hidden=!0,qr.menuButton.hidden=!0,qr.menuButton2.hidden=!0,1==r&&(wr.play(),wr.currentTime=0),Nr.requestPointerLock(),e.mode=xr.Play,e.play.ship=new Tr(e.gl),e.play.missiles=[],e.play.tieredAsteroids=[[],[]],e.play.numAsteroids=gr(r),e.play.asteroidSpeed=function(e){return[.01+.005*e,.09+.03*e]}(r),e.play.suns=[],e.play.score=0,e.play.ticks=0,e.play.lastCameraPosition=e.play.ship.eye(),e.play.camera=e.play.ship.camera(e.play.ship.eye()),e.play.level=r,e.play.levelFinishedAt=null,Ir(e),Ur(e),Cr(e);try{for(var a=He(e.play.numAsteroids.entries()),i=a.next();!i.done;i=a.next())for(var s=ze(i.value,2),l=s[0],u=s[1],c=0;cpr&&(r.moveSpeed-=pr)}var Nr=document.getElementById("game-canvas"),qr={score:document.getElementById("score-text"),time:document.getElementById("time-text"),level:document.getElementById("level-text"),menuButton:document.getElementById("menu-button"),menuButton2:document.getElementById("menu-button2"),mainText:document.getElementById("main-text")};!function(){var e=function(e){var r=e.getContext("webgl");if(null==r)throw"unable to create gl context -- is your browser gl ready?";return r.clearDepth(1),r.clearColor.apply(r,ke(ke([],Re(be),!1),[1],!1)),r.enable(r.DEPTH_TEST),r}(Nr),r=function(e){var r=new qe;r.register();var t=new Tr(e),n={gl:e,shaderInfo:Ce(e),mode:xr.Menu,inputs:{keyboard:r,gamepad:0,pauseDebouncer:new Ne(Date.now,vr),mouseDown:!1},play:{ship:t,missiles:[],tieredAsteroids:[[],[]],numAsteroids:[0,0],suns:[],ticks:0,score:0,lastCameraPosition:t.eye(),camera:t.camera(t.eye()),asteroidSpeed:[0,0],level:0,levelFinishedAt:null},freecam:{camera:new Vr({eye:l(0,0,-5),lookAt:l(0,0,1),lookUp:l(0,1,0),width:Nr.width,height:Nr.height,fovDegrees:cr[0],near:.03125,far:64,moveSpeed:.04}),freecamModeDebouncer:new Ne(Date.now,vr),generalDebouncer:new Ne(Date.now,vr),fog:!0,showShipCollisions:!1},menu:{camera:new Vr({eye:l(0,0,0),lookAt:l(0,0,1),lookUp:l(0,1,0),width:Nr.width,height:Nr.height,fovDegrees:cr[0],near:Ze,far:32,moveSpeed:.04}),asteroids:[],suns:[],movingCamera:!1,moveModeDebouncer:new Ne(Date.now,vr)}};return function(e){var r=e.menu.camera;r.yawLeft(Xe(-30)),r.pitchUp(Xe(-20));var t=new Ve(e.gl,we);t.translate(l(3.5,-4,10)),e.menu.suns.push(t);var n=new Ve(e.gl,we);n.translate(x(o(),r.eye,r.forward,-4)),e.menu.suns.push(n)}(n),n}(e);function t(e){r.mode==xr.Freecam?(r.freecam.camera.yawLeft(-.002*e.movementX),r.freecam.camera.pitchUp(-.002*e.movementY)):r.mode==xr.Play?(r.play.ship.yawLeft(-1e-4*e.movementX),r.play.ship.pitchUp(-1e-4*e.movementY)):r.mode==xr.Menu&&(r.menu.camera.yawLeft(-.002*e.movementX),r.menu.camera.pitchUp(-.002*e.movementY))}window.addEventListener("blur",(function(){r.mode==xr.Play&&kr(r),wr.pause()})),qr.menuButton.onclick=function(){_r(r,1)},Nr.onclick=function(){r.mode!=xr.Play&&r.mode!=xr.Freecam||Nr.requestPointerLock()},document.addEventListener("pointerlockchange",(function(){document.pointerLockElement===Nr?document.addEventListener("mousemove",t):document.removeEventListener("mousemove",t)})),document.addEventListener("mousedown",(function(){r.inputs.mouseDown=!0})),document.addEventListener("mouseup",(function(){r.inputs.mouseDown=!1})),jr(r)}()})(); +//# sourceMappingURL=data:application/json;charset=utf-8;base64,{"version":3,"file":"bundle.js","mappings":"mBACA,IAAIA,EAAsB,CCA1BA,EAAwB,CAACC,EAASC,KACjC,IAAI,IAAIC,KAAOD,EACXF,EAAoBI,EAAEF,EAAYC,KAASH,EAAoBI,EAAEH,EAASE,IAC5EE,OAAOC,eAAeL,EAASE,EAAK,CAAEI,YAAY,EAAMC,IAAKN,EAAWC,MCJ3EH,EAAwB,CAACS,EAAKC,IAAUL,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKC,GCClFV,EAAyBC,IACH,oBAAXa,QAA0BA,OAAOC,aAC1CV,OAAOC,eAAeL,EAASa,OAAOC,YAAa,CAAEC,MAAO,WAE7DX,OAAOC,eAAeL,EAAS,aAAc,CAAEe,OAAO,M,0pBCAhD,IAAIC,EAAU,KACVC,EAAqC,oBAAjBC,aAA+BA,aAAeC,MAClEC,EAASC,KAAKC,OCKlB,SAASC,IACd,IAAIC,EAAM,IAAI,EAAoB,GAQlC,OANI,GAAuBN,eACzBM,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,GAGJA,EASF,SAASC,EAAMC,GACpB,IAAIF,EAAM,IAAI,EAAoB,GAIlC,OAHAA,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACJF,EASF,SAAS,EAAOE,GACrB,IAAIC,EAAID,EAAE,GACNE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GACV,OAAOL,KAAKS,MAAMH,EAAGC,EAAGC,GAWnB,SAASE,EAAWJ,EAAGC,EAAGC,GAC/B,IAAIL,EAAM,IAAI,EAAoB,GAIlC,OAHAA,EAAI,GAAKG,EACTH,EAAI,GAAKI,EACTJ,EAAI,GAAKK,EACFL,EAUF,SAASQ,EAAKR,EAAKE,GAIxB,OAHAF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACJF,EAYF,SAASS,EAAIT,EAAKG,EAAGC,EAAGC,GAI7B,OAHAL,EAAI,GAAKG,EACTH,EAAI,GAAKI,EACTJ,EAAI,GAAKK,EACFL,EAWF,SAASU,EAAIV,EAAKE,EAAGS,GAI1B,OAHAX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GACXX,EAWF,SAASY,EAASZ,EAAKE,EAAGS,GAI/B,OAHAX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GACXX,EAWF,SAASa,EAASb,EAAKE,EAAGS,GAI/B,OAHAX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GACXX,EAWF,SAASc,EAAOd,EAAKE,EAAGS,GAI7B,OAHAX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAClBX,EAAI,GAAKE,EAAE,GAAKS,EAAE,GACXX,EAUF,SAASe,EAAKf,EAAKE,GAIxB,OAHAF,EAAI,GAAKH,KAAKkB,KAAKb,EAAE,IACrBF,EAAI,GAAKH,KAAKkB,KAAKb,EAAE,IACrBF,EAAI,GAAKH,KAAKkB,KAAKb,EAAE,IACdF,EAUF,SAASgB,EAAMhB,EAAKE,GAIzB,OAHAF,EAAI,GAAKH,KAAKmB,MAAMd,EAAE,IACtBF,EAAI,GAAKH,KAAKmB,MAAMd,EAAE,IACtBF,EAAI,GAAKH,KAAKmB,MAAMd,EAAE,IACfF,EAWF,SAASiB,EAAIjB,EAAKE,EAAGS,GAI1B,OAHAX,EAAI,GAAKH,KAAKoB,IAAIf,EAAE,GAAIS,EAAE,IAC1BX,EAAI,GAAKH,KAAKoB,IAAIf,EAAE,GAAIS,EAAE,IAC1BX,EAAI,GAAKH,KAAKoB,IAAIf,EAAE,GAAIS,EAAE,IACnBX,EAWF,SAASkB,EAAIlB,EAAKE,EAAGS,GAI1B,OAHAX,EAAI,GAAKH,KAAKqB,IAAIhB,EAAE,GAAIS,EAAE,IAC1BX,EAAI,GAAKH,KAAKqB,IAAIhB,EAAE,GAAIS,EAAE,IAC1BX,EAAI,GAAKH,KAAKqB,IAAIhB,EAAE,GAAIS,EAAE,IACnBX,EAUF,SAASmB,EAAMnB,EAAKE,GAIzB,OAHAF,EAAI,GAAKH,KAAKsB,MAAMjB,EAAE,IACtBF,EAAI,GAAKH,KAAKsB,MAAMjB,EAAE,IACtBF,EAAI,GAAKH,KAAKsB,MAAMjB,EAAE,IACfF,EAWF,SAASoB,EAAMpB,EAAKE,EAAGS,GAI5B,OAHAX,EAAI,GAAKE,EAAE,GAAKS,EAChBX,EAAI,GAAKE,EAAE,GAAKS,EAChBX,EAAI,GAAKE,EAAE,GAAKS,EACTX,EAYF,SAASqB,EAAYrB,EAAKE,EAAGS,EAAGS,GAIrC,OAHApB,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAAKS,EACvBpB,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAAKS,EACvBpB,EAAI,GAAKE,EAAE,GAAKS,EAAE,GAAKS,EAChBpB,EAUF,SAASsB,EAASpB,EAAGS,GAC1B,IAAIR,EAAIQ,EAAE,GAAKT,EAAE,GACbE,EAAIO,EAAE,GAAKT,EAAE,GACbG,EAAIM,EAAE,GAAKT,EAAE,GACjB,OAAOL,KAAKS,MAAMH,EAAGC,EAAGC,GAUnB,SAASkB,EAAgBrB,EAAGS,GACjC,IAAIR,EAAIQ,EAAE,GAAKT,EAAE,GACbE,EAAIO,EAAE,GAAKT,EAAE,GACbG,EAAIM,EAAE,GAAKT,EAAE,GACjB,OAAOC,EAAIA,EAAIC,EAAIA,EAAIC,EAAIA,EAStB,SAASmB,EAActB,GAC5B,IAAIC,EAAID,EAAE,GACNE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GACV,OAAOC,EAAIA,EAAIC,EAAIA,EAAIC,EAAIA,EAUtB,SAASoB,EAAOzB,EAAKE,GAI1B,OAHAF,EAAI,IAAME,EAAE,GACZF,EAAI,IAAME,EAAE,GACZF,EAAI,IAAME,EAAE,GACLF,EAUF,SAAS0B,EAAQ1B,EAAKE,GAI3B,OAHAF,EAAI,GAAK,EAAME,EAAE,GACjBF,EAAI,GAAK,EAAME,EAAE,GACjBF,EAAI,GAAK,EAAME,EAAE,GACVF,EAUF,SAAS2B,EAAU3B,EAAKE,GAC7B,IAAIC,EAAID,EAAE,GACNE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GACN0B,EAAMzB,EAAIA,EAAIC,EAAIA,EAAIC,EAAIA,EAU9B,OARIuB,EAAM,IAERA,EAAM,EAAI/B,KAAKgC,KAAKD,IAGtB5B,EAAI,GAAKE,EAAE,GAAK0B,EAChB5B,EAAI,GAAKE,EAAE,GAAK0B,EAChB5B,EAAI,GAAKE,EAAE,GAAK0B,EACT5B,EAUF,SAAS,EAAIE,EAAGS,GACrB,OAAOT,EAAE,GAAKS,EAAE,GAAKT,EAAE,GAAKS,EAAE,GAAKT,EAAE,GAAKS,EAAE,GAWvC,SAASmB,EAAM9B,EAAKE,EAAGS,GAC5B,IAAIoB,EAAK7B,EAAE,GACP8B,EAAK9B,EAAE,GACP+B,EAAK/B,EAAE,GACPgC,EAAKvB,EAAE,GACPwB,EAAKxB,EAAE,GACPyB,EAAKzB,EAAE,GAIX,OAHAX,EAAI,GAAKgC,EAAKI,EAAKH,EAAKE,EACxBnC,EAAI,GAAKiC,EAAKC,EAAKH,EAAKK,EACxBpC,EAAI,GAAK+B,EAAKI,EAAKH,EAAKE,EACjBlC,EAYF,SAASqC,EAAKrC,EAAKE,EAAGS,EAAG2B,GAC9B,IAAIP,EAAK7B,EAAE,GACP8B,EAAK9B,EAAE,GACP+B,EAAK/B,EAAE,GAIX,OAHAF,EAAI,GAAK+B,EAAKO,GAAK3B,EAAE,GAAKoB,GAC1B/B,EAAI,GAAKgC,EAAKM,GAAK3B,EAAE,GAAKqB,GAC1BhC,EAAI,GAAKiC,EAAKK,GAAK3B,EAAE,GAAKsB,GACnBjC,EAcF,SAASuC,EAAQvC,EAAKE,EAAGS,EAAG6B,EAAGC,EAAGH,GACvC,IAAII,EAAeJ,EAAIA,EACnBK,EAAUD,GAAgB,EAAIJ,EAAI,GAAK,EACvCM,EAAUF,GAAgBJ,EAAI,GAAKA,EACnCO,EAAUH,GAAgBJ,EAAI,GAC9BQ,EAAUJ,GAAgB,EAAI,EAAIJ,GAItC,OAHAtC,EAAI,GAAKE,EAAE,GAAKyC,EAAUhC,EAAE,GAAKiC,EAAUJ,EAAE,GAAKK,EAAUJ,EAAE,GAAKK,EACnE9C,EAAI,GAAKE,EAAE,GAAKyC,EAAUhC,EAAE,GAAKiC,EAAUJ,EAAE,GAAKK,EAAUJ,EAAE,GAAKK,EACnE9C,EAAI,GAAKE,EAAE,GAAKyC,EAAUhC,EAAE,GAAKiC,EAAUJ,EAAE,GAAKK,EAAUJ,EAAE,GAAKK,EAC5D9C,EAcF,SAAS+C,EAAO/C,EAAKE,EAAGS,EAAG6B,EAAGC,EAAGH,GACtC,IAAIU,EAAgB,EAAIV,EACpBW,EAAwBD,EAAgBA,EACxCN,EAAeJ,EAAIA,EACnBK,EAAUM,EAAwBD,EAClCJ,EAAU,EAAIN,EAAIW,EAClBJ,EAAU,EAAIH,EAAeM,EAC7BF,EAAUJ,EAAeJ,EAI7B,OAHAtC,EAAI,GAAKE,EAAE,GAAKyC,EAAUhC,EAAE,GAAKiC,EAAUJ,EAAE,GAAKK,EAAUJ,EAAE,GAAKK,EACnE9C,EAAI,GAAKE,EAAE,GAAKyC,EAAUhC,EAAE,GAAKiC,EAAUJ,EAAE,GAAKK,EAAUJ,EAAE,GAAKK,EACnE9C,EAAI,GAAKE,EAAE,GAAKyC,EAAUhC,EAAE,GAAKiC,EAAUJ,EAAE,GAAKK,EAAUJ,EAAE,GAAKK,EAC5D9C,EAUF,SAASF,EAAOE,EAAKoB,GAC1BA,EAAQA,GAAS,EACjB,IAAI8B,EAAwB,EAApB,IAA0BrD,KAAKsD,GACnC9C,EAAwB,EAApB,IAA0B,EAC9B+C,EAASvD,KAAKgC,KAAK,EAAMxB,EAAIA,GAAKe,EAItC,OAHApB,EAAI,GAAKH,KAAKwD,IAAIH,GAAKE,EACvBpD,EAAI,GAAKH,KAAKyD,IAAIJ,GAAKE,EACvBpD,EAAI,GAAKK,EAAIe,EACNpB,EAYF,SAASuD,EAAcvD,EAAKE,EAAGsD,GACpC,IAAIrD,EAAID,EAAE,GACNE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GACNuD,EAAID,EAAE,GAAKrD,EAAIqD,EAAE,GAAKpD,EAAIoD,EAAE,IAAMnD,EAAImD,EAAE,IAK5C,OAJAC,EAAIA,GAAK,EACTzD,EAAI,IAAMwD,EAAE,GAAKrD,EAAIqD,EAAE,GAAKpD,EAAIoD,EAAE,GAAKnD,EAAImD,EAAE,KAAOC,EACpDzD,EAAI,IAAMwD,EAAE,GAAKrD,EAAIqD,EAAE,GAAKpD,EAAIoD,EAAE,GAAKnD,EAAImD,EAAE,KAAOC,EACpDzD,EAAI,IAAMwD,EAAE,GAAKrD,EAAIqD,EAAE,GAAKpD,EAAIoD,EAAE,IAAMnD,EAAImD,EAAE,KAAOC,EAC9CzD,EAWF,SAAS0D,EAAc1D,EAAKE,EAAGsD,GACpC,IAAIrD,EAAID,EAAE,GACNE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GAIV,OAHAF,EAAI,GAAKG,EAAIqD,EAAE,GAAKpD,EAAIoD,EAAE,GAAKnD,EAAImD,EAAE,GACrCxD,EAAI,GAAKG,EAAIqD,EAAE,GAAKpD,EAAIoD,EAAE,GAAKnD,EAAImD,EAAE,GACrCxD,EAAI,GAAKG,EAAIqD,EAAE,GAAKpD,EAAIoD,EAAE,GAAKnD,EAAImD,EAAE,GAC9BxD,EAYF,SAAS2D,EAAc3D,EAAKE,EAAG0D,GAEpC,IAAIC,EAAKD,EAAE,GACPE,EAAKF,EAAE,GACPG,EAAKH,EAAE,GACPI,EAAKJ,EAAE,GACPzD,EAAID,EAAE,GACNE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GAGN+D,EAAMH,EAAKzD,EAAI0D,EAAK3D,EACpB8D,EAAMH,EAAK5D,EAAI0D,EAAKxD,EACpB8D,EAAMN,EAAKzD,EAAI0D,EAAK3D,EAEpBiE,EAAON,EAAKK,EAAMJ,EAAKG,EACvBG,EAAON,EAAKE,EAAMJ,EAAKM,EACvBG,EAAOT,EAAKK,EAAMJ,EAAKG,EAEvBM,EAAU,EAALP,EAYT,OAXAC,GAAOM,EACPL,GAAOK,EACPJ,GAAOI,EAEPH,GAAQ,EACRC,GAAQ,EACRC,GAAQ,EAERtE,EAAI,GAAKG,EAAI8D,EAAMG,EACnBpE,EAAI,GAAKI,EAAI8D,EAAMG,EACnBrE,EAAI,GAAKK,EAAI8D,EAAMG,EACZtE,EAWF,SAASwE,EAAQxE,EAAKE,EAAGS,EAAG8D,GACjC,IAAIC,EAAI,GACJxB,EAAI,GAaR,OAXAwB,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAChB+D,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAChB+D,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAEhBuC,EAAE,GAAKwB,EAAE,GACTxB,EAAE,GAAKwB,EAAE,GAAK7E,KAAKwD,IAAIoB,GAAOC,EAAE,GAAK7E,KAAKyD,IAAImB,GAC9CvB,EAAE,GAAKwB,EAAE,GAAK7E,KAAKyD,IAAImB,GAAOC,EAAE,GAAK7E,KAAKwD,IAAIoB,GAE9CzE,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GAClBX,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GAClBX,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GACXX,EAWF,SAAS2E,EAAQ3E,EAAKE,EAAGS,EAAG8D,GACjC,IAAIC,EAAI,GACJxB,EAAI,GAaR,OAXAwB,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAChB+D,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAChB+D,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAEhBuC,EAAE,GAAKwB,EAAE,GAAK7E,KAAKyD,IAAImB,GAAOC,EAAE,GAAK7E,KAAKwD,IAAIoB,GAC9CvB,EAAE,GAAKwB,EAAE,GACTxB,EAAE,GAAKwB,EAAE,GAAK7E,KAAKwD,IAAIoB,GAAOC,EAAE,GAAK7E,KAAKyD,IAAImB,GAE9CzE,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GAClBX,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GAClBX,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GACXX,EAWF,SAAS4E,EAAQ5E,EAAKE,EAAGS,EAAG8D,GACjC,IAAIC,EAAI,GACJxB,EAAI,GAaR,OAXAwB,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAChB+D,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAChB+D,EAAE,GAAKxE,EAAE,GAAKS,EAAE,GAEhBuC,EAAE,GAAKwB,EAAE,GAAK7E,KAAKwD,IAAIoB,GAAOC,EAAE,GAAK7E,KAAKyD,IAAImB,GAC9CvB,EAAE,GAAKwB,EAAE,GAAK7E,KAAKyD,IAAImB,GAAOC,EAAE,GAAK7E,KAAKwD,IAAIoB,GAC9CvB,EAAE,GAAKwB,EAAE,GAET1E,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GAClBX,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GAClBX,EAAI,GAAKkD,EAAE,GAAKvC,EAAE,GACXX,EASF,SAAS6E,EAAM3E,EAAGS,GACvB,IAAIoB,EAAK7B,EAAE,GACP8B,EAAK9B,EAAE,GACP+B,EAAK/B,EAAE,GACPgC,EAAKvB,EAAE,GACPwB,EAAKxB,EAAE,GACPyB,EAAKzB,EAAE,GAGPmE,EAFOjF,KAAKgC,KAAKE,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,GACnCpC,KAAKgC,KAAKK,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,GAE1C2C,EAASD,GAAO,EAAI5E,EAAGS,GAAKmE,EAChC,OAAOjF,KAAKmF,KAAKnF,KAAKoB,IAAIpB,KAAKqB,IAAI6D,GAAS,GAAI,IAS3C,SAASE,EAAKjF,GAInB,OAHAA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACFA,EASF,SAASkF,EAAIhF,GAClB,MAAO,QAAUA,EAAE,GAAK,KAAOA,EAAE,GAAK,KAAOA,EAAE,GAAK,IAU/C,SAASiF,EAAYjF,EAAGS,GAC7B,OAAOT,EAAE,KAAOS,EAAE,IAAMT,EAAE,KAAOS,EAAE,IAAMT,EAAE,KAAOS,EAAE,GAU/C,SAAS,EAAOT,EAAGS,GACxB,IAAIyE,EAAKlF,EAAE,GACPmF,EAAKnF,EAAE,GACPoF,EAAKpF,EAAE,GACPqF,EAAK5E,EAAE,GACP6E,EAAK7E,EAAE,GACP8E,EAAK9E,EAAE,GACX,OAAOd,KAAK6F,IAAIN,EAAKG,IAAO,EAAmB1F,KAAKqB,IAAI,EAAKrB,KAAK6F,IAAIN,GAAKvF,KAAK6F,IAAIH,KAAQ1F,KAAK6F,IAAIL,EAAKG,IAAO,EAAmB3F,KAAKqB,IAAI,EAAKrB,KAAK6F,IAAIL,GAAKxF,KAAK6F,IAAIF,KAAQ3F,KAAK6F,IAAIJ,EAAKG,IAAO,EAAmB5F,KAAKqB,IAAI,EAAKrB,KAAK6F,IAAIJ,GAAKzF,KAAK6F,IAAID,IDzqBnP5F,KAAKsD,GAuBbtD,KAAKS,QAAOT,KAAKS,MAAQ,WAI5B,IAHA,IAAIF,EAAI,EACJuF,EAAIC,UAAUC,OAEXF,KACLvF,GAAKwF,UAAUD,GAAKC,UAAUD,GAGhC,OAAO9F,KAAKgC,KAAKzB,KCipBZ,IAmDD0F,EAnDKC,EAAMnF,EAMNoF,EAAMnF,EAMNoF,EAAMnF,EAMNoF,EAAO5E,EAMP6E,EAAU5E,EAMVK,EAAM,EAMNwE,EAAS5E,EAcT6E,GACLP,EAAM/F,IACH,SAAUG,EAAGoG,EAAQC,EAAQC,EAAOC,EAAIC,GAC7C,IAAIf,EAAGgB,EAgBP,IAdKL,IACHA,EAAS,GAGNC,IACHA,EAAS,GAITI,EADEH,EACE3G,KAAKoB,IAAIuF,EAAQF,EAASC,EAAQrG,EAAE2F,QAEpC3F,EAAE2F,OAGHF,EAAIY,EAAQZ,EAAIgB,EAAGhB,GAAKW,EAC3BR,EAAI,GAAK5F,EAAEyF,GACXG,EAAI,GAAK5F,EAAEyF,EAAI,GACfG,EAAI,GAAK5F,EAAEyF,EAAI,GACfc,EAAGX,EAAKA,EAAKY,GACbxG,EAAEyF,GAAKG,EAAI,GACX5F,EAAEyF,EAAI,GAAKG,EAAI,GACf5F,EAAEyF,EAAI,GAAKG,EAAI,GAGjB,OAAO5F,ICpwBJ,SAAS,KACd,IAAIF,EAAM,IAAI,EAAoB,IAqBlC,OAnBI,GAAuBN,eACzBM,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,GAGZA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,IAAM,EACVA,EAAI,IAAM,EACHA,EAkXF,SAAS,GAASA,EAAKE,EAAGS,GAC/B,IAAIiG,EAAM1G,EAAE,GACR2G,EAAM3G,EAAE,GACR4G,EAAM5G,EAAE,GACR6G,EAAM7G,EAAE,GACR8G,EAAM9G,EAAE,GACR+G,EAAM/G,EAAE,GACRgH,EAAMhH,EAAE,GACRiH,EAAMjH,EAAE,GACRkH,EAAMlH,EAAE,GACRmH,EAAMnH,EAAE,GACRoH,EAAMpH,EAAE,IACRqH,EAAMrH,EAAE,IACRsH,EAAMtH,EAAE,IACRuH,EAAMvH,EAAE,IACRwH,EAAMxH,EAAE,IACRyH,EAAMzH,EAAE,IAERqF,EAAK5E,EAAE,GACP6E,EAAK7E,EAAE,GACP8E,EAAK9E,EAAE,GACPiH,EAAKjH,EAAE,GA6BX,OA5BAX,EAAI,GAAKuF,EAAKqB,EAAMpB,EAAKwB,EAAMvB,EAAK2B,EAAMQ,EAAKJ,EAC/CxH,EAAI,GAAKuF,EAAKsB,EAAMrB,EAAKyB,EAAMxB,EAAK4B,EAAMO,EAAKH,EAC/CzH,EAAI,GAAKuF,EAAKuB,EAAMtB,EAAK0B,EAAMzB,EAAK6B,EAAMM,EAAKF,EAC/C1H,EAAI,GAAKuF,EAAKwB,EAAMvB,EAAK2B,EAAM1B,EAAK8B,EAAMK,EAAKD,EAC/CpC,EAAK5E,EAAE,GACP6E,EAAK7E,EAAE,GACP8E,EAAK9E,EAAE,GACPiH,EAAKjH,EAAE,GACPX,EAAI,GAAKuF,EAAKqB,EAAMpB,EAAKwB,EAAMvB,EAAK2B,EAAMQ,EAAKJ,EAC/CxH,EAAI,GAAKuF,EAAKsB,EAAMrB,EAAKyB,EAAMxB,EAAK4B,EAAMO,EAAKH,EAC/CzH,EAAI,GAAKuF,EAAKuB,EAAMtB,EAAK0B,EAAMzB,EAAK6B,EAAMM,EAAKF,EAC/C1H,EAAI,GAAKuF,EAAKwB,EAAMvB,EAAK2B,EAAM1B,EAAK8B,EAAMK,EAAKD,EAC/CpC,EAAK5E,EAAE,GACP6E,EAAK7E,EAAE,GACP8E,EAAK9E,EAAE,IACPiH,EAAKjH,EAAE,IACPX,EAAI,GAAKuF,EAAKqB,EAAMpB,EAAKwB,EAAMvB,EAAK2B,EAAMQ,EAAKJ,EAC/CxH,EAAI,GAAKuF,EAAKsB,EAAMrB,EAAKyB,EAAMxB,EAAK4B,EAAMO,EAAKH,EAC/CzH,EAAI,IAAMuF,EAAKuB,EAAMtB,EAAK0B,EAAMzB,EAAK6B,EAAMM,EAAKF,EAChD1H,EAAI,IAAMuF,EAAKwB,EAAMvB,EAAK2B,EAAM1B,EAAK8B,EAAMK,EAAKD,EAChDpC,EAAK5E,EAAE,IACP6E,EAAK7E,EAAE,IACP8E,EAAK9E,EAAE,IACPiH,EAAKjH,EAAE,IACPX,EAAI,IAAMuF,EAAKqB,EAAMpB,EAAKwB,EAAMvB,EAAK2B,EAAMQ,EAAKJ,EAChDxH,EAAI,IAAMuF,EAAKsB,EAAMrB,EAAKyB,EAAMxB,EAAK4B,EAAMO,EAAKH,EAChDzH,EAAI,IAAMuF,EAAKuB,EAAMtB,EAAK0B,EAAMzB,EAAK6B,EAAMM,EAAKF,EAChD1H,EAAI,IAAMuF,EAAKwB,EAAMvB,EAAK2B,EAAM1B,EAAK8B,EAAMK,EAAKD,EACzC3H,EAkGF,SAAS6H,GAAO7H,EAAKE,EAAGuE,EAAKqD,GAClC,IAIIC,EAAGvF,EAAGF,EACNsE,EAAKC,EAAKC,EAAKC,EACfC,EAAKC,EAAKC,EAAKC,EACfC,EAAKC,EAAKC,EAAKC,EACfS,EAAKC,EAAKC,EACVC,EAAKC,EAAKC,EACVC,EAAKC,EAAKC,EAVVrI,EAAI2H,EAAK,GACT1H,EAAI0H,EAAK,GACTzH,EAAIyH,EAAK,GACTlG,EAAM/B,KAAKS,MAAMH,EAAGC,EAAGC,GAS3B,OAAIuB,EAAM,EACD,MAITzB,GADAyB,EAAM,EAAIA,EAEVxB,GAAKwB,EACLvB,GAAKuB,EACLmG,EAAIlI,KAAKyD,IAAImB,GAEbnC,EAAI,GADJE,EAAI3C,KAAKwD,IAAIoB,IAEbmC,EAAM1G,EAAE,GACR2G,EAAM3G,EAAE,GACR4G,EAAM5G,EAAE,GACR6G,EAAM7G,EAAE,GACR8G,EAAM9G,EAAE,GACR+G,EAAM/G,EAAE,GACRgH,EAAMhH,EAAE,GACRiH,EAAMjH,EAAE,GACRkH,EAAMlH,EAAE,GACRmH,EAAMnH,EAAE,GACRoH,EAAMpH,EAAE,IACRqH,EAAMrH,EAAE,IAER8H,EAAM7H,EAAIA,EAAImC,EAAIE,EAClByF,EAAM7H,EAAID,EAAImC,EAAIjC,EAAI0H,EACtBG,EAAM7H,EAAIF,EAAImC,EAAIlC,EAAI2H,EACtBI,EAAMhI,EAAIC,EAAIkC,EAAIjC,EAAI0H,EACtBK,EAAMhI,EAAIA,EAAIkC,EAAIE,EAClB6F,EAAMhI,EAAID,EAAIkC,EAAInC,EAAI4H,EACtBO,EAAMnI,EAAIE,EAAIiC,EAAIlC,EAAI2H,EACtBQ,EAAMnI,EAAIC,EAAIiC,EAAInC,EAAI4H,EACtBS,EAAMnI,EAAIA,EAAIiC,EAAIE,EAElBxC,EAAI,GAAK4G,EAAMoB,EAAMhB,EAAMiB,EAAMb,EAAMc,EACvClI,EAAI,GAAK6G,EAAMmB,EAAMf,EAAMgB,EAAMZ,EAAMa,EACvClI,EAAI,GAAK8G,EAAMkB,EAAMd,EAAMe,EAAMX,EAAMY,EACvClI,EAAI,GAAK+G,EAAMiB,EAAMb,EAAMc,EAAMV,EAAMW,EACvClI,EAAI,GAAK4G,EAAMuB,EAAMnB,EAAMoB,EAAMhB,EAAMiB,EACvCrI,EAAI,GAAK6G,EAAMsB,EAAMlB,EAAMmB,EAAMf,EAAMgB,EACvCrI,EAAI,GAAK8G,EAAMqB,EAAMjB,EAAMkB,EAAMd,EAAMe,EACvCrI,EAAI,GAAK+G,EAAMoB,EAAMhB,EAAMiB,EAAMb,EAAMc,EACvCrI,EAAI,GAAK4G,EAAM0B,EAAMtB,EAAMuB,EAAMnB,EAAMoB,EACvCxI,EAAI,GAAK6G,EAAMyB,EAAMrB,EAAMsB,EAAMlB,EAAMmB,EACvCxI,EAAI,IAAM8G,EAAMwB,EAAMpB,EAAMqB,EAAMjB,EAAMkB,EACxCxI,EAAI,IAAM+G,EAAMuB,EAAMnB,EAAMoB,EAAMhB,EAAMiB,EAEpCtI,IAAMF,IAERA,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,KAGPF,GAiNF,SAASyI,GAAazI,EAAKyE,EAAKqD,GACrC,IAIIC,EAAGvF,EAAGF,EAJNnC,EAAI2H,EAAK,GACT1H,EAAI0H,EAAK,GACTzH,EAAIyH,EAAK,GACTlG,EAAM/B,KAAKS,MAAMH,EAAGC,EAAGC,GAG3B,OAAIuB,EAAM,EACD,MAITzB,GADAyB,EAAM,EAAIA,EAEVxB,GAAKwB,EACLvB,GAAKuB,EACLmG,EAAIlI,KAAKyD,IAAImB,GAEbnC,EAAI,GADJE,EAAI3C,KAAKwD,IAAIoB,IAGbzE,EAAI,GAAKG,EAAIA,EAAImC,EAAIE,EACrBxC,EAAI,GAAKI,EAAID,EAAImC,EAAIjC,EAAI0H,EACzB/H,EAAI,GAAKK,EAAIF,EAAImC,EAAIlC,EAAI2H,EACzB/H,EAAI,GAAK,EACTA,EAAI,GAAKG,EAAIC,EAAIkC,EAAIjC,EAAI0H,EACzB/H,EAAI,GAAKI,EAAIA,EAAIkC,EAAIE,EACrBxC,EAAI,GAAKK,EAAID,EAAIkC,EAAInC,EAAI4H,EACzB/H,EAAI,GAAK,EACTA,EAAI,GAAKG,EAAIE,EAAIiC,EAAIlC,EAAI2H,EACzB/H,EAAI,GAAKI,EAAIC,EAAIiC,EAAInC,EAAI4H,EACzB/H,EAAI,IAAMK,EAAIA,EAAIiC,EAAIE,EACtBxC,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACHA,GAyaF,SAAS0I,GAAS1I,EAAK4D,GAC5B,IAAIzD,EAAIyD,EAAE,GACNxD,EAAIwD,EAAE,GACNvD,EAAIuD,EAAE,GACNH,EAAIG,EAAE,GACN+E,EAAKxI,EAAIA,EACTyI,EAAKxI,EAAIA,EACTyI,EAAKxI,EAAIA,EACTyI,EAAK3I,EAAIwI,EACTI,EAAK3I,EAAIuI,EACTK,EAAK5I,EAAIwI,EACTK,EAAK5I,EAAIsI,EACTO,EAAK7I,EAAIuI,EACTO,EAAK9I,EAAIwI,EACTO,EAAK3F,EAAIkF,EACTU,EAAK5F,EAAImF,EACTU,EAAK7F,EAAIoF,EAiBb,OAhBA7I,EAAI,GAAK,EAAIgJ,EAAKG,EAClBnJ,EAAI,GAAK+I,EAAKO,EACdtJ,EAAI,GAAKiJ,EAAKI,EACdrJ,EAAI,GAAK,EACTA,EAAI,GAAK+I,EAAKO,EACdtJ,EAAI,GAAK,EAAI8I,EAAKK,EAClBnJ,EAAI,GAAKkJ,EAAKE,EACdpJ,EAAI,GAAK,EACTA,EAAI,GAAKiJ,EAAKI,EACdrJ,EAAI,GAAKkJ,EAAKE,EACdpJ,EAAI,IAAM,EAAI8I,EAAKE,EACnBhJ,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACHA,EAqFF,IAAIuJ,GAlCJ,SAAuBvJ,EAAKwJ,EAAMC,EAAQC,EAAMC,GACrD,IACIC,EADAC,EAAI,EAAMhK,KAAKiK,IAAIN,EAAO,GA0B9B,OAxBAxJ,EAAI,GAAK6J,EAAIJ,EACbzJ,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK6J,EACT7J,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,KAAO,EACXA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EAEC,MAAP2J,GAAeA,IAAQI,EAAAA,GACzBH,EAAK,GAAKF,EAAOC,GACjB3J,EAAI,KAAO2J,EAAMD,GAAQE,EACzB5J,EAAI,IAAM,EAAI2J,EAAMD,EAAOE,IAE3B5J,EAAI,KAAO,EACXA,EAAI,KAAO,EAAI0J,GAGV1J,GAmLF,SAASgK,GAAOhK,EAAKiK,EAAKC,EAAQC,GACvC,IAAIC,EAAIC,EAAI1B,EAAI2B,EAAIC,EAAI3B,EAAI4B,EAAIC,EAAI5B,EAAIjH,EACpC8I,EAAOT,EAAI,GACXU,EAAOV,EAAI,GACXW,EAAOX,EAAI,GACXY,EAAMV,EAAG,GACTW,EAAMX,EAAG,GACTY,EAAMZ,EAAG,GACTa,EAAUd,EAAO,GACjBe,EAAUf,EAAO,GACjBgB,EAAUhB,EAAO,GAErB,OAAIrK,KAAK6F,IAAIgF,EAAOM,GAAW,GAAoBnL,KAAK6F,IAAIiF,EAAOM,GAAW,GAAoBpL,KAAK6F,IAAIkF,EAAOM,GAAW,EAl4CxH,SAAkBlL,GAiBvB,OAhBAA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM,EACHA,EAk3CEmL,CAASnL,IAGlBwK,EAAKE,EAAOM,EACZP,EAAKE,EAAOM,EACZpC,EAAK+B,EAAOM,EAKZd,EAAKU,GADLjC,GAHAjH,EAAM,EAAI/B,KAAKS,MAAMkK,EAAIC,EAAI5B,IAIbkC,GAFhBN,GAAM7I,GAGNyI,EAAKU,GAJLP,GAAM5I,GAIUiJ,EAAMhC,EACtBF,EAAKkC,EAAMJ,EAAKK,EAAMN,GACtB5I,EAAM/B,KAAKS,MAAM8J,EAAIC,EAAI1B,KAQvByB,GADAxI,EAAM,EAAIA,EAEVyI,GAAMzI,EACN+G,GAAM/G,IAPNwI,EAAK,EACLC,EAAK,EACL1B,EAAK,GAQP2B,EAAKG,EAAK9B,EAAKE,EAAKwB,EACpBE,EAAK1B,EAAKuB,EAAKI,EAAK7B,EACpBC,EAAK4B,EAAKH,EAAKI,EAAKL,GACpBxI,EAAM/B,KAAKS,MAAMgK,EAAIC,EAAI3B,KAQvB0B,GADA1I,EAAM,EAAIA,EAEV2I,GAAM3I,EACNgH,GAAMhH,IAPN0I,EAAK,EACLC,EAAK,EACL3B,EAAK,GAQP5I,EAAI,GAAKoK,EACTpK,EAAI,GAAKsK,EACTtK,EAAI,GAAKwK,EACTxK,EAAI,GAAK,EACTA,EAAI,GAAKqK,EACTrK,EAAI,GAAKuK,EACTvK,EAAI,GAAKyK,EACTzK,EAAI,GAAK,EACTA,EAAI,GAAK2I,EACT3I,EAAI,GAAK4I,EACT5I,EAAI,IAAM6I,EACV7I,EAAI,IAAM,EACVA,EAAI,MAAQoK,EAAKM,EAAOL,EAAKM,EAAOhC,EAAKiC,GACzC5K,EAAI,MAAQsK,EAAKI,EAAOH,EAAKI,EAAO/B,EAAKgC,GACzC5K,EAAI,MAAQwK,EAAKE,EAAOD,EAAKE,EAAO9B,EAAK+B,GACzC5K,EAAI,IAAM,EACHA,GCnmDF,SAAS,KACd,IAAIA,EAAM,IAAI,EAAoB,GASlC,OAPI,GAAuBN,eACzBM,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,GAGXA,EAAI,GAAK,EACFA,EA0BF,SAASoL,GAAapL,EAAK8H,EAAMrD,GACtCA,GAAY,GACZ,IAAIsD,EAAIlI,KAAKyD,IAAImB,GAKjB,OAJAzE,EAAI,GAAK+H,EAAID,EAAK,GAClB9H,EAAI,GAAK+H,EAAID,EAAK,GAClB9H,EAAI,GAAK+H,EAAID,EAAK,GAClB9H,EAAI,GAAKH,KAAKwD,IAAIoB,GACXzE,EAsDF,SAAS,GAASA,EAAKE,EAAGS,GAC/B,IAAIoB,EAAK7B,EAAE,GACP8B,EAAK9B,EAAE,GACP+B,EAAK/B,EAAE,GACPmL,EAAKnL,EAAE,GACPgC,EAAKvB,EAAE,GACPwB,EAAKxB,EAAE,GACPyB,EAAKzB,EAAE,GACP2K,EAAK3K,EAAE,GAKX,OAJAX,EAAI,GAAK+B,EAAKuJ,EAAKD,EAAKnJ,EAAKF,EAAKI,EAAKH,EAAKE,EAC5CnC,EAAI,GAAKgC,EAAKsJ,EAAKD,EAAKlJ,EAAKF,EAAKC,EAAKH,EAAKK,EAC5CpC,EAAI,GAAKiC,EAAKqJ,EAAKD,EAAKjJ,EAAKL,EAAKI,EAAKH,EAAKE,EAC5ClC,EAAI,GAAKqL,EAAKC,EAAKvJ,EAAKG,EAAKF,EAAKG,EAAKF,EAAKG,EACrCpC,GCwfY,WACnB,IAzmBIA,EAAAA,EAAM,IAAI,EAAoB,GAE9B,GAAuBN,eACzBM,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,GAkmBQ,GDvJd,IEjdDA,GFidK,GC/bJ,SAAeE,GACpB,IAAIF,EAAM,IAAI,EAAoB,GAKlC,OAJAA,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACJF,G,IDqlBO,IACE,EAAgB,EAAG,EAAG,GACtB,EAAgB,EAAG,EAAG,GAuC1B,KACA,KEvpBRA,GAAM,IAAI,EAAoB,GAE9B,GAAuBN,eACzBM,GAAI,GAAK,EACTA,GAAI,GAAK,EACTA,GAAI,GAAK,EACTA,GAAI,GAAK,EACTA,GAAI,GAAK,EACTA,GAAI,GAAK,GAGXA,GAAI,GAAK,EACTA,GAAI,GAAK,EACTA,GAAI,GAAK,EACFA,G,ywBCVT,SAASuL,GAAIrI,EAAWsI,EAAW7K,GACjC,MAAO,CAACuC,EAAI,IAAKsI,EAAI,IAAK7K,EAAI,KAgBhC,SAASuJ,GAAOuB,G,YAEVC,EAAW,I,IACf,IAAgB,SAAAD,EAAME,UAAQ,8BAC5B,EAASD,EAAUA,EADVE,EAAC,S,iGAGZ,EAAWF,EAAUA,EAAU,EAAID,EAAME,SAAS9F,Q,IAClD,IAAgB,SAAA4F,EAAME,UAAQ,8BAAE,CAA3B,IAAMC,EACT,EADSA,EAAC,QACOA,EAAGF,I,iGAEtB,OAAOD,EAGT,SAASI,GAAKC,EAAiBC,GAC7B,OAAO7B,GAAO,CACZ6B,SAAUA,EACVJ,SAAU,CACR,CAAC,EAAG,EAAG,GACP,CAACG,EAAS,EAAG,GACb,CAACA,EAAS,EAAGA,GACb,CAAC,EAAG,EAAGA,GACP,CAAC,EAAGA,EAAS,GACb,CAACA,EAASA,EAAS,GACnB,CAACA,EAASA,EAASA,GACnB,CAAC,EAAGA,EAASA,IAEfE,UAAW,CACT,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,MAeN,IAAMC,GAAoBV,GAAI,IAAK,IAAK,KAClCW,GAAsBX,GAAI,GAAI,GAAI,IAGlCY,GAAaN,GADa,EACS,CAC9CO,QAASH,GACTI,QAAS,CAAC,EAAK,EAAK,GACpBC,SAAU,CAAC,EAAK,EAAK,GACrBC,EAAG,KAGQC,GAAaX,GAAK,GAAK,CAClCO,QAAS,CAAC,EAAK,EAAK,GACpBC,QAAS,CAAC,EAAK,EAAK,GACpBC,SAAU,CAAC,EAAK,EAAK,GACrBC,EAAG,KAGQE,GAAcvC,GAAO,CAChC6B,SAAU,CACRK,QAAS,CAAC,KAAO,KAAO,MACxBC,QAAS,CAAC,KAAO,KAAO,MACxBC,SAAU,CAAC,IAAM,IAAM,KACvBC,EAAG,IAELZ,SAAU,CACR,CAAC,EAAK,EAAK,GACX,CAAC,GAAK,GAAK,GACX,CAAC,GAAK,EAAK,GACX,CAAC,GAAK,IAAM,KACZ,CAAC,GAAK,KAAO,MAEfK,UAAW,CACT,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,MAGEU,GAAoBD,GAAKd,SAAS,GAClCgB,GAAgCF,GAAKd,SAASiB,KAAI,SAAChB,GAAM,iBAAI,SAAeA,IAAC,OAE7EiB,GAAoB,CAC/Bd,SAAU,CACRK,QAASb,GAAI,IAAK,GAAI,IACtBc,QAAS,CAAC,EAAK,EAAK,GACpBC,SAAU,CAAC,EAAK,EAAK,GACrBC,EAAG,IAELZ,SAAU,CACR,CAAC,EAAI,GAAI,EAAG,GACZ,CAAC,EAAG,EAAG,EAAI,KACX,EAAE,EAAI,GAAI,EAAG,GACb,CAAC,EAAG,GAAI,EAAI,KACZ,CAAC,GAAI,GAAK,IAEZK,UAAW,CACT,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,KAIEc,GAA2B,CACtCf,SAAU,CACRK,QAASb,GAAI,IAAK,IAAK,KACvBc,QAAS,CAAC,EAAK,EAAK,GACpBC,SAAU,CAAC,EAAK,EAAK,GACrBC,EAAG,IAELZ,SAAU,CACR,CAAC,IAAM,GAAI,EAAG,GACd,CAAC,EAAG,EAAG,EAAI,KACX,EAAE,IAAM,GAAI,EAAG,GACf,CAAC,EAAG,GAAI,EAAI,KACZ,CAAC,GAAI,IAAM,IAEbK,UAAW,CACT,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,KAMEe,GAvGb,SAAetB,EAAc3F,GAC3B,IAAK,IAAMH,KAAK8F,EAAME,SACpBF,EAAME,SAAShG,GAAG,IAAMG,EAAI,GAC5B2F,EAAME,SAAShG,GAAG,IAAMG,EAAI,GAC5B2F,EAAME,SAAShG,GAAG,IAAMG,EAAI,GAE9B,OAAO2F,EAiG0BuB,CACjCnB,GAHwB,GAGR,CACdO,QAASb,GAAI,IAAK,IAAK,KACvBc,QAAS,CAAC,EAAK,EAAK,GACpBC,SAAU,CAAC,EAAK,EAAK,GACrBC,EAAG,KAEL,CAAC,EAR0B,GAQT,IAGPU,GAAiB/C,GAAO,CACnC6B,SAAU,CACRK,QAAS,CAAC,EAAK,GAAK,IACpBC,QAAS,CAAC,EAAK,EAAK,GACpBC,SAAU,CAAC,EAAK,EAAK,GACrBC,EAAG,IAELZ,SAAU,CACR,CAAC,EAAI,GAAI,EAAK,GACd,CAAC,EAAK,EAAK,EAAI,IACf,EAAE,EAAI,GAAI,EAAK,GACf,CAAC,EAAK,GAAM,EAAI,IAChB,CAAC,EAAI,GAAI,GAAK,GACd,CAAC,EAAK,GAAK,EAAI,IACf,EAAE,EAAI,GAAI,GAAK,GACf,CAAC,EAAK,IAAM,EAAI,KAElBK,UAAW,CACT,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,MAIEkB,GAAyB3B,GAAI,GAAI,GAAI,IACrC4B,GAAiC,CAAC,EAAG,EAAG,GAQ/CC,GAAoB,CACxBhB,QAAiBc,GAAeN,KAAI,SAACzM,GAAM,MAHE,GAGFA,KAC3CkM,QAAiBa,GAAeN,KAAI,SAACzM,GAAM,OAHE,EAGFA,KAC3CmM,SAAU,CAAC,EAAK,EAAK,GACrBC,EAAG,I,+wBCpOQc,GAAY,GAEzB,cAYE,WAAYC,EAA2B7B,EAAc8B,QAAA,IAAAA,IAAAA,EAAwB,MAE3E,IAAIC,EAAiB/B,EAAME,SAAS8B,OAChCC,EAAkBJ,EAAGK,eACzB,GAAuB,MAAnBD,EACF,KAAM,gCAERJ,EAAGM,WAAWN,EAAGO,aAAcH,GAC/BJ,EAAGQ,WAAWR,EAAGO,aAAc,IAAInO,aAAa8N,GAAiBF,EAAGS,aAGpE,IAAIC,EAAgBvC,EAAMO,UAAUyB,OAChCQ,EAAiBX,EAAGK,eACxB,GAAsB,MAAlBM,EACF,KAAM,gCAERX,EAAGM,WAAWN,EAAGY,qBAAsBD,GACvCX,EAAGQ,WAAWR,EAAGY,qBAAsB,IAAIC,YAAYH,GAAgBV,EAAGS,aAE1EK,KAAKV,gBAAkBA,EACvBU,KAAKH,eAAiBA,EACtBG,KAAKC,mBAAqBL,EAAcnI,OACxCuI,KAAK3C,MAAQA,EACb2C,KAAKb,gBAAkBA,EAkB3B,OAfE,YAAAe,UAAA,SAAU1C,GACR,GACEwC,KAAKb,gBL2sBJ,SAAyBvN,EAAK4L,GAiBnC,OAhBA5L,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,GAAK,EACTA,EAAI,IAAM,EACVA,EAAI,IAAM,EACVA,EAAI,IAAM4L,EAAE,GACZ5L,EAAI,IAAM4L,EAAE,GACZ5L,EAAI,IAAM4L,EAAE,GACZ5L,EAAI,IAAM,EACHA,EK3tBH,CAAqB,KAAe4L,GACpCwC,KAAKb,kBAIT,YAAA1F,OAAA,SAAO0G,ILspBF,SAAiBvO,EAAKE,EAAGuE,GAC9B,IAAIsD,EAAIlI,KAAKyD,IAAImB,GACbjC,EAAI3C,KAAKwD,IAAIoB,GACbmC,EAAM1G,EAAE,GACR2G,EAAM3G,EAAE,GACR4G,EAAM5G,EAAE,GACR6G,EAAM7G,EAAE,GACR8G,EAAM9G,EAAE,GACR+G,EAAM/G,EAAE,GACRgH,EAAMhH,EAAE,GACRiH,EAAMjH,EAAE,GAERA,IAAMF,IAERA,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,KAIdF,EAAI,GAAK4G,EAAMpE,EAAIwE,EAAMe,EACzB/H,EAAI,GAAK6G,EAAMrE,EAAIyE,EAAMc,EACzB/H,EAAI,GAAK8G,EAAMtE,EAAI0E,EAAMa,EACzB/H,EAAI,GAAK+G,EAAMvE,EAAI2E,EAAMY,EACzB/H,EAAI,GAAKgH,EAAMxE,EAAIoE,EAAMmB,EACzB/H,EAAI,GAAKiH,EAAMzE,EAAIqE,EAAMkB,EACzB/H,EAAI,GAAKkH,EAAM1E,EAAIsE,EAAMiB,EACzB/H,EAAI,GAAKmH,EAAM3E,EAAIuE,EAAMgB,EKrrBvB,CAAaqG,KAAKb,gBAAiBa,KAAKb,gBAAiBgB,IAG3D,YAAAC,IAAA,WACE,OLy+BG,SAAwBxO,EAAKyO,GAIlC,OAHAzO,EAAI,GAAKyO,EAAI,IACbzO,EAAI,GAAKyO,EAAI,IACbzO,EAAI,GAAKyO,EAAI,IACNzO,EK7+BE,CAAoB,IAAeoO,KAAKb,kBAEnD,EArDA,GAuDMmB,GAAoB,CAAC,cACrBC,GAAkB,CACtB,oBACA,wBACA,mBACA,UACA,aACA,UACA,OAEA,oBACA,oBACA,qBACA,mBA2CK,SAASC,GAAatB,G,YAC3BA,EAAGuB,aAAa,4BAEhB,IAmBIC,EAAUxB,EAAGyB,aAAazB,EAAG0B,eACjC,GAAe,MAAXF,EACF,KAAM,gCAIR,GAFAxB,EAAG2B,aAAaH,EAvBE,gWAwBlBxB,EAAG4B,cAAcJ,IACZxB,EAAG6B,mBAAmBL,EAASxB,EAAG8B,gBACrC,KAAM,uCAAyC9B,EAAG+B,iBAAiBP,GAGrE,IAAIQ,EAAc,8GArJY,EA0JD,sCAxJN,IAyJWC,QAAQ,IAAG,oCAxJxB,IAyJSA,QAAQ,IAAG,0CACblC,GAAU,GAAE,aAAKA,GAAU,GAAE,aAAKA,GAAU,GAAE,ogDAiEtEmC,EAAUlC,EAAGyB,aAAazB,EAAGmC,iBACjC,GAAe,MAAXD,EACF,KAAM,gCAIR,GAFAlC,EAAG2B,aAAaO,EAASF,GACzBhC,EAAG4B,cAAcM,IACZlC,EAAG6B,mBAAmBK,EAASlC,EAAG8B,gBACrC,KAAM,yCAA2C9B,EAAG+B,iBAAiBG,GAIvE,IAAIE,EAAgBpC,EAAGqC,gBACvB,GAAqB,MAAjBD,EACF,KAAM,iCAMR,GAJApC,EAAGsC,aAAaF,EAAeF,GAC/BlC,EAAGsC,aAAaF,EAAeZ,GAC/BxB,EAAGuC,YAAYH,IAEVpC,EAAGwC,oBAAoBJ,EAAepC,EAAGyC,aAC5C,KAAM,wCAA0CzC,EAAG0C,kBAAkBN,GAGvEpC,EAAG2C,WAAWP,GAEd,IAAIQ,EAAmB,CACrBC,QAAS,GACTC,SAAU,I,IAGZ,IAAmB,SAAA1B,IAAiB,8BAAE,CAAjC,IAAM,EAAI,QACT2B,EAAS/C,EAAGgD,kBAAkBZ,EAAe,GACjD,IAAe,GAAXW,EACF,KAAM,4BAAqB,GAE7B/C,EAAGiD,wBAAwBF,GAC3BH,EAAiBC,QAAQ,GAAQE,G,qGAGnC,IAAmB,SAAA1B,IAAe,8BAAE,CAA/B,IAAM,EAAI,QACT6B,EAAUlD,EAAGmD,mBAAmBf,EAAe,GACnDQ,EAAiBE,SAAS,GAAQI,G,iGAGpC,OAAON,EAUF,SAASQ,GACdpD,EACAqD,EACAC,EACAC,EACAC,EACAC,EACAC,G,YAIYC,MAARD,IACFA,EAAO,CAAEE,KAAK,IAIhB5D,EAAG6D,MAAM7D,EAAG8D,iBAAmB9D,EAAG+D,kBAclC,IAAIC,EAAsB,GACtBC,EAAoB,E,IACxB,IAAqB,SAAAZ,GAAM,8BAAE,CAAxB,IAAIa,EAAQ,QACfF,EAAUG,KAAI,MAAdH,EAAS,SAASE,IAAQ,IAC1BD,GAAa,G,iGAiBf,SAASG,EAAW1S,GAjCpB,IAAsB2S,EAAqBtB,EAArBsB,EAkCP3S,EAAI0O,gBAlCwB2C,EAkCPS,EAAWX,QAAQyB,WAjCrDtE,EAAGM,WAAWN,EAAGO,aAAc8D,GAC/BrE,EAAGuE,oBACDxB,EA+B+D,EA7B/D/C,EAAGwE,OACH,EACA,EACA,GA4BFxE,EAAGyE,iBAAiBjB,EAAWV,SAAS4B,kBAAkB,EAAOhT,EAAIuO,iBAErE,IAAIxB,EAAW/M,EAAIyM,MAAMM,SACzBuB,EAAG2E,WAAWnB,EAAWV,SAAS,qBAAsBrE,EAASK,SACjEkB,EAAG2E,WAAWnB,EAAWV,SAAS,qBAAsBrE,EAASM,SACjEiB,EAAG2E,WAAWnB,EAAWV,SAAS,sBAAuBrE,EAASO,UAClEgB,EAAG4E,UAAUpB,EAAWV,SAAS,mBAAoBrE,EAASQ,GAE9De,EAAGM,WAAWN,EAAGY,qBAAsBlP,EAAIiP,gBAC3CX,EAAG6E,aAAa7E,EAAG8E,UAAWpT,EAAIqP,mBAAoBf,EAAG+E,eAAgB,GA3B3E/E,EAAG2E,WAAWnB,EAAWV,SAASkC,QAAShB,GAC3ChE,EAAGiF,UAAUzB,EAAWV,SAASoC,WAAYjB,GAE7CjE,EAAGiF,UAAUzB,EAAWV,SAASqC,KAAMzB,EAAKE,IAAM,EAAI,GAGtD5D,EAAG2E,WAAWnB,EAAWV,SAASsC,QAAS3B,EAAO9G,KAElDqD,EAAGyE,iBAAiBjB,EAAWV,SAASuC,mBAAmB,EAAO5B,EAAO6B,kBACzEtF,EAAGyE,iBACDjB,EAAWV,SAASyC,uBACpB,EACA9B,EAAO+B,sBAmBTxF,EAAGyF,OAAOzF,EAAG0F,YACb,IAAIC,EAAatT,MAAMuT,KAAKtC,G,IAC5B,IAAkB,SAAAqC,GAAU,8BAC1BvB,EADY,S,iGAIdpE,EAAG6F,QAAQ7F,EAAG0F,YACQrT,MAAMuT,KAAKrC,GACjBxK,QAAQqL,GCpW1B,kBAKE,WAAY0B,EAAuBC,GACjCjF,KAAKgF,QAAUA,EACfhF,KAAKkF,aAAeD,EACpBjF,KAAKmF,YAAcF,EAsBvB,OAnBE,YAAAG,MAAA,WACEpF,KAAKmF,YAAcnF,KAAKkF,cAG1B,YAAA7S,IAAA,WACE2N,KAAKmF,WAAanF,KAAKgF,WAGzB,YAAAK,MAAA,WACE,OAAOrF,KAAKgF,UAAYhF,KAAKmF,YAAcnF,KAAKkF,cAGlD,YAAAI,IAAA,SAAI7J,GACF,IAAI8J,EAAMvF,KAAKgF,UACXO,EAAMvF,KAAKmF,YAAcnF,KAAKkF,eAChCzJ,IACAuE,KAAKmF,WAAaI,IAGxB,EA9BA,GAgCA,cAGE,aACEvF,KAAKwF,QAAU,IAAIC,IAWvB,OARE,YAAAC,SAAA,sBACEC,SAASC,iBAAiB,WAAW,SAACC,GACpC,EAAKL,QAAQlT,IAAIuT,EAAEC,SAErBH,SAASC,iBAAiB,SAAS,SAACC,GAClC,EAAKL,QAAQO,OAAOF,EAAEC,UAG5B,EAfA,G,mzDClBA,SAAS,GAAME,EAAYC,GACzB,OAAQA,EAAKD,GAAMvU,KAAKC,SAAWsU,EAGrC,SAASE,GAAM/H,EAAWgI,GACxB,OAAO1U,KAAKoB,IAAIsT,EAAM,GAAI1U,KAAKqB,IAAIqT,EAAM,GAAIhI,IAO/C,SAASiI,GAAQjG,GACf,OAAOA,GAAQ1O,KAAKsD,GAAK,KAI3B,SAASsR,GAAUC,EAAiBC,GAClC,OAAOC,GAAeF,EAAW,CAAC,EAAGC,IAIvC,SAASC,GAAeF,EAAiBG,GAEvC,IAAIC,EAAgB,EAAgBJ,EAAU,GAAK,EAAGA,EAAU,GAAIA,EAAU,IAC1E7U,KAAK6F,IAAIoP,EAAc,IAAM,MAC/BA,EAAgB,EAAgBJ,EAAU,GAAIA,EAAU,GAAK,EAAGA,EAAU,KAE5E,EAAWI,EAAeJ,EAAWI,GACrC,EAAeA,EAAeA,GAG9B,IAAIC,EAAS,EAAU,IAAeL,GAClCM,EAAW,GAAkB,KAAe,GAAK,sBAAIH,IAAW,IAAAC,GAChEG,EAAc,GAAkB,KAAe,GAAM,EAAG,EAAIpV,KAAKsD,IAAKuR,GAI1E,OAHA,EAAmBK,EAAQA,EAAQC,GACnC,EAAmBD,EAAQA,EAAQE,GAE5BF,EAGT,IAGMG,GAAqB,EAAI,GAQzBC,GAAuC,CAC3C,CAAC,IAAK,KACN,CAAC,GAAK,KAEFC,GAAwC,CAAC,EAAG,GAC5CC,GAAuC,CAAC,IAAK,IAC7CC,GAAiC,CAAC,KAAO,IACzCC,GAA8B,CAAC,IAAM,KACrCC,GAAyC,CAAC,GAAI,IAG9CC,GAA6BjB,GAAQ,KACrCkB,GAAgClB,GAAQ,IAKxCmB,GAAoC,CAAC,GAAI,IAKzCC,GAAuB,CAACpB,GAAQ,KAAMA,GAAQ,KAG9CqB,GAAmC,EAAE,EAAI,EAAG,EAAI,IAChDC,GAA0B,CAAC,GAAI,IAU/BC,GAA0BvB,GAAQ,IAUlCwB,GAA6BnW,KAAKsB,MAAM8U,IAMxCC,GAAuC,KAMvCC,GAAoC,CAAC3B,GAAQ,GAAIA,GAAQ,KACzD4B,GAAkC5B,GAAQ,KAE1C6B,GAA6B,CAAC,IAAM,IAEpCC,GAAsB,IAa5B,SAASC,GAAaC,GAGpB,MAAO,CAFG3W,KAAKsB,MAAM,GAAUqV,EAAQA,EAAQ,EAAIA,GACvC3W,KAAKsB,MAAO,EAAI,EAAKqV,EAAQA,EAAQ,EAAIA,EAAQ,IAK/D,IAAMC,GAAgC,IAAIC,MAAM,eAC1CC,GAA0B,IAAID,MAAM,aAG1CC,GAAMC,OAASC,IACfF,GAAMG,MAAO,EAQb,IA0PKC,GA1PL,cAKE,WAAYxX,EAAeyX,GACzB5I,KAAK6I,KAAO1X,EACZ6O,KAAK8I,QAAU3X,EACf6O,KAAK4I,WAAaA,EActB,OAXE,YAAAvW,IAAA,SAAIlB,GACF6O,KAAK6I,KAAO1X,GAGd,YAAAR,IAAA,WACE,OAAOqP,KAAK8I,SAGd,YAAAC,KAAA,WACE/I,KAAK8I,SAAW5C,GAAMlG,KAAK6I,KAAO7I,KAAK8I,QAAS9I,KAAK4I,aAEzD,EAtBA,GAyBA,cAmBE,WAAY1J,GACVc,KAAKgJ,SAAW,IAChBhJ,KAAKpP,IAAM,IAAIqY,GAAY/J,EAAI,IAC/Bc,KAAKkJ,MAAQ,IAAID,GAAY/J,EAAI,IACjCc,KAAKmJ,YAAc,IAAIF,GAAY/J,EAAI,IAEvCc,KAAKmJ,YAAYhK,gBAAkBa,KAAKkJ,MAAM/J,gBAC9Ca,KAAKoJ,QAAU,IAAIH,GAAY/J,EAAI,IAEnCc,KAAKoJ,QAAQjK,gBAAkBa,KAAKpP,IAAIuO,gBAExCa,KAAKqJ,UAAYC,OAAOC,kBACxBvJ,KAAKwJ,SAAW,IAAIC,GAAM,EAAGhC,IAE7BzH,KAAK0J,cAAgB,KAErB1J,KAAKjE,GAAK,EAAgB,EAAG,GAAI,GACjCiE,KAAK2J,QAAU,EAAgB,EAAG,EAAG,GACrC3J,KAAK4J,MAAQ,GAAiB,EAAG,EAAG,GAEpC5J,KAAK6J,YAAc,IAAIvB,MAAM,gBAC7BtI,KAAK6J,YAAYnB,MAAO,EAqG5B,OAlGG,YAAAlG,QAAD,W,mDACE,SAAMxC,KAAKpP,K,cAAX,SACIoP,KAAKwJ,SAAS7Y,MAAQ,EACxB,GAAMqP,KAAKkJ,OADT,M,OAEF,OADA,SACA,GAAMlJ,KAAKmJ,a,OAAX,S,gCAIJ,YAAAW,YAAA,SAAYC,GACI,GAAVA,GACF/J,KAAK6J,YAAYG,OAEnBhK,KAAKwJ,SAASnX,IAAI0X,IAGpB,YAAAE,QAAA,SAAQ9J,GACNH,KAAKvG,OAAO0G,EAAMH,KAAK4J,QAGzB,YAAAM,QAAA,SAAQ/J,GACNH,KAAKvG,OAAO0G,EAAMH,KAAKjE,KAGzB,YAAAoO,UAAA,SAAUhK,GACRH,KAAKvG,OAAO0G,EAAMH,KAAK2J,UAGjB,YAAAlQ,OAAR,SAAe0G,EAAciK,GAC3B,IAAIC,EAAe,GAAkB,KAAeD,EAAYjK,GAChE,GAAcH,KAAK0J,cAAe1J,KAAK0J,cAAeW,IAGxD,YAAAC,gBAAA,sBACE,OAAO,QAAiC,SAAC9M,GACvC,SAAmB,IAAeA,EAAG,EAAK5M,IAAIuO,qBAKlD,YAAAoL,QAAA,SAAQC,GACN,KAAIA,EAAKR,KAAKS,MAAQzK,KAAKqJ,WA/JQ,IA+JnC,CAIArJ,KAAKqJ,UAAYmB,EAAKR,KAAKS,MAC3B,IAAIC,EAAwBrC,GAAYsC,YAExCD,EAAIlC,OAASoC,IACbF,EAAIV,OAEJ,IAAIa,EAAkB,IACtB,EAAiBA,EAAiB7K,KAAKgJ,SAAUhJ,KAAK2J,QA3K5B,GA4K1B,IAAI/Y,EAAM,IAAIqY,GAAYuB,EAAKtL,GAAI,KPuLhC,SAAmBtN,EAAKE,EAAG0L,GAChC,IAGIhF,EAAKC,EAAKC,EAAKC,EACfC,EAAKC,EAAKC,EAAKC,EACfC,EAAKC,EAAKC,EAAKC,EALfpH,EAAIyL,EAAE,GACNxL,EAAIwL,EAAE,GACNvL,EAAIuL,EAAE,GAKN1L,IAAMF,GACRA,EAAI,IAAME,EAAE,GAAKC,EAAID,EAAE,GAAKE,EAAIF,EAAE,GAAKG,EAAIH,EAAE,IAC7CF,EAAI,IAAME,EAAE,GAAKC,EAAID,EAAE,GAAKE,EAAIF,EAAE,GAAKG,EAAIH,EAAE,IAC7CF,EAAI,IAAME,EAAE,GAAKC,EAAID,EAAE,GAAKE,EAAIF,EAAE,IAAMG,EAAIH,EAAE,IAC9CF,EAAI,IAAME,EAAE,GAAKC,EAAID,EAAE,GAAKE,EAAIF,EAAE,IAAMG,EAAIH,EAAE,MAE9C0G,EAAM1G,EAAE,GACR2G,EAAM3G,EAAE,GACR4G,EAAM5G,EAAE,GACR6G,EAAM7G,EAAE,GACR8G,EAAM9G,EAAE,GACR+G,EAAM/G,EAAE,GACRgH,EAAMhH,EAAE,GACRiH,EAAMjH,EAAE,GACRkH,EAAMlH,EAAE,GACRmH,EAAMnH,EAAE,GACRoH,EAAMpH,EAAE,IACRqH,EAAMrH,EAAE,IACRF,EAAI,GAAK4G,EACT5G,EAAI,GAAK6G,EACT7G,EAAI,GAAK8G,EACT9G,EAAI,GAAK+G,EACT/G,EAAI,GAAKgH,EACThH,EAAI,GAAKiH,EACTjH,EAAI,GAAKkH,EACTlH,EAAI,GAAKmH,EACTnH,EAAI,GAAKoH,EACTpH,EAAI,GAAKqH,EACTrH,EAAI,IAAMsH,EACVtH,EAAI,IAAMuH,EACVvH,EAAI,IAAM4G,EAAMzG,EAAI6G,EAAM5G,EAAIgH,EAAM/G,EAAIH,EAAE,IAC1CF,EAAI,IAAM6G,EAAM1G,EAAI8G,EAAM7G,EAAIiH,EAAMhH,EAAIH,EAAE,IAC1CF,EAAI,IAAM8G,EAAM3G,EAAI+G,EAAM9G,EAAIkH,EAAMjH,EAAIH,EAAE,IAC1CF,EAAI,IAAM+G,EAAM5G,EAAIgH,EAAM/G,EAAImH,EAAMlH,EAAIH,EAAE,KO7N1C,CAAelB,EAAIuO,gBAAiBvO,EAAIuO,gBAAiB,IACzD,GAAcvO,EAAIuO,gBAAiBa,KAAKpP,IAAIuO,gBAAiBvO,EAAIuO,iBAEjEqL,EAAKR,KAAKc,SAASzH,KAAK,CACtB0H,MAAOP,EAAKR,KAAKS,MACjBzB,SAAU6B,EACVja,IAAKA,MAIT,YAAAiL,IAAA,WACE,IAAIA,EAAMmE,KAAKpP,IAAIwP,MAGnB,OAFA,EAAiBvE,EAAKA,EAAKmE,KAAK2J,SAAU,KAC1C,EAAiB9N,EAAKA,EAAKmE,KAAKjE,GAAI,IAC7BF,GAGT,YAAA8G,OAAA,SAAOqI,GACL,IAzRiB5K,EAAa+F,EAyR1BtK,EAAMmE,KAAKnE,MACX2N,EAAWxJ,KAAKwJ,SAAS7Y,MACzBsa,GA3Ra7K,EA2RKoJ,EAAWA,IA3RHrD,EA2RauB,IA1R1B,IAAM,EAAItH,GAAO+F,EAAM,GA2SxC,OAhBA,EAAUtK,EAAKmP,EAASnP,EArNa,IAqO9B,CACLA,IAAKA,EACL2I,iBAhBqB,GACrB,KACA3I,EACA,EAAS,IAAeA,EAAKmE,KAAK2J,SAClC3J,KAAKjE,IAaL2I,qBAXyB,GACzB,KACA0B,GAAQ6E,GACRC,GAAOC,MAAQD,GAAOE,OACtBtE,GAnQwB,MA6Q9B,EA7IA,GA+IA,cAQE,WACE5H,EACAmM,EACArC,EACAsC,GAGA,IAAIC,EAAaxE,GAAsBsE,GACnCG,EACK3I,MAAPyI,EACI7Z,KAAKoB,IAAI0Y,EAAW,GAAI9Z,KAAKqB,IAAIyY,EAAW,GAAID,EAAIE,SACpD,GAAK,sBAAID,IAAU,IAErB,KH/GD,SAAwBC,G,QACzBC,EAAaD,GAAU,EAAI/Z,KAAKgC,KAAK,IAYrCiY,EAXW,CACb,CAAC,EAAG,EAAG,GACP,CAACD,EAAY,EAAG,GAChB,CAACA,EAAY,EAAGA,GAChB,CAAC,EAAG,EAAGA,GACP,CAAC,EAAGA,EAAY,GAChB,CAACA,EAAYA,EAAY,GACzB,CAACA,EAAYA,EAAYA,GACzB,CAAC,EAAGA,EAAYA,IAGgBjN,KAAI,SAAChB,GACrC,IAAImO,EAAO,EAAY,KAAwBF,EAAa,EAAhB,GA1B3Bha,KAAKC,SA0BsB,GAC5C,MAAO,CAAC8L,EAAE,GAAKmO,EAAK,GAAInO,EAAE,GAAKmO,EAAK,GAAInO,EAAE,GAAKmO,EAAK,OAGlDC,EAAW9P,GAAO,CAEpB6B,SAAUkO,KAAKC,MAAMD,KAAKE,UAAU/M,KACpCzB,SAAUmO,EACV9N,UAAW,CACT,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,GACP,CAAC,EAAG,EAAG,MAIPoO,EAAY,E,IAChB,IAAgB,SAAAJ,EAASrO,UAAQ,8BAAE,CAA9B,IAAMC,EAAC,QACVwO,GAAava,KAAKS,MAAK,MAAVT,KAAI,SAAU+L,IAAC,K,iGAI9B,MAAO,CAFPwO,GAAaJ,EAASrO,SAAS9F,OAEZmU,GGmEW,CAAsBJ,GAAO,GAApDS,EAAY,KAAE5O,EAAK,KAMxB,GALA2C,KAAKpP,IAAM,IAAIqY,GAAY/J,EAAI7B,GAC/B2C,KAAKwL,OAASS,EACdjM,KAAKqL,KAAOA,EACZrL,KAAKkM,OAASlF,GAAsBqE,GACpCrL,KAAKgJ,SAAWA,EACLnG,MAAPyI,EAAkB,CACpB,IAAInL,EAAO,GAAK,sBAAI+G,KAAuB,IACvCiF,EAAe,EAAY,KAC/BnM,KAAKoM,SAAW,GAAkB,KAAeD,EAAchM,QAE/DH,KAAKoM,SAAWd,EAAIc,SAsC1B,OAlCE,YAAAC,MAAA,SAAMnN,GACJ,IAAIoH,EAAY,EAAY,KACxBgG,EAAQ,GAAK,sBAAInF,KAAoB,IAErCoF,EAAe,EAAiB,IAAevM,KAAKgJ,SAAU1C,EAAWgG,GACzEE,EAAO,IAAIC,EAASvN,EAAIc,KAAKqL,KAAO,EAAGkB,EAAc,CACvDf,OAAQxL,KAAKwL,OAAS,EACtBY,SAAU,GAAWpM,KAAKoM,YAExBhM,EAAMJ,KAAKpP,IAAIwP,MACnBoM,EAAK5b,IAAIsP,UAAUE,GACnB,IAAIsM,EAAgB,EAAiB,IAAe1M,KAAKgJ,SAAU1C,GAAYgG,GAC3E1C,EAAQ,IAAI6C,EAASvN,EAAIc,KAAKqL,KAAO,EAAGqB,EAAe,CACzDlB,OAAQxL,KAAKwL,OAAS,EACtBY,SAAU,GAAWpM,KAAKoM,YAI5B,OAFAxC,EAAMhZ,IAAIsP,UAAUE,GAEb,CAACoM,EAAM5C,IAGhB,YAAA+C,OAAA,WACE3M,KAAKkM,QAAU,EAIf,IAFA,IAAIvO,EAAWqC,KAAKpP,IAAIyM,MAAMM,SAC1BiP,EAAgB5M,KAAKkM,OAASlF,GAAsBhH,KAAKqL,MACpD9T,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAIsV,EACF,GAAsBtV,GAAKqV,EAC3B,GAA8BrV,IAAM,EAAIqV,GAC1CjP,EAASK,QAAQzG,GHrKwB,GGqKnBsV,EACtBlP,EAASM,QAAQ1G,GHrKwB,EGqKnBsV,IAG5B,EAtEA,GAyEA,SAASC,GAAYC,EAAkBC,GACrC,IAAIlR,EAASiR,EAAI3M,MACjB,MAAO,CAAC,EAAG,EAAG,GAAG6M,OACf,SAAC1V,GACC,OAAAuE,EAAOvE,GAAK,GAA8ByV,EAAMzV,IAChDyV,EAAMzV,IAAMuE,EAAOvE,GAAK,KA4H9B,SAAU2V,GAAa1C,G,0FACF,KAAAA,EAAKR,KAAKmD,iBAAe,W,sCAAjC9B,EAAI,QACb,MAAOA,K,OAAP,S,gNAgBJ,SAAU+B,GAAY5C,G,yFACpB,YAAOA,EAAKR,KAAKqD,KAAK7K,Y,UAAtB,UACIgI,EAAK8C,QAAQC,mBAAb,Y,wCACc,KAAA/C,EAAKR,KAAKqD,KAAK/C,mBAAiB,W,sCAArC9M,EAAC,SACN5M,EAAM,IAAIqY,GAAYuB,EAAKtL,GAAI,KAC/BgB,UAAU1C,GACd,GAAM5M,I,OAAN,S,4NAGY,KAAA4Z,EAAKR,KAAKc,UAAQ,W,wCAChC,GADU,QACFla,K,QAAR,S,sOAEc,KAAAsc,GAAa1C,IAAK,W,wCAChC,GADU,QACF5Z,K,QAAR,S,2MAEF,YAAO4Z,EAAKR,KAAKwD,O,eAAjB,S,QAGF,SAAUC,GAAiBjD,G,mDACzB,SAAMA,EAAKR,KAAKqD,KAAKjE,S,cAArB,S,QAGF,SAAUsE,GAAWlD,G,wFACD,KAAAA,EAAKR,KAAKwD,MAAI,W,qCAC9B,GADY,QACFpN,O,OAAV,S,gNAkBJ,SAASuN,GAAkBnD,GACrBA,EAAKoD,MAAQjF,GAASkF,KACxBC,uBAAsB,WAAM,OA2tBhC,SAAkBtD,G,SA1XlB,SAA8BA,G,QACxBuD,EAA0B,G,IAC9B,IAAqC,SAAAvD,EAAKwD,KAAKC,UAAUC,WAAS,8BAAE,CAAzD,oBAACC,EAAU,KAAEvC,EAAQ,KAC1B,EAAcpB,EAAKwD,KAAKrL,OAAO9G,IAAK+P,EAAShb,IAAIwP,OA93BxBgO,IA+3B3BL,EAAc1K,KAAK8K,I,iGAGvB,IAAK,IAAI5W,EAAIwW,EAActW,OAAS,EAAGF,GAAK,EAAGA,IAC7CiT,EAAKwD,KAAKC,UAAUI,OAAON,EAAcxW,GAAI,IAmX/C+W,CAAqB9D,GA5YvB,SAA4BA,GAE1B,IADA,IAAI7H,EAAS6H,EAAKwD,KAAKrL,OAChB6H,EAAKwD,KAAKC,UAAUxW,OA1yBM,IA0yBuB,CACtD,IAAI2I,EAAMiG,GAAU1D,EAAOgH,QAAS3B,IAEhCgB,EAAWxC,GAAe,EAAW,IAAepG,GAAM,GAAI2H,IAClE,EAAiB3H,EAAKuC,EAAO9G,IAAKuE,EAj3BP,IAk3B3B,EAAW4I,EAAUA,EAAU,GAAK,sBAAIf,KAAmB,KAE3D,IAAI2D,EAAW,IAAIa,GAASjC,EAAKtL,GAAI,EAAG8J,GACxC4C,EAAS5C,SAAWA,EACpB4C,EAAShb,IAAIsP,UAAUE,GACvBoK,EAAKwD,KAAKC,UAAU5K,KAAKuI,IAiY3B2C,CAAmB/D,G,IAEnB,IAAuB,SAAAA,EAAKwD,KAAKC,WAAS,8BAAE,CAAvC,IAAMrC,EAAQ,QACjBA,EAAShb,IAAIsP,UAAU0L,EAAS5C,UAChC,IAAIwF,EAAY,GAAc,KAAe5C,EAASQ,UACtD,GAAcR,EAAShb,IAAIuO,gBAAiByM,EAAShb,IAAIuO,gBAAiBqP,I,iGAGxEhE,EAAKiE,OAAOC,SAASlJ,QAAQmJ,IAAI,SACnCnE,EAAKwD,KAAKY,kBAAkBtJ,KAAI,WAC1BkF,EAAKwD,KAAKa,cACZlJ,SAASmJ,kBACTtE,EAAKwD,KAAKa,cAAe,IAEzB3D,GAAO6D,qBACPvE,EAAKwD,KAAKa,cAAe,MAK3BrE,EAAKwD,KAAKa,cACZG,GAAmBxE,EAAKiE,OAAOC,SAAUlE,EAAKwD,KAAKrL,QAGrDL,GACEkI,EAAKtL,GA/vBT,SAAqBsL,G,wFACD,KAAAA,EAAKwD,KAAKR,MAAI,W,qCAC9B,GADY,QACFpN,O,OAAV,S,gNA8vBA6O,CAAWzE,GAvwBf,SAAsBA,G,wFACJ,KAAAA,EAAKwD,KAAKC,WAAS,W,qCACjC,GADU,QACFrd,K,OAAR,S,kMAEF,YAAO4Z,EAAKwD,KAAKR,O,cAAjB,S,QAowBE0B,CAAY1E,GACZ,GACAA,EAAK9H,WACL8H,EAAKwD,KAAKrL,QAGZgL,GAAkBnD,GA9vBY2E,CAAS3E,MAC5BA,EAAKoD,MAAQjF,GAASyG,MAC/BtB,uBAAsB,WAAM,OA+vBhC,SAAmBtD,GACbA,EAAKiE,OAAOC,SAASlJ,QAAQmJ,IAAI,SACnCnE,EAAKiE,OAAOY,eAAe/J,KAAI,WAAM,OAAAgK,GAAY9E,MAGnDlI,GACEkI,EAAKtL,GACLwO,GAAWlD,GACX4C,GAAY5C,GACZiD,GAAiBjD,GACjBA,EAAK9H,WACL8H,EAAKR,KAAKrH,QAGZgL,GAAkBnD,GA7wBY+E,CAAU/E,MAC7BA,EAAKoD,MAAQjF,GAAS6G,KAC/B1B,uBAAsB,WAAM,OA8wBhC,SAAkBtD,IAvnBlB,SAAwBA,GACtB,GAAiC,MAA7BA,EAAKR,KAAKyF,gBAAyB,CAErC,GAAIjF,EAAKR,KAAKS,MAAQD,EAAKR,KAAKyF,gBAlrBH,GAmrB3B,OAEAC,GAASlF,EAAMA,EAAKR,KAAK5B,MAAQ,GAIjCoC,EAAKR,KAAK7B,aAAa8E,OAAM,SAAC9O,GAAM,OAAK,GAALA,OACtCqM,EAAKR,KAAKyF,gBAAkBjF,EAAKR,KAAKS,QA6mBxCkF,CAAenF,GA1gBjB,SAAwBA,GACtB,IAAIkE,EAAWlE,EAAKiE,OAAOC,SAEvBlE,EAAKiE,OAAOmB,WACdpF,EAAKR,KAAKqD,KAAK9C,QAAQC,GAGrBkE,EAASlJ,QAAQmJ,IAAI,SACvBnE,EAAKiE,OAAOY,eAAe/J,KAAI,WAAM,OAAAuK,GAAUrF,MAG7CkE,EAASlJ,QAAQmJ,IAAI,SACvBnE,EAAKR,KAAKqD,KAAKlD,UAAUxC,IAEvB+G,EAASlJ,QAAQmJ,IAAI,SACvBnE,EAAKR,KAAKqD,KAAKlD,WAAWxC,IAGxB+G,EAASlJ,QAAQmJ,IAAI,QACvBnE,EAAKR,KAAKqD,KAAKvD,YAAY,GAE3BU,EAAKR,KAAKqD,KAAKvD,YAAY,GAGzB4E,EAASlJ,QAAQmJ,IAAI,UACvBnE,EAAKR,KAAKqD,KAAK9C,QAAQC,GAmfzBsF,CAAetF,GA/ejB,SAAuBA,GACrB,IAAIuF,EAAUC,UAAUC,cAAczF,EAAKiE,OAAOsB,SAClD,GAAe,MAAXA,EAAJ,CAWAvF,EAAKR,KAAKqD,KAAKpD,QAhyBuB,KAgyBW8F,EAAQG,KAPtC,IAQnB1F,EAAKR,KAAKqD,KAAKnD,SAAQ,KAA2B6F,EAAQG,KAPzC,IAQjB1F,EAAKR,KAAKqD,KAAKlD,UAlyBuB,KAkyBa4F,EAAQG,KAPzC,IAQlB1F,EAAKR,KAAKqD,KAAKvD,YAAYiG,EAAQI,QAPV,GAOoChf,QACzD4e,EAAQI,QANK,GAMa3K,SAAWuK,EAAQI,QAPhC,GAOkD3K,UACjEgF,EAAKR,KAAKqD,KAAK9C,QAAQC,GAGzB4F,QAAQC,IAAIN,IA2dZO,CAAc9F,GApZhB,SAAqBA,G,QACf+F,EAAqB,G,IACzB,IAA2B,SAAA/F,EAAKR,KAAKwD,KAAKU,WAAS,8BAAE,CAA1C,oBAACsC,EAAK,KAAEzD,EAAG,KAChB,EAAcvC,EAAKR,KAAKqD,KAAKzc,IAAIwP,MAAO2M,EAAI3M,OA/5BnBgO,IAg6B3BmC,EAASlN,KAAKmN,I,iGAGlB,IAAK,IAAIjZ,EAAIgZ,EAAS9Y,OAAS,EAAGF,GAAK,EAAGA,IACxCiT,EAAKR,KAAKwD,KAAKa,OAAOkC,EAAShZ,GAAI,GA+YrCkZ,CAAYjG,GA3Yd,SAA0BA,G,gBACpBuD,EAAkC,CAAC,GAAI,I,IAC3C,IAAgC,SAAAvD,EAAKR,KAAKmD,gBAAgBe,WAAS,8BAAE,CAA1D,oBAAC7C,EAAI,KAAE4C,EAAS,K,IACzB,IAAqC,mBAAAA,EAAUC,YAAS,8BAAE,CAA/C,oBAACC,EAAU,KAAEvC,EAAQ,KAC1B,EAAcpB,EAAKR,KAAKqD,KAAKzc,IAAIwP,MAAOwL,EAAShb,IAAIwP,OA56B9BgO,IA66BzBL,EAAc1C,GAAMhI,KAAK8K,I,wMAI/B,IAA2B,SAAAJ,EAAcG,WAAS,8BAChD,IADS,oBAAOwC,GAANrF,EAAI,KAAM,MACX9T,EAAImZ,EAAKjZ,OAAS,EAAGF,GAAK,EAAGA,IACpCiT,EAAKR,KAAKmD,gBAAgB9B,GAAMgD,OAAOqC,EAAKnZ,GAAI,G,kGAiYpDoZ,CAAiBnG,GA5XnB,SAAyBA,GAEvB,KACEA,EAAKR,KAAKc,SAASrT,OAAS,GAC5B+S,EAAKR,KAAKS,MAAQD,EAAKR,KAAKc,SAAS,GAAGC,MAAQnD,IAEhD4C,EAAKR,KAAKc,SAASlM,QAuXrBgS,CAAgBpG,GA7dlB,SAAmBA,GAEjB,KAAOA,EAAKR,KAAKwD,KAAK/V,OF74BQ,GE64BkB,CAC9C,IAAIsV,EAAM,IAAI9D,GAAYuB,EAAKtL,GAAI,IAC/BkB,OAAG,EAOP,EALEA,EADE,EAAYoK,EAAKR,KAAKqD,KAAKrE,UAtzBG,MAuzB1B,EAAY,KAGZxC,GADU,EAAe,IAAegE,EAAKR,KAAKqD,KAAKrE,UAC7BxB,IAEZgD,EAAKR,KAAKqD,KAAKzc,IAAIwP,MAAOA,EAp2BrB,IAq2B3B2M,EAAI7M,UAAUE,GACdoK,EAAKR,KAAKwD,KAAKnK,KAAK0J,IAmdtB8D,CAAUrG,GAhbZ,SAAwBA,GACtB,IAAK,IAAIa,EAAO,EAAGA,EAj4BU,EAi4BaA,IACxC,KAAOb,EAAKR,KAAKmD,gBAAgB9B,GAAM5T,OAAS+S,EAAKR,KAAK7B,aAAakD,IAAO,CAC5E,IAAIjL,EAAMiG,GAAUmE,EAAKR,KAAKqD,KAAK1D,QAAStC,IAExC2B,EAAW3C,GACb,EAAW,IAAemE,EAAKR,KAAKqD,KAAK1D,SAAU,GACnDrC,IAEF,EAAiBlH,EAAKoK,EAAKR,KAAKqD,KAAKzc,IAAIwP,MAAOA,EAl5BvB,IAm5BzB,EAAW4I,EAAUA,EAAU,GAAK,sBAAIwB,EAAKR,KAAK8G,gBAAa,KAE/D,IAAIlF,EAAW,IAAIa,GAASjC,EAAKtL,GAAImM,EAAMrC,GAC3C4C,EAAS5C,SAAWA,EACpB4C,EAAShb,IAAIsP,UAAUE,GACvBoK,EAAKR,KAAKmD,gBAAgB9B,GAAMhI,KAAKuI,IAkazCmF,CAAevG,GAnMjB,SAA2BA,G,YACrBwG,EAAyB,G,IAC7B,IAAkB,SAAAxG,EAAKR,KAAKwD,MAAI,8BAAE,CAA7B,IAAMT,EAAG,Q,IACZ,IAAmC,mBAAAvC,EAAKR,KAAKc,SAASoD,YAAS,8BAAE,CAAtD,oBAAC+C,EAAS,KACfnE,GAAYC,EADY,KACCnc,IAAIwP,QAC/B4Q,EAAa3N,KAAK4N,I,oMAIxB,IAAK,IAAI1Z,EAAIyZ,EAAavZ,OAAS,EAAGF,GAAK,EAAGA,IAC5CiT,EAAKR,KAAKc,SAASuD,OAAO2C,EAAazZ,GAAI,GA4L7C2Z,CAAkB1G,GA3PpB,SAAgCA,G,YAC1BwG,EAAyB,G,IAC7B,IAAuB,SAAA9D,GAAa1C,IAAK,8BAAE,CAAtC,IAAMoB,EAAQ,Q,IACjB,IAAmC,mBAAApB,EAAKR,KAAKc,SAASoD,YAAS,8BAAE,CAAtD,oBAAC+C,EAAS,KAAEE,EAAO,KAE5B,GADW,EAAcvF,EAAShb,IAAIwP,MAAO+Q,EAAQvgB,IAAIwP,QAC7CwL,EAASJ,OAAQ,CAC3BwF,EAAa3N,KAAK4N,GAClBrF,EAASe,SAET,IACIyE,EADkB,EAAI,EAAK3f,KAAKsD,GAAK,SAAA6W,EAASJ,OAAU,GAjjCnC,EAmjCrB6F,EAA4B,GAAUD,EAAe,SAAAxF,EAASJ,OAAU,GAKxE8F,EAAS,EAAc,IAAeH,EAAQvgB,IAAIwP,MAAOwL,EAAShb,IAAIwP,OACtEmR,EAAkB,EAAYD,GAClC,EAAeA,EAAQA,GACvB,IAAIE,EAAc/f,KAAK6F,IAAI,EAASga,EAAQH,EAAQnI,WAEhDyI,EAAwB,EAC1B,IACAN,EAAQnI,SACRsI,GACCE,GAIH,EACE5F,EAAS5C,SACT4C,EAAS5C,SACTsI,EAxiCmB,GAyiCYF,GAA9BI,GAGH,IAAIrF,EAAe,EAAW,IAAemF,EAAQG,GACrD,EAAetF,EAAcA,GAC7B,IAAIuF,EAAgBH,EAAkB,EAAYE,GA9iC7B,GA+iCjBE,EAAM,GACR,KACAxF,EACAuF,EAAgBL,GAElB,GAAczF,EAASQ,SAAUR,EAASQ,SAAUuF,K,oMAI1D,IAAK,IAAIpa,EAAIyZ,EAAavZ,OAAS,EAAGF,GAAK,EAAGA,IAC5CiT,EAAKR,KAAKc,SAASuD,OAAO2C,EAAazZ,GAAI,GA2M7Cqa,CAAuBpH,GA3XzB,SAA6BA,GAC3B,I,MAASa,EAAO,EAAGA,EA37BU,EA27BaA,IACxC,IAAK,IAAI9T,EAAIiT,EAAKR,KAAKmD,gBAAgB9B,GAAM5T,OAAS,EAAGF,GAAK,EAAGA,IAAK,CACpE,IAAIqU,EAAWpB,EAAKR,KAAKmD,gBAAgB9B,GAAM9T,GAC/C,GAAIqU,EAASM,QAAU,EAAG,CACxB,GAAIb,EAAO,EA/7BY,EA+7BQ,CAC7B,IAAIwG,EAAWjG,EAASS,MAAM7B,EAAKtL,KACnC,EAAAsL,EAAKR,KAAKmD,gBAAgB9B,EAAO,IAAGhI,KAAI,iBAAIwO,IAAQ,IACpDrH,EAAKR,KAAK7B,aAAakD,EAAO,IAAMwG,EAASpa,OAE/C+S,EAAKR,KAAKmD,gBAAgB9B,GAAMgD,OAAO9W,EAAG,GAC1CiT,EAAKR,KAAK7B,aAAakD,IAAS,EAChCb,EAAKR,KAAK8H,OAAS7K,GAAqBoE,GACxC0G,GAAYvH,KAiXlBwH,CAAoBxH,GA3WtB,SAAwBA,GACtB,EACEA,EAAKR,KAAKqD,KAAKrE,SACfwB,EAAKR,KAAKqD,KAAKrE,SACfwB,EAAKR,KAAKqD,KAAK1D,QAv7Ba,KAw7BVa,EAAKR,KAAKqD,KAAK7D,SAAS7Y,OAyW5CshB,CAAezH,GAjTjB,SAAkBA,GAChBA,EAAKR,KAAKqD,KAAKzc,IAAIsP,UAAUsK,EAAKR,KAAKqD,KAAKrE,UAmT5CkJ,CAAS1H,GAhTX,SAAsBA,G,YACpB,IAAsB,SAAAA,EAAKR,KAAKc,UAAQ,8BAAE,CAArC,IAAMqG,EAAO,QAChBA,EAAQvgB,IAAIsP,UAAUiR,EAAQnI,W,kGA+ShCmJ,CAAa3H,GA3Sf,SAAuBA,G,YACrB,IAAuB,SAAA0C,GAAa1C,IAAK,8BAAE,CAAtC,IAAMoB,EAAQ,QACjBA,EAAShb,IAAIsP,UAAU0L,EAAS5C,UAEhC,IAAI5I,EAAMwL,EAAShb,IAAIwP,MACvBwL,EAAShb,IAAIsP,UAAU,EAAW,IAAeE,GAAM,IACvD,IAAIuR,EAAM,GAAc,KAAe/F,EAASQ,UAChD,GAAcR,EAAShb,IAAIuO,gBAAiBwS,EAAK/F,EAAShb,IAAIuO,iBAC9DyM,EAAShb,IAAIsP,UAAUE,I,kGAoSzBgS,CAAc5H,GAImB,MAA7BA,EAAKR,KAAKyF,kBApShB,SAA6BjF,G,gBAG3B,IAAuB,SAAA0C,GAAa1C,IAAK,8BAAE,CAAtC,IAAMoB,EAAQ,Q,IAEjB,IAAgB,mBAAApB,EAAKR,KAAKqD,KAAK/C,oBAAiB,8BAAE,CAA7C,IAAM9M,EAAC,QAEN,EAAcoO,EAAShb,IAAIwP,MAAO5C,IAvhCC,IAuhCoCoO,EAASJ,QAElF6G,GAAS7H,I,qMA4Rb8H,CAAoB9H,GAtRxB,SAAwBA,G,gBACtB,IAAkB,SAAAA,EAAKR,KAAKwD,MAAI,8BAAE,CAA7B,IAAMT,EAAG,Q,IACZ,IAAgB,mBAAAvC,EAAKR,KAAKqD,KAAK/C,oBAAiB,8BAC1CwC,GAAYC,EADN,UAERsF,GAAS7H,G,qMAmRb+H,CAAe/H,IAGjBgI,GAAYhI,GA7Md,SAA0BA,GACxBA,EAAKR,KAAKrH,OAAS6H,EAAKR,KAAKqD,KAAK1K,OAAO6H,EAAKR,KAAKyI,oBACnDjI,EAAKR,KAAKyI,mBAAqBjI,EAAKR,KAAKqD,KAAKxR,MA6M9C6W,CAAiBlI,GArXnB,SAAyBA,GACvB,IAAI6C,EAAO7C,EAAKR,KAAKqD,KACrBA,EAAK7D,SAAST,OACd,IAAIS,EAAW6D,EAAK7D,SAAS7Y,OPjhBxB,SAAeiB,EAAKE,EAAG0L,GAC5B,IAAIzL,EAAIyL,EAAE,GACNxL,EAAIwL,EAAE,GACNvL,EAAIuL,EAAE,GACV5L,EAAI,GAAKE,EAAE,GAAKC,EAChBH,EAAI,GAAKE,EAAE,GAAKC,EAChBH,EAAI,GAAKE,EAAE,GAAKC,EAChBH,EAAI,GAAKE,EAAE,GAAKC,EAChBH,EAAI,GAAKE,EAAE,GAAKE,EAChBJ,EAAI,GAAKE,EAAE,GAAKE,EAChBJ,EAAI,GAAKE,EAAE,GAAKE,EAChBJ,EAAI,GAAKE,EAAE,GAAKE,EAChBJ,EAAI,GAAKE,EAAE,GAAKG,EAChBL,EAAI,GAAKE,EAAE,GAAKG,EAChBL,EAAI,IAAME,EAAE,IAAMG,EAClBL,EAAI,IAAME,EAAE,IAAMG,EAClBL,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IOggBZ,CAAWub,EAAKnE,MAAM/J,gBAAiBkO,EAAKzc,IAAIuO,gBAAiB,EAAgB,EAAGqK,EAAU,IAE9F,IAAImJ,EAAW,KAAQlhB,KAAKyD,IAAI,cAAiBsV,EAAKR,KAAKS,OACvDmI,EAAa,KAAQnhB,KAAKyD,IAAI,QAAgBsV,EAAKR,KAAKS,OAG5D,GACE4C,EAAKnE,MAAM/J,gBACXkO,EAAKnE,MAAM/J,gBACXwT,EACA,EAAgB,EAAG,EAAG,IAExB,GACEtF,EAAKnE,MAAM/J,gBACXkO,EAAKnE,MAAM/J,gBACXyT,EACA,EAAgB,EAAG,EAAG,IAGxBvF,EAAKxD,YAAYrB,OAt5BQ,EAs5BcgB,EAgWvCqJ,CAAgBrI,GA7VlB,SAAoBA,GAClB,INx+B2BsI,EAAUtd,EACjCa,EACAsD,EMs+BA0T,EAAO7C,EAAKR,KAAKqD,KAGjB0F,GN3+BuBD,EM2+BO,IN3+BGtd,EM2+BY6X,EAAK3D,cN1+BlDrT,EAAwB,EAAlB5E,KAAKmF,KAAKpB,EAAE,KAClBmE,EAAIlI,KAAKyD,IAAImB,EAAM,IAEf,GACNyc,EAAS,GAAKtd,EAAE,GAAKmE,EACrBmZ,EAAS,GAAKtd,EAAE,GAAKmE,EACrBmZ,EAAS,GAAKtd,EAAE,GAAKmE,IAGrBmZ,EAAS,GAAK,EACdA,EAAS,GAAK,EACdA,EAAS,GAAK,GAGTzc,GM69BH2c,GACDvhB,KAAK4e,IAAI0C,GAAathB,KAAK4e,IAv9BM,SAw9BjC5e,KAAK4e,IAv9B2B,KAu9BC5e,KAAK4e,IAx9BL,QA09B9B4C,EAx9BqC,MAu9B3CD,EAAiB9M,GAAM8M,EAAgB,CAAC,EAAG,MLz0BtC,SAAephB,EAAKE,EAAGS,GAC5BX,EAAI,GAAKE,EAAE,GAAKS,EAChBX,EAAI,GAAKE,EAAE,GAAKS,EAChBX,EAAI,GAAKE,EAAE,GAAKS,EAChBX,EAAI,GAAKE,EAAE,GAAKS,GKu0BhB,CAAW8a,EAAK3D,cAAe2D,EAAK3D,cAAeuJ,GN72B9C,SAAoBrhB,EAAKE,GAC9B,IAAIC,EAAID,EAAE,GACNE,EAAIF,EAAE,GACNG,EAAIH,EAAE,GACVF,EAAI,GAAKG,EACTH,EAAI,GAAKI,EACTJ,EAAI,GAAKK,EACTL,EAAI,GAAKH,KAAKgC,KAAKhC,KAAK6F,IAAI,EAAMvF,EAAIA,EAAIC,EAAIA,EAAIC,EAAIA,IMu2BtD,CAAgBob,EAAK3D,cAAe2D,EAAK3D,eAGzC,EAAmB2D,EAAK1D,QAAS0D,EAAK1D,QAAS0D,EAAK3D,eACpD,EAAmB2D,EAAKtR,GAAIsR,EAAKtR,GAAIsR,EAAK3D,eAC1C,EAAmB2D,EAAKzD,MAAOyD,EAAKzD,MAAOyD,EAAK3D,eAEhD,IAAItJ,EAAMiN,EAAKzc,IAAIwP,MACnBiN,EAAKzc,IAAIsP,UAAU,EAAW,IAAeE,GAAM,IACnD,IAAIuR,EAAM,GAAc,KAAetE,EAAK3D,eAC5C,GAAc2D,EAAKzc,IAAIuO,gBAAiBwS,EAAKtE,EAAKzc,IAAIuO,iBACtDkO,EAAKzc,IAAIsP,UAAUE,GAwUnB8S,CAAW1I,GAEPA,EAAKiE,OAAOC,SAASlJ,QAAQmJ,IAAI,SACnCnE,EAAK8C,QAAQ6F,qBAAqB7N,KAAI,WAAM,OA9qBhD,SAAiBkF,GACfA,EAAK8C,QAAQ3K,OAAOyQ,KAAK5I,EAAKR,KAAKqD,KAAM7C,EAAKR,KAAKrH,QACnD6H,EAAKoD,KAAOjF,GAAS0K,QA4qByBC,CAAQ9I,MAGtDA,EAAKR,KAAKS,OAAS,EACnBnI,GACEkI,EAAKtL,GACLwO,GAAWlD,GACX4C,GAAY5C,GACZiD,GAAiBjD,GACjBA,EAAK9H,WACL8H,EAAKR,KAAKrH,QAGZgL,GAAkBnD,GAz0BY+I,CAAS/I,MAC5BA,EAAKoD,MAAQjF,GAAS0K,SAC/BvF,uBAAsB,WAAM,OAmqBhC,SAAiBtD,GACf,IAAIkE,EAAWlE,EAAKiE,OAAOC,SAE3BM,GAAmBN,EAAUlE,EAAK8C,QAAQ3K,QAEtC+L,EAASlJ,QAAQmJ,IAAI,cACvBnE,EAAK8C,QAAQkG,iBAAiBlO,KAAI,WAChCkF,EAAKR,KAAK5B,MAAQ3W,KAAKqB,IAAI,EAAG0X,EAAKR,KAAK5B,MAAQ,GAChDoC,EAAKR,KAAK7B,aAAeA,GAAaqC,EAAKR,KAAK5B,OAChDqL,GAAYjJ,MAGZkE,EAASlJ,QAAQmJ,IAAI,eACvBnE,EAAK8C,QAAQkG,iBAAiBlO,KAAI,WAChCkF,EAAKR,KAAK5B,OAAS,EACnBoC,EAAKR,KAAK7B,aAAeA,GAAaqC,EAAKR,KAAK5B,OAChDqL,GAAYjJ,MAIZkE,EAASlJ,QAAQmJ,IAAI,SACvBnE,EAAK8C,QAAQkG,iBAAiBlO,KAAI,WAChCkF,EAAK8C,QAAQxK,KAAO0H,EAAK8C,QAAQxK,OAIjC4L,EAASlJ,QAAQmJ,IAAI,SACvBnE,EAAK8C,QAAQkG,iBAAiBlO,KAAI,WAChCkF,EAAK8C,QAAQC,oBAAsB/C,EAAK8C,QAAQC,sBAIhDmB,EAASlJ,QAAQmJ,IAAI,SACvBnE,EAAK8C,QAAQ6F,qBAAqB7N,KAAI,WAAM,OAnjBhD,SAAmBkF,GACjBA,EAAKoD,KAAOjF,GAAS6G,KAkjByBkE,CAAUlJ,MAExDlI,GACEkI,EAAKtL,GACLwO,GAAWlD,GACX4C,GAAY5C,GACZiD,GAAiBjD,GACjBA,EAAK9H,WACL8H,EAAK8C,QAAQ3K,OACb,CACEG,IAAK0H,EAAK8C,QAAQxK,MAItB6K,GAAkBnD,GAltBYmJ,CAAQnJ,MAIxC,SAASoJ,GAASpJ,GAChBqJ,GAAQC,KAAKC,QAAS,EACtBF,GAAQ/B,MAAMiC,QAAS,EACvBF,GAAQzL,MAAM2L,QAAS,EAEvBF,GAAQG,SAASC,UAAY,YAC7BJ,GAAQG,SAASD,QAAS,EAC1BF,GAAQK,WAAWD,UAAY,QAC/BJ,GAAQK,WAAWH,QAAS,EAC5BF,GAAQK,WAAWC,QAAU,WAC3BzE,GAASlF,EAAM,IAEjBqJ,GAAQO,YAAYL,QAAS,EAE7BvJ,EAAKoD,KAAOjF,GAASkF,KAGvB,SAASwE,GAAS7H,GAChBqJ,GAAQC,KAAKC,QAAS,EACtBF,GAAQ/B,MAAMiC,QAAS,EACvBF,GAAQzL,MAAM2L,QAAS,EAEvBF,GAAQG,SAASC,UAAY,YAC7BJ,GAAQG,SAASD,QAAS,EAC1BF,GAAQK,WAAWD,UAAY,UAC/BJ,GAAQK,WAAWH,QAAS,EAC5BF,GAAQK,WAAWC,QAAU,WAC3BzE,GAASlF,EAAM,IAEjBqJ,GAAQO,YAAYH,UAAY,OAChCJ,GAAQO,YAAYL,QAAS,EAC7BF,GAAQO,YAAYD,QAAU,WAC5BP,GAASpJ,IAGXA,EAAKR,KAAKqD,KAAKxD,YAAYwK,QAE3B1O,SAASmJ,kBACTtE,EAAKoD,KAAOjF,GAASyG,MAGvB,SAASS,GAAUrF,GACjBqJ,GAAQ/B,MAAMiC,QAAS,EACvBF,GAAQC,KAAKC,QAAS,EACtBF,GAAQzL,MAAM2L,QAAS,EAEvBF,GAAQG,SAASC,UAAY,QAC7BJ,GAAQG,SAASD,QAAS,EAC1BF,GAAQK,WAAWD,UAAY,UAC/BJ,GAAQK,WAAWH,QAAS,EAC5BF,GAAQK,WAAWC,QAAU,WAC3B7E,GAAY9E,IAEdqJ,GAAQO,YAAYH,UAAY,OAChCJ,GAAQO,YAAYL,QAAS,EAC7BF,GAAQO,YAAYD,QAAU,WAC5BP,GAASpJ,IAGXjC,GAAM8L,QACN7J,EAAKR,KAAKqD,KAAKxD,YAAYwK,QAE3B1O,SAASmJ,kBACTtE,EAAKoD,KAAOjF,GAASyG,MAGvB,SAASE,GAAY9E,GACnBqJ,GAAQC,KAAKC,QAAS,EACtBF,GAAQ/B,MAAMiC,QAAS,EACvBF,GAAQzL,MAAM2L,QAAS,EAEvBF,GAAQG,SAASD,QAAS,EAC1BF,GAAQK,WAAWH,QAAS,EAC5BF,GAAQO,YAAYL,QAAS,EAE7BxL,GAAMyB,OAENkB,GAAO6D,qBACPvE,EAAKoD,KAAOjF,GAAS6G,KAGvB,SAASE,GAASlF,EAAYpC,G,QAC5ByL,GAAQC,KAAKC,QAAS,EACtBF,GAAQ/B,MAAMiC,QAAS,EACvBF,GAAQzL,MAAM2L,QAAS,EAEvBF,GAAQG,SAASD,QAAS,EAC1BF,GAAQK,WAAWH,QAAS,EAC5BF,GAAQO,YAAYL,QAAS,EAEhB,GAAT3L,IACFG,GAAMyB,OACNzB,GAAM+L,YAAc,GAGtBpJ,GAAO6D,qBACPvE,EAAKoD,KAAOjF,GAAS6G,KAErBhF,EAAKR,KAAKqD,KAAO,IAAIkH,GAAK/J,EAAKtL,IAC/BsL,EAAKR,KAAKc,SAAW,GACrBN,EAAKR,KAAKmD,gBAAkB,CAAC,GAAI,IACjC3C,EAAKR,KAAK7B,aAAeA,GAAaC,GACtCoC,EAAKR,KAAK8G,cA1jBZ,SAAuB1I,GAGrB,MAAO,CAFI,IAAe,KAARA,EACP,IAAe,IAARA,GAwjBQ0I,CAAc1I,GACxCoC,EAAKR,KAAKwD,KAAO,GACjBhD,EAAKR,KAAK8H,MAAQ,EAClBtH,EAAKR,KAAKS,MAAQ,EAClBD,EAAKR,KAAKyI,mBAAqBjI,EAAKR,KAAKqD,KAAKxR,MAC9C2O,EAAKR,KAAKrH,OAAS6H,EAAKR,KAAKqD,KAAK1K,OAAO6H,EAAKR,KAAKqD,KAAKxR,OACxD2O,EAAKR,KAAK5B,MAAQA,EAClBoC,EAAKR,KAAKyF,gBAAkB,KAC5BsC,GAAYvH,GACZgI,GAAYhI,GACZiJ,GAAYjJ,G,IAEZ,IAAmC,SAAAA,EAAKR,KAAK7B,aAAa+F,WAAS,8BACjE,IADS,oBAAC7C,EAAI,KAAE,EAAY,KACnB9T,EAAI,EAAGA,EAAI,EAAcA,IAAK,CACrC,IAAI6I,EAAMiG,GAAUmE,EAAKR,KAAKqD,KAAK1D,QAAStC,IACxC2B,EAAW3C,GAAU,EAAW,IAAejG,GAAM,GAAIkH,IAC7D,EAAWlH,EAAKA,EAAK,GAAK,sBAAIgH,KAA+B,KAC7D,EAAW4B,EAAUA,EAAU,GAAK,sBAAIwB,EAAKR,KAAK8G,gBAAa,KAE/D,IAAIlF,EAAW,IAAIa,GAASjC,EAAKtL,GAAImM,EAAMrC,GAC3C4C,EAAS5C,SAAWA,EACpB4C,EAAShb,IAAIsP,UAAUE,GACvBoK,EAAKR,KAAKmD,gBAAgB9B,GAAMhI,KAAKuI,I,iGAIzC,IAASrU,EAAI,EAAGA,EFvtBc,EEutBOA,IAAK,CAExC,IAAIwV,EAAM,IAAI9D,GAAYuB,EAAKtL,GAAI,IACnC6N,EAAI7M,UAAU,EAAY,IAAe,GAAK,sBAAIqH,KAA0B,MAC5EiD,EAAKR,KAAKwD,KAAKnK,KAAK0J,KApUxB,SAAKpE,GACH,mBACA,qBACA,mBACA,yBAJF,CAAKA,KAAAA,GAAQ,KAgWb,kBAWE,WAAY,G,IACV9M,EAAG,MACHD,EAAM,SACN4Y,EAAM,SACNrJ,EAAK,QACLC,EAAM,SACNqJ,EAAU,aACVnZ,EAAI,OACJC,EAAG,MACHmZ,EAAS,YAYT1U,KAAKnE,IAAMA,EACXmE,KAAK2J,QAAU/N,EACfoE,KAAKjE,GAAKyY,EACVxU,KAAK4J,MAAQ,EAAW,IAAehO,EAAQ4Y,GAE/CxU,KAAK0U,UAAYA,EAEjB1U,KAAKwE,iBAAmB,KACxBxE,KAAK0E,qBAAuB,KAC5B1E,KAAK2U,cACL,GACE3U,KAAK0E,qBACL0B,GAAQqO,GACRtJ,EAAQC,EACR9P,EACAC,GA8CN,OA1CU,YAAAoZ,YAAR,WACE,GACE3U,KAAKwE,iBACLxE,KAAKnE,IACL,EAAS,IAAemE,KAAKnE,IAAKmE,KAAK2J,SACvC3J,KAAKjE,KAIT,YAAA6Y,KAAA,SAAKtO,EAAiBpT,GACpB,EAAiB8M,KAAKnE,IAAKmE,KAAKnE,IAAKyK,EAAWpT,GAChD8M,KAAK2U,eAGP,YAAA1K,QAAA,SAAQ9J,GACNH,KAAK6U,cAAc,GAAkB,KAAe1U,EAAMH,KAAK4J,QAC/D5J,KAAK2U,eAGP,YAAAzK,QAAA,SAAQ/J,GACNH,KAAK6U,cAAc,GAAkB,KAAe1U,EAAMH,KAAKjE,KAC/DiE,KAAK2U,eAGP,YAAAxK,UAAA,SAAUhK,GACRH,KAAK6U,cAAc,GAAkB,KAAe1U,EAAMH,KAAK2J,UAC/D3J,KAAK2U,eAGC,YAAAE,cAAR,SAAsBC,GACpB,EAAmB9U,KAAK2J,QAAS3J,KAAK2J,QAASmL,GAC/C,EAAmB9U,KAAKjE,GAAIiE,KAAKjE,GAAI+Y,GACrC,EAAmB9U,KAAK4J,MAAO5J,KAAK4J,MAAOkL,IAG7C,YAAA1B,KAAA,SAAK/F,EAAY0H,GACf,EAAU/U,KAAK2J,QAAS0D,EAAK1D,SAC7B,EAAU3J,KAAKjE,GAAIsR,EAAKtR,IACxB,EAAUiE,KAAK4J,MAAOyD,EAAKzD,OAC3B,EAAU5J,KAAKnE,IAAKkZ,EAAIlZ,KP/wBrB,SAAcjK,EAAKE,GACxBF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,GAAKE,EAAE,GACXF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IACZF,EAAI,IAAME,EAAE,IOgwBV,CAAUkO,KAAKwE,iBAAkBuQ,EAAIvQ,mBAEzC,EA7FA,GAqcA,SAASuN,GAAYvH,GACnBqJ,GAAQ/B,MAAMkD,UAAY,iBAAUxK,EAAKR,KAAK8H,OAGhD,SAASU,GAAYhI,GACnB,IAAIyK,EAAexjB,KAAKmB,MAAM4X,EAAKR,KAAKS,MAAQ,IAC5CyK,EAAUzjB,KAAKmB,MAAMqiB,EAAe,IACpCE,EAAUF,EAAe,GAC7BpB,GAAQC,KAAKkB,UAAY,gBAASE,EAAO,YAAIC,EAAQC,WAAWC,SAAS,EAAG,MAG9E,SAAS5B,GAAYjJ,GACnBqJ,GAAQzL,MAAM4M,UAAY,iBAAUxK,EAAKR,KAAK5B,OAGhD,SAAS4G,GAAmBN,EAAoB/L,GAC9C,IAAI2S,EAAU,IAGV5G,EAASlJ,QAAQmJ,IAAI,SACvB,EAAiB2G,EAASA,EAAS3S,EAAOiH,OAAQ,GAEhD8E,EAASlJ,QAAQmJ,IAAI,SACvB,EAAS2G,EAASA,EAAS3S,EAAOiH,OAEhC8E,EAASlJ,QAAQmJ,IAAI,SACvB,EAAS2G,EAASA,EAAS3S,EAAOgH,SAEhC+E,EAASlJ,QAAQmJ,IAAI,SACvB,EAAiB2G,EAASA,EAAS3S,EAAOgH,SAAU,GAElD+E,EAASlJ,QAAQmJ,IAAI,cACvB,EAAiB2G,EAASA,EAAS3S,EAAO5G,IAAK,GAE7C2S,EAASlJ,QAAQmJ,IAAI,UACvB,EAAS2G,EAASA,EAAS3S,EAAO5G,IAG/B,EAAiBuZ,EAAS,OAC7B,EAAeA,EAASA,GACxB3S,EAAOiS,KAAKU,EAAS3S,EAAO+R,YAG1BhG,EAASlJ,QAAQmJ,IAAI,SACvBhM,EAAOwH,UAznCuB,KA2nC5BuE,EAASlJ,QAAQmJ,IAAI,SACvBhM,EAAOwH,WA5nCuB,KA+nC5BuE,EAASlJ,QAAQmJ,IAAI,aACvBhM,EAAO+R,WAAa5M,IAElB4G,EAASlJ,QAAQmJ,IAAI,cAAgBhM,EAAO+R,UAAY5M,KAC1DnF,EAAO+R,WAAa5M,IA2KxB,IAAMoD,GAA4BvF,SAAS4P,eAAe,eAGpD1B,GAAU,CACd/B,MAAoBnM,SAAS4P,eAAe,cAC5CzB,KAAmBnO,SAAS4P,eAAe,aAC3CnN,MAAoBzC,SAAS4P,eAAe,cAC5CrB,WAA+BvO,SAAS4P,eAAe,eACvDnB,YAAgCzO,SAAS4P,eAAe,gBACxDvB,SAAuBrO,SAAS4P,eAAe,eAGjD,WACE,IAAIrW,EFv0CC,SAAmBgM,GACxB,IAAIhM,EAAKgM,EAAOsK,WAAW,SAC3B,GAAU,MAANtW,EACF,KAAM,2DAWR,OAPAA,EAAGuW,WAAW,GACdvW,EAAGwW,WAAU,MAAbxW,EAAE,YAAe,KAAkB,IAAE,IAAC,IAEtCA,EAAGyF,OAAOzF,EAAG0F,YAIN1F,EEyzCE,CAAiBgM,IACtBV,EAr+BN,SAAkBtL,GAChB,IAAIwP,EAAW,IAAIiH,GACnBjH,EAAShJ,WACT,IAAI2H,EAAO,IAAIkH,GAAKrV,GAEhBsL,EAAa,CACftL,GAAIA,EACJwD,WAAY,GAAoBxD,GAChC0O,KAAMjF,GAASkF,KACfY,OAAQ,CACNC,SAAUA,EAEVqB,QAAS,EACTV,eAAgB,IAAIuG,GAAUC,KAAKtQ,IAAK2C,IACxC0H,WAAW,GAEb5F,KAAM,CACJqD,KAAMA,EACNvC,SAAU,GACVqC,gBAAiB,CAAC,GAAI,IAEtBhF,aAAc,CAAC,EAAG,GAClBqF,KAAM,GACN/C,MAAO,EACPqH,MAAO,EACPW,mBAAoBpF,EAAKxR,MACzB8G,OAAQ0K,EAAK1K,OAAO0K,EAAKxR,OACzBiV,cAAe,CAAC,EAAG,GACnB1I,MAAO,EACPqH,gBAAiB,MAEnBnC,QAAS,CACP3K,OAAQ,IAAImT,GAAW,CACrBja,IAAK,EAAgB,EAAG,GAAI,GAC5BD,OAAQ,EAAgB,EAAG,EAAG,GAC9B4Y,OAAQ,EAAgB,EAAG,EAAG,GAC9BrJ,MAAOD,GAAOC,MACdC,OAAQF,GAAOE,OACfqJ,WAAY/M,GAAiB,GAC7BpM,KA3X2B,OA4X3BC,IA3X0B,GA4X1BmZ,UA/XmC,MAiYrCvB,qBAAsB,IAAIyC,GAAUC,KAAKtQ,IAAK2C,IAC9CsL,iBAAkB,IAAIoC,GAAUC,KAAKtQ,IAAK2C,IAC1CpF,KAAK,EACLyK,oBAAoB,GAEtBS,KAAM,CACJrL,OAAQ,IAAImT,GAAW,CACrBja,IAAK,EAAgB,EAAG,EAAG,GAC3BD,OAAQ,EAAgB,EAAG,EAAG,GAC9B4Y,OAAQ,EAAgB,EAAG,EAAG,GAC9BrJ,MAAOD,GAAOC,MACdC,OAAQF,GAAOE,OACfqJ,WAAY/M,GAAiB,GAC7BpM,KAAMwL,GACNvL,IAzcsB,GA0ctBmZ,UAhZmC,MAkZrCzG,UAAW,GACXT,KAAM,GACNqB,cAAc,EACdD,kBAAmB,IAAIgH,GAAUC,KAAKtQ,IAAK2C,MAO/C,OASF,SAAmBsC,GACjB,IAAI7H,EAAS6H,EAAKwD,KAAKrL,OACvBA,EAAOuH,QAAQ9D,IAAS,KACxBzD,EAAOsH,QAAQ7D,IAAS,KACxB,IAAI2G,EAAM,IAAI9D,GAAYuB,EAAKtL,GAAI,IACnC6N,EAAI7M,UAAU,EAAgB,KAAM,EAAG,KACvCsK,EAAKwD,KAAKR,KAAKnK,KAAK0J,GACpB,IAAIgJ,EAAY,IAAI9M,GAAYuB,EAAKtL,GAAI,IACzC6W,EAAU7V,UAAU,EAAiB,IAAeyC,EAAO9G,IAAK8G,EAAOgH,SAAU,IACjFa,EAAKwD,KAAKR,KAAKnK,KAAK0S,GApBpBC,CAAUxL,GAEHA,EA+5BIyL,CAAS/W,GAyBpB,SAASgX,EAAerQ,GAClB2E,EAAKoD,MAAQjF,GAAS0K,SACxB7I,EAAK8C,QAAQ3K,OAAOuH,SAAQ,KAA2BrE,EAAEsQ,WACzD3L,EAAK8C,QAAQ3K,OAAOsH,SAAQ,KAA2BpE,EAAEuQ,YAChD5L,EAAKoD,MAAQjF,GAAS6G,MAC/BhF,EAAKR,KAAKqD,KAAKnD,SAAQ,KAAyBrE,EAAEsQ,WAClD3L,EAAKR,KAAKqD,KAAKpD,SAAQ,KAAyBpE,EAAEuQ,YACzC5L,EAAKoD,MAAQjF,GAASkF,OAC/BrD,EAAKwD,KAAKrL,OAAOuH,SAAQ,KAA2BrE,EAAEsQ,WACtD3L,EAAKwD,KAAKrL,OAAOsH,SAAQ,KAA2BpE,EAAEuQ,YAhC1DC,OAAOzQ,iBAAiB,QAAQ,WAC1B4E,EAAKoD,MAAQjF,GAAS6G,MACxBK,GAAUrF,GAEZjC,GAAM8L,WAGRR,GAAQK,WAAWC,QAAU,WAC3BzE,GAASlF,EAAM,IAGjBU,GAAOiJ,QAAU,WACX3J,EAAKoD,MAAQjF,GAAS6G,MAAQhF,EAAKoD,MAAQjF,GAAS0K,SACtDnI,GAAO6D,sBAGXpJ,SAASC,iBAAiB,qBAAqB,WACzCD,SAAS2Q,qBAAuBpL,GAClCvF,SAASC,iBAAiB,YAAasQ,GAEvCvQ,SAAS4Q,oBAAoB,YAAaL,MAe9CvQ,SAASC,iBAAiB,aAAa,WACrC4E,EAAKiE,OAAOmB,WAAY,KAE1BjK,SAASC,iBAAiB,WAAW,WACnC4E,EAAKiE,OAAOmB,WAAY,KAG1BjC,GAAkBnD,GAGpBgM,I","sources":["webpack:///webpack/bootstrap","webpack:///webpack/runtime/define property getters","webpack:///webpack/runtime/hasOwnProperty shorthand","webpack:///webpack/runtime/make namespace object","webpack:///./node_modules/gl-matrix/esm/common.js","webpack:///./node_modules/gl-matrix/esm/vec3.js","webpack:///./node_modules/gl-matrix/esm/mat4.js","webpack:///./node_modules/gl-matrix/esm/quat.js","webpack:///./node_modules/gl-matrix/esm/vec4.js","webpack:///./node_modules/gl-matrix/esm/mat3.js","webpack:///./src/models.ts","webpack:///./src/render.ts","webpack:///./src/inputs.ts","webpack:///./src/game.ts"],"sourcesContent":["// The require scope\nvar __webpack_require__ = {};\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/**\n * Common utilities\n * @module glMatrix\n */\n// Configuration Constants\nexport var EPSILON = 0.000001;\nexport var ARRAY_TYPE = typeof Float32Array !== 'undefined' ? Float32Array : Array;\nexport var RANDOM = Math.random;\n/**\n * Sets the type of array used when creating new vectors and matrices\n *\n * @param {Float32ArrayConstructor | ArrayConstructor} type Array type, such as Float32Array or Array\n */\n\nexport function setMatrixArrayType(type) {\n  ARRAY_TYPE = type;\n}\nvar degree = Math.PI / 180;\n/**\n * Convert Degree To Radian\n *\n * @param {Number} a Angle in Degrees\n */\n\nexport function toRadian(a) {\n  return a * degree;\n}\n/**\n * Tests whether or not the arguments have approximately the same value, within an absolute\n * or relative tolerance of glMatrix.EPSILON (an absolute tolerance is used for values less\n * than or equal to 1.0, and a relative tolerance is used for larger values)\n *\n * @param {Number} a The first number to test.\n * @param {Number} b The second number to test.\n * @returns {Boolean} True if the numbers are approximately equal, false otherwise.\n */\n\nexport function equals(a, b) {\n  return Math.abs(a - b) <= EPSILON * Math.max(1.0, Math.abs(a), Math.abs(b));\n}\nif (!Math.hypot) Math.hypot = function () {\n  var y = 0,\n      i = arguments.length;\n\n  while (i--) {\n    y += arguments[i] * arguments[i];\n  }\n\n  return Math.sqrt(y);\n};","import * as glMatrix from \"./common.js\";\n/**\n * 3 Dimensional Vector\n * @module vec3\n */\n\n/**\n * Creates a new, empty vec3\n *\n * @returns {vec3} a new 3D vector\n */\n\nexport function create() {\n  var out = new glMatrix.ARRAY_TYPE(3);\n\n  if (glMatrix.ARRAY_TYPE != Float32Array) {\n    out[0] = 0;\n    out[1] = 0;\n    out[2] = 0;\n  }\n\n  return out;\n}\n/**\n * Creates a new vec3 initialized with values from an existing vector\n *\n * @param {ReadonlyVec3} a vector to clone\n * @returns {vec3} a new 3D vector\n */\n\nexport function clone(a) {\n  var out = new glMatrix.ARRAY_TYPE(3);\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  return out;\n}\n/**\n * Calculates the length of a vec3\n *\n * @param {ReadonlyVec3} a vector to calculate length of\n * @returns {Number} length of a\n */\n\nexport function length(a) {\n  var x = a[0];\n  var y = a[1];\n  var z = a[2];\n  return Math.hypot(x, y, z);\n}\n/**\n * Creates a new vec3 initialized with the given values\n *\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @returns {vec3} a new 3D vector\n */\n\nexport function fromValues(x, y, z) {\n  var out = new glMatrix.ARRAY_TYPE(3);\n  out[0] = x;\n  out[1] = y;\n  out[2] = z;\n  return out;\n}\n/**\n * Copy the values from one vec3 to another\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the source vector\n * @returns {vec3} out\n */\n\nexport function copy(out, a) {\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  return out;\n}\n/**\n * Set the components of a vec3 to the given values\n *\n * @param {vec3} out the receiving vector\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @returns {vec3} out\n */\n\nexport function set(out, x, y, z) {\n  out[0] = x;\n  out[1] = y;\n  out[2] = z;\n  return out;\n}\n/**\n * Adds two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function add(out, a, b) {\n  out[0] = a[0] + b[0];\n  out[1] = a[1] + b[1];\n  out[2] = a[2] + b[2];\n  return out;\n}\n/**\n * Subtracts vector b from vector a\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function subtract(out, a, b) {\n  out[0] = a[0] - b[0];\n  out[1] = a[1] - b[1];\n  out[2] = a[2] - b[2];\n  return out;\n}\n/**\n * Multiplies two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function multiply(out, a, b) {\n  out[0] = a[0] * b[0];\n  out[1] = a[1] * b[1];\n  out[2] = a[2] * b[2];\n  return out;\n}\n/**\n * Divides two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function divide(out, a, b) {\n  out[0] = a[0] / b[0];\n  out[1] = a[1] / b[1];\n  out[2] = a[2] / b[2];\n  return out;\n}\n/**\n * Math.ceil the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to ceil\n * @returns {vec3} out\n */\n\nexport function ceil(out, a) {\n  out[0] = Math.ceil(a[0]);\n  out[1] = Math.ceil(a[1]);\n  out[2] = Math.ceil(a[2]);\n  return out;\n}\n/**\n * Math.floor the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to floor\n * @returns {vec3} out\n */\n\nexport function floor(out, a) {\n  out[0] = Math.floor(a[0]);\n  out[1] = Math.floor(a[1]);\n  out[2] = Math.floor(a[2]);\n  return out;\n}\n/**\n * Returns the minimum of two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function min(out, a, b) {\n  out[0] = Math.min(a[0], b[0]);\n  out[1] = Math.min(a[1], b[1]);\n  out[2] = Math.min(a[2], b[2]);\n  return out;\n}\n/**\n * Returns the maximum of two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function max(out, a, b) {\n  out[0] = Math.max(a[0], b[0]);\n  out[1] = Math.max(a[1], b[1]);\n  out[2] = Math.max(a[2], b[2]);\n  return out;\n}\n/**\n * Math.round the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to round\n * @returns {vec3} out\n */\n\nexport function round(out, a) {\n  out[0] = Math.round(a[0]);\n  out[1] = Math.round(a[1]);\n  out[2] = Math.round(a[2]);\n  return out;\n}\n/**\n * Scales a vec3 by a scalar number\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to scale\n * @param {Number} b amount to scale the vector by\n * @returns {vec3} out\n */\n\nexport function scale(out, a, b) {\n  out[0] = a[0] * b;\n  out[1] = a[1] * b;\n  out[2] = a[2] * b;\n  return out;\n}\n/**\n * Adds two vec3's after scaling the second operand by a scalar value\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {Number} scale the amount to scale b by before adding\n * @returns {vec3} out\n */\n\nexport function scaleAndAdd(out, a, b, scale) {\n  out[0] = a[0] + b[0] * scale;\n  out[1] = a[1] + b[1] * scale;\n  out[2] = a[2] + b[2] * scale;\n  return out;\n}\n/**\n * Calculates the euclidian distance between two vec3's\n *\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {Number} distance between a and b\n */\n\nexport function distance(a, b) {\n  var x = b[0] - a[0];\n  var y = b[1] - a[1];\n  var z = b[2] - a[2];\n  return Math.hypot(x, y, z);\n}\n/**\n * Calculates the squared euclidian distance between two vec3's\n *\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {Number} squared distance between a and b\n */\n\nexport function squaredDistance(a, b) {\n  var x = b[0] - a[0];\n  var y = b[1] - a[1];\n  var z = b[2] - a[2];\n  return x * x + y * y + z * z;\n}\n/**\n * Calculates the squared length of a vec3\n *\n * @param {ReadonlyVec3} a vector to calculate squared length of\n * @returns {Number} squared length of a\n */\n\nexport function squaredLength(a) {\n  var x = a[0];\n  var y = a[1];\n  var z = a[2];\n  return x * x + y * y + z * z;\n}\n/**\n * Negates the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to negate\n * @returns {vec3} out\n */\n\nexport function negate(out, a) {\n  out[0] = -a[0];\n  out[1] = -a[1];\n  out[2] = -a[2];\n  return out;\n}\n/**\n * Returns the inverse of the components of a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to invert\n * @returns {vec3} out\n */\n\nexport function inverse(out, a) {\n  out[0] = 1.0 / a[0];\n  out[1] = 1.0 / a[1];\n  out[2] = 1.0 / a[2];\n  return out;\n}\n/**\n * Normalize a vec3\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a vector to normalize\n * @returns {vec3} out\n */\n\nexport function normalize(out, a) {\n  var x = a[0];\n  var y = a[1];\n  var z = a[2];\n  var len = x * x + y * y + z * z;\n\n  if (len > 0) {\n    //TODO: evaluate use of glm_invsqrt here?\n    len = 1 / Math.sqrt(len);\n  }\n\n  out[0] = a[0] * len;\n  out[1] = a[1] * len;\n  out[2] = a[2] * len;\n  return out;\n}\n/**\n * Calculates the dot product of two vec3's\n *\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {Number} dot product of a and b\n */\n\nexport function dot(a, b) {\n  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];\n}\n/**\n * Computes the cross product of two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @returns {vec3} out\n */\n\nexport function cross(out, a, b) {\n  var ax = a[0],\n      ay = a[1],\n      az = a[2];\n  var bx = b[0],\n      by = b[1],\n      bz = b[2];\n  out[0] = ay * bz - az * by;\n  out[1] = az * bx - ax * bz;\n  out[2] = ax * by - ay * bx;\n  return out;\n}\n/**\n * Performs a linear interpolation between two vec3's\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {vec3} out\n */\n\nexport function lerp(out, a, b, t) {\n  var ax = a[0];\n  var ay = a[1];\n  var az = a[2];\n  out[0] = ax + t * (b[0] - ax);\n  out[1] = ay + t * (b[1] - ay);\n  out[2] = az + t * (b[2] - az);\n  return out;\n}\n/**\n * Performs a hermite interpolation with two control points\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {ReadonlyVec3} c the third operand\n * @param {ReadonlyVec3} d the fourth operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {vec3} out\n */\n\nexport function hermite(out, a, b, c, d, t) {\n  var factorTimes2 = t * t;\n  var factor1 = factorTimes2 * (2 * t - 3) + 1;\n  var factor2 = factorTimes2 * (t - 2) + t;\n  var factor3 = factorTimes2 * (t - 1);\n  var factor4 = factorTimes2 * (3 - 2 * t);\n  out[0] = a[0] * factor1 + b[0] * factor2 + c[0] * factor3 + d[0] * factor4;\n  out[1] = a[1] * factor1 + b[1] * factor2 + c[1] * factor3 + d[1] * factor4;\n  out[2] = a[2] * factor1 + b[2] * factor2 + c[2] * factor3 + d[2] * factor4;\n  return out;\n}\n/**\n * Performs a bezier interpolation with two control points\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the first operand\n * @param {ReadonlyVec3} b the second operand\n * @param {ReadonlyVec3} c the third operand\n * @param {ReadonlyVec3} d the fourth operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {vec3} out\n */\n\nexport function bezier(out, a, b, c, d, t) {\n  var inverseFactor = 1 - t;\n  var inverseFactorTimesTwo = inverseFactor * inverseFactor;\n  var factorTimes2 = t * t;\n  var factor1 = inverseFactorTimesTwo * inverseFactor;\n  var factor2 = 3 * t * inverseFactorTimesTwo;\n  var factor3 = 3 * factorTimes2 * inverseFactor;\n  var factor4 = factorTimes2 * t;\n  out[0] = a[0] * factor1 + b[0] * factor2 + c[0] * factor3 + d[0] * factor4;\n  out[1] = a[1] * factor1 + b[1] * factor2 + c[1] * factor3 + d[1] * factor4;\n  out[2] = a[2] * factor1 + b[2] * factor2 + c[2] * factor3 + d[2] * factor4;\n  return out;\n}\n/**\n * Generates a random vector with the given scale\n *\n * @param {vec3} out the receiving vector\n * @param {Number} [scale] Length of the resulting vector. If ommitted, a unit vector will be returned\n * @returns {vec3} out\n */\n\nexport function random(out, scale) {\n  scale = scale || 1.0;\n  var r = glMatrix.RANDOM() * 2.0 * Math.PI;\n  var z = glMatrix.RANDOM() * 2.0 - 1.0;\n  var zScale = Math.sqrt(1.0 - z * z) * scale;\n  out[0] = Math.cos(r) * zScale;\n  out[1] = Math.sin(r) * zScale;\n  out[2] = z * scale;\n  return out;\n}\n/**\n * Transforms the vec3 with a mat4.\n * 4th vector component is implicitly '1'\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to transform\n * @param {ReadonlyMat4} m matrix to transform with\n * @returns {vec3} out\n */\n\nexport function transformMat4(out, a, m) {\n  var x = a[0],\n      y = a[1],\n      z = a[2];\n  var w = m[3] * x + m[7] * y + m[11] * z + m[15];\n  w = w || 1.0;\n  out[0] = (m[0] * x + m[4] * y + m[8] * z + m[12]) / w;\n  out[1] = (m[1] * x + m[5] * y + m[9] * z + m[13]) / w;\n  out[2] = (m[2] * x + m[6] * y + m[10] * z + m[14]) / w;\n  return out;\n}\n/**\n * Transforms the vec3 with a mat3.\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to transform\n * @param {ReadonlyMat3} m the 3x3 matrix to transform with\n * @returns {vec3} out\n */\n\nexport function transformMat3(out, a, m) {\n  var x = a[0],\n      y = a[1],\n      z = a[2];\n  out[0] = x * m[0] + y * m[3] + z * m[6];\n  out[1] = x * m[1] + y * m[4] + z * m[7];\n  out[2] = x * m[2] + y * m[5] + z * m[8];\n  return out;\n}\n/**\n * Transforms the vec3 with a quat\n * Can also be used for dual quaternions. (Multiply it with the real part)\n *\n * @param {vec3} out the receiving vector\n * @param {ReadonlyVec3} a the vector to transform\n * @param {ReadonlyQuat} q quaternion to transform with\n * @returns {vec3} out\n */\n\nexport function transformQuat(out, a, q) {\n  // benchmarks: https://jsperf.com/quaternion-transform-vec3-implementations-fixed\n  var qx = q[0],\n      qy = q[1],\n      qz = q[2],\n      qw = q[3];\n  var x = a[0],\n      y = a[1],\n      z = a[2]; // var qvec = [qx, qy, qz];\n  // var uv = vec3.cross([], qvec, a);\n\n  var uvx = qy * z - qz * y,\n      uvy = qz * x - qx * z,\n      uvz = qx * y - qy * x; // var uuv = vec3.cross([], qvec, uv);\n\n  var uuvx = qy * uvz - qz * uvy,\n      uuvy = qz * uvx - qx * uvz,\n      uuvz = qx * uvy - qy * uvx; // vec3.scale(uv, uv, 2 * w);\n\n  var w2 = qw * 2;\n  uvx *= w2;\n  uvy *= w2;\n  uvz *= w2; // vec3.scale(uuv, uuv, 2);\n\n  uuvx *= 2;\n  uuvy *= 2;\n  uuvz *= 2; // return vec3.add(out, a, vec3.add(out, uv, uuv));\n\n  out[0] = x + uvx + uuvx;\n  out[1] = y + uvy + uuvy;\n  out[2] = z + uvz + uuvz;\n  return out;\n}\n/**\n * Rotate a 3D vector around the x-axis\n * @param {vec3} out The receiving vec3\n * @param {ReadonlyVec3} a The vec3 point to rotate\n * @param {ReadonlyVec3} b The origin of the rotation\n * @param {Number} rad The angle of rotation in radians\n * @returns {vec3} out\n */\n\nexport function rotateX(out, a, b, rad) {\n  var p = [],\n      r = []; //Translate point to the origin\n\n  p[0] = a[0] - b[0];\n  p[1] = a[1] - b[1];\n  p[2] = a[2] - b[2]; //perform rotation\n\n  r[0] = p[0];\n  r[1] = p[1] * Math.cos(rad) - p[2] * Math.sin(rad);\n  r[2] = p[1] * Math.sin(rad) + p[2] * Math.cos(rad); //translate to correct position\n\n  out[0] = r[0] + b[0];\n  out[1] = r[1] + b[1];\n  out[2] = r[2] + b[2];\n  return out;\n}\n/**\n * Rotate a 3D vector around the y-axis\n * @param {vec3} out The receiving vec3\n * @param {ReadonlyVec3} a The vec3 point to rotate\n * @param {ReadonlyVec3} b The origin of the rotation\n * @param {Number} rad The angle of rotation in radians\n * @returns {vec3} out\n */\n\nexport function rotateY(out, a, b, rad) {\n  var p = [],\n      r = []; //Translate point to the origin\n\n  p[0] = a[0] - b[0];\n  p[1] = a[1] - b[1];\n  p[2] = a[2] - b[2]; //perform rotation\n\n  r[0] = p[2] * Math.sin(rad) + p[0] * Math.cos(rad);\n  r[1] = p[1];\n  r[2] = p[2] * Math.cos(rad) - p[0] * Math.sin(rad); //translate to correct position\n\n  out[0] = r[0] + b[0];\n  out[1] = r[1] + b[1];\n  out[2] = r[2] + b[2];\n  return out;\n}\n/**\n * Rotate a 3D vector around the z-axis\n * @param {vec3} out The receiving vec3\n * @param {ReadonlyVec3} a The vec3 point to rotate\n * @param {ReadonlyVec3} b The origin of the rotation\n * @param {Number} rad The angle of rotation in radians\n * @returns {vec3} out\n */\n\nexport function rotateZ(out, a, b, rad) {\n  var p = [],\n      r = []; //Translate point to the origin\n\n  p[0] = a[0] - b[0];\n  p[1] = a[1] - b[1];\n  p[2] = a[2] - b[2]; //perform rotation\n\n  r[0] = p[0] * Math.cos(rad) - p[1] * Math.sin(rad);\n  r[1] = p[0] * Math.sin(rad) + p[1] * Math.cos(rad);\n  r[2] = p[2]; //translate to correct position\n\n  out[0] = r[0] + b[0];\n  out[1] = r[1] + b[1];\n  out[2] = r[2] + b[2];\n  return out;\n}\n/**\n * Get the angle between two 3D vectors\n * @param {ReadonlyVec3} a The first operand\n * @param {ReadonlyVec3} b The second operand\n * @returns {Number} The angle in radians\n */\n\nexport function angle(a, b) {\n  var ax = a[0],\n      ay = a[1],\n      az = a[2],\n      bx = b[0],\n      by = b[1],\n      bz = b[2],\n      mag1 = Math.sqrt(ax * ax + ay * ay + az * az),\n      mag2 = Math.sqrt(bx * bx + by * by + bz * bz),\n      mag = mag1 * mag2,\n      cosine = mag && dot(a, b) / mag;\n  return Math.acos(Math.min(Math.max(cosine, -1), 1));\n}\n/**\n * Set the components of a vec3 to zero\n *\n * @param {vec3} out the receiving vector\n * @returns {vec3} out\n */\n\nexport function zero(out) {\n  out[0] = 0.0;\n  out[1] = 0.0;\n  out[2] = 0.0;\n  return out;\n}\n/**\n * Returns a string representation of a vector\n *\n * @param {ReadonlyVec3} a vector to represent as a string\n * @returns {String} string representation of the vector\n */\n\nexport function str(a) {\n  return \"vec3(\" + a[0] + \", \" + a[1] + \", \" + a[2] + \")\";\n}\n/**\n * Returns whether or not the vectors have exactly the same elements in the same position (when compared with ===)\n *\n * @param {ReadonlyVec3} a The first vector.\n * @param {ReadonlyVec3} b The second vector.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport function exactEquals(a, b) {\n  return a[0] === b[0] && a[1] === b[1] && a[2] === b[2];\n}\n/**\n * Returns whether or not the vectors have approximately the same elements in the same position.\n *\n * @param {ReadonlyVec3} a The first vector.\n * @param {ReadonlyVec3} b The second vector.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport function equals(a, b) {\n  var a0 = a[0],\n      a1 = a[1],\n      a2 = a[2];\n  var b0 = b[0],\n      b1 = b[1],\n      b2 = b[2];\n  return Math.abs(a0 - b0) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a0), Math.abs(b0)) && Math.abs(a1 - b1) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a1), Math.abs(b1)) && Math.abs(a2 - b2) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a2), Math.abs(b2));\n}\n/**\n * Alias for {@link vec3.subtract}\n * @function\n */\n\nexport var sub = subtract;\n/**\n * Alias for {@link vec3.multiply}\n * @function\n */\n\nexport var mul = multiply;\n/**\n * Alias for {@link vec3.divide}\n * @function\n */\n\nexport var div = divide;\n/**\n * Alias for {@link vec3.distance}\n * @function\n */\n\nexport var dist = distance;\n/**\n * Alias for {@link vec3.squaredDistance}\n * @function\n */\n\nexport var sqrDist = squaredDistance;\n/**\n * Alias for {@link vec3.length}\n * @function\n */\n\nexport var len = length;\n/**\n * Alias for {@link vec3.squaredLength}\n * @function\n */\n\nexport var sqrLen = squaredLength;\n/**\n * Perform some operation over an array of vec3s.\n *\n * @param {Array} a the array of vectors to iterate over\n * @param {Number} stride Number of elements between the start of each vec3. If 0 assumes tightly packed\n * @param {Number} offset Number of elements to skip at the beginning of the array\n * @param {Number} count Number of vec3s to iterate over. If 0 iterates over entire array\n * @param {Function} fn Function to call for each vector in the array\n * @param {Object} [arg] additional argument to pass to fn\n * @returns {Array} a\n * @function\n */\n\nexport var forEach = function () {\n  var vec = create();\n  return function (a, stride, offset, count, fn, arg) {\n    var i, l;\n\n    if (!stride) {\n      stride = 3;\n    }\n\n    if (!offset) {\n      offset = 0;\n    }\n\n    if (count) {\n      l = Math.min(count * stride + offset, a.length);\n    } else {\n      l = a.length;\n    }\n\n    for (i = offset; i < l; i += stride) {\n      vec[0] = a[i];\n      vec[1] = a[i + 1];\n      vec[2] = a[i + 2];\n      fn(vec, vec, arg);\n      a[i] = vec[0];\n      a[i + 1] = vec[1];\n      a[i + 2] = vec[2];\n    }\n\n    return a;\n  };\n}();","import * as glMatrix from \"./common.js\";\n/**\n * 4x4 Matrix<br>Format: column-major, when typed out it looks like row-major<br>The matrices are being post multiplied.\n * @module mat4\n */\n\n/**\n * Creates a new identity mat4\n *\n * @returns {mat4} a new 4x4 matrix\n */\n\nexport function create() {\n  var out = new glMatrix.ARRAY_TYPE(16);\n\n  if (glMatrix.ARRAY_TYPE != Float32Array) {\n    out[1] = 0;\n    out[2] = 0;\n    out[3] = 0;\n    out[4] = 0;\n    out[6] = 0;\n    out[7] = 0;\n    out[8] = 0;\n    out[9] = 0;\n    out[11] = 0;\n    out[12] = 0;\n    out[13] = 0;\n    out[14] = 0;\n  }\n\n  out[0] = 1;\n  out[5] = 1;\n  out[10] = 1;\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a new mat4 initialized with values from an existing matrix\n *\n * @param {ReadonlyMat4} a matrix to clone\n * @returns {mat4} a new 4x4 matrix\n */\n\nexport function clone(a) {\n  var out = new glMatrix.ARRAY_TYPE(16);\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  out[3] = a[3];\n  out[4] = a[4];\n  out[5] = a[5];\n  out[6] = a[6];\n  out[7] = a[7];\n  out[8] = a[8];\n  out[9] = a[9];\n  out[10] = a[10];\n  out[11] = a[11];\n  out[12] = a[12];\n  out[13] = a[13];\n  out[14] = a[14];\n  out[15] = a[15];\n  return out;\n}\n/**\n * Copy the values from one mat4 to another\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function copy(out, a) {\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  out[3] = a[3];\n  out[4] = a[4];\n  out[5] = a[5];\n  out[6] = a[6];\n  out[7] = a[7];\n  out[8] = a[8];\n  out[9] = a[9];\n  out[10] = a[10];\n  out[11] = a[11];\n  out[12] = a[12];\n  out[13] = a[13];\n  out[14] = a[14];\n  out[15] = a[15];\n  return out;\n}\n/**\n * Create a new mat4 with the given values\n *\n * @param {Number} m00 Component in column 0, row 0 position (index 0)\n * @param {Number} m01 Component in column 0, row 1 position (index 1)\n * @param {Number} m02 Component in column 0, row 2 position (index 2)\n * @param {Number} m03 Component in column 0, row 3 position (index 3)\n * @param {Number} m10 Component in column 1, row 0 position (index 4)\n * @param {Number} m11 Component in column 1, row 1 position (index 5)\n * @param {Number} m12 Component in column 1, row 2 position (index 6)\n * @param {Number} m13 Component in column 1, row 3 position (index 7)\n * @param {Number} m20 Component in column 2, row 0 position (index 8)\n * @param {Number} m21 Component in column 2, row 1 position (index 9)\n * @param {Number} m22 Component in column 2, row 2 position (index 10)\n * @param {Number} m23 Component in column 2, row 3 position (index 11)\n * @param {Number} m30 Component in column 3, row 0 position (index 12)\n * @param {Number} m31 Component in column 3, row 1 position (index 13)\n * @param {Number} m32 Component in column 3, row 2 position (index 14)\n * @param {Number} m33 Component in column 3, row 3 position (index 15)\n * @returns {mat4} A new mat4\n */\n\nexport function fromValues(m00, m01, m02, m03, m10, m11, m12, m13, m20, m21, m22, m23, m30, m31, m32, m33) {\n  var out = new glMatrix.ARRAY_TYPE(16);\n  out[0] = m00;\n  out[1] = m01;\n  out[2] = m02;\n  out[3] = m03;\n  out[4] = m10;\n  out[5] = m11;\n  out[6] = m12;\n  out[7] = m13;\n  out[8] = m20;\n  out[9] = m21;\n  out[10] = m22;\n  out[11] = m23;\n  out[12] = m30;\n  out[13] = m31;\n  out[14] = m32;\n  out[15] = m33;\n  return out;\n}\n/**\n * Set the components of a mat4 to the given values\n *\n * @param {mat4} out the receiving matrix\n * @param {Number} m00 Component in column 0, row 0 position (index 0)\n * @param {Number} m01 Component in column 0, row 1 position (index 1)\n * @param {Number} m02 Component in column 0, row 2 position (index 2)\n * @param {Number} m03 Component in column 0, row 3 position (index 3)\n * @param {Number} m10 Component in column 1, row 0 position (index 4)\n * @param {Number} m11 Component in column 1, row 1 position (index 5)\n * @param {Number} m12 Component in column 1, row 2 position (index 6)\n * @param {Number} m13 Component in column 1, row 3 position (index 7)\n * @param {Number} m20 Component in column 2, row 0 position (index 8)\n * @param {Number} m21 Component in column 2, row 1 position (index 9)\n * @param {Number} m22 Component in column 2, row 2 position (index 10)\n * @param {Number} m23 Component in column 2, row 3 position (index 11)\n * @param {Number} m30 Component in column 3, row 0 position (index 12)\n * @param {Number} m31 Component in column 3, row 1 position (index 13)\n * @param {Number} m32 Component in column 3, row 2 position (index 14)\n * @param {Number} m33 Component in column 3, row 3 position (index 15)\n * @returns {mat4} out\n */\n\nexport function set(out, m00, m01, m02, m03, m10, m11, m12, m13, m20, m21, m22, m23, m30, m31, m32, m33) {\n  out[0] = m00;\n  out[1] = m01;\n  out[2] = m02;\n  out[3] = m03;\n  out[4] = m10;\n  out[5] = m11;\n  out[6] = m12;\n  out[7] = m13;\n  out[8] = m20;\n  out[9] = m21;\n  out[10] = m22;\n  out[11] = m23;\n  out[12] = m30;\n  out[13] = m31;\n  out[14] = m32;\n  out[15] = m33;\n  return out;\n}\n/**\n * Set a mat4 to the identity matrix\n *\n * @param {mat4} out the receiving matrix\n * @returns {mat4} out\n */\n\nexport function identity(out) {\n  out[0] = 1;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = 1;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[10] = 1;\n  out[11] = 0;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = 0;\n  out[15] = 1;\n  return out;\n}\n/**\n * Transpose the values of a mat4\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function transpose(out, a) {\n  // If we are transposing ourselves we can skip a few steps but have to cache some values\n  if (out === a) {\n    var a01 = a[1],\n        a02 = a[2],\n        a03 = a[3];\n    var a12 = a[6],\n        a13 = a[7];\n    var a23 = a[11];\n    out[1] = a[4];\n    out[2] = a[8];\n    out[3] = a[12];\n    out[4] = a01;\n    out[6] = a[9];\n    out[7] = a[13];\n    out[8] = a02;\n    out[9] = a12;\n    out[11] = a[14];\n    out[12] = a03;\n    out[13] = a13;\n    out[14] = a23;\n  } else {\n    out[0] = a[0];\n    out[1] = a[4];\n    out[2] = a[8];\n    out[3] = a[12];\n    out[4] = a[1];\n    out[5] = a[5];\n    out[6] = a[9];\n    out[7] = a[13];\n    out[8] = a[2];\n    out[9] = a[6];\n    out[10] = a[10];\n    out[11] = a[14];\n    out[12] = a[3];\n    out[13] = a[7];\n    out[14] = a[11];\n    out[15] = a[15];\n  }\n\n  return out;\n}\n/**\n * Inverts a mat4\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function invert(out, a) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2],\n      a03 = a[3];\n  var a10 = a[4],\n      a11 = a[5],\n      a12 = a[6],\n      a13 = a[7];\n  var a20 = a[8],\n      a21 = a[9],\n      a22 = a[10],\n      a23 = a[11];\n  var a30 = a[12],\n      a31 = a[13],\n      a32 = a[14],\n      a33 = a[15];\n  var b00 = a00 * a11 - a01 * a10;\n  var b01 = a00 * a12 - a02 * a10;\n  var b02 = a00 * a13 - a03 * a10;\n  var b03 = a01 * a12 - a02 * a11;\n  var b04 = a01 * a13 - a03 * a11;\n  var b05 = a02 * a13 - a03 * a12;\n  var b06 = a20 * a31 - a21 * a30;\n  var b07 = a20 * a32 - a22 * a30;\n  var b08 = a20 * a33 - a23 * a30;\n  var b09 = a21 * a32 - a22 * a31;\n  var b10 = a21 * a33 - a23 * a31;\n  var b11 = a22 * a33 - a23 * a32; // Calculate the determinant\n\n  var det = b00 * b11 - b01 * b10 + b02 * b09 + b03 * b08 - b04 * b07 + b05 * b06;\n\n  if (!det) {\n    return null;\n  }\n\n  det = 1.0 / det;\n  out[0] = (a11 * b11 - a12 * b10 + a13 * b09) * det;\n  out[1] = (a02 * b10 - a01 * b11 - a03 * b09) * det;\n  out[2] = (a31 * b05 - a32 * b04 + a33 * b03) * det;\n  out[3] = (a22 * b04 - a21 * b05 - a23 * b03) * det;\n  out[4] = (a12 * b08 - a10 * b11 - a13 * b07) * det;\n  out[5] = (a00 * b11 - a02 * b08 + a03 * b07) * det;\n  out[6] = (a32 * b02 - a30 * b05 - a33 * b01) * det;\n  out[7] = (a20 * b05 - a22 * b02 + a23 * b01) * det;\n  out[8] = (a10 * b10 - a11 * b08 + a13 * b06) * det;\n  out[9] = (a01 * b08 - a00 * b10 - a03 * b06) * det;\n  out[10] = (a30 * b04 - a31 * b02 + a33 * b00) * det;\n  out[11] = (a21 * b02 - a20 * b04 - a23 * b00) * det;\n  out[12] = (a11 * b07 - a10 * b09 - a12 * b06) * det;\n  out[13] = (a00 * b09 - a01 * b07 + a02 * b06) * det;\n  out[14] = (a31 * b01 - a30 * b03 - a32 * b00) * det;\n  out[15] = (a20 * b03 - a21 * b01 + a22 * b00) * det;\n  return out;\n}\n/**\n * Calculates the adjugate of a mat4\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the source matrix\n * @returns {mat4} out\n */\n\nexport function adjoint(out, a) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2],\n      a03 = a[3];\n  var a10 = a[4],\n      a11 = a[5],\n      a12 = a[6],\n      a13 = a[7];\n  var a20 = a[8],\n      a21 = a[9],\n      a22 = a[10],\n      a23 = a[11];\n  var a30 = a[12],\n      a31 = a[13],\n      a32 = a[14],\n      a33 = a[15];\n  out[0] = a11 * (a22 * a33 - a23 * a32) - a21 * (a12 * a33 - a13 * a32) + a31 * (a12 * a23 - a13 * a22);\n  out[1] = -(a01 * (a22 * a33 - a23 * a32) - a21 * (a02 * a33 - a03 * a32) + a31 * (a02 * a23 - a03 * a22));\n  out[2] = a01 * (a12 * a33 - a13 * a32) - a11 * (a02 * a33 - a03 * a32) + a31 * (a02 * a13 - a03 * a12);\n  out[3] = -(a01 * (a12 * a23 - a13 * a22) - a11 * (a02 * a23 - a03 * a22) + a21 * (a02 * a13 - a03 * a12));\n  out[4] = -(a10 * (a22 * a33 - a23 * a32) - a20 * (a12 * a33 - a13 * a32) + a30 * (a12 * a23 - a13 * a22));\n  out[5] = a00 * (a22 * a33 - a23 * a32) - a20 * (a02 * a33 - a03 * a32) + a30 * (a02 * a23 - a03 * a22);\n  out[6] = -(a00 * (a12 * a33 - a13 * a32) - a10 * (a02 * a33 - a03 * a32) + a30 * (a02 * a13 - a03 * a12));\n  out[7] = a00 * (a12 * a23 - a13 * a22) - a10 * (a02 * a23 - a03 * a22) + a20 * (a02 * a13 - a03 * a12);\n  out[8] = a10 * (a21 * a33 - a23 * a31) - a20 * (a11 * a33 - a13 * a31) + a30 * (a11 * a23 - a13 * a21);\n  out[9] = -(a00 * (a21 * a33 - a23 * a31) - a20 * (a01 * a33 - a03 * a31) + a30 * (a01 * a23 - a03 * a21));\n  out[10] = a00 * (a11 * a33 - a13 * a31) - a10 * (a01 * a33 - a03 * a31) + a30 * (a01 * a13 - a03 * a11);\n  out[11] = -(a00 * (a11 * a23 - a13 * a21) - a10 * (a01 * a23 - a03 * a21) + a20 * (a01 * a13 - a03 * a11));\n  out[12] = -(a10 * (a21 * a32 - a22 * a31) - a20 * (a11 * a32 - a12 * a31) + a30 * (a11 * a22 - a12 * a21));\n  out[13] = a00 * (a21 * a32 - a22 * a31) - a20 * (a01 * a32 - a02 * a31) + a30 * (a01 * a22 - a02 * a21);\n  out[14] = -(a00 * (a11 * a32 - a12 * a31) - a10 * (a01 * a32 - a02 * a31) + a30 * (a01 * a12 - a02 * a11));\n  out[15] = a00 * (a11 * a22 - a12 * a21) - a10 * (a01 * a22 - a02 * a21) + a20 * (a01 * a12 - a02 * a11);\n  return out;\n}\n/**\n * Calculates the determinant of a mat4\n *\n * @param {ReadonlyMat4} a the source matrix\n * @returns {Number} determinant of a\n */\n\nexport function determinant(a) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2],\n      a03 = a[3];\n  var a10 = a[4],\n      a11 = a[5],\n      a12 = a[6],\n      a13 = a[7];\n  var a20 = a[8],\n      a21 = a[9],\n      a22 = a[10],\n      a23 = a[11];\n  var a30 = a[12],\n      a31 = a[13],\n      a32 = a[14],\n      a33 = a[15];\n  var b00 = a00 * a11 - a01 * a10;\n  var b01 = a00 * a12 - a02 * a10;\n  var b02 = a00 * a13 - a03 * a10;\n  var b03 = a01 * a12 - a02 * a11;\n  var b04 = a01 * a13 - a03 * a11;\n  var b05 = a02 * a13 - a03 * a12;\n  var b06 = a20 * a31 - a21 * a30;\n  var b07 = a20 * a32 - a22 * a30;\n  var b08 = a20 * a33 - a23 * a30;\n  var b09 = a21 * a32 - a22 * a31;\n  var b10 = a21 * a33 - a23 * a31;\n  var b11 = a22 * a33 - a23 * a32; // Calculate the determinant\n\n  return b00 * b11 - b01 * b10 + b02 * b09 + b03 * b08 - b04 * b07 + b05 * b06;\n}\n/**\n * Multiplies two mat4s\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @returns {mat4} out\n */\n\nexport function multiply(out, a, b) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2],\n      a03 = a[3];\n  var a10 = a[4],\n      a11 = a[5],\n      a12 = a[6],\n      a13 = a[7];\n  var a20 = a[8],\n      a21 = a[9],\n      a22 = a[10],\n      a23 = a[11];\n  var a30 = a[12],\n      a31 = a[13],\n      a32 = a[14],\n      a33 = a[15]; // Cache only the current line of the second matrix\n\n  var b0 = b[0],\n      b1 = b[1],\n      b2 = b[2],\n      b3 = b[3];\n  out[0] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n  out[1] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n  out[2] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n  out[3] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n  b0 = b[4];\n  b1 = b[5];\n  b2 = b[6];\n  b3 = b[7];\n  out[4] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n  out[5] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n  out[6] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n  out[7] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n  b0 = b[8];\n  b1 = b[9];\n  b2 = b[10];\n  b3 = b[11];\n  out[8] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n  out[9] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n  out[10] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n  out[11] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n  b0 = b[12];\n  b1 = b[13];\n  b2 = b[14];\n  b3 = b[15];\n  out[12] = b0 * a00 + b1 * a10 + b2 * a20 + b3 * a30;\n  out[13] = b0 * a01 + b1 * a11 + b2 * a21 + b3 * a31;\n  out[14] = b0 * a02 + b1 * a12 + b2 * a22 + b3 * a32;\n  out[15] = b0 * a03 + b1 * a13 + b2 * a23 + b3 * a33;\n  return out;\n}\n/**\n * Translate a mat4 by the given vector\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to translate\n * @param {ReadonlyVec3} v vector to translate by\n * @returns {mat4} out\n */\n\nexport function translate(out, a, v) {\n  var x = v[0],\n      y = v[1],\n      z = v[2];\n  var a00, a01, a02, a03;\n  var a10, a11, a12, a13;\n  var a20, a21, a22, a23;\n\n  if (a === out) {\n    out[12] = a[0] * x + a[4] * y + a[8] * z + a[12];\n    out[13] = a[1] * x + a[5] * y + a[9] * z + a[13];\n    out[14] = a[2] * x + a[6] * y + a[10] * z + a[14];\n    out[15] = a[3] * x + a[7] * y + a[11] * z + a[15];\n  } else {\n    a00 = a[0];\n    a01 = a[1];\n    a02 = a[2];\n    a03 = a[3];\n    a10 = a[4];\n    a11 = a[5];\n    a12 = a[6];\n    a13 = a[7];\n    a20 = a[8];\n    a21 = a[9];\n    a22 = a[10];\n    a23 = a[11];\n    out[0] = a00;\n    out[1] = a01;\n    out[2] = a02;\n    out[3] = a03;\n    out[4] = a10;\n    out[5] = a11;\n    out[6] = a12;\n    out[7] = a13;\n    out[8] = a20;\n    out[9] = a21;\n    out[10] = a22;\n    out[11] = a23;\n    out[12] = a00 * x + a10 * y + a20 * z + a[12];\n    out[13] = a01 * x + a11 * y + a21 * z + a[13];\n    out[14] = a02 * x + a12 * y + a22 * z + a[14];\n    out[15] = a03 * x + a13 * y + a23 * z + a[15];\n  }\n\n  return out;\n}\n/**\n * Scales the mat4 by the dimensions in the given vec3 not using vectorization\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to scale\n * @param {ReadonlyVec3} v the vec3 to scale the matrix by\n * @returns {mat4} out\n **/\n\nexport function scale(out, a, v) {\n  var x = v[0],\n      y = v[1],\n      z = v[2];\n  out[0] = a[0] * x;\n  out[1] = a[1] * x;\n  out[2] = a[2] * x;\n  out[3] = a[3] * x;\n  out[4] = a[4] * y;\n  out[5] = a[5] * y;\n  out[6] = a[6] * y;\n  out[7] = a[7] * y;\n  out[8] = a[8] * z;\n  out[9] = a[9] * z;\n  out[10] = a[10] * z;\n  out[11] = a[11] * z;\n  out[12] = a[12];\n  out[13] = a[13];\n  out[14] = a[14];\n  out[15] = a[15];\n  return out;\n}\n/**\n * Rotates a mat4 by the given angle around the given axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @param {ReadonlyVec3} axis the axis to rotate around\n * @returns {mat4} out\n */\n\nexport function rotate(out, a, rad, axis) {\n  var x = axis[0],\n      y = axis[1],\n      z = axis[2];\n  var len = Math.hypot(x, y, z);\n  var s, c, t;\n  var a00, a01, a02, a03;\n  var a10, a11, a12, a13;\n  var a20, a21, a22, a23;\n  var b00, b01, b02;\n  var b10, b11, b12;\n  var b20, b21, b22;\n\n  if (len < glMatrix.EPSILON) {\n    return null;\n  }\n\n  len = 1 / len;\n  x *= len;\n  y *= len;\n  z *= len;\n  s = Math.sin(rad);\n  c = Math.cos(rad);\n  t = 1 - c;\n  a00 = a[0];\n  a01 = a[1];\n  a02 = a[2];\n  a03 = a[3];\n  a10 = a[4];\n  a11 = a[5];\n  a12 = a[6];\n  a13 = a[7];\n  a20 = a[8];\n  a21 = a[9];\n  a22 = a[10];\n  a23 = a[11]; // Construct the elements of the rotation matrix\n\n  b00 = x * x * t + c;\n  b01 = y * x * t + z * s;\n  b02 = z * x * t - y * s;\n  b10 = x * y * t - z * s;\n  b11 = y * y * t + c;\n  b12 = z * y * t + x * s;\n  b20 = x * z * t + y * s;\n  b21 = y * z * t - x * s;\n  b22 = z * z * t + c; // Perform rotation-specific matrix multiplication\n\n  out[0] = a00 * b00 + a10 * b01 + a20 * b02;\n  out[1] = a01 * b00 + a11 * b01 + a21 * b02;\n  out[2] = a02 * b00 + a12 * b01 + a22 * b02;\n  out[3] = a03 * b00 + a13 * b01 + a23 * b02;\n  out[4] = a00 * b10 + a10 * b11 + a20 * b12;\n  out[5] = a01 * b10 + a11 * b11 + a21 * b12;\n  out[6] = a02 * b10 + a12 * b11 + a22 * b12;\n  out[7] = a03 * b10 + a13 * b11 + a23 * b12;\n  out[8] = a00 * b20 + a10 * b21 + a20 * b22;\n  out[9] = a01 * b20 + a11 * b21 + a21 * b22;\n  out[10] = a02 * b20 + a12 * b21 + a22 * b22;\n  out[11] = a03 * b20 + a13 * b21 + a23 * b22;\n\n  if (a !== out) {\n    // If the source and destination differ, copy the unchanged last row\n    out[12] = a[12];\n    out[13] = a[13];\n    out[14] = a[14];\n    out[15] = a[15];\n  }\n\n  return out;\n}\n/**\n * Rotates a matrix by the given angle around the X axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function rotateX(out, a, rad) {\n  var s = Math.sin(rad);\n  var c = Math.cos(rad);\n  var a10 = a[4];\n  var a11 = a[5];\n  var a12 = a[6];\n  var a13 = a[7];\n  var a20 = a[8];\n  var a21 = a[9];\n  var a22 = a[10];\n  var a23 = a[11];\n\n  if (a !== out) {\n    // If the source and destination differ, copy the unchanged rows\n    out[0] = a[0];\n    out[1] = a[1];\n    out[2] = a[2];\n    out[3] = a[3];\n    out[12] = a[12];\n    out[13] = a[13];\n    out[14] = a[14];\n    out[15] = a[15];\n  } // Perform axis-specific matrix multiplication\n\n\n  out[4] = a10 * c + a20 * s;\n  out[5] = a11 * c + a21 * s;\n  out[6] = a12 * c + a22 * s;\n  out[7] = a13 * c + a23 * s;\n  out[8] = a20 * c - a10 * s;\n  out[9] = a21 * c - a11 * s;\n  out[10] = a22 * c - a12 * s;\n  out[11] = a23 * c - a13 * s;\n  return out;\n}\n/**\n * Rotates a matrix by the given angle around the Y axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function rotateY(out, a, rad) {\n  var s = Math.sin(rad);\n  var c = Math.cos(rad);\n  var a00 = a[0];\n  var a01 = a[1];\n  var a02 = a[2];\n  var a03 = a[3];\n  var a20 = a[8];\n  var a21 = a[9];\n  var a22 = a[10];\n  var a23 = a[11];\n\n  if (a !== out) {\n    // If the source and destination differ, copy the unchanged rows\n    out[4] = a[4];\n    out[5] = a[5];\n    out[6] = a[6];\n    out[7] = a[7];\n    out[12] = a[12];\n    out[13] = a[13];\n    out[14] = a[14];\n    out[15] = a[15];\n  } // Perform axis-specific matrix multiplication\n\n\n  out[0] = a00 * c - a20 * s;\n  out[1] = a01 * c - a21 * s;\n  out[2] = a02 * c - a22 * s;\n  out[3] = a03 * c - a23 * s;\n  out[8] = a00 * s + a20 * c;\n  out[9] = a01 * s + a21 * c;\n  out[10] = a02 * s + a22 * c;\n  out[11] = a03 * s + a23 * c;\n  return out;\n}\n/**\n * Rotates a matrix by the given angle around the Z axis\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function rotateZ(out, a, rad) {\n  var s = Math.sin(rad);\n  var c = Math.cos(rad);\n  var a00 = a[0];\n  var a01 = a[1];\n  var a02 = a[2];\n  var a03 = a[3];\n  var a10 = a[4];\n  var a11 = a[5];\n  var a12 = a[6];\n  var a13 = a[7];\n\n  if (a !== out) {\n    // If the source and destination differ, copy the unchanged last row\n    out[8] = a[8];\n    out[9] = a[9];\n    out[10] = a[10];\n    out[11] = a[11];\n    out[12] = a[12];\n    out[13] = a[13];\n    out[14] = a[14];\n    out[15] = a[15];\n  } // Perform axis-specific matrix multiplication\n\n\n  out[0] = a00 * c + a10 * s;\n  out[1] = a01 * c + a11 * s;\n  out[2] = a02 * c + a12 * s;\n  out[3] = a03 * c + a13 * s;\n  out[4] = a10 * c - a00 * s;\n  out[5] = a11 * c - a01 * s;\n  out[6] = a12 * c - a02 * s;\n  out[7] = a13 * c - a03 * s;\n  return out;\n}\n/**\n * Creates a matrix from a vector translation\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.translate(dest, dest, vec);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {ReadonlyVec3} v Translation vector\n * @returns {mat4} out\n */\n\nexport function fromTranslation(out, v) {\n  out[0] = 1;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = 1;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[10] = 1;\n  out[11] = 0;\n  out[12] = v[0];\n  out[13] = v[1];\n  out[14] = v[2];\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a matrix from a vector scaling\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.scale(dest, dest, vec);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {ReadonlyVec3} v Scaling vector\n * @returns {mat4} out\n */\n\nexport function fromScaling(out, v) {\n  out[0] = v[0];\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = v[1];\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[10] = v[2];\n  out[11] = 0;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = 0;\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a matrix from a given angle around a given axis\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.rotate(dest, dest, rad, axis);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @param {ReadonlyVec3} axis the axis to rotate around\n * @returns {mat4} out\n */\n\nexport function fromRotation(out, rad, axis) {\n  var x = axis[0],\n      y = axis[1],\n      z = axis[2];\n  var len = Math.hypot(x, y, z);\n  var s, c, t;\n\n  if (len < glMatrix.EPSILON) {\n    return null;\n  }\n\n  len = 1 / len;\n  x *= len;\n  y *= len;\n  z *= len;\n  s = Math.sin(rad);\n  c = Math.cos(rad);\n  t = 1 - c; // Perform rotation-specific matrix multiplication\n\n  out[0] = x * x * t + c;\n  out[1] = y * x * t + z * s;\n  out[2] = z * x * t - y * s;\n  out[3] = 0;\n  out[4] = x * y * t - z * s;\n  out[5] = y * y * t + c;\n  out[6] = z * y * t + x * s;\n  out[7] = 0;\n  out[8] = x * z * t + y * s;\n  out[9] = y * z * t - x * s;\n  out[10] = z * z * t + c;\n  out[11] = 0;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = 0;\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a matrix from the given angle around the X axis\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.rotateX(dest, dest, rad);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function fromXRotation(out, rad) {\n  var s = Math.sin(rad);\n  var c = Math.cos(rad); // Perform axis-specific matrix multiplication\n\n  out[0] = 1;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = c;\n  out[6] = s;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = -s;\n  out[10] = c;\n  out[11] = 0;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = 0;\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a matrix from the given angle around the Y axis\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.rotateY(dest, dest, rad);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function fromYRotation(out, rad) {\n  var s = Math.sin(rad);\n  var c = Math.cos(rad); // Perform axis-specific matrix multiplication\n\n  out[0] = c;\n  out[1] = 0;\n  out[2] = -s;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = 1;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = s;\n  out[9] = 0;\n  out[10] = c;\n  out[11] = 0;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = 0;\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a matrix from the given angle around the Z axis\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.rotateZ(dest, dest, rad);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat4} out\n */\n\nexport function fromZRotation(out, rad) {\n  var s = Math.sin(rad);\n  var c = Math.cos(rad); // Perform axis-specific matrix multiplication\n\n  out[0] = c;\n  out[1] = s;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = -s;\n  out[5] = c;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[10] = 1;\n  out[11] = 0;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = 0;\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a matrix from a quaternion rotation and vector translation\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.translate(dest, vec);\n *     let quatMat = mat4.create();\n *     quat4.toMat4(quat, quatMat);\n *     mat4.multiply(dest, quatMat);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {quat4} q Rotation quaternion\n * @param {ReadonlyVec3} v Translation vector\n * @returns {mat4} out\n */\n\nexport function fromRotationTranslation(out, q, v) {\n  // Quaternion math\n  var x = q[0],\n      y = q[1],\n      z = q[2],\n      w = q[3];\n  var x2 = x + x;\n  var y2 = y + y;\n  var z2 = z + z;\n  var xx = x * x2;\n  var xy = x * y2;\n  var xz = x * z2;\n  var yy = y * y2;\n  var yz = y * z2;\n  var zz = z * z2;\n  var wx = w * x2;\n  var wy = w * y2;\n  var wz = w * z2;\n  out[0] = 1 - (yy + zz);\n  out[1] = xy + wz;\n  out[2] = xz - wy;\n  out[3] = 0;\n  out[4] = xy - wz;\n  out[5] = 1 - (xx + zz);\n  out[6] = yz + wx;\n  out[7] = 0;\n  out[8] = xz + wy;\n  out[9] = yz - wx;\n  out[10] = 1 - (xx + yy);\n  out[11] = 0;\n  out[12] = v[0];\n  out[13] = v[1];\n  out[14] = v[2];\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a new mat4 from a dual quat.\n *\n * @param {mat4} out Matrix\n * @param {ReadonlyQuat2} a Dual Quaternion\n * @returns {mat4} mat4 receiving operation result\n */\n\nexport function fromQuat2(out, a) {\n  var translation = new glMatrix.ARRAY_TYPE(3);\n  var bx = -a[0],\n      by = -a[1],\n      bz = -a[2],\n      bw = a[3],\n      ax = a[4],\n      ay = a[5],\n      az = a[6],\n      aw = a[7];\n  var magnitude = bx * bx + by * by + bz * bz + bw * bw; //Only scale if it makes sense\n\n  if (magnitude > 0) {\n    translation[0] = (ax * bw + aw * bx + ay * bz - az * by) * 2 / magnitude;\n    translation[1] = (ay * bw + aw * by + az * bx - ax * bz) * 2 / magnitude;\n    translation[2] = (az * bw + aw * bz + ax * by - ay * bx) * 2 / magnitude;\n  } else {\n    translation[0] = (ax * bw + aw * bx + ay * bz - az * by) * 2;\n    translation[1] = (ay * bw + aw * by + az * bx - ax * bz) * 2;\n    translation[2] = (az * bw + aw * bz + ax * by - ay * bx) * 2;\n  }\n\n  fromRotationTranslation(out, a, translation);\n  return out;\n}\n/**\n * Returns the translation vector component of a transformation\n *  matrix. If a matrix is built with fromRotationTranslation,\n *  the returned vector will be the same as the translation vector\n *  originally supplied.\n * @param  {vec3} out Vector to receive translation component\n * @param  {ReadonlyMat4} mat Matrix to be decomposed (input)\n * @return {vec3} out\n */\n\nexport function getTranslation(out, mat) {\n  out[0] = mat[12];\n  out[1] = mat[13];\n  out[2] = mat[14];\n  return out;\n}\n/**\n * Returns the scaling factor component of a transformation\n *  matrix. If a matrix is built with fromRotationTranslationScale\n *  with a normalized Quaternion paramter, the returned vector will be\n *  the same as the scaling vector\n *  originally supplied.\n * @param  {vec3} out Vector to receive scaling factor component\n * @param  {ReadonlyMat4} mat Matrix to be decomposed (input)\n * @return {vec3} out\n */\n\nexport function getScaling(out, mat) {\n  var m11 = mat[0];\n  var m12 = mat[1];\n  var m13 = mat[2];\n  var m21 = mat[4];\n  var m22 = mat[5];\n  var m23 = mat[6];\n  var m31 = mat[8];\n  var m32 = mat[9];\n  var m33 = mat[10];\n  out[0] = Math.hypot(m11, m12, m13);\n  out[1] = Math.hypot(m21, m22, m23);\n  out[2] = Math.hypot(m31, m32, m33);\n  return out;\n}\n/**\n * Returns a quaternion representing the rotational component\n *  of a transformation matrix. If a matrix is built with\n *  fromRotationTranslation, the returned quaternion will be the\n *  same as the quaternion originally supplied.\n * @param {quat} out Quaternion to receive the rotation component\n * @param {ReadonlyMat4} mat Matrix to be decomposed (input)\n * @return {quat} out\n */\n\nexport function getRotation(out, mat) {\n  var scaling = new glMatrix.ARRAY_TYPE(3);\n  getScaling(scaling, mat);\n  var is1 = 1 / scaling[0];\n  var is2 = 1 / scaling[1];\n  var is3 = 1 / scaling[2];\n  var sm11 = mat[0] * is1;\n  var sm12 = mat[1] * is2;\n  var sm13 = mat[2] * is3;\n  var sm21 = mat[4] * is1;\n  var sm22 = mat[5] * is2;\n  var sm23 = mat[6] * is3;\n  var sm31 = mat[8] * is1;\n  var sm32 = mat[9] * is2;\n  var sm33 = mat[10] * is3;\n  var trace = sm11 + sm22 + sm33;\n  var S = 0;\n\n  if (trace > 0) {\n    S = Math.sqrt(trace + 1.0) * 2;\n    out[3] = 0.25 * S;\n    out[0] = (sm23 - sm32) / S;\n    out[1] = (sm31 - sm13) / S;\n    out[2] = (sm12 - sm21) / S;\n  } else if (sm11 > sm22 && sm11 > sm33) {\n    S = Math.sqrt(1.0 + sm11 - sm22 - sm33) * 2;\n    out[3] = (sm23 - sm32) / S;\n    out[0] = 0.25 * S;\n    out[1] = (sm12 + sm21) / S;\n    out[2] = (sm31 + sm13) / S;\n  } else if (sm22 > sm33) {\n    S = Math.sqrt(1.0 + sm22 - sm11 - sm33) * 2;\n    out[3] = (sm31 - sm13) / S;\n    out[0] = (sm12 + sm21) / S;\n    out[1] = 0.25 * S;\n    out[2] = (sm23 + sm32) / S;\n  } else {\n    S = Math.sqrt(1.0 + sm33 - sm11 - sm22) * 2;\n    out[3] = (sm12 - sm21) / S;\n    out[0] = (sm31 + sm13) / S;\n    out[1] = (sm23 + sm32) / S;\n    out[2] = 0.25 * S;\n  }\n\n  return out;\n}\n/**\n * Creates a matrix from a quaternion rotation, vector translation and vector scale\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.translate(dest, vec);\n *     let quatMat = mat4.create();\n *     quat4.toMat4(quat, quatMat);\n *     mat4.multiply(dest, quatMat);\n *     mat4.scale(dest, scale)\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {quat4} q Rotation quaternion\n * @param {ReadonlyVec3} v Translation vector\n * @param {ReadonlyVec3} s Scaling vector\n * @returns {mat4} out\n */\n\nexport function fromRotationTranslationScale(out, q, v, s) {\n  // Quaternion math\n  var x = q[0],\n      y = q[1],\n      z = q[2],\n      w = q[3];\n  var x2 = x + x;\n  var y2 = y + y;\n  var z2 = z + z;\n  var xx = x * x2;\n  var xy = x * y2;\n  var xz = x * z2;\n  var yy = y * y2;\n  var yz = y * z2;\n  var zz = z * z2;\n  var wx = w * x2;\n  var wy = w * y2;\n  var wz = w * z2;\n  var sx = s[0];\n  var sy = s[1];\n  var sz = s[2];\n  out[0] = (1 - (yy + zz)) * sx;\n  out[1] = (xy + wz) * sx;\n  out[2] = (xz - wy) * sx;\n  out[3] = 0;\n  out[4] = (xy - wz) * sy;\n  out[5] = (1 - (xx + zz)) * sy;\n  out[6] = (yz + wx) * sy;\n  out[7] = 0;\n  out[8] = (xz + wy) * sz;\n  out[9] = (yz - wx) * sz;\n  out[10] = (1 - (xx + yy)) * sz;\n  out[11] = 0;\n  out[12] = v[0];\n  out[13] = v[1];\n  out[14] = v[2];\n  out[15] = 1;\n  return out;\n}\n/**\n * Creates a matrix from a quaternion rotation, vector translation and vector scale, rotating and scaling around the given origin\n * This is equivalent to (but much faster than):\n *\n *     mat4.identity(dest);\n *     mat4.translate(dest, vec);\n *     mat4.translate(dest, origin);\n *     let quatMat = mat4.create();\n *     quat4.toMat4(quat, quatMat);\n *     mat4.multiply(dest, quatMat);\n *     mat4.scale(dest, scale)\n *     mat4.translate(dest, negativeOrigin);\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {quat4} q Rotation quaternion\n * @param {ReadonlyVec3} v Translation vector\n * @param {ReadonlyVec3} s Scaling vector\n * @param {ReadonlyVec3} o The origin vector around which to scale and rotate\n * @returns {mat4} out\n */\n\nexport function fromRotationTranslationScaleOrigin(out, q, v, s, o) {\n  // Quaternion math\n  var x = q[0],\n      y = q[1],\n      z = q[2],\n      w = q[3];\n  var x2 = x + x;\n  var y2 = y + y;\n  var z2 = z + z;\n  var xx = x * x2;\n  var xy = x * y2;\n  var xz = x * z2;\n  var yy = y * y2;\n  var yz = y * z2;\n  var zz = z * z2;\n  var wx = w * x2;\n  var wy = w * y2;\n  var wz = w * z2;\n  var sx = s[0];\n  var sy = s[1];\n  var sz = s[2];\n  var ox = o[0];\n  var oy = o[1];\n  var oz = o[2];\n  var out0 = (1 - (yy + zz)) * sx;\n  var out1 = (xy + wz) * sx;\n  var out2 = (xz - wy) * sx;\n  var out4 = (xy - wz) * sy;\n  var out5 = (1 - (xx + zz)) * sy;\n  var out6 = (yz + wx) * sy;\n  var out8 = (xz + wy) * sz;\n  var out9 = (yz - wx) * sz;\n  var out10 = (1 - (xx + yy)) * sz;\n  out[0] = out0;\n  out[1] = out1;\n  out[2] = out2;\n  out[3] = 0;\n  out[4] = out4;\n  out[5] = out5;\n  out[6] = out6;\n  out[7] = 0;\n  out[8] = out8;\n  out[9] = out9;\n  out[10] = out10;\n  out[11] = 0;\n  out[12] = v[0] + ox - (out0 * ox + out4 * oy + out8 * oz);\n  out[13] = v[1] + oy - (out1 * ox + out5 * oy + out9 * oz);\n  out[14] = v[2] + oz - (out2 * ox + out6 * oy + out10 * oz);\n  out[15] = 1;\n  return out;\n}\n/**\n * Calculates a 4x4 matrix from the given quaternion\n *\n * @param {mat4} out mat4 receiving operation result\n * @param {ReadonlyQuat} q Quaternion to create matrix from\n *\n * @returns {mat4} out\n */\n\nexport function fromQuat(out, q) {\n  var x = q[0],\n      y = q[1],\n      z = q[2],\n      w = q[3];\n  var x2 = x + x;\n  var y2 = y + y;\n  var z2 = z + z;\n  var xx = x * x2;\n  var yx = y * x2;\n  var yy = y * y2;\n  var zx = z * x2;\n  var zy = z * y2;\n  var zz = z * z2;\n  var wx = w * x2;\n  var wy = w * y2;\n  var wz = w * z2;\n  out[0] = 1 - yy - zz;\n  out[1] = yx + wz;\n  out[2] = zx - wy;\n  out[3] = 0;\n  out[4] = yx - wz;\n  out[5] = 1 - xx - zz;\n  out[6] = zy + wx;\n  out[7] = 0;\n  out[8] = zx + wy;\n  out[9] = zy - wx;\n  out[10] = 1 - xx - yy;\n  out[11] = 0;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = 0;\n  out[15] = 1;\n  return out;\n}\n/**\n * Generates a frustum matrix with the given bounds\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {Number} left Left bound of the frustum\n * @param {Number} right Right bound of the frustum\n * @param {Number} bottom Bottom bound of the frustum\n * @param {Number} top Top bound of the frustum\n * @param {Number} near Near bound of the frustum\n * @param {Number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function frustum(out, left, right, bottom, top, near, far) {\n  var rl = 1 / (right - left);\n  var tb = 1 / (top - bottom);\n  var nf = 1 / (near - far);\n  out[0] = near * 2 * rl;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = near * 2 * tb;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = (right + left) * rl;\n  out[9] = (top + bottom) * tb;\n  out[10] = (far + near) * nf;\n  out[11] = -1;\n  out[12] = 0;\n  out[13] = 0;\n  out[14] = far * near * 2 * nf;\n  out[15] = 0;\n  return out;\n}\n/**\n * Generates a perspective projection matrix with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [-1, 1],\n * which matches WebGL/OpenGL's clip volume.\n * Passing null/undefined/no value for far will generate infinite projection matrix.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} fovy Vertical field of view in radians\n * @param {number} aspect Aspect ratio. typically viewport width/height\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum, can be null or Infinity\n * @returns {mat4} out\n */\n\nexport function perspectiveNO(out, fovy, aspect, near, far) {\n  var f = 1.0 / Math.tan(fovy / 2),\n      nf;\n  out[0] = f / aspect;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = f;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[11] = -1;\n  out[12] = 0;\n  out[13] = 0;\n  out[15] = 0;\n\n  if (far != null && far !== Infinity) {\n    nf = 1 / (near - far);\n    out[10] = (far + near) * nf;\n    out[14] = 2 * far * near * nf;\n  } else {\n    out[10] = -1;\n    out[14] = -2 * near;\n  }\n\n  return out;\n}\n/**\n * Alias for {@link mat4.perspectiveNO}\n * @function\n */\n\nexport var perspective = perspectiveNO;\n/**\n * Generates a perspective projection matrix suitable for WebGPU with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [0, 1],\n * which matches WebGPU/Vulkan/DirectX/Metal's clip volume.\n * Passing null/undefined/no value for far will generate infinite projection matrix.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} fovy Vertical field of view in radians\n * @param {number} aspect Aspect ratio. typically viewport width/height\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum, can be null or Infinity\n * @returns {mat4} out\n */\n\nexport function perspectiveZO(out, fovy, aspect, near, far) {\n  var f = 1.0 / Math.tan(fovy / 2),\n      nf;\n  out[0] = f / aspect;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = f;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[11] = -1;\n  out[12] = 0;\n  out[13] = 0;\n  out[15] = 0;\n\n  if (far != null && far !== Infinity) {\n    nf = 1 / (near - far);\n    out[10] = far * nf;\n    out[14] = far * near * nf;\n  } else {\n    out[10] = -1;\n    out[14] = -near;\n  }\n\n  return out;\n}\n/**\n * Generates a perspective projection matrix with the given field of view.\n * This is primarily useful for generating projection matrices to be used\n * with the still experiemental WebVR API.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {Object} fov Object containing the following values: upDegrees, downDegrees, leftDegrees, rightDegrees\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function perspectiveFromFieldOfView(out, fov, near, far) {\n  var upTan = Math.tan(fov.upDegrees * Math.PI / 180.0);\n  var downTan = Math.tan(fov.downDegrees * Math.PI / 180.0);\n  var leftTan = Math.tan(fov.leftDegrees * Math.PI / 180.0);\n  var rightTan = Math.tan(fov.rightDegrees * Math.PI / 180.0);\n  var xScale = 2.0 / (leftTan + rightTan);\n  var yScale = 2.0 / (upTan + downTan);\n  out[0] = xScale;\n  out[1] = 0.0;\n  out[2] = 0.0;\n  out[3] = 0.0;\n  out[4] = 0.0;\n  out[5] = yScale;\n  out[6] = 0.0;\n  out[7] = 0.0;\n  out[8] = -((leftTan - rightTan) * xScale * 0.5);\n  out[9] = (upTan - downTan) * yScale * 0.5;\n  out[10] = far / (near - far);\n  out[11] = -1.0;\n  out[12] = 0.0;\n  out[13] = 0.0;\n  out[14] = far * near / (near - far);\n  out[15] = 0.0;\n  return out;\n}\n/**\n * Generates a orthogonal projection matrix with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [-1, 1],\n * which matches WebGL/OpenGL's clip volume.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} left Left bound of the frustum\n * @param {number} right Right bound of the frustum\n * @param {number} bottom Bottom bound of the frustum\n * @param {number} top Top bound of the frustum\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function orthoNO(out, left, right, bottom, top, near, far) {\n  var lr = 1 / (left - right);\n  var bt = 1 / (bottom - top);\n  var nf = 1 / (near - far);\n  out[0] = -2 * lr;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = -2 * bt;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[10] = 2 * nf;\n  out[11] = 0;\n  out[12] = (left + right) * lr;\n  out[13] = (top + bottom) * bt;\n  out[14] = (far + near) * nf;\n  out[15] = 1;\n  return out;\n}\n/**\n * Alias for {@link mat4.orthoNO}\n * @function\n */\n\nexport var ortho = orthoNO;\n/**\n * Generates a orthogonal projection matrix with the given bounds.\n * The near/far clip planes correspond to a normalized device coordinate Z range of [0, 1],\n * which matches WebGPU/Vulkan/DirectX/Metal's clip volume.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {number} left Left bound of the frustum\n * @param {number} right Right bound of the frustum\n * @param {number} bottom Bottom bound of the frustum\n * @param {number} top Top bound of the frustum\n * @param {number} near Near bound of the frustum\n * @param {number} far Far bound of the frustum\n * @returns {mat4} out\n */\n\nexport function orthoZO(out, left, right, bottom, top, near, far) {\n  var lr = 1 / (left - right);\n  var bt = 1 / (bottom - top);\n  var nf = 1 / (near - far);\n  out[0] = -2 * lr;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 0;\n  out[5] = -2 * bt;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 0;\n  out[9] = 0;\n  out[10] = nf;\n  out[11] = 0;\n  out[12] = (left + right) * lr;\n  out[13] = (top + bottom) * bt;\n  out[14] = near * nf;\n  out[15] = 1;\n  return out;\n}\n/**\n * Generates a look-at matrix with the given eye position, focal point, and up axis.\n * If you want a matrix that actually makes an object look at another object, you should use targetTo instead.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {ReadonlyVec3} eye Position of the viewer\n * @param {ReadonlyVec3} center Point the viewer is looking at\n * @param {ReadonlyVec3} up vec3 pointing up\n * @returns {mat4} out\n */\n\nexport function lookAt(out, eye, center, up) {\n  var x0, x1, x2, y0, y1, y2, z0, z1, z2, len;\n  var eyex = eye[0];\n  var eyey = eye[1];\n  var eyez = eye[2];\n  var upx = up[0];\n  var upy = up[1];\n  var upz = up[2];\n  var centerx = center[0];\n  var centery = center[1];\n  var centerz = center[2];\n\n  if (Math.abs(eyex - centerx) < glMatrix.EPSILON && Math.abs(eyey - centery) < glMatrix.EPSILON && Math.abs(eyez - centerz) < glMatrix.EPSILON) {\n    return identity(out);\n  }\n\n  z0 = eyex - centerx;\n  z1 = eyey - centery;\n  z2 = eyez - centerz;\n  len = 1 / Math.hypot(z0, z1, z2);\n  z0 *= len;\n  z1 *= len;\n  z2 *= len;\n  x0 = upy * z2 - upz * z1;\n  x1 = upz * z0 - upx * z2;\n  x2 = upx * z1 - upy * z0;\n  len = Math.hypot(x0, x1, x2);\n\n  if (!len) {\n    x0 = 0;\n    x1 = 0;\n    x2 = 0;\n  } else {\n    len = 1 / len;\n    x0 *= len;\n    x1 *= len;\n    x2 *= len;\n  }\n\n  y0 = z1 * x2 - z2 * x1;\n  y1 = z2 * x0 - z0 * x2;\n  y2 = z0 * x1 - z1 * x0;\n  len = Math.hypot(y0, y1, y2);\n\n  if (!len) {\n    y0 = 0;\n    y1 = 0;\n    y2 = 0;\n  } else {\n    len = 1 / len;\n    y0 *= len;\n    y1 *= len;\n    y2 *= len;\n  }\n\n  out[0] = x0;\n  out[1] = y0;\n  out[2] = z0;\n  out[3] = 0;\n  out[4] = x1;\n  out[5] = y1;\n  out[6] = z1;\n  out[7] = 0;\n  out[8] = x2;\n  out[9] = y2;\n  out[10] = z2;\n  out[11] = 0;\n  out[12] = -(x0 * eyex + x1 * eyey + x2 * eyez);\n  out[13] = -(y0 * eyex + y1 * eyey + y2 * eyez);\n  out[14] = -(z0 * eyex + z1 * eyey + z2 * eyez);\n  out[15] = 1;\n  return out;\n}\n/**\n * Generates a matrix that makes something look at something else.\n *\n * @param {mat4} out mat4 frustum matrix will be written into\n * @param {ReadonlyVec3} eye Position of the viewer\n * @param {ReadonlyVec3} center Point the viewer is looking at\n * @param {ReadonlyVec3} up vec3 pointing up\n * @returns {mat4} out\n */\n\nexport function targetTo(out, eye, target, up) {\n  var eyex = eye[0],\n      eyey = eye[1],\n      eyez = eye[2],\n      upx = up[0],\n      upy = up[1],\n      upz = up[2];\n  var z0 = eyex - target[0],\n      z1 = eyey - target[1],\n      z2 = eyez - target[2];\n  var len = z0 * z0 + z1 * z1 + z2 * z2;\n\n  if (len > 0) {\n    len = 1 / Math.sqrt(len);\n    z0 *= len;\n    z1 *= len;\n    z2 *= len;\n  }\n\n  var x0 = upy * z2 - upz * z1,\n      x1 = upz * z0 - upx * z2,\n      x2 = upx * z1 - upy * z0;\n  len = x0 * x0 + x1 * x1 + x2 * x2;\n\n  if (len > 0) {\n    len = 1 / Math.sqrt(len);\n    x0 *= len;\n    x1 *= len;\n    x2 *= len;\n  }\n\n  out[0] = x0;\n  out[1] = x1;\n  out[2] = x2;\n  out[3] = 0;\n  out[4] = z1 * x2 - z2 * x1;\n  out[5] = z2 * x0 - z0 * x2;\n  out[6] = z0 * x1 - z1 * x0;\n  out[7] = 0;\n  out[8] = z0;\n  out[9] = z1;\n  out[10] = z2;\n  out[11] = 0;\n  out[12] = eyex;\n  out[13] = eyey;\n  out[14] = eyez;\n  out[15] = 1;\n  return out;\n}\n/**\n * Returns a string representation of a mat4\n *\n * @param {ReadonlyMat4} a matrix to represent as a string\n * @returns {String} string representation of the matrix\n */\n\nexport function str(a) {\n  return \"mat4(\" + a[0] + \", \" + a[1] + \", \" + a[2] + \", \" + a[3] + \", \" + a[4] + \", \" + a[5] + \", \" + a[6] + \", \" + a[7] + \", \" + a[8] + \", \" + a[9] + \", \" + a[10] + \", \" + a[11] + \", \" + a[12] + \", \" + a[13] + \", \" + a[14] + \", \" + a[15] + \")\";\n}\n/**\n * Returns Frobenius norm of a mat4\n *\n * @param {ReadonlyMat4} a the matrix to calculate Frobenius norm of\n * @returns {Number} Frobenius norm\n */\n\nexport function frob(a) {\n  return Math.hypot(a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9], a[10], a[11], a[12], a[13], a[14], a[15]);\n}\n/**\n * Adds two mat4's\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @returns {mat4} out\n */\n\nexport function add(out, a, b) {\n  out[0] = a[0] + b[0];\n  out[1] = a[1] + b[1];\n  out[2] = a[2] + b[2];\n  out[3] = a[3] + b[3];\n  out[4] = a[4] + b[4];\n  out[5] = a[5] + b[5];\n  out[6] = a[6] + b[6];\n  out[7] = a[7] + b[7];\n  out[8] = a[8] + b[8];\n  out[9] = a[9] + b[9];\n  out[10] = a[10] + b[10];\n  out[11] = a[11] + b[11];\n  out[12] = a[12] + b[12];\n  out[13] = a[13] + b[13];\n  out[14] = a[14] + b[14];\n  out[15] = a[15] + b[15];\n  return out;\n}\n/**\n * Subtracts matrix b from matrix a\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @returns {mat4} out\n */\n\nexport function subtract(out, a, b) {\n  out[0] = a[0] - b[0];\n  out[1] = a[1] - b[1];\n  out[2] = a[2] - b[2];\n  out[3] = a[3] - b[3];\n  out[4] = a[4] - b[4];\n  out[5] = a[5] - b[5];\n  out[6] = a[6] - b[6];\n  out[7] = a[7] - b[7];\n  out[8] = a[8] - b[8];\n  out[9] = a[9] - b[9];\n  out[10] = a[10] - b[10];\n  out[11] = a[11] - b[11];\n  out[12] = a[12] - b[12];\n  out[13] = a[13] - b[13];\n  out[14] = a[14] - b[14];\n  out[15] = a[15] - b[15];\n  return out;\n}\n/**\n * Multiply each element of the matrix by a scalar.\n *\n * @param {mat4} out the receiving matrix\n * @param {ReadonlyMat4} a the matrix to scale\n * @param {Number} b amount to scale the matrix's elements by\n * @returns {mat4} out\n */\n\nexport function multiplyScalar(out, a, b) {\n  out[0] = a[0] * b;\n  out[1] = a[1] * b;\n  out[2] = a[2] * b;\n  out[3] = a[3] * b;\n  out[4] = a[4] * b;\n  out[5] = a[5] * b;\n  out[6] = a[6] * b;\n  out[7] = a[7] * b;\n  out[8] = a[8] * b;\n  out[9] = a[9] * b;\n  out[10] = a[10] * b;\n  out[11] = a[11] * b;\n  out[12] = a[12] * b;\n  out[13] = a[13] * b;\n  out[14] = a[14] * b;\n  out[15] = a[15] * b;\n  return out;\n}\n/**\n * Adds two mat4's after multiplying each element of the second operand by a scalar value.\n *\n * @param {mat4} out the receiving vector\n * @param {ReadonlyMat4} a the first operand\n * @param {ReadonlyMat4} b the second operand\n * @param {Number} scale the amount to scale b's elements by before adding\n * @returns {mat4} out\n */\n\nexport function multiplyScalarAndAdd(out, a, b, scale) {\n  out[0] = a[0] + b[0] * scale;\n  out[1] = a[1] + b[1] * scale;\n  out[2] = a[2] + b[2] * scale;\n  out[3] = a[3] + b[3] * scale;\n  out[4] = a[4] + b[4] * scale;\n  out[5] = a[5] + b[5] * scale;\n  out[6] = a[6] + b[6] * scale;\n  out[7] = a[7] + b[7] * scale;\n  out[8] = a[8] + b[8] * scale;\n  out[9] = a[9] + b[9] * scale;\n  out[10] = a[10] + b[10] * scale;\n  out[11] = a[11] + b[11] * scale;\n  out[12] = a[12] + b[12] * scale;\n  out[13] = a[13] + b[13] * scale;\n  out[14] = a[14] + b[14] * scale;\n  out[15] = a[15] + b[15] * scale;\n  return out;\n}\n/**\n * Returns whether or not the matrices have exactly the same elements in the same position (when compared with ===)\n *\n * @param {ReadonlyMat4} a The first matrix.\n * @param {ReadonlyMat4} b The second matrix.\n * @returns {Boolean} True if the matrices are equal, false otherwise.\n */\n\nexport function exactEquals(a, b) {\n  return a[0] === b[0] && a[1] === b[1] && a[2] === b[2] && a[3] === b[3] && a[4] === b[4] && a[5] === b[5] && a[6] === b[6] && a[7] === b[7] && a[8] === b[8] && a[9] === b[9] && a[10] === b[10] && a[11] === b[11] && a[12] === b[12] && a[13] === b[13] && a[14] === b[14] && a[15] === b[15];\n}\n/**\n * Returns whether or not the matrices have approximately the same elements in the same position.\n *\n * @param {ReadonlyMat4} a The first matrix.\n * @param {ReadonlyMat4} b The second matrix.\n * @returns {Boolean} True if the matrices are equal, false otherwise.\n */\n\nexport function equals(a, b) {\n  var a0 = a[0],\n      a1 = a[1],\n      a2 = a[2],\n      a3 = a[3];\n  var a4 = a[4],\n      a5 = a[5],\n      a6 = a[6],\n      a7 = a[7];\n  var a8 = a[8],\n      a9 = a[9],\n      a10 = a[10],\n      a11 = a[11];\n  var a12 = a[12],\n      a13 = a[13],\n      a14 = a[14],\n      a15 = a[15];\n  var b0 = b[0],\n      b1 = b[1],\n      b2 = b[2],\n      b3 = b[3];\n  var b4 = b[4],\n      b5 = b[5],\n      b6 = b[6],\n      b7 = b[7];\n  var b8 = b[8],\n      b9 = b[9],\n      b10 = b[10],\n      b11 = b[11];\n  var b12 = b[12],\n      b13 = b[13],\n      b14 = b[14],\n      b15 = b[15];\n  return Math.abs(a0 - b0) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a0), Math.abs(b0)) && Math.abs(a1 - b1) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a1), Math.abs(b1)) && Math.abs(a2 - b2) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a2), Math.abs(b2)) && Math.abs(a3 - b3) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a3), Math.abs(b3)) && Math.abs(a4 - b4) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a4), Math.abs(b4)) && Math.abs(a5 - b5) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a5), Math.abs(b5)) && Math.abs(a6 - b6) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a6), Math.abs(b6)) && Math.abs(a7 - b7) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a7), Math.abs(b7)) && Math.abs(a8 - b8) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a8), Math.abs(b8)) && Math.abs(a9 - b9) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a9), Math.abs(b9)) && Math.abs(a10 - b10) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a10), Math.abs(b10)) && Math.abs(a11 - b11) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a11), Math.abs(b11)) && Math.abs(a12 - b12) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a12), Math.abs(b12)) && Math.abs(a13 - b13) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a13), Math.abs(b13)) && Math.abs(a14 - b14) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a14), Math.abs(b14)) && Math.abs(a15 - b15) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a15), Math.abs(b15));\n}\n/**\n * Alias for {@link mat4.multiply}\n * @function\n */\n\nexport var mul = multiply;\n/**\n * Alias for {@link mat4.subtract}\n * @function\n */\n\nexport var sub = subtract;","import * as glMatrix from \"./common.js\";\nimport * as mat3 from \"./mat3.js\";\nimport * as vec3 from \"./vec3.js\";\nimport * as vec4 from \"./vec4.js\";\n/**\n * Quaternion\n * @module quat\n */\n\n/**\n * Creates a new identity quat\n *\n * @returns {quat} a new quaternion\n */\n\nexport function create() {\n  var out = new glMatrix.ARRAY_TYPE(4);\n\n  if (glMatrix.ARRAY_TYPE != Float32Array) {\n    out[0] = 0;\n    out[1] = 0;\n    out[2] = 0;\n  }\n\n  out[3] = 1;\n  return out;\n}\n/**\n * Set a quat to the identity quaternion\n *\n * @param {quat} out the receiving quaternion\n * @returns {quat} out\n */\n\nexport function identity(out) {\n  out[0] = 0;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 1;\n  return out;\n}\n/**\n * Sets a quat from the given angle and rotation axis,\n * then returns it.\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyVec3} axis the axis around which to rotate\n * @param {Number} rad the angle in radians\n * @returns {quat} out\n **/\n\nexport function setAxisAngle(out, axis, rad) {\n  rad = rad * 0.5;\n  var s = Math.sin(rad);\n  out[0] = s * axis[0];\n  out[1] = s * axis[1];\n  out[2] = s * axis[2];\n  out[3] = Math.cos(rad);\n  return out;\n}\n/**\n * Gets the rotation axis and angle for a given\n *  quaternion. If a quaternion is created with\n *  setAxisAngle, this method will return the same\n *  values as providied in the original parameter list\n *  OR functionally equivalent values.\n * Example: The quaternion formed by axis [0, 0, 1] and\n *  angle -90 is the same as the quaternion formed by\n *  [0, 0, 1] and 270. This method favors the latter.\n * @param  {vec3} out_axis  Vector receiving the axis of rotation\n * @param  {ReadonlyQuat} q     Quaternion to be decomposed\n * @return {Number}     Angle, in radians, of the rotation\n */\n\nexport function getAxisAngle(out_axis, q) {\n  var rad = Math.acos(q[3]) * 2.0;\n  var s = Math.sin(rad / 2.0);\n\n  if (s > glMatrix.EPSILON) {\n    out_axis[0] = q[0] / s;\n    out_axis[1] = q[1] / s;\n    out_axis[2] = q[2] / s;\n  } else {\n    // If s is zero, return any axis (no rotation - axis does not matter)\n    out_axis[0] = 1;\n    out_axis[1] = 0;\n    out_axis[2] = 0;\n  }\n\n  return rad;\n}\n/**\n * Gets the angular distance between two unit quaternions\n *\n * @param  {ReadonlyQuat} a     Origin unit quaternion\n * @param  {ReadonlyQuat} b     Destination unit quaternion\n * @return {Number}     Angle, in radians, between the two quaternions\n */\n\nexport function getAngle(a, b) {\n  var dotproduct = dot(a, b);\n  return Math.acos(2 * dotproduct * dotproduct - 1);\n}\n/**\n * Multiplies two quat's\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a the first operand\n * @param {ReadonlyQuat} b the second operand\n * @returns {quat} out\n */\n\nexport function multiply(out, a, b) {\n  var ax = a[0],\n      ay = a[1],\n      az = a[2],\n      aw = a[3];\n  var bx = b[0],\n      by = b[1],\n      bz = b[2],\n      bw = b[3];\n  out[0] = ax * bw + aw * bx + ay * bz - az * by;\n  out[1] = ay * bw + aw * by + az * bx - ax * bz;\n  out[2] = az * bw + aw * bz + ax * by - ay * bx;\n  out[3] = aw * bw - ax * bx - ay * by - az * bz;\n  return out;\n}\n/**\n * Rotates a quaternion by the given angle about the X axis\n *\n * @param {quat} out quat receiving operation result\n * @param {ReadonlyQuat} a quat to rotate\n * @param {number} rad angle (in radians) to rotate\n * @returns {quat} out\n */\n\nexport function rotateX(out, a, rad) {\n  rad *= 0.5;\n  var ax = a[0],\n      ay = a[1],\n      az = a[2],\n      aw = a[3];\n  var bx = Math.sin(rad),\n      bw = Math.cos(rad);\n  out[0] = ax * bw + aw * bx;\n  out[1] = ay * bw + az * bx;\n  out[2] = az * bw - ay * bx;\n  out[3] = aw * bw - ax * bx;\n  return out;\n}\n/**\n * Rotates a quaternion by the given angle about the Y axis\n *\n * @param {quat} out quat receiving operation result\n * @param {ReadonlyQuat} a quat to rotate\n * @param {number} rad angle (in radians) to rotate\n * @returns {quat} out\n */\n\nexport function rotateY(out, a, rad) {\n  rad *= 0.5;\n  var ax = a[0],\n      ay = a[1],\n      az = a[2],\n      aw = a[3];\n  var by = Math.sin(rad),\n      bw = Math.cos(rad);\n  out[0] = ax * bw - az * by;\n  out[1] = ay * bw + aw * by;\n  out[2] = az * bw + ax * by;\n  out[3] = aw * bw - ay * by;\n  return out;\n}\n/**\n * Rotates a quaternion by the given angle about the Z axis\n *\n * @param {quat} out quat receiving operation result\n * @param {ReadonlyQuat} a quat to rotate\n * @param {number} rad angle (in radians) to rotate\n * @returns {quat} out\n */\n\nexport function rotateZ(out, a, rad) {\n  rad *= 0.5;\n  var ax = a[0],\n      ay = a[1],\n      az = a[2],\n      aw = a[3];\n  var bz = Math.sin(rad),\n      bw = Math.cos(rad);\n  out[0] = ax * bw + ay * bz;\n  out[1] = ay * bw - ax * bz;\n  out[2] = az * bw + aw * bz;\n  out[3] = aw * bw - az * bz;\n  return out;\n}\n/**\n * Calculates the W component of a quat from the X, Y, and Z components.\n * Assumes that quaternion is 1 unit in length.\n * Any existing W component will be ignored.\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a quat to calculate W component of\n * @returns {quat} out\n */\n\nexport function calculateW(out, a) {\n  var x = a[0],\n      y = a[1],\n      z = a[2];\n  out[0] = x;\n  out[1] = y;\n  out[2] = z;\n  out[3] = Math.sqrt(Math.abs(1.0 - x * x - y * y - z * z));\n  return out;\n}\n/**\n * Calculate the exponential of a unit quaternion.\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a quat to calculate the exponential of\n * @returns {quat} out\n */\n\nexport function exp(out, a) {\n  var x = a[0],\n      y = a[1],\n      z = a[2],\n      w = a[3];\n  var r = Math.sqrt(x * x + y * y + z * z);\n  var et = Math.exp(w);\n  var s = r > 0 ? et * Math.sin(r) / r : 0;\n  out[0] = x * s;\n  out[1] = y * s;\n  out[2] = z * s;\n  out[3] = et * Math.cos(r);\n  return out;\n}\n/**\n * Calculate the natural logarithm of a unit quaternion.\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a quat to calculate the exponential of\n * @returns {quat} out\n */\n\nexport function ln(out, a) {\n  var x = a[0],\n      y = a[1],\n      z = a[2],\n      w = a[3];\n  var r = Math.sqrt(x * x + y * y + z * z);\n  var t = r > 0 ? Math.atan2(r, w) / r : 0;\n  out[0] = x * t;\n  out[1] = y * t;\n  out[2] = z * t;\n  out[3] = 0.5 * Math.log(x * x + y * y + z * z + w * w);\n  return out;\n}\n/**\n * Calculate the scalar power of a unit quaternion.\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a quat to calculate the exponential of\n * @param {Number} b amount to scale the quaternion by\n * @returns {quat} out\n */\n\nexport function pow(out, a, b) {\n  ln(out, a);\n  scale(out, out, b);\n  exp(out, out);\n  return out;\n}\n/**\n * Performs a spherical linear interpolation between two quat\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a the first operand\n * @param {ReadonlyQuat} b the second operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {quat} out\n */\n\nexport function slerp(out, a, b, t) {\n  // benchmarks:\n  //    http://jsperf.com/quaternion-slerp-implementations\n  var ax = a[0],\n      ay = a[1],\n      az = a[2],\n      aw = a[3];\n  var bx = b[0],\n      by = b[1],\n      bz = b[2],\n      bw = b[3];\n  var omega, cosom, sinom, scale0, scale1; // calc cosine\n\n  cosom = ax * bx + ay * by + az * bz + aw * bw; // adjust signs (if necessary)\n\n  if (cosom < 0.0) {\n    cosom = -cosom;\n    bx = -bx;\n    by = -by;\n    bz = -bz;\n    bw = -bw;\n  } // calculate coefficients\n\n\n  if (1.0 - cosom > glMatrix.EPSILON) {\n    // standard case (slerp)\n    omega = Math.acos(cosom);\n    sinom = Math.sin(omega);\n    scale0 = Math.sin((1.0 - t) * omega) / sinom;\n    scale1 = Math.sin(t * omega) / sinom;\n  } else {\n    // \"from\" and \"to\" quaternions are very close\n    //  ... so we can do a linear interpolation\n    scale0 = 1.0 - t;\n    scale1 = t;\n  } // calculate final values\n\n\n  out[0] = scale0 * ax + scale1 * bx;\n  out[1] = scale0 * ay + scale1 * by;\n  out[2] = scale0 * az + scale1 * bz;\n  out[3] = scale0 * aw + scale1 * bw;\n  return out;\n}\n/**\n * Generates a random unit quaternion\n *\n * @param {quat} out the receiving quaternion\n * @returns {quat} out\n */\n\nexport function random(out) {\n  // Implementation of http://planning.cs.uiuc.edu/node198.html\n  // TODO: Calling random 3 times is probably not the fastest solution\n  var u1 = glMatrix.RANDOM();\n  var u2 = glMatrix.RANDOM();\n  var u3 = glMatrix.RANDOM();\n  var sqrt1MinusU1 = Math.sqrt(1 - u1);\n  var sqrtU1 = Math.sqrt(u1);\n  out[0] = sqrt1MinusU1 * Math.sin(2.0 * Math.PI * u2);\n  out[1] = sqrt1MinusU1 * Math.cos(2.0 * Math.PI * u2);\n  out[2] = sqrtU1 * Math.sin(2.0 * Math.PI * u3);\n  out[3] = sqrtU1 * Math.cos(2.0 * Math.PI * u3);\n  return out;\n}\n/**\n * Calculates the inverse of a quat\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a quat to calculate inverse of\n * @returns {quat} out\n */\n\nexport function invert(out, a) {\n  var a0 = a[0],\n      a1 = a[1],\n      a2 = a[2],\n      a3 = a[3];\n  var dot = a0 * a0 + a1 * a1 + a2 * a2 + a3 * a3;\n  var invDot = dot ? 1.0 / dot : 0; // TODO: Would be faster to return [0,0,0,0] immediately if dot == 0\n\n  out[0] = -a0 * invDot;\n  out[1] = -a1 * invDot;\n  out[2] = -a2 * invDot;\n  out[3] = a3 * invDot;\n  return out;\n}\n/**\n * Calculates the conjugate of a quat\n * If the quaternion is normalized, this function is faster than quat.inverse and produces the same result.\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a quat to calculate conjugate of\n * @returns {quat} out\n */\n\nexport function conjugate(out, a) {\n  out[0] = -a[0];\n  out[1] = -a[1];\n  out[2] = -a[2];\n  out[3] = a[3];\n  return out;\n}\n/**\n * Creates a quaternion from the given 3x3 rotation matrix.\n *\n * NOTE: The resultant quaternion is not normalized, so you should be sure\n * to renormalize the quaternion yourself where necessary.\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyMat3} m rotation matrix\n * @returns {quat} out\n * @function\n */\n\nexport function fromMat3(out, m) {\n  // Algorithm in Ken Shoemake's article in 1987 SIGGRAPH course notes\n  // article \"Quaternion Calculus and Fast Animation\".\n  var fTrace = m[0] + m[4] + m[8];\n  var fRoot;\n\n  if (fTrace > 0.0) {\n    // |w| > 1/2, may as well choose w > 1/2\n    fRoot = Math.sqrt(fTrace + 1.0); // 2w\n\n    out[3] = 0.5 * fRoot;\n    fRoot = 0.5 / fRoot; // 1/(4w)\n\n    out[0] = (m[5] - m[7]) * fRoot;\n    out[1] = (m[6] - m[2]) * fRoot;\n    out[2] = (m[1] - m[3]) * fRoot;\n  } else {\n    // |w| <= 1/2\n    var i = 0;\n    if (m[4] > m[0]) i = 1;\n    if (m[8] > m[i * 3 + i]) i = 2;\n    var j = (i + 1) % 3;\n    var k = (i + 2) % 3;\n    fRoot = Math.sqrt(m[i * 3 + i] - m[j * 3 + j] - m[k * 3 + k] + 1.0);\n    out[i] = 0.5 * fRoot;\n    fRoot = 0.5 / fRoot;\n    out[3] = (m[j * 3 + k] - m[k * 3 + j]) * fRoot;\n    out[j] = (m[j * 3 + i] + m[i * 3 + j]) * fRoot;\n    out[k] = (m[k * 3 + i] + m[i * 3 + k]) * fRoot;\n  }\n\n  return out;\n}\n/**\n * Creates a quaternion from the given euler angle x, y, z.\n *\n * @param {quat} out the receiving quaternion\n * @param {x} Angle to rotate around X axis in degrees.\n * @param {y} Angle to rotate around Y axis in degrees.\n * @param {z} Angle to rotate around Z axis in degrees.\n * @returns {quat} out\n * @function\n */\n\nexport function fromEuler(out, x, y, z) {\n  var halfToRad = 0.5 * Math.PI / 180.0;\n  x *= halfToRad;\n  y *= halfToRad;\n  z *= halfToRad;\n  var sx = Math.sin(x);\n  var cx = Math.cos(x);\n  var sy = Math.sin(y);\n  var cy = Math.cos(y);\n  var sz = Math.sin(z);\n  var cz = Math.cos(z);\n  out[0] = sx * cy * cz - cx * sy * sz;\n  out[1] = cx * sy * cz + sx * cy * sz;\n  out[2] = cx * cy * sz - sx * sy * cz;\n  out[3] = cx * cy * cz + sx * sy * sz;\n  return out;\n}\n/**\n * Returns a string representation of a quatenion\n *\n * @param {ReadonlyQuat} a vector to represent as a string\n * @returns {String} string representation of the vector\n */\n\nexport function str(a) {\n  return \"quat(\" + a[0] + \", \" + a[1] + \", \" + a[2] + \", \" + a[3] + \")\";\n}\n/**\n * Creates a new quat initialized with values from an existing quaternion\n *\n * @param {ReadonlyQuat} a quaternion to clone\n * @returns {quat} a new quaternion\n * @function\n */\n\nexport var clone = vec4.clone;\n/**\n * Creates a new quat initialized with the given values\n *\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @param {Number} w W component\n * @returns {quat} a new quaternion\n * @function\n */\n\nexport var fromValues = vec4.fromValues;\n/**\n * Copy the values from one quat to another\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a the source quaternion\n * @returns {quat} out\n * @function\n */\n\nexport var copy = vec4.copy;\n/**\n * Set the components of a quat to the given values\n *\n * @param {quat} out the receiving quaternion\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @param {Number} w W component\n * @returns {quat} out\n * @function\n */\n\nexport var set = vec4.set;\n/**\n * Adds two quat's\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a the first operand\n * @param {ReadonlyQuat} b the second operand\n * @returns {quat} out\n * @function\n */\n\nexport var add = vec4.add;\n/**\n * Alias for {@link quat.multiply}\n * @function\n */\n\nexport var mul = multiply;\n/**\n * Scales a quat by a scalar number\n *\n * @param {quat} out the receiving vector\n * @param {ReadonlyQuat} a the vector to scale\n * @param {Number} b amount to scale the vector by\n * @returns {quat} out\n * @function\n */\n\nexport var scale = vec4.scale;\n/**\n * Calculates the dot product of two quat's\n *\n * @param {ReadonlyQuat} a the first operand\n * @param {ReadonlyQuat} b the second operand\n * @returns {Number} dot product of a and b\n * @function\n */\n\nexport var dot = vec4.dot;\n/**\n * Performs a linear interpolation between two quat's\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a the first operand\n * @param {ReadonlyQuat} b the second operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {quat} out\n * @function\n */\n\nexport var lerp = vec4.lerp;\n/**\n * Calculates the length of a quat\n *\n * @param {ReadonlyQuat} a vector to calculate length of\n * @returns {Number} length of a\n */\n\nexport var length = vec4.length;\n/**\n * Alias for {@link quat.length}\n * @function\n */\n\nexport var len = length;\n/**\n * Calculates the squared length of a quat\n *\n * @param {ReadonlyQuat} a vector to calculate squared length of\n * @returns {Number} squared length of a\n * @function\n */\n\nexport var squaredLength = vec4.squaredLength;\n/**\n * Alias for {@link quat.squaredLength}\n * @function\n */\n\nexport var sqrLen = squaredLength;\n/**\n * Normalize a quat\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a quaternion to normalize\n * @returns {quat} out\n * @function\n */\n\nexport var normalize = vec4.normalize;\n/**\n * Returns whether or not the quaternions have exactly the same elements in the same position (when compared with ===)\n *\n * @param {ReadonlyQuat} a The first quaternion.\n * @param {ReadonlyQuat} b The second quaternion.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport var exactEquals = vec4.exactEquals;\n/**\n * Returns whether or not the quaternions have approximately the same elements in the same position.\n *\n * @param {ReadonlyQuat} a The first vector.\n * @param {ReadonlyQuat} b The second vector.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport var equals = vec4.equals;\n/**\n * Sets a quaternion to represent the shortest rotation from one\n * vector to another.\n *\n * Both vectors are assumed to be unit length.\n *\n * @param {quat} out the receiving quaternion.\n * @param {ReadonlyVec3} a the initial vector\n * @param {ReadonlyVec3} b the destination vector\n * @returns {quat} out\n */\n\nexport var rotationTo = function () {\n  var tmpvec3 = vec3.create();\n  var xUnitVec3 = vec3.fromValues(1, 0, 0);\n  var yUnitVec3 = vec3.fromValues(0, 1, 0);\n  return function (out, a, b) {\n    var dot = vec3.dot(a, b);\n\n    if (dot < -0.999999) {\n      vec3.cross(tmpvec3, xUnitVec3, a);\n      if (vec3.len(tmpvec3) < 0.000001) vec3.cross(tmpvec3, yUnitVec3, a);\n      vec3.normalize(tmpvec3, tmpvec3);\n      setAxisAngle(out, tmpvec3, Math.PI);\n      return out;\n    } else if (dot > 0.999999) {\n      out[0] = 0;\n      out[1] = 0;\n      out[2] = 0;\n      out[3] = 1;\n      return out;\n    } else {\n      vec3.cross(tmpvec3, a, b);\n      out[0] = tmpvec3[0];\n      out[1] = tmpvec3[1];\n      out[2] = tmpvec3[2];\n      out[3] = 1 + dot;\n      return normalize(out, out);\n    }\n  };\n}();\n/**\n * Performs a spherical linear interpolation with two control points\n *\n * @param {quat} out the receiving quaternion\n * @param {ReadonlyQuat} a the first operand\n * @param {ReadonlyQuat} b the second operand\n * @param {ReadonlyQuat} c the third operand\n * @param {ReadonlyQuat} d the fourth operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {quat} out\n */\n\nexport var sqlerp = function () {\n  var temp1 = create();\n  var temp2 = create();\n  return function (out, a, b, c, d, t) {\n    slerp(temp1, a, d, t);\n    slerp(temp2, b, c, t);\n    slerp(out, temp1, temp2, 2 * t * (1 - t));\n    return out;\n  };\n}();\n/**\n * Sets the specified quaternion with values corresponding to the given\n * axes. Each axis is a vec3 and is expected to be unit length and\n * perpendicular to all other specified axes.\n *\n * @param {ReadonlyVec3} view  the vector representing the viewing direction\n * @param {ReadonlyVec3} right the vector representing the local \"right\" direction\n * @param {ReadonlyVec3} up    the vector representing the local \"up\" direction\n * @returns {quat} out\n */\n\nexport var setAxes = function () {\n  var matr = mat3.create();\n  return function (out, view, right, up) {\n    matr[0] = right[0];\n    matr[3] = right[1];\n    matr[6] = right[2];\n    matr[1] = up[0];\n    matr[4] = up[1];\n    matr[7] = up[2];\n    matr[2] = -view[0];\n    matr[5] = -view[1];\n    matr[8] = -view[2];\n    return normalize(out, fromMat3(out, matr));\n  };\n}();","import * as glMatrix from \"./common.js\";\n/**\n * 4 Dimensional Vector\n * @module vec4\n */\n\n/**\n * Creates a new, empty vec4\n *\n * @returns {vec4} a new 4D vector\n */\n\nexport function create() {\n  var out = new glMatrix.ARRAY_TYPE(4);\n\n  if (glMatrix.ARRAY_TYPE != Float32Array) {\n    out[0] = 0;\n    out[1] = 0;\n    out[2] = 0;\n    out[3] = 0;\n  }\n\n  return out;\n}\n/**\n * Creates a new vec4 initialized with values from an existing vector\n *\n * @param {ReadonlyVec4} a vector to clone\n * @returns {vec4} a new 4D vector\n */\n\nexport function clone(a) {\n  var out = new glMatrix.ARRAY_TYPE(4);\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  out[3] = a[3];\n  return out;\n}\n/**\n * Creates a new vec4 initialized with the given values\n *\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @param {Number} w W component\n * @returns {vec4} a new 4D vector\n */\n\nexport function fromValues(x, y, z, w) {\n  var out = new glMatrix.ARRAY_TYPE(4);\n  out[0] = x;\n  out[1] = y;\n  out[2] = z;\n  out[3] = w;\n  return out;\n}\n/**\n * Copy the values from one vec4 to another\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the source vector\n * @returns {vec4} out\n */\n\nexport function copy(out, a) {\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  out[3] = a[3];\n  return out;\n}\n/**\n * Set the components of a vec4 to the given values\n *\n * @param {vec4} out the receiving vector\n * @param {Number} x X component\n * @param {Number} y Y component\n * @param {Number} z Z component\n * @param {Number} w W component\n * @returns {vec4} out\n */\n\nexport function set(out, x, y, z, w) {\n  out[0] = x;\n  out[1] = y;\n  out[2] = z;\n  out[3] = w;\n  return out;\n}\n/**\n * Adds two vec4's\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {vec4} out\n */\n\nexport function add(out, a, b) {\n  out[0] = a[0] + b[0];\n  out[1] = a[1] + b[1];\n  out[2] = a[2] + b[2];\n  out[3] = a[3] + b[3];\n  return out;\n}\n/**\n * Subtracts vector b from vector a\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {vec4} out\n */\n\nexport function subtract(out, a, b) {\n  out[0] = a[0] - b[0];\n  out[1] = a[1] - b[1];\n  out[2] = a[2] - b[2];\n  out[3] = a[3] - b[3];\n  return out;\n}\n/**\n * Multiplies two vec4's\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {vec4} out\n */\n\nexport function multiply(out, a, b) {\n  out[0] = a[0] * b[0];\n  out[1] = a[1] * b[1];\n  out[2] = a[2] * b[2];\n  out[3] = a[3] * b[3];\n  return out;\n}\n/**\n * Divides two vec4's\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {vec4} out\n */\n\nexport function divide(out, a, b) {\n  out[0] = a[0] / b[0];\n  out[1] = a[1] / b[1];\n  out[2] = a[2] / b[2];\n  out[3] = a[3] / b[3];\n  return out;\n}\n/**\n * Math.ceil the components of a vec4\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a vector to ceil\n * @returns {vec4} out\n */\n\nexport function ceil(out, a) {\n  out[0] = Math.ceil(a[0]);\n  out[1] = Math.ceil(a[1]);\n  out[2] = Math.ceil(a[2]);\n  out[3] = Math.ceil(a[3]);\n  return out;\n}\n/**\n * Math.floor the components of a vec4\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a vector to floor\n * @returns {vec4} out\n */\n\nexport function floor(out, a) {\n  out[0] = Math.floor(a[0]);\n  out[1] = Math.floor(a[1]);\n  out[2] = Math.floor(a[2]);\n  out[3] = Math.floor(a[3]);\n  return out;\n}\n/**\n * Returns the minimum of two vec4's\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {vec4} out\n */\n\nexport function min(out, a, b) {\n  out[0] = Math.min(a[0], b[0]);\n  out[1] = Math.min(a[1], b[1]);\n  out[2] = Math.min(a[2], b[2]);\n  out[3] = Math.min(a[3], b[3]);\n  return out;\n}\n/**\n * Returns the maximum of two vec4's\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {vec4} out\n */\n\nexport function max(out, a, b) {\n  out[0] = Math.max(a[0], b[0]);\n  out[1] = Math.max(a[1], b[1]);\n  out[2] = Math.max(a[2], b[2]);\n  out[3] = Math.max(a[3], b[3]);\n  return out;\n}\n/**\n * Math.round the components of a vec4\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a vector to round\n * @returns {vec4} out\n */\n\nexport function round(out, a) {\n  out[0] = Math.round(a[0]);\n  out[1] = Math.round(a[1]);\n  out[2] = Math.round(a[2]);\n  out[3] = Math.round(a[3]);\n  return out;\n}\n/**\n * Scales a vec4 by a scalar number\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the vector to scale\n * @param {Number} b amount to scale the vector by\n * @returns {vec4} out\n */\n\nexport function scale(out, a, b) {\n  out[0] = a[0] * b;\n  out[1] = a[1] * b;\n  out[2] = a[2] * b;\n  out[3] = a[3] * b;\n  return out;\n}\n/**\n * Adds two vec4's after scaling the second operand by a scalar value\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @param {Number} scale the amount to scale b by before adding\n * @returns {vec4} out\n */\n\nexport function scaleAndAdd(out, a, b, scale) {\n  out[0] = a[0] + b[0] * scale;\n  out[1] = a[1] + b[1] * scale;\n  out[2] = a[2] + b[2] * scale;\n  out[3] = a[3] + b[3] * scale;\n  return out;\n}\n/**\n * Calculates the euclidian distance between two vec4's\n *\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {Number} distance between a and b\n */\n\nexport function distance(a, b) {\n  var x = b[0] - a[0];\n  var y = b[1] - a[1];\n  var z = b[2] - a[2];\n  var w = b[3] - a[3];\n  return Math.hypot(x, y, z, w);\n}\n/**\n * Calculates the squared euclidian distance between two vec4's\n *\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {Number} squared distance between a and b\n */\n\nexport function squaredDistance(a, b) {\n  var x = b[0] - a[0];\n  var y = b[1] - a[1];\n  var z = b[2] - a[2];\n  var w = b[3] - a[3];\n  return x * x + y * y + z * z + w * w;\n}\n/**\n * Calculates the length of a vec4\n *\n * @param {ReadonlyVec4} a vector to calculate length of\n * @returns {Number} length of a\n */\n\nexport function length(a) {\n  var x = a[0];\n  var y = a[1];\n  var z = a[2];\n  var w = a[3];\n  return Math.hypot(x, y, z, w);\n}\n/**\n * Calculates the squared length of a vec4\n *\n * @param {ReadonlyVec4} a vector to calculate squared length of\n * @returns {Number} squared length of a\n */\n\nexport function squaredLength(a) {\n  var x = a[0];\n  var y = a[1];\n  var z = a[2];\n  var w = a[3];\n  return x * x + y * y + z * z + w * w;\n}\n/**\n * Negates the components of a vec4\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a vector to negate\n * @returns {vec4} out\n */\n\nexport function negate(out, a) {\n  out[0] = -a[0];\n  out[1] = -a[1];\n  out[2] = -a[2];\n  out[3] = -a[3];\n  return out;\n}\n/**\n * Returns the inverse of the components of a vec4\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a vector to invert\n * @returns {vec4} out\n */\n\nexport function inverse(out, a) {\n  out[0] = 1.0 / a[0];\n  out[1] = 1.0 / a[1];\n  out[2] = 1.0 / a[2];\n  out[3] = 1.0 / a[3];\n  return out;\n}\n/**\n * Normalize a vec4\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a vector to normalize\n * @returns {vec4} out\n */\n\nexport function normalize(out, a) {\n  var x = a[0];\n  var y = a[1];\n  var z = a[2];\n  var w = a[3];\n  var len = x * x + y * y + z * z + w * w;\n\n  if (len > 0) {\n    len = 1 / Math.sqrt(len);\n  }\n\n  out[0] = x * len;\n  out[1] = y * len;\n  out[2] = z * len;\n  out[3] = w * len;\n  return out;\n}\n/**\n * Calculates the dot product of two vec4's\n *\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @returns {Number} dot product of a and b\n */\n\nexport function dot(a, b) {\n  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2] + a[3] * b[3];\n}\n/**\n * Returns the cross-product of three vectors in a 4-dimensional space\n *\n * @param {ReadonlyVec4} result the receiving vector\n * @param {ReadonlyVec4} U the first vector\n * @param {ReadonlyVec4} V the second vector\n * @param {ReadonlyVec4} W the third vector\n * @returns {vec4} result\n */\n\nexport function cross(out, u, v, w) {\n  var A = v[0] * w[1] - v[1] * w[0],\n      B = v[0] * w[2] - v[2] * w[0],\n      C = v[0] * w[3] - v[3] * w[0],\n      D = v[1] * w[2] - v[2] * w[1],\n      E = v[1] * w[3] - v[3] * w[1],\n      F = v[2] * w[3] - v[3] * w[2];\n  var G = u[0];\n  var H = u[1];\n  var I = u[2];\n  var J = u[3];\n  out[0] = H * F - I * E + J * D;\n  out[1] = -(G * F) + I * C - J * B;\n  out[2] = G * E - H * C + J * A;\n  out[3] = -(G * D) + H * B - I * A;\n  return out;\n}\n/**\n * Performs a linear interpolation between two vec4's\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the first operand\n * @param {ReadonlyVec4} b the second operand\n * @param {Number} t interpolation amount, in the range [0-1], between the two inputs\n * @returns {vec4} out\n */\n\nexport function lerp(out, a, b, t) {\n  var ax = a[0];\n  var ay = a[1];\n  var az = a[2];\n  var aw = a[3];\n  out[0] = ax + t * (b[0] - ax);\n  out[1] = ay + t * (b[1] - ay);\n  out[2] = az + t * (b[2] - az);\n  out[3] = aw + t * (b[3] - aw);\n  return out;\n}\n/**\n * Generates a random vector with the given scale\n *\n * @param {vec4} out the receiving vector\n * @param {Number} [scale] Length of the resulting vector. If ommitted, a unit vector will be returned\n * @returns {vec4} out\n */\n\nexport function random(out, scale) {\n  scale = scale || 1.0; // Marsaglia, George. Choosing a Point from the Surface of a\n  // Sphere. Ann. Math. Statist. 43 (1972), no. 2, 645--646.\n  // http://projecteuclid.org/euclid.aoms/1177692644;\n\n  var v1, v2, v3, v4;\n  var s1, s2;\n\n  do {\n    v1 = glMatrix.RANDOM() * 2 - 1;\n    v2 = glMatrix.RANDOM() * 2 - 1;\n    s1 = v1 * v1 + v2 * v2;\n  } while (s1 >= 1);\n\n  do {\n    v3 = glMatrix.RANDOM() * 2 - 1;\n    v4 = glMatrix.RANDOM() * 2 - 1;\n    s2 = v3 * v3 + v4 * v4;\n  } while (s2 >= 1);\n\n  var d = Math.sqrt((1 - s1) / s2);\n  out[0] = scale * v1;\n  out[1] = scale * v2;\n  out[2] = scale * v3 * d;\n  out[3] = scale * v4 * d;\n  return out;\n}\n/**\n * Transforms the vec4 with a mat4.\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the vector to transform\n * @param {ReadonlyMat4} m matrix to transform with\n * @returns {vec4} out\n */\n\nexport function transformMat4(out, a, m) {\n  var x = a[0],\n      y = a[1],\n      z = a[2],\n      w = a[3];\n  out[0] = m[0] * x + m[4] * y + m[8] * z + m[12] * w;\n  out[1] = m[1] * x + m[5] * y + m[9] * z + m[13] * w;\n  out[2] = m[2] * x + m[6] * y + m[10] * z + m[14] * w;\n  out[3] = m[3] * x + m[7] * y + m[11] * z + m[15] * w;\n  return out;\n}\n/**\n * Transforms the vec4 with a quat\n *\n * @param {vec4} out the receiving vector\n * @param {ReadonlyVec4} a the vector to transform\n * @param {ReadonlyQuat} q quaternion to transform with\n * @returns {vec4} out\n */\n\nexport function transformQuat(out, a, q) {\n  var x = a[0],\n      y = a[1],\n      z = a[2];\n  var qx = q[0],\n      qy = q[1],\n      qz = q[2],\n      qw = q[3]; // calculate quat * vec\n\n  var ix = qw * x + qy * z - qz * y;\n  var iy = qw * y + qz * x - qx * z;\n  var iz = qw * z + qx * y - qy * x;\n  var iw = -qx * x - qy * y - qz * z; // calculate result * inverse quat\n\n  out[0] = ix * qw + iw * -qx + iy * -qz - iz * -qy;\n  out[1] = iy * qw + iw * -qy + iz * -qx - ix * -qz;\n  out[2] = iz * qw + iw * -qz + ix * -qy - iy * -qx;\n  out[3] = a[3];\n  return out;\n}\n/**\n * Set the components of a vec4 to zero\n *\n * @param {vec4} out the receiving vector\n * @returns {vec4} out\n */\n\nexport function zero(out) {\n  out[0] = 0.0;\n  out[1] = 0.0;\n  out[2] = 0.0;\n  out[3] = 0.0;\n  return out;\n}\n/**\n * Returns a string representation of a vector\n *\n * @param {ReadonlyVec4} a vector to represent as a string\n * @returns {String} string representation of the vector\n */\n\nexport function str(a) {\n  return \"vec4(\" + a[0] + \", \" + a[1] + \", \" + a[2] + \", \" + a[3] + \")\";\n}\n/**\n * Returns whether or not the vectors have exactly the same elements in the same position (when compared with ===)\n *\n * @param {ReadonlyVec4} a The first vector.\n * @param {ReadonlyVec4} b The second vector.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport function exactEquals(a, b) {\n  return a[0] === b[0] && a[1] === b[1] && a[2] === b[2] && a[3] === b[3];\n}\n/**\n * Returns whether or not the vectors have approximately the same elements in the same position.\n *\n * @param {ReadonlyVec4} a The first vector.\n * @param {ReadonlyVec4} b The second vector.\n * @returns {Boolean} True if the vectors are equal, false otherwise.\n */\n\nexport function equals(a, b) {\n  var a0 = a[0],\n      a1 = a[1],\n      a2 = a[2],\n      a3 = a[3];\n  var b0 = b[0],\n      b1 = b[1],\n      b2 = b[2],\n      b3 = b[3];\n  return Math.abs(a0 - b0) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a0), Math.abs(b0)) && Math.abs(a1 - b1) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a1), Math.abs(b1)) && Math.abs(a2 - b2) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a2), Math.abs(b2)) && Math.abs(a3 - b3) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a3), Math.abs(b3));\n}\n/**\n * Alias for {@link vec4.subtract}\n * @function\n */\n\nexport var sub = subtract;\n/**\n * Alias for {@link vec4.multiply}\n * @function\n */\n\nexport var mul = multiply;\n/**\n * Alias for {@link vec4.divide}\n * @function\n */\n\nexport var div = divide;\n/**\n * Alias for {@link vec4.distance}\n * @function\n */\n\nexport var dist = distance;\n/**\n * Alias for {@link vec4.squaredDistance}\n * @function\n */\n\nexport var sqrDist = squaredDistance;\n/**\n * Alias for {@link vec4.length}\n * @function\n */\n\nexport var len = length;\n/**\n * Alias for {@link vec4.squaredLength}\n * @function\n */\n\nexport var sqrLen = squaredLength;\n/**\n * Perform some operation over an array of vec4s.\n *\n * @param {Array} a the array of vectors to iterate over\n * @param {Number} stride Number of elements between the start of each vec4. If 0 assumes tightly packed\n * @param {Number} offset Number of elements to skip at the beginning of the array\n * @param {Number} count Number of vec4s to iterate over. If 0 iterates over entire array\n * @param {Function} fn Function to call for each vector in the array\n * @param {Object} [arg] additional argument to pass to fn\n * @returns {Array} a\n * @function\n */\n\nexport var forEach = function () {\n  var vec = create();\n  return function (a, stride, offset, count, fn, arg) {\n    var i, l;\n\n    if (!stride) {\n      stride = 4;\n    }\n\n    if (!offset) {\n      offset = 0;\n    }\n\n    if (count) {\n      l = Math.min(count * stride + offset, a.length);\n    } else {\n      l = a.length;\n    }\n\n    for (i = offset; i < l; i += stride) {\n      vec[0] = a[i];\n      vec[1] = a[i + 1];\n      vec[2] = a[i + 2];\n      vec[3] = a[i + 3];\n      fn(vec, vec, arg);\n      a[i] = vec[0];\n      a[i + 1] = vec[1];\n      a[i + 2] = vec[2];\n      a[i + 3] = vec[3];\n    }\n\n    return a;\n  };\n}();","import * as glMatrix from \"./common.js\";\n/**\n * 3x3 Matrix\n * @module mat3\n */\n\n/**\n * Creates a new identity mat3\n *\n * @returns {mat3} a new 3x3 matrix\n */\n\nexport function create() {\n  var out = new glMatrix.ARRAY_TYPE(9);\n\n  if (glMatrix.ARRAY_TYPE != Float32Array) {\n    out[1] = 0;\n    out[2] = 0;\n    out[3] = 0;\n    out[5] = 0;\n    out[6] = 0;\n    out[7] = 0;\n  }\n\n  out[0] = 1;\n  out[4] = 1;\n  out[8] = 1;\n  return out;\n}\n/**\n * Copies the upper-left 3x3 values into the given mat3.\n *\n * @param {mat3} out the receiving 3x3 matrix\n * @param {ReadonlyMat4} a   the source 4x4 matrix\n * @returns {mat3} out\n */\n\nexport function fromMat4(out, a) {\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  out[3] = a[4];\n  out[4] = a[5];\n  out[5] = a[6];\n  out[6] = a[8];\n  out[7] = a[9];\n  out[8] = a[10];\n  return out;\n}\n/**\n * Creates a new mat3 initialized with values from an existing matrix\n *\n * @param {ReadonlyMat3} a matrix to clone\n * @returns {mat3} a new 3x3 matrix\n */\n\nexport function clone(a) {\n  var out = new glMatrix.ARRAY_TYPE(9);\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  out[3] = a[3];\n  out[4] = a[4];\n  out[5] = a[5];\n  out[6] = a[6];\n  out[7] = a[7];\n  out[8] = a[8];\n  return out;\n}\n/**\n * Copy the values from one mat3 to another\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the source matrix\n * @returns {mat3} out\n */\n\nexport function copy(out, a) {\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = a[2];\n  out[3] = a[3];\n  out[4] = a[4];\n  out[5] = a[5];\n  out[6] = a[6];\n  out[7] = a[7];\n  out[8] = a[8];\n  return out;\n}\n/**\n * Create a new mat3 with the given values\n *\n * @param {Number} m00 Component in column 0, row 0 position (index 0)\n * @param {Number} m01 Component in column 0, row 1 position (index 1)\n * @param {Number} m02 Component in column 0, row 2 position (index 2)\n * @param {Number} m10 Component in column 1, row 0 position (index 3)\n * @param {Number} m11 Component in column 1, row 1 position (index 4)\n * @param {Number} m12 Component in column 1, row 2 position (index 5)\n * @param {Number} m20 Component in column 2, row 0 position (index 6)\n * @param {Number} m21 Component in column 2, row 1 position (index 7)\n * @param {Number} m22 Component in column 2, row 2 position (index 8)\n * @returns {mat3} A new mat3\n */\n\nexport function fromValues(m00, m01, m02, m10, m11, m12, m20, m21, m22) {\n  var out = new glMatrix.ARRAY_TYPE(9);\n  out[0] = m00;\n  out[1] = m01;\n  out[2] = m02;\n  out[3] = m10;\n  out[4] = m11;\n  out[5] = m12;\n  out[6] = m20;\n  out[7] = m21;\n  out[8] = m22;\n  return out;\n}\n/**\n * Set the components of a mat3 to the given values\n *\n * @param {mat3} out the receiving matrix\n * @param {Number} m00 Component in column 0, row 0 position (index 0)\n * @param {Number} m01 Component in column 0, row 1 position (index 1)\n * @param {Number} m02 Component in column 0, row 2 position (index 2)\n * @param {Number} m10 Component in column 1, row 0 position (index 3)\n * @param {Number} m11 Component in column 1, row 1 position (index 4)\n * @param {Number} m12 Component in column 1, row 2 position (index 5)\n * @param {Number} m20 Component in column 2, row 0 position (index 6)\n * @param {Number} m21 Component in column 2, row 1 position (index 7)\n * @param {Number} m22 Component in column 2, row 2 position (index 8)\n * @returns {mat3} out\n */\n\nexport function set(out, m00, m01, m02, m10, m11, m12, m20, m21, m22) {\n  out[0] = m00;\n  out[1] = m01;\n  out[2] = m02;\n  out[3] = m10;\n  out[4] = m11;\n  out[5] = m12;\n  out[6] = m20;\n  out[7] = m21;\n  out[8] = m22;\n  return out;\n}\n/**\n * Set a mat3 to the identity matrix\n *\n * @param {mat3} out the receiving matrix\n * @returns {mat3} out\n */\n\nexport function identity(out) {\n  out[0] = 1;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 1;\n  out[5] = 0;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 1;\n  return out;\n}\n/**\n * Transpose the values of a mat3\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the source matrix\n * @returns {mat3} out\n */\n\nexport function transpose(out, a) {\n  // If we are transposing ourselves we can skip a few steps but have to cache some values\n  if (out === a) {\n    var a01 = a[1],\n        a02 = a[2],\n        a12 = a[5];\n    out[1] = a[3];\n    out[2] = a[6];\n    out[3] = a01;\n    out[5] = a[7];\n    out[6] = a02;\n    out[7] = a12;\n  } else {\n    out[0] = a[0];\n    out[1] = a[3];\n    out[2] = a[6];\n    out[3] = a[1];\n    out[4] = a[4];\n    out[5] = a[7];\n    out[6] = a[2];\n    out[7] = a[5];\n    out[8] = a[8];\n  }\n\n  return out;\n}\n/**\n * Inverts a mat3\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the source matrix\n * @returns {mat3} out\n */\n\nexport function invert(out, a) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2];\n  var a10 = a[3],\n      a11 = a[4],\n      a12 = a[5];\n  var a20 = a[6],\n      a21 = a[7],\n      a22 = a[8];\n  var b01 = a22 * a11 - a12 * a21;\n  var b11 = -a22 * a10 + a12 * a20;\n  var b21 = a21 * a10 - a11 * a20; // Calculate the determinant\n\n  var det = a00 * b01 + a01 * b11 + a02 * b21;\n\n  if (!det) {\n    return null;\n  }\n\n  det = 1.0 / det;\n  out[0] = b01 * det;\n  out[1] = (-a22 * a01 + a02 * a21) * det;\n  out[2] = (a12 * a01 - a02 * a11) * det;\n  out[3] = b11 * det;\n  out[4] = (a22 * a00 - a02 * a20) * det;\n  out[5] = (-a12 * a00 + a02 * a10) * det;\n  out[6] = b21 * det;\n  out[7] = (-a21 * a00 + a01 * a20) * det;\n  out[8] = (a11 * a00 - a01 * a10) * det;\n  return out;\n}\n/**\n * Calculates the adjugate of a mat3\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the source matrix\n * @returns {mat3} out\n */\n\nexport function adjoint(out, a) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2];\n  var a10 = a[3],\n      a11 = a[4],\n      a12 = a[5];\n  var a20 = a[6],\n      a21 = a[7],\n      a22 = a[8];\n  out[0] = a11 * a22 - a12 * a21;\n  out[1] = a02 * a21 - a01 * a22;\n  out[2] = a01 * a12 - a02 * a11;\n  out[3] = a12 * a20 - a10 * a22;\n  out[4] = a00 * a22 - a02 * a20;\n  out[5] = a02 * a10 - a00 * a12;\n  out[6] = a10 * a21 - a11 * a20;\n  out[7] = a01 * a20 - a00 * a21;\n  out[8] = a00 * a11 - a01 * a10;\n  return out;\n}\n/**\n * Calculates the determinant of a mat3\n *\n * @param {ReadonlyMat3} a the source matrix\n * @returns {Number} determinant of a\n */\n\nexport function determinant(a) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2];\n  var a10 = a[3],\n      a11 = a[4],\n      a12 = a[5];\n  var a20 = a[6],\n      a21 = a[7],\n      a22 = a[8];\n  return a00 * (a22 * a11 - a12 * a21) + a01 * (-a22 * a10 + a12 * a20) + a02 * (a21 * a10 - a11 * a20);\n}\n/**\n * Multiplies two mat3's\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the first operand\n * @param {ReadonlyMat3} b the second operand\n * @returns {mat3} out\n */\n\nexport function multiply(out, a, b) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2];\n  var a10 = a[3],\n      a11 = a[4],\n      a12 = a[5];\n  var a20 = a[6],\n      a21 = a[7],\n      a22 = a[8];\n  var b00 = b[0],\n      b01 = b[1],\n      b02 = b[2];\n  var b10 = b[3],\n      b11 = b[4],\n      b12 = b[5];\n  var b20 = b[6],\n      b21 = b[7],\n      b22 = b[8];\n  out[0] = b00 * a00 + b01 * a10 + b02 * a20;\n  out[1] = b00 * a01 + b01 * a11 + b02 * a21;\n  out[2] = b00 * a02 + b01 * a12 + b02 * a22;\n  out[3] = b10 * a00 + b11 * a10 + b12 * a20;\n  out[4] = b10 * a01 + b11 * a11 + b12 * a21;\n  out[5] = b10 * a02 + b11 * a12 + b12 * a22;\n  out[6] = b20 * a00 + b21 * a10 + b22 * a20;\n  out[7] = b20 * a01 + b21 * a11 + b22 * a21;\n  out[8] = b20 * a02 + b21 * a12 + b22 * a22;\n  return out;\n}\n/**\n * Translate a mat3 by the given vector\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the matrix to translate\n * @param {ReadonlyVec2} v vector to translate by\n * @returns {mat3} out\n */\n\nexport function translate(out, a, v) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2],\n      a10 = a[3],\n      a11 = a[4],\n      a12 = a[5],\n      a20 = a[6],\n      a21 = a[7],\n      a22 = a[8],\n      x = v[0],\n      y = v[1];\n  out[0] = a00;\n  out[1] = a01;\n  out[2] = a02;\n  out[3] = a10;\n  out[4] = a11;\n  out[5] = a12;\n  out[6] = x * a00 + y * a10 + a20;\n  out[7] = x * a01 + y * a11 + a21;\n  out[8] = x * a02 + y * a12 + a22;\n  return out;\n}\n/**\n * Rotates a mat3 by the given angle\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the matrix to rotate\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat3} out\n */\n\nexport function rotate(out, a, rad) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2],\n      a10 = a[3],\n      a11 = a[4],\n      a12 = a[5],\n      a20 = a[6],\n      a21 = a[7],\n      a22 = a[8],\n      s = Math.sin(rad),\n      c = Math.cos(rad);\n  out[0] = c * a00 + s * a10;\n  out[1] = c * a01 + s * a11;\n  out[2] = c * a02 + s * a12;\n  out[3] = c * a10 - s * a00;\n  out[4] = c * a11 - s * a01;\n  out[5] = c * a12 - s * a02;\n  out[6] = a20;\n  out[7] = a21;\n  out[8] = a22;\n  return out;\n}\n/**\n * Scales the mat3 by the dimensions in the given vec2\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the matrix to rotate\n * @param {ReadonlyVec2} v the vec2 to scale the matrix by\n * @returns {mat3} out\n **/\n\nexport function scale(out, a, v) {\n  var x = v[0],\n      y = v[1];\n  out[0] = x * a[0];\n  out[1] = x * a[1];\n  out[2] = x * a[2];\n  out[3] = y * a[3];\n  out[4] = y * a[4];\n  out[5] = y * a[5];\n  out[6] = a[6];\n  out[7] = a[7];\n  out[8] = a[8];\n  return out;\n}\n/**\n * Creates a matrix from a vector translation\n * This is equivalent to (but much faster than):\n *\n *     mat3.identity(dest);\n *     mat3.translate(dest, dest, vec);\n *\n * @param {mat3} out mat3 receiving operation result\n * @param {ReadonlyVec2} v Translation vector\n * @returns {mat3} out\n */\n\nexport function fromTranslation(out, v) {\n  out[0] = 1;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = 1;\n  out[5] = 0;\n  out[6] = v[0];\n  out[7] = v[1];\n  out[8] = 1;\n  return out;\n}\n/**\n * Creates a matrix from a given angle\n * This is equivalent to (but much faster than):\n *\n *     mat3.identity(dest);\n *     mat3.rotate(dest, dest, rad);\n *\n * @param {mat3} out mat3 receiving operation result\n * @param {Number} rad the angle to rotate the matrix by\n * @returns {mat3} out\n */\n\nexport function fromRotation(out, rad) {\n  var s = Math.sin(rad),\n      c = Math.cos(rad);\n  out[0] = c;\n  out[1] = s;\n  out[2] = 0;\n  out[3] = -s;\n  out[4] = c;\n  out[5] = 0;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 1;\n  return out;\n}\n/**\n * Creates a matrix from a vector scaling\n * This is equivalent to (but much faster than):\n *\n *     mat3.identity(dest);\n *     mat3.scale(dest, dest, vec);\n *\n * @param {mat3} out mat3 receiving operation result\n * @param {ReadonlyVec2} v Scaling vector\n * @returns {mat3} out\n */\n\nexport function fromScaling(out, v) {\n  out[0] = v[0];\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = v[1];\n  out[5] = 0;\n  out[6] = 0;\n  out[7] = 0;\n  out[8] = 1;\n  return out;\n}\n/**\n * Copies the values from a mat2d into a mat3\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat2d} a the matrix to copy\n * @returns {mat3} out\n **/\n\nexport function fromMat2d(out, a) {\n  out[0] = a[0];\n  out[1] = a[1];\n  out[2] = 0;\n  out[3] = a[2];\n  out[4] = a[3];\n  out[5] = 0;\n  out[6] = a[4];\n  out[7] = a[5];\n  out[8] = 1;\n  return out;\n}\n/**\n * Calculates a 3x3 matrix from the given quaternion\n *\n * @param {mat3} out mat3 receiving operation result\n * @param {ReadonlyQuat} q Quaternion to create matrix from\n *\n * @returns {mat3} out\n */\n\nexport function fromQuat(out, q) {\n  var x = q[0],\n      y = q[1],\n      z = q[2],\n      w = q[3];\n  var x2 = x + x;\n  var y2 = y + y;\n  var z2 = z + z;\n  var xx = x * x2;\n  var yx = y * x2;\n  var yy = y * y2;\n  var zx = z * x2;\n  var zy = z * y2;\n  var zz = z * z2;\n  var wx = w * x2;\n  var wy = w * y2;\n  var wz = w * z2;\n  out[0] = 1 - yy - zz;\n  out[3] = yx - wz;\n  out[6] = zx + wy;\n  out[1] = yx + wz;\n  out[4] = 1 - xx - zz;\n  out[7] = zy - wx;\n  out[2] = zx - wy;\n  out[5] = zy + wx;\n  out[8] = 1 - xx - yy;\n  return out;\n}\n/**\n * Calculates a 3x3 normal matrix (transpose inverse) from the 4x4 matrix\n *\n * @param {mat3} out mat3 receiving operation result\n * @param {ReadonlyMat4} a Mat4 to derive the normal matrix from\n *\n * @returns {mat3} out\n */\n\nexport function normalFromMat4(out, a) {\n  var a00 = a[0],\n      a01 = a[1],\n      a02 = a[2],\n      a03 = a[3];\n  var a10 = a[4],\n      a11 = a[5],\n      a12 = a[6],\n      a13 = a[7];\n  var a20 = a[8],\n      a21 = a[9],\n      a22 = a[10],\n      a23 = a[11];\n  var a30 = a[12],\n      a31 = a[13],\n      a32 = a[14],\n      a33 = a[15];\n  var b00 = a00 * a11 - a01 * a10;\n  var b01 = a00 * a12 - a02 * a10;\n  var b02 = a00 * a13 - a03 * a10;\n  var b03 = a01 * a12 - a02 * a11;\n  var b04 = a01 * a13 - a03 * a11;\n  var b05 = a02 * a13 - a03 * a12;\n  var b06 = a20 * a31 - a21 * a30;\n  var b07 = a20 * a32 - a22 * a30;\n  var b08 = a20 * a33 - a23 * a30;\n  var b09 = a21 * a32 - a22 * a31;\n  var b10 = a21 * a33 - a23 * a31;\n  var b11 = a22 * a33 - a23 * a32; // Calculate the determinant\n\n  var det = b00 * b11 - b01 * b10 + b02 * b09 + b03 * b08 - b04 * b07 + b05 * b06;\n\n  if (!det) {\n    return null;\n  }\n\n  det = 1.0 / det;\n  out[0] = (a11 * b11 - a12 * b10 + a13 * b09) * det;\n  out[1] = (a12 * b08 - a10 * b11 - a13 * b07) * det;\n  out[2] = (a10 * b10 - a11 * b08 + a13 * b06) * det;\n  out[3] = (a02 * b10 - a01 * b11 - a03 * b09) * det;\n  out[4] = (a00 * b11 - a02 * b08 + a03 * b07) * det;\n  out[5] = (a01 * b08 - a00 * b10 - a03 * b06) * det;\n  out[6] = (a31 * b05 - a32 * b04 + a33 * b03) * det;\n  out[7] = (a32 * b02 - a30 * b05 - a33 * b01) * det;\n  out[8] = (a30 * b04 - a31 * b02 + a33 * b00) * det;\n  return out;\n}\n/**\n * Generates a 2D projection matrix with the given bounds\n *\n * @param {mat3} out mat3 frustum matrix will be written into\n * @param {number} width Width of your gl context\n * @param {number} height Height of gl context\n * @returns {mat3} out\n */\n\nexport function projection(out, width, height) {\n  out[0] = 2 / width;\n  out[1] = 0;\n  out[2] = 0;\n  out[3] = 0;\n  out[4] = -2 / height;\n  out[5] = 0;\n  out[6] = -1;\n  out[7] = 1;\n  out[8] = 1;\n  return out;\n}\n/**\n * Returns a string representation of a mat3\n *\n * @param {ReadonlyMat3} a matrix to represent as a string\n * @returns {String} string representation of the matrix\n */\n\nexport function str(a) {\n  return \"mat3(\" + a[0] + \", \" + a[1] + \", \" + a[2] + \", \" + a[3] + \", \" + a[4] + \", \" + a[5] + \", \" + a[6] + \", \" + a[7] + \", \" + a[8] + \")\";\n}\n/**\n * Returns Frobenius norm of a mat3\n *\n * @param {ReadonlyMat3} a the matrix to calculate Frobenius norm of\n * @returns {Number} Frobenius norm\n */\n\nexport function frob(a) {\n  return Math.hypot(a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8]);\n}\n/**\n * Adds two mat3's\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the first operand\n * @param {ReadonlyMat3} b the second operand\n * @returns {mat3} out\n */\n\nexport function add(out, a, b) {\n  out[0] = a[0] + b[0];\n  out[1] = a[1] + b[1];\n  out[2] = a[2] + b[2];\n  out[3] = a[3] + b[3];\n  out[4] = a[4] + b[4];\n  out[5] = a[5] + b[5];\n  out[6] = a[6] + b[6];\n  out[7] = a[7] + b[7];\n  out[8] = a[8] + b[8];\n  return out;\n}\n/**\n * Subtracts matrix b from matrix a\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the first operand\n * @param {ReadonlyMat3} b the second operand\n * @returns {mat3} out\n */\n\nexport function subtract(out, a, b) {\n  out[0] = a[0] - b[0];\n  out[1] = a[1] - b[1];\n  out[2] = a[2] - b[2];\n  out[3] = a[3] - b[3];\n  out[4] = a[4] - b[4];\n  out[5] = a[5] - b[5];\n  out[6] = a[6] - b[6];\n  out[7] = a[7] - b[7];\n  out[8] = a[8] - b[8];\n  return out;\n}\n/**\n * Multiply each element of the matrix by a scalar.\n *\n * @param {mat3} out the receiving matrix\n * @param {ReadonlyMat3} a the matrix to scale\n * @param {Number} b amount to scale the matrix's elements by\n * @returns {mat3} out\n */\n\nexport function multiplyScalar(out, a, b) {\n  out[0] = a[0] * b;\n  out[1] = a[1] * b;\n  out[2] = a[2] * b;\n  out[3] = a[3] * b;\n  out[4] = a[4] * b;\n  out[5] = a[5] * b;\n  out[6] = a[6] * b;\n  out[7] = a[7] * b;\n  out[8] = a[8] * b;\n  return out;\n}\n/**\n * Adds two mat3's after multiplying each element of the second operand by a scalar value.\n *\n * @param {mat3} out the receiving vector\n * @param {ReadonlyMat3} a the first operand\n * @param {ReadonlyMat3} b the second operand\n * @param {Number} scale the amount to scale b's elements by before adding\n * @returns {mat3} out\n */\n\nexport function multiplyScalarAndAdd(out, a, b, scale) {\n  out[0] = a[0] + b[0] * scale;\n  out[1] = a[1] + b[1] * scale;\n  out[2] = a[2] + b[2] * scale;\n  out[3] = a[3] + b[3] * scale;\n  out[4] = a[4] + b[4] * scale;\n  out[5] = a[5] + b[5] * scale;\n  out[6] = a[6] + b[6] * scale;\n  out[7] = a[7] + b[7] * scale;\n  out[8] = a[8] + b[8] * scale;\n  return out;\n}\n/**\n * Returns whether or not the matrices have exactly the same elements in the same position (when compared with ===)\n *\n * @param {ReadonlyMat3} a The first matrix.\n * @param {ReadonlyMat3} b The second matrix.\n * @returns {Boolean} True if the matrices are equal, false otherwise.\n */\n\nexport function exactEquals(a, b) {\n  return a[0] === b[0] && a[1] === b[1] && a[2] === b[2] && a[3] === b[3] && a[4] === b[4] && a[5] === b[5] && a[6] === b[6] && a[7] === b[7] && a[8] === b[8];\n}\n/**\n * Returns whether or not the matrices have approximately the same elements in the same position.\n *\n * @param {ReadonlyMat3} a The first matrix.\n * @param {ReadonlyMat3} b The second matrix.\n * @returns {Boolean} True if the matrices are equal, false otherwise.\n */\n\nexport function equals(a, b) {\n  var a0 = a[0],\n      a1 = a[1],\n      a2 = a[2],\n      a3 = a[3],\n      a4 = a[4],\n      a5 = a[5],\n      a6 = a[6],\n      a7 = a[7],\n      a8 = a[8];\n  var b0 = b[0],\n      b1 = b[1],\n      b2 = b[2],\n      b3 = b[3],\n      b4 = b[4],\n      b5 = b[5],\n      b6 = b[6],\n      b7 = b[7],\n      b8 = b[8];\n  return Math.abs(a0 - b0) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a0), Math.abs(b0)) && Math.abs(a1 - b1) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a1), Math.abs(b1)) && Math.abs(a2 - b2) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a2), Math.abs(b2)) && Math.abs(a3 - b3) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a3), Math.abs(b3)) && Math.abs(a4 - b4) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a4), Math.abs(b4)) && Math.abs(a5 - b5) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a5), Math.abs(b5)) && Math.abs(a6 - b6) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a6), Math.abs(b6)) && Math.abs(a7 - b7) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a7), Math.abs(b7)) && Math.abs(a8 - b8) <= glMatrix.EPSILON * Math.max(1.0, Math.abs(a8), Math.abs(b8));\n}\n/**\n * Alias for {@link mat3.multiply}\n * @function\n */\n\nexport var mul = multiply;\n/**\n * Alias for {@link mat3.subtract}\n * @function\n */\n\nexport var sub = subtract;","import { vec3 } from \"gl-matrix\";\n\n// Vertex [x, y, z]\ntype Vector = [number, number, number];\n// Some aliases which are useful for documentation\n// Color [r, g, b]\ntype ColorVector = Vector;\n// Point (x, y, z)\ntype Point = Vector;\n\nexport type Material = {\n  ambient: ColorVector;\n  diffuse: ColorVector;\n  specular: ColorVector;\n  n: number;\n};\n\nfunction rgb(r: number, g: number, b: number): Vector {\n  return [r / 255, g / 255, b / 255];\n}\n\n// Description of triangle JSON.\n//\n// Note: The arrays of `ambient`, `diffuse`, `specular`, and `triangles` all\n// have the same length.\nexport type Model = {\n  material: Material;\n  vertices: Array<Point>;\n  // Numbers are integer references to vertexes within `vertices`\n  triangles: Array<[number, number, number]>;\n};\n\n// Center model on origin. This should be done for all models not tied to\n// another\nfunction center(model: Model): Model {\n  // Preprocess all vertexes so their centroid is the origin\n  let centroid = vec3.create();\n  for (const v of model.vertices) {\n    vec3.add(centroid, centroid, v);\n  }\n  vec3.scale(centroid, centroid, 1 / model.vertices.length);\n  for (const v of model.vertices) {\n    vec3.subtract(v, v, centroid);\n  }\n  return model;\n}\n\nfunction cube(sideLen: number, material: Material): Model {\n  return center({\n    material: material,\n    vertices: [\n      [0, 0, 0],\n      [sideLen, 0, 0],\n      [sideLen, 0, sideLen],\n      [0, 0, sideLen],\n      [0, sideLen, 0],\n      [sideLen, sideLen, 0],\n      [sideLen, sideLen, sideLen],\n      [0, sideLen, sideLen],\n    ],\n    triangles: [\n      [0, 1, 2],\n      [2, 3, 0],\n      [4, 5, 6],\n      [6, 7, 4],\n      [0, 1, 4],\n      [4, 5, 1],\n      [1, 2, 5],\n      [2, 5, 6],\n      [2, 3, 6],\n      [3, 6, 7],\n      [3, 0, 7],\n      [0, 7, 4],\n    ],\n  });\n}\n\n// This modifies model directly\nfunction shift(model: Model, vec: Vector): Model {\n  for (const i in model.vertices) {\n    model.vertices[i][0] += vec[0];\n    model.vertices[i][1] += vec[1];\n    model.vertices[i][2] += vec[2];\n  }\n  return model;\n}\n\nexport const SUN_COLOR: Vector = rgb(252, 229, 112);\nexport const SPACE_COLOR: Vector = rgb(29, 17, 53);\n\nexport const SUN_SIDE_LENGTH: number = 2.0;\nexport const SUN: Model = cube(SUN_SIDE_LENGTH, {\n  ambient: SUN_COLOR,\n  diffuse: [0.0, 0.0, 0.0],\n  specular: [0.0, 0.0, 0.0],\n  n: 11,\n});\n\nexport const DOT: Model = cube(0.1, {\n  ambient: [1.0, 1.0, 1.0],\n  diffuse: [0.0, 0.0, 0.0],\n  specular: [0.0, 0.0, 0.0],\n  n: 11,\n});\n\nexport const SHIP: Model = center({\n  material: {\n    ambient: [0.125, 0.125, 0.125],\n    diffuse: [0.325, 0.325, 0.325],\n    specular: [0.45, 0.45, 0.45],\n    n: 31,\n  },\n  vertices: [\n    [0.0, 0.0, 0],\n    [0.3, 0.6, 0],\n    [0.6, 0.0, 0],\n    [0.3, 0.15, 0.08],\n    [0.3, 0.15, -0.08],\n  ],\n  triangles: [\n    [0, 1, 3],\n    [0, 1, 4],\n    [0, 3, 4],\n    [2, 1, 3],\n    [2, 1, 4],\n    [2, 3, 4],\n  ],\n});\nexport const SHIP_NOZZLE: vec3 = SHIP.vertices[1];\nexport const SHIP_COLLISION_POINTS: vec3[] = SHIP.vertices.map((v) => vec3.fromValues(...v));\n\nexport const SHIP_FLAME: Model = {\n  material: {\n    ambient: rgb(226, 88, 34),\n    diffuse: [0.0, 0.0, 0.0],\n    specular: [0.0, 0.0, 0.0],\n    n: 17,\n  },\n  vertices: [\n    [5 / 32, 0, 0],\n    [0, 0, 5 / 128],\n    [-5 / 32, 0, 0],\n    [0, 0, -5 / 128],\n    [0, -0.4, 0],\n  ],\n  triangles: [\n    [0, 1, 2],\n    [2, 3, 0],\n    [0, 1, 4],\n    [1, 2, 4],\n    [2, 3, 4],\n    [3, 0, 4],\n  ],\n};\n\nexport const SHIP_FLAME_ACCENT: Model = {\n  material: {\n    ambient: rgb(255, 247, 110),\n    diffuse: [0.0, 0.0, 0.0],\n    specular: [0.0, 0.0, 0.0],\n    n: 17,\n  },\n  vertices: [\n    [4.5 / 32, 0, 0],\n    [0, 0, 6 / 128],\n    [-4.5 / 32, 0, 0],\n    [0, 0, -6 / 128],\n    [0, -0.36, 0],\n  ],\n  triangles: [\n    [0, 1, 2],\n    [2, 3, 0],\n    [0, 1, 4],\n    [1, 2, 4],\n    [2, 3, 4],\n    [3, 0, 4],\n  ],\n};\n\nconst RETICLE_S: number = 0.1;\nconst RETICLE_DIST: number = 10;\nexport const SHIP_RETICLE: Model = shift(\n  cube(RETICLE_S, {\n    ambient: rgb(255, 255, 255),\n    diffuse: [0.0, 0.0, 0.0],\n    specular: [0.0, 0.0, 0.0],\n    n: 11,\n  }),\n  [0, RETICLE_DIST, 0],\n);\n\nexport const MISSILE: Model = center({\n  material: {\n    ambient: [1.0, 0.2, 0.2],\n    diffuse: [0.0, 0.0, 0.0],\n    specular: [0.0, 0.0, 0.0],\n    n: 11,\n  },\n  vertices: [\n    [1 / 32, 0.0, 0.0],\n    [0.0, 0.0, 1 / 32],\n    [-1 / 32, 0.0, 0.0],\n    [0.0, 0.0, -1 / 32],\n    [1 / 32, 0.5, 0.0],\n    [0.0, 0.5, 1 / 32],\n    [-1 / 32, 0.5, 0.0],\n    [0.0, 0.5, -1 / 32],\n  ],\n  triangles: [\n    [0, 1, 2],\n    [2, 3, 0],\n    [4, 5, 6],\n    [6, 7, 4],\n    [0, 1, 4],\n    [4, 5, 1],\n    [1, 2, 5],\n    [2, 5, 6],\n    [2, 3, 6],\n    [3, 6, 7],\n    [3, 0, 7],\n    [0, 7, 4],\n  ],\n});\n\nexport const ASTEROID_COLOR: Vector = rgb(99, 78, 63);\nexport const ASTEROID_DAMAGED_COLOR: Vector = [1, 0, 0];\n\nfunction randf(lo: number, hi: number) {\n  return (hi - lo) * Math.random() + lo;\n}\n\nexport const ASTEROID_AMBIENT_SCALAR: number = 0.5;\nexport const ASTEROID_DIFFUSE_SCALAR: number = 1.0;\nconst ASTEROID_MATERIAL = {\n  ambient: <Vector>ASTEROID_COLOR.map((x) => x * ASTEROID_AMBIENT_SCALAR),\n  diffuse: <Vector>ASTEROID_COLOR.map((x) => x * ASTEROID_DIFFUSE_SCALAR),\n  specular: [0.0, 0.0, 0.0],\n  n: 11,\n};\n\nexport function randomAsteroid(radius: number): [number, Model] {\n  let sideLength = radius * (2 / Math.sqrt(3));\n  let template = [\n    [0, 0, 0],\n    [sideLength, 0, 0],\n    [sideLength, 0, sideLength],\n    [0, 0, sideLength],\n    [0, sideLength, 0],\n    [sideLength, sideLength, 0],\n    [sideLength, sideLength, sideLength],\n    [0, sideLength, sideLength],\n  ];\n\n  let vertexes: Vector[] = template.map((v) => {\n    let disp = vec3.random(vec3.create(), randf(0, sideLength / 2));\n    return [v[0] + disp[0], v[1] + disp[1], v[2] + disp[2]];\n  });\n\n  let asteroid = center({\n    // Deep clone the material since we modify the color later\n    material: JSON.parse(JSON.stringify(ASTEROID_MATERIAL)),\n    vertices: vertexes,\n    triangles: [\n      [0, 1, 2],\n      [2, 3, 0],\n      [4, 5, 6],\n      [6, 7, 4],\n      [0, 1, 4],\n      [4, 5, 1],\n      [1, 2, 5],\n      [2, 5, 6],\n      [2, 3, 6],\n      [3, 6, 7],\n      [3, 0, 7],\n      [0, 7, 4],\n    ],\n  });\n\n  let avgRadius = 0.0;\n  for (const v of asteroid.vertices) {\n    avgRadius += Math.hypot(...v);\n  }\n  avgRadius /= asteroid.vertices.length;\n\n  return [avgRadius, asteroid];\n}\n","import { vec3, mat4 } from \"gl-matrix\";\n\nimport * as models from \"./models\";\nimport { Model } from \"./models\";\n\nexport const NUM_SUNS: number = 4;\n\nexport const FOG_START = 24;\nexport const FOG_END = 32;\nexport const FOG_COLOR = models.SPACE_COLOR;\n\nexport class SceneObject {\n  // this contains vertex coordinates in triples\n  public vertexPosBuffer: WebGLBuffer;\n  // this contains indices into vertexBuffer in triples\n  public triangleBuffer: WebGLBuffer;\n  // the number of indices in the triangle buffer\n  public triangleBufferSize: number;\n  // The input model this scene comes from\n  public model: Model;\n  // Model transforms\n  public vertexTransform: mat4;\n\n  constructor(gl: WebGLRenderingContext, model: Model, vertexTransform: mat4 = mat4.create()) {\n    // Send vertex positions to webgl\n    let vertexPosArray = model.vertices.flat();\n    let vertexPosBuffer = gl.createBuffer();\n    if (vertexPosBuffer == null) {\n      throw \"could not create webgl buffer\";\n    }\n    gl.bindBuffer(gl.ARRAY_BUFFER, vertexPosBuffer);\n    gl.bufferData(gl.ARRAY_BUFFER, new Float32Array(vertexPosArray), gl.STATIC_DRAW);\n\n    // Send the triangle indexes to webgl\n    let triangleArray = model.triangles.flat();\n    let triangleBuffer = gl.createBuffer();\n    if (triangleBuffer == null) {\n      throw \"could not create webgl buffer\";\n    }\n    gl.bindBuffer(gl.ELEMENT_ARRAY_BUFFER, triangleBuffer);\n    gl.bufferData(gl.ELEMENT_ARRAY_BUFFER, new Uint16Array(triangleArray), gl.STATIC_DRAW);\n\n    this.vertexPosBuffer = vertexPosBuffer;\n    this.triangleBuffer = triangleBuffer;\n    this.triangleBufferSize = triangleArray.length;\n    this.model = model;\n    this.vertexTransform = vertexTransform;\n  }\n\n  translate(v: vec3) {\n    mat4.multiply(\n      this.vertexTransform,\n      mat4.fromTranslation(mat4.create(), v),\n      this.vertexTransform,\n    );\n  }\n\n  rotate(rads: number) {\n    mat4.rotateZ(this.vertexTransform, this.vertexTransform, rads);\n  }\n\n  pos(): vec3 {\n    return mat4.getTranslation(vec3.create(), this.vertexTransform);\n  }\n}\n\nconst SHADER_ATTRIBUTES = [\"aVertexPos\"];\nconst SHADER_UNIFORMS = [\n  \"uViewingTransform\",\n  \"uPerspectiveTransform\",\n  \"uVertexTransform\",\n  \"uLights\",\n  \"uNumLights\",\n  \"uEyePos\",\n  \"uFog\",\n\n  \"uMaterial.ambient\",\n  \"uMaterial.diffuse\",\n  \"uMaterial.specular\",\n  \"uMaterial.shine\",\n];\n\nexport type ShaderAttributes = {\n  attribs: {\n    aVertexPos: number;\n  };\n  uniforms: {\n    uViewingTransform: WebGLUniformLocation;\n    uPerspectiveTransform: WebGLUniformLocation;\n    uVertexTransform: WebGLUniformLocation;\n    uLights: WebGLUniformLocation;\n    uNumLights: WebGLUniformLocation;\n    uEyePos: WebGLUniformLocation;\n    uFog: WebGLUniformLocation;\n\n    \"uMaterial.ambient\": WebGLUniformLocation;\n    \"uMaterial.diffuse\": WebGLUniformLocation;\n    \"uMaterial.specular\": WebGLUniformLocation;\n    \"uMaterial.shine\": WebGLUniformLocation;\n\n    uSampler: WebGLUniformLocation;\n  };\n};\n\nexport function initWebgl(canvas: HTMLCanvasElement): WebGLRenderingContext {\n  let gl = canvas.getContext(\"webgl\");\n  if (gl == null) {\n    throw \"unable to create gl context -- is your browser gl ready?\";\n  }\n\n  // use max when we clear the depth buffer\n  gl.clearDepth(1.0);\n  gl.clearColor(...models.SPACE_COLOR, 1);\n  // use hidden surface removal (with zbuffering)\n  gl.enable(gl.DEPTH_TEST);\n\n  // We must enable blending so that we see the objects behind us\n\n  return gl;\n}\n\n// setup the webGL shaders\nexport function setupShaders(gl: WebGLRenderingContext): ShaderAttributes {\n  gl.getExtension(\"OES_standard_derivatives\");\n\n  let vShaderCode = `\nprecision highp float;\n\nuniform mat4 uViewingTransform;\nuniform mat4 uPerspectiveTransform;\n\nuniform mat4 uVertexTransform;\n\nattribute vec3 aVertexPos;\nvarying vec4 vSurfacePos;\n\nvoid main(void) {\n  vSurfacePos = uVertexTransform * vec4(aVertexPos, 1.0);\n\n  gl_Position = uPerspectiveTransform * uViewingTransform * vSurfacePos;\n}\n`;\n\n  // create vertex shader\n  let vShader = gl.createShader(gl.VERTEX_SHADER);\n  if (vShader == null) {\n    throw \"could not create webgl shader\";\n  }\n  gl.shaderSource(vShader, vShaderCode);\n  gl.compileShader(vShader);\n  if (!gl.getShaderParameter(vShader, gl.COMPILE_STATUS)) {\n    throw \"error during vertex shader compile: \" + gl.getShaderInfoLog(vShader);\n  }\n\n  let fShaderCode = `\n#extension GL_OES_standard_derivatives : enable\n\nprecision highp float;\n\nconst int NUM_SUNS = ${NUM_SUNS};\nconst float FOG_START = ${FOG_START.toFixed(10)};\nconst float FOG_END = ${FOG_END.toFixed(10)};\nconst vec3 FOG_COLOR = vec3(${FOG_COLOR[0]}, ${FOG_COLOR[1]}, ${FOG_COLOR[2]});\n\nuniform vec3 uLights[NUM_SUNS];\nuniform int uNumLights;\nuniform vec3 uEyePos;\nuniform int uFog;\n\nstruct Material {\n  vec3 ambient;\n  vec3 diffuse;\n  vec3 specular;\n  float shine;\n};\n\nuniform Material uMaterial;\n\nvarying vec4 vSurfacePos;\n\n// The function 1 / (1 + 0.002x^3) == 0.5 at 7.937\nfloat attenuation(float x) {\n  if (x < 8.0) {\n    return 1.0;\n  } else {\n    x -= 8.0;\n    float a = 1.0 / (1.0 + 0.05*x + 0.004*x*x*x);\n    return clamp(a, 0.0, 1.0);\n  }\n}\n\nvoid main(void) {\n  vec3 color = uMaterial.ambient;\n\n  vec3 viewVector = normalize(uEyePos - vSurfacePos.xyz);\n  vec3 normalVector = normalize(cross(\n    dFdx(vSurfacePos.xyz),\n    dFdy(vSurfacePos.xyz)\n  ));\n\n  for (int i = 0; i < NUM_SUNS; i++) {\n    if (i >= uNumLights) {\n      break;\n    }\n\n    vec3 lightVector = normalize(uLights[i] - vSurfacePos.xyz);\n    vec3 halfVector = normalize(viewVector + lightVector);\n\n    float lightDist = length(uLights[i] - vSurfacePos.xyz);\n    float atten = attenuation(lightDist);\n\n    vec3 diffuse = atten * uMaterial.diffuse * max(0.0, dot(normalVector, lightVector));\n    vec3 specular = atten * uMaterial.specular * pow(max(0.0, dot(normalVector, halfVector)), uMaterial.shine);\n    color += diffuse + specular;\n  }\n\n  float fogFactor = 0.0;\n  if (uFog == 1) {\n    float dist = length(uEyePos - vSurfacePos.xyz);\n    fogFactor = min(1.0, max(0.0, dist - FOG_START) / (FOG_END - FOG_START));\n  }\n\n  gl_FragColor = vec4(mix(color, FOG_COLOR, fogFactor), 1.0);\n}\n`;\n\n  // create frag shader\n  let fShader = gl.createShader(gl.FRAGMENT_SHADER);\n  if (fShader == null) {\n    throw \"could not create webgl shader\";\n  }\n  gl.shaderSource(fShader, fShaderCode);\n  gl.compileShader(fShader);\n  if (!gl.getShaderParameter(fShader, gl.COMPILE_STATUS)) {\n    throw \"error during fragment shader compile: \" + gl.getShaderInfoLog(fShader);\n  }\n\n  // create the single shader program\n  let shaderProgram = gl.createProgram();\n  if (shaderProgram == null) {\n    throw \"could not create webgl program\";\n  }\n  gl.attachShader(shaderProgram, fShader);\n  gl.attachShader(shaderProgram, vShader);\n  gl.linkProgram(shaderProgram);\n\n  if (!gl.getProgramParameter(shaderProgram, gl.LINK_STATUS)) {\n    throw \"error during shader program linking: \" + gl.getProgramInfoLog(shaderProgram);\n  }\n\n  gl.useProgram(shaderProgram);\n\n  let shaderAttributes = {\n    attribs: {},\n    uniforms: {},\n  };\n\n  for (const name of SHADER_ATTRIBUTES) {\n    let attrib = gl.getAttribLocation(shaderProgram, name);\n    if (attrib == -1) {\n      throw `invalid attribute ${name}`;\n    }\n    gl.enableVertexAttribArray(attrib);\n    shaderAttributes.attribs[name] = attrib;\n  }\n\n  for (const name of SHADER_UNIFORMS) {\n    let uniform = gl.getUniformLocation(shaderProgram, name);\n    shaderAttributes.uniforms[name] = uniform;\n  }\n\n  return shaderAttributes as ShaderAttributes;\n}\n\nexport interface Camera {\n  eye: vec3;\n  viewingTransform: mat4;\n  perspectiveTransform: mat4;\n}\n\n// TODO: Just use array rather than iterable?\nexport function render(\n  gl: WebGLRenderingContext,\n  lights: Iterable<vec3>,\n  objects: Iterable<SceneObject>,\n  frontObjects: Iterable<SceneObject>,\n  shaderInfo: ShaderAttributes,\n  camera: Camera,\n  opts?: {\n    fog: boolean;\n  },\n) {\n  if (opts == undefined) {\n    opts = { fog: true };\n  }\n\n  // clear frame/depth buffers\n  gl.clear(gl.COLOR_BUFFER_BIT | gl.DEPTH_BUFFER_BIT);\n\n  function bindBufferTo(buffer: WebGLBuffer, attrib: GLuint, size: number) {\n    gl.bindBuffer(gl.ARRAY_BUFFER, buffer);\n    gl.vertexAttribPointer(\n      attrib,\n      size, // size\n      gl.FLOAT, // type\n      false, // normalized\n      0, // stride\n      0, // offset\n    );\n  }\n\n  let lightsArr: number[] = [];\n  let numLights: number = 0;\n  for (let lightPos of lights) {\n    lightsArr.push(...lightPos);\n    numLights += 1;\n  }\n  gl.uniform3fv(shaderInfo.uniforms.uLights, lightsArr);\n  gl.uniform1i(shaderInfo.uniforms.uNumLights, numLights);\n\n  gl.uniform1i(shaderInfo.uniforms.uFog, opts.fog ? 1 : 0);\n\n  // These uniforms don't change across the models\n  gl.uniform3fv(shaderInfo.uniforms.uEyePos, camera.eye);\n\n  gl.uniformMatrix4fv(shaderInfo.uniforms.uViewingTransform, false, camera.viewingTransform);\n  gl.uniformMatrix4fv(\n    shaderInfo.uniforms.uPerspectiveTransform,\n    false,\n    camera.perspectiveTransform,\n  );\n\n  function drawObject(obj: SceneObject) {\n    bindBufferTo(obj.vertexPosBuffer, shaderInfo.attribs.aVertexPos, 3);\n\n    gl.uniformMatrix4fv(shaderInfo.uniforms.uVertexTransform, false, obj.vertexTransform);\n\n    let material = obj.model.material;\n    gl.uniform3fv(shaderInfo.uniforms[\"uMaterial.ambient\"], material.ambient);\n    gl.uniform3fv(shaderInfo.uniforms[\"uMaterial.diffuse\"], material.diffuse);\n    gl.uniform3fv(shaderInfo.uniforms[\"uMaterial.specular\"], material.specular);\n    gl.uniform1f(shaderInfo.uniforms[\"uMaterial.shine\"], material.n);\n\n    gl.bindBuffer(gl.ELEMENT_ARRAY_BUFFER, obj.triangleBuffer);\n    gl.drawElements(gl.TRIANGLES, obj.triangleBufferSize, gl.UNSIGNED_SHORT, 0);\n  }\n\n  // We cannot use an iterable repeatedly\n  gl.enable(gl.DEPTH_TEST);\n  let objectsArr = Array.from(objects);\n  for (const obj of objectsArr) {\n    drawObject(obj);\n  }\n\n  gl.disable(gl.DEPTH_TEST);\n  let frontObjectsArr = Array.from(frontObjects);\n  frontObjectsArr.forEach(drawObject);\n}\n","export class Debouncer {\n  debounceTime: number;\n  lastChange: number;\n  getTime: () => number;\n\n  constructor(getTime: () => number, delayMs: number) {\n    this.getTime = getTime;\n    this.debounceTime = delayMs;\n    this.lastChange = -delayMs;\n  }\n\n  reset() {\n    this.lastChange = -this.debounceTime;\n  }\n\n  set() {\n    this.lastChange = this.getTime();\n  }\n\n  ready() {\n    return this.getTime() - this.lastChange >= this.debounceTime;\n  }\n\n  try(f: () => void) {\n    let now = this.getTime();\n    if (now - this.lastChange >= this.debounceTime) {\n      f();\n      this.lastChange = now;\n    }\n  }\n}\n\nexport class Keyboard {\n  public readonly pressed: Set<string>;\n\n  constructor() {\n    this.pressed = new Set();\n  }\n\n  register() {\n    document.addEventListener(\"keydown\", (e: KeyboardEvent) => {\n      this.pressed.add(e.code);\n    });\n    document.addEventListener(\"keyup\", (e: KeyboardEvent) => {\n      this.pressed.delete(e.code);\n    });\n  }\n}\n","// TODO: Make music play on start\n// TODO: Have sound effects and music mute\nimport { quat, vec3, mat4 } from \"gl-matrix\";\n\nimport * as models from \"./models\";\nimport * as render from \"./render\";\nimport { SceneObject } from \"./render\";\nimport { Debouncer, Keyboard } from \"./inputs\";\nimport { Camera } from \"./render\";\n\n// TODO: Try to split up different loops into different files\n\ntype Range = [number, number];\n\nfunction randf(lo: number, hi: number) {\n  return (hi - lo) * Math.random() + lo;\n}\n\nfunction clamp(n: number, range: Range) {\n  return Math.min(range[1], Math.max(range[0], n));\n}\n\nfunction interpolate(pos: number, range: Range) {\n  return pos * range[1] + (1 - pos) * range[0];\n}\n\nfunction degrees(rads: number) {\n  return rads * (Math.PI / 180);\n}\n\n// Find a position in the given unit vector direction\nfunction randomArc(direction: vec3, arc: number): vec3 {\n  return randomArcRange(direction, [0, arc]);\n}\n\n// Find a position in the given unit vector direction\nfunction randomArcRange(direction: vec3, arcRange: Range): vec3 {\n  // This fails if direction = [-1,0,0] so we have two alternatives\n  let perpendicular = vec3.fromValues(direction[0] + 1, direction[1], direction[2]);\n  if (Math.abs(perpendicular[0]) < 0.01) {\n    perpendicular = vec3.fromValues(direction[0], direction[1] + 1, direction[2]);\n  }\n  vec3.cross(perpendicular, direction, perpendicular);\n  vec3.normalize(perpendicular, perpendicular);\n\n  // let arcVec = vec3.clone(direction);\n  let arcVec = vec3.copy(vec3.create(), direction);\n  let angleOut = mat4.fromRotation(mat4.create(), randf(...arcRange), perpendicular);\n  let angleAround = mat4.fromRotation(mat4.create(), randf(0, 2 * Math.PI), direction);\n  vec3.transformMat4(arcVec, arcVec, angleOut);\n  vec3.transformMat4(arcVec, arcVec, angleAround);\n\n  return arcVec;\n}\n\nconst SPAWN_DISTANCE: number = render.FOG_END + 1;\nconst DESPAWN_DISTANCE: number = SPAWN_DISTANCE + 1;\n\nconst NEAR_BOUND: number = 1 / 32;\nconst VIEW_DISTANCE: number = 32;\n\n// Number of ticks to wait before going to the next level after winning a level\nconst LEVEL_WAIT_TICKS: number = 30;\n\nconst ASTEROID_TIERS: number = 2;\ntype Tiered<T> = [T, T];\nconst ASTEROID_RADIUS_TIERS: Tiered<Range> = [\n  [1.4, 1.8],\n  [0.6, 0.8],\n];\nconst ASTEROID_HEALTH_TIERS: Tiered<number> = [2, 1];\nconst ASTEROID_POINT_TIERS: Tiered<number> = [100, 50];\nconst ASTEROID_ROTATION_SPEED: Range = [0.005, 0.1];\nconst ASTEROID_SPLIT_SPEED: Range = [0.01, 0.08];\nconst ASTEROID_INITIAL_SPAWN_DISTANCE: Range = [16, 32];\nconst ASTEROID_SPAWN_DISTANCE: number = SPAWN_DISTANCE;\nconst ASTEROID_DESPAWN_DISTANCE: number = DESPAWN_DISTANCE;\nconst ASTEROID_SPAWN_ARC: number = degrees(120);\nconst ASTEROID_VELOCITY_ARC: number = degrees(45);\n// A fudge factor to tweak the asteroid collision in the player's favor\nconst ASTEROID_RADIUS_FUDGE_FACTOR: number = 0.85;\nconst ASTEROID_DENSITY: number = 1.0;\n\nconst SUN_INITIAL_SPAWN_DISTANCE: Range = [10, 28];\nconst SUN_SPAWN_DISTANCE: number = SPAWN_DISTANCE;\nconst SUN_DESPAWN_DISTANCE: number = DESPAWN_DISTANCE;\n// 2.5 degrees is just enough to always let you dodge but for it to be deadly\n// if you're not paying attention\nconst SUN_SPAWN_ARC: Range = [degrees(2.5), degrees(50)];\n\nconst SHIP_MAX_THRUST: number = 0.001;\nconst SHIP_THROTTLE_SPEED_LIMIT: Range = [-1 / 9, 1 / 15];\nconst SHIP_FOV_DEGREES: Range = [80, 86];\nconst SHIP_CAMERA_CHASE_FACTOR: number = 0.6;\n\nconst SHIP_VELOCITY_EPSILON: number = 1e-10;\nconst SHIP_ROTATION_EPSILON: number = 1e-10;\nconst SHIP_ROTATION_TOPOUT: number = 0.01;\nconst SHIP_ROTATION_TOPOUT_SCALING: number = 0.925;\n\nconst SHIP_MOUSE_TURN_SPEED: number = 0.0001;\nconst SHIP_GAMEPAD_TURN_SPEED: number = 0.003;\nconst SHIP_ROLL_SPEED: number = degrees(0.3);\n\n// number of ticks moving at MISSILE_SPEED to travel DESPAWN_DISTANCE\nconst MISSILE_DISTANCE: number = DESPAWN_DISTANCE;\n// This should be notably smaller than the asteroid radius otherwise missiles\n// can phase through asteroids\n// TODO: Check missile collisions at multiple steps to ensure missiles don't\n// \"phase through\" asteroids\nconst MISSILE_SPEED: number = 1.0;\nconst MISSILE_COOLDOWN_TICKS: number = 30;\nconst MISSILE_LIFE_TICKS: number = Math.round(MISSILE_DISTANCE / MISSILE_SPEED);\nconst MISSILE_MASS: number = 0.3;\n\nconst FRECAM_MOUSE_TURN_SPEED: number = 0.002;\nconst FRECAM_ROLL_SPEED: number = 0.02;\nconst FREECAM_DEFAULT_MOVE_SPEED: number = 0.04;\nconst FREECAM_MOVE_SPEED_INCREMENT: number = 0.005;\nconst FREECAM_NEAR_BOUND: number = 1 / 32;\nconst FREECAM_FAR_BOUND: number = 64;\n\nconst MENU_NUM_ASTEROIDS: number = 64;\n// We don't let the angle be 0 or else we get intersections with us\nconst MENU_ASTEROID_VELOCITY_ARC: Range = [degrees(3), degrees(45)];\nconst MENU_ASTEROID_SPAWN_ARC: number = degrees(120);\nconst MENU_ASTEROID_SPAWN_DISTANCE: number = SPAWN_DISTANCE;\nconst MENU_ASTEROID_SPEED: Range = [0.01, 0.1];\n\nconst DEBOUNCE_MS: number = 200;\n\n// TODO: Make these configurable, as well as direction\nconst CONTROLLER_X_AXIS: number = 0;\nconst CONTROLLER_Y_AXIS: number = 1;\nconst DEADZONE: number = 0.15;\n\nfunction asteroidSpeed(level: number): Range {\n  let slow = 0.01 + level * 0.005;\n  let fast = 0.09 + level * 0.03;\n  return [slow, fast];\n}\n\nfunction numAsteroids(level: number): Tiered<number> {\n  let big = Math.round((1 / 2) * level * level + 8 * level);\n  let small = Math.round((1 / 8) * level * level + 4 * level + 4);\n  return [big, small];\n}\n\n// TODO: Actually mix the volume better\nconst MISSILE_SFX: HTMLAudioElement = new Audio(\"missile.mp3\");\nconst MUSIC: HTMLAudioElement = new Audio(\"music.wav\");\nconst MUSIC_VOLUME: number = 1.0;\nconst SFX_VOLUME: number = 1.0;\nMUSIC.volume = MUSIC_VOLUME * 0.75;\nMUSIC.loop = true;\n\ntype Missile = {\n  birth: number;\n  velocity: vec3;\n  obj: SceneObject;\n};\n\nclass Eased {\n  want: number;\n  current: number;\n  speedLimit: Range;\n\n  constructor(value: number, speedLimit: Range) {\n    this.want = value;\n    this.current = value;\n    this.speedLimit = speedLimit;\n  }\n\n  set(value: number) {\n    this.want = value;\n  }\n\n  get() {\n    return this.current;\n  }\n\n  step() {\n    this.current += clamp(this.want - this.current, this.speedLimit);\n  }\n}\n\n// TODO: Implement an ammo mechanic\nclass Ship {\n  velocity: vec3;\n\n  obj: SceneObject;\n  flame: SceneObject;\n  flameAccent: SceneObject;\n  reticle: SceneObject;\n\n  lastFired: number;\n  throttle: Eased;\n\n  worldRotation: quat;\n\n  forward: vec3;\n  up: vec3;\n  right: vec3;\n\n  thrusterSfx: HTMLAudioElement;\n\n  constructor(gl: WebGLRenderingContext) {\n    this.velocity = vec3.create();\n    this.obj = new SceneObject(gl, models.SHIP);\n    this.flame = new SceneObject(gl, models.SHIP_FLAME);\n    this.flameAccent = new SceneObject(gl, models.SHIP_FLAME_ACCENT);\n    // The flame is always by the flame accent\n    this.flameAccent.vertexTransform = this.flame.vertexTransform;\n    this.reticle = new SceneObject(gl, models.SHIP_RETICLE);\n    // The reticle moves with the ship\n    this.reticle.vertexTransform = this.obj.vertexTransform;\n\n    this.lastFired = Number.NEGATIVE_INFINITY;\n    this.throttle = new Eased(0, SHIP_THROTTLE_SPEED_LIMIT);\n\n    this.worldRotation = quat.create();\n\n    this.up = vec3.fromValues(0, 0, -1);\n    this.forward = vec3.fromValues(0, 1, 0);\n    this.right = vec3.fromValues(-1, 0, 0);\n\n    this.thrusterSfx = new Audio(\"thruster.wav\");\n    this.thrusterSfx.loop = true;\n  }\n\n  *objects(): Iterable<SceneObject> {\n    yield this.obj;\n    if (this.throttle.get() > 0) {\n      yield this.flame;\n      yield this.flameAccent;\n    }\n  }\n\n  setThrottle(amount: number) {\n    if (amount != 0) {\n      this.thrusterSfx.play();\n    }\n    this.throttle.set(amount);\n  }\n\n  pitchUp(rads: number) {\n    this.rotate(rads, this.right);\n  }\n\n  yawLeft(rads: number) {\n    this.rotate(rads, this.up);\n  }\n\n  rollRight(rads: number) {\n    this.rotate(rads, this.forward);\n  }\n\n  private rotate(rads: number, aboutWorld: vec3) {\n    let worldImpulse = quat.setAxisAngle(quat.create(), aboutWorld, rads);\n    quat.multiply(this.worldRotation, this.worldRotation, worldImpulse);\n  }\n\n  collisionPoints(): vec3[] {\n    return models.SHIP_COLLISION_POINTS.map((v) =>\n      vec3.transformMat4(vec3.create(), v, this.obj.vertexTransform),\n    );\n  }\n\n  // TODO: Maybe be a free function\n  tryFire(game: Game) {\n    if (game.play.ticks - this.lastFired <= MISSILE_COOLDOWN_TICKS) {\n      return;\n    }\n\n    this.lastFired = game.play.ticks;\n    let sfx = <HTMLAudioElement>MISSILE_SFX.cloneNode();\n    // TODO: Do actual audio mixing\n    sfx.volume = SFX_VOLUME * 0.15;\n    sfx.play();\n\n    let missileVelocity = vec3.create();\n    vec3.scaleAndAdd(missileVelocity, this.velocity, this.forward, MISSILE_SPEED);\n    let obj = new SceneObject(game.gl, models.MISSILE);\n    // We don't call translate because we want to translate in model\n    // coordinates\n    mat4.translate(obj.vertexTransform, obj.vertexTransform, models.SHIP_NOZZLE);\n    mat4.multiply(obj.vertexTransform, this.obj.vertexTransform, obj.vertexTransform);\n\n    game.play.missiles.push({\n      birth: game.play.ticks,\n      velocity: missileVelocity,\n      obj: obj,\n    });\n  }\n\n  eye(): vec3 {\n    let eye = this.obj.pos();\n    vec3.scaleAndAdd(eye, eye, this.forward, -0.65);\n    vec3.scaleAndAdd(eye, eye, this.up, 0.3);\n    return eye;\n  }\n\n  camera(lastPos: vec3): render.Camera {\n    let eye = this.eye();\n    let throttle = this.throttle.get();\n    let fov = interpolate(throttle * throttle, SHIP_FOV_DEGREES);\n    vec3.lerp(eye, lastPos, eye, SHIP_CAMERA_CHASE_FACTOR);\n\n    let viewingTransform = mat4.lookAt(\n      mat4.create(),\n      eye, // eye\n      vec3.add(vec3.create(), eye, this.forward), // center\n      this.up, // up\n    );\n    let perspectiveTransform = mat4.perspective(\n      mat4.create(),\n      degrees(fov), // FOV y\n      canvas.width / canvas.height, // aspect ratio (W/H)\n      NEAR_BOUND, // near bound\n      VIEW_DISTANCE, // far bound\n    );\n\n    return {\n      eye: eye,\n      viewingTransform: viewingTransform,\n      perspectiveTransform: perspectiveTransform,\n    };\n  }\n}\n\nclass Asteroid {\n  obj: SceneObject;\n  velocity: vec3;\n  radius: number;\n  tier: number;\n  rotation: quat;\n  health: number;\n\n  constructor(\n    gl: WebGLRenderingContext,\n    tier: number,\n    velocity: vec3,\n    opt?: { radius: number; rotation: quat },\n  ) {\n    // Clamp the radius to the acceptable values\n    let tierRadius = ASTEROID_RADIUS_TIERS[tier];\n    let radius =\n      opt != undefined\n        ? Math.min(tierRadius[1], Math.max(tierRadius[0], opt.radius))\n        : randf(...tierRadius);\n\n    let [actualRadius, model] = models.randomAsteroid(radius);\n    this.obj = new SceneObject(gl, model);\n    this.radius = actualRadius;\n    this.tier = tier;\n    this.health = ASTEROID_HEALTH_TIERS[tier];\n    this.velocity = velocity;\n    if (opt == undefined) {\n      let rads = randf(...ASTEROID_ROTATION_SPEED);\n      let rotationAxis = vec3.random(vec3.create());\n      this.rotation = quat.setAxisAngle(quat.create(), rotationAxis, rads);\n    } else {\n      this.rotation = opt.rotation;\n    }\n  }\n\n  split(gl: WebGLRenderingContext): [Asteroid, Asteroid] {\n    let direction = vec3.random(vec3.create());\n    let speed = randf(...ASTEROID_SPLIT_SPEED);\n\n    let leftVelocity = vec3.scaleAndAdd(vec3.create(), this.velocity, direction, speed);\n    let left = new Asteroid(gl, this.tier + 1, leftVelocity, {\n      radius: this.radius / 2,\n      rotation: quat.clone(this.rotation),\n    });\n    let pos = this.obj.pos();\n    left.obj.translate(pos);\n    let rightVelocity = vec3.scaleAndAdd(vec3.create(), this.velocity, direction, -speed);\n    let right = new Asteroid(gl, this.tier + 1, rightVelocity, {\n      radius: this.radius / 2,\n      rotation: quat.clone(this.rotation),\n    });\n    right.obj.translate(pos);\n\n    return [left, right];\n  }\n\n  damage() {\n    this.health -= 1;\n\n    let material = this.obj.model.material;\n    let healthPercent = this.health / ASTEROID_HEALTH_TIERS[this.tier];\n    for (let i = 0; i < 3; i++) {\n      let color =\n        models.ASTEROID_COLOR[i] * healthPercent +\n        models.ASTEROID_DAMAGED_COLOR[i] * (1 - healthPercent);\n      material.ambient[i] = color * models.ASTEROID_AMBIENT_SCALAR;\n      material.diffuse[i] = color * models.ASTEROID_DIFFUSE_SCALAR;\n    }\n  }\n}\n\n// TODO: Make sun a class?\nfunction sunContains(sun: SceneObject, point: vec3): boolean {\n  let center = sun.pos();\n  return [0, 1, 2].every(\n    (i) =>\n      center[i] - models.SUN_SIDE_LENGTH / 2 <= point[i] &&\n      point[i] <= center[i] + models.SUN_SIDE_LENGTH / 2,\n  );\n}\n\nenum GameMode {\n  Menu,\n  Pause,\n  Play,\n  Freecam,\n}\n\nexport type Game = {\n  gl: WebGLRenderingContext;\n  shaderInfo: render.ShaderAttributes;\n  mode: GameMode;\n  inputs: {\n    keyboard: Keyboard;\n    gamepad: number;\n    pauseDebouncer: Debouncer;\n    mouseDown: boolean;\n  };\n  play: {\n    ship: Ship;\n    missiles: Missile[];\n    tieredAsteroids: Tiered<Asteroid[]>;\n    numAsteroids: Tiered<number>;\n    suns: SceneObject[];\n    ticks: number;\n    score: number;\n    lastCameraPosition: vec3;\n    camera: Camera;\n    asteroidSpeed: Range;\n    level: number;\n    levelFinishedAt: null | number;\n  };\n  freecam: {\n    freecamModeDebouncer: Debouncer;\n    generalDebouncer: Debouncer;\n    camera: FreeCamera;\n    fog: boolean;\n    showShipCollisions: boolean;\n  };\n  menu: {\n    camera: FreeCamera;\n    asteroids: Asteroid[];\n    suns: SceneObject[];\n    movingCamera: boolean;\n    moveModeDebouncer: Debouncer;\n  };\n};\n\nfunction initGame(gl: WebGLRenderingContext): Game {\n  let keyboard = new Keyboard();\n  keyboard.register();\n  let ship = new Ship(gl);\n\n  let game: Game = {\n    gl: gl,\n    shaderInfo: render.setupShaders(gl),\n    mode: GameMode.Menu,\n    inputs: {\n      keyboard: keyboard,\n      // TODO: Don't hardcode\n      gamepad: 0,\n      pauseDebouncer: new Debouncer(Date.now, DEBOUNCE_MS),\n      mouseDown: false,\n    },\n    play: {\n      ship: ship,\n      missiles: [],\n      tieredAsteroids: [[], []],\n      // These get reassigned when we play a level\n      numAsteroids: [0, 0],\n      suns: [],\n      ticks: 0,\n      score: 0,\n      lastCameraPosition: ship.eye(),\n      camera: ship.camera(ship.eye()),\n      asteroidSpeed: [0, 0],\n      level: 0,\n      levelFinishedAt: null,\n    },\n    freecam: {\n      camera: new FreeCamera({\n        eye: vec3.fromValues(0, 0, -5),\n        lookAt: vec3.fromValues(0, 0, 1),\n        lookUp: vec3.fromValues(0, 1, 0),\n        width: canvas.width,\n        height: canvas.height,\n        fovDegrees: SHIP_FOV_DEGREES[0],\n        near: FREECAM_NEAR_BOUND,\n        far: FREECAM_FAR_BOUND,\n        moveSpeed: FREECAM_DEFAULT_MOVE_SPEED,\n      }),\n      freecamModeDebouncer: new Debouncer(Date.now, DEBOUNCE_MS),\n      generalDebouncer: new Debouncer(Date.now, DEBOUNCE_MS),\n      fog: true,\n      showShipCollisions: false,\n    },\n    menu: {\n      camera: new FreeCamera({\n        eye: vec3.fromValues(0, 0, 0),\n        lookAt: vec3.fromValues(0, 0, 1),\n        lookUp: vec3.fromValues(0, 1, 0),\n        width: canvas.width,\n        height: canvas.height,\n        fovDegrees: SHIP_FOV_DEGREES[0],\n        near: NEAR_BOUND,\n        far: VIEW_DISTANCE,\n        moveSpeed: FREECAM_DEFAULT_MOVE_SPEED,\n      }),\n      asteroids: [],\n      suns: [],\n      movingCamera: false,\n      moveModeDebouncer: new Debouncer(Date.now, DEBOUNCE_MS),\n    },\n  };\n\n  // Set up menu\n  menuScene(game);\n\n  return game;\n}\n\nfunction* allAsteroids(game: Game): Iterable<Asteroid> {\n  for (const tier of game.play.tieredAsteroids) {\n    yield* tier;\n  }\n}\n\nfunction menuScene(game: Game) {\n  let camera = game.menu.camera;\n  camera.yawLeft(degrees(-30));\n  camera.pitchUp(degrees(-20));\n  let sun = new SceneObject(game.gl, models.SUN);\n  sun.translate(vec3.fromValues(3.5, -4, 10));\n  game.menu.suns.push(sun);\n  let backlight = new SceneObject(game.gl, models.SUN);\n  backlight.translate(vec3.scaleAndAdd(vec3.create(), camera.eye, camera.forward, -4));\n  game.menu.suns.push(backlight);\n}\n\nfunction* playObjects(game: Game): Iterable<SceneObject> {\n  yield* game.play.ship.objects();\n  if (game.freecam.showShipCollisions) {\n    for (const v of game.play.ship.collisionPoints()) {\n      let obj = new SceneObject(game.gl, models.DOT);\n      obj.translate(v);\n      yield obj;\n    }\n  }\n  for (const m of game.play.missiles) {\n    yield m.obj;\n  }\n  for (const a of allAsteroids(game)) {\n    yield a.obj;\n  }\n  yield* game.play.suns;\n}\n\nfunction* playFrontObjects(game: Game): Iterable<SceneObject> {\n  yield game.play.ship.reticle;\n}\n\nfunction* playLights(game: Game): Iterable<vec3> {\n  for (const sun of game.play.suns) {\n    yield sun.pos();\n  }\n}\n\nfunction* menuObjects(game: Game): Iterable<SceneObject> {\n  for (const a of game.menu.asteroids) {\n    yield a.obj;\n  }\n  yield* game.menu.suns;\n}\n\nfunction* menuLights(game: Game): Iterable<vec3> {\n  for (const sun of game.menu.suns) {\n    yield sun.pos();\n  }\n}\n\n// Schedules the next frame based on the game mode\nfunction scheduleNextFrame(game: Game) {\n  if (game.mode == GameMode.Menu) {\n    requestAnimationFrame(() => menuLoop(game));\n  } else if (game.mode == GameMode.Pause) {\n    requestAnimationFrame(() => pauseLoop(game));\n  } else if (game.mode == GameMode.Play) {\n    requestAnimationFrame(() => playLoop(game));\n  } else if (game.mode == GameMode.Freecam) {\n    requestAnimationFrame(() => devLoop(game));\n  }\n}\n\nfunction quitGame(game: Game) {\n  display.time.hidden = true;\n  display.score.hidden = true;\n  display.level.hidden = true;\n\n  display.mainText.innerHTML = \"Asteroids\";\n  display.mainText.hidden = false;\n  display.menuButton.innerHTML = \"Start\";\n  display.menuButton.hidden = false;\n  display.menuButton.onclick = () => {\n    playGame(game, 1);\n  };\n  display.menuButton2.hidden = true;\n\n  game.mode = GameMode.Menu;\n}\n\nfunction gameOver(game: Game) {\n  display.time.hidden = false;\n  display.score.hidden = false;\n  display.level.hidden = false;\n\n  display.mainText.innerHTML = \"Game Over\";\n  display.mainText.hidden = false;\n  display.menuButton.innerHTML = \"Restart\";\n  display.menuButton.hidden = false;\n  display.menuButton.onclick = () => {\n    playGame(game, 1);\n  };\n  display.menuButton2.innerHTML = \"Quit\";\n  display.menuButton2.hidden = false;\n  display.menuButton2.onclick = () => {\n    quitGame(game);\n  };\n\n  game.play.ship.thrusterSfx.pause();\n\n  document.exitPointerLock();\n  game.mode = GameMode.Pause;\n}\n\nfunction pauseGame(game: Game) {\n  display.score.hidden = false;\n  display.time.hidden = false;\n  display.level.hidden = false;\n\n  display.mainText.innerHTML = \"Pause\";\n  display.mainText.hidden = false;\n  display.menuButton.innerHTML = \"Unpause\";\n  display.menuButton.hidden = false;\n  display.menuButton.onclick = () => {\n    unpauseGame(game);\n  };\n  display.menuButton2.innerHTML = \"Quit\";\n  display.menuButton2.hidden = false;\n  display.menuButton2.onclick = () => {\n    quitGame(game);\n  };\n\n  MUSIC.pause();\n  game.play.ship.thrusterSfx.pause();\n\n  document.exitPointerLock();\n  game.mode = GameMode.Pause;\n}\n\nfunction unpauseGame(game: Game) {\n  display.time.hidden = false;\n  display.score.hidden = false;\n  display.level.hidden = false;\n\n  display.mainText.hidden = true;\n  display.menuButton.hidden = true;\n  display.menuButton2.hidden = true;\n\n  MUSIC.play();\n\n  canvas.requestPointerLock();\n  game.mode = GameMode.Play;\n}\n\nfunction playGame(game: Game, level: number) {\n  display.time.hidden = false;\n  display.score.hidden = false;\n  display.level.hidden = false;\n\n  display.mainText.hidden = true;\n  display.menuButton.hidden = true;\n  display.menuButton2.hidden = true;\n\n  if (level == 1) {\n    MUSIC.play();\n    MUSIC.currentTime = 0.0;\n  }\n\n  canvas.requestPointerLock();\n  game.mode = GameMode.Play;\n\n  game.play.ship = new Ship(game.gl);\n  game.play.missiles = [];\n  game.play.tieredAsteroids = [[], []];\n  game.play.numAsteroids = numAsteroids(level);\n  game.play.asteroidSpeed = asteroidSpeed(level);\n  game.play.suns = [];\n  game.play.score = 0;\n  game.play.ticks = 0;\n  game.play.lastCameraPosition = game.play.ship.eye();\n  game.play.camera = game.play.ship.camera(game.play.ship.eye());\n  game.play.level = level;\n  game.play.levelFinishedAt = null;\n  updateScore(game);\n  updateClock(game);\n  updateLevel(game);\n\n  for (const [tier, numAsteroids] of game.play.numAsteroids.entries()) {\n    for (let i = 0; i < numAsteroids; i++) {\n      let pos = randomArc(game.play.ship.forward, ASTEROID_SPAWN_ARC);\n      let velocity = randomArc(vec3.scale(vec3.create(), pos, -1), ASTEROID_VELOCITY_ARC);\n      vec3.scale(pos, pos, randf(...ASTEROID_INITIAL_SPAWN_DISTANCE));\n      vec3.scale(velocity, velocity, randf(...game.play.asteroidSpeed));\n\n      let asteroid = new Asteroid(game.gl, tier, velocity);\n      asteroid.velocity = velocity;\n      asteroid.obj.translate(pos);\n      game.play.tieredAsteroids[tier].push(asteroid);\n    }\n  }\n\n  for (let i = 0; i < render.NUM_SUNS; i++) {\n    // TODO: Ensure suns aren't close together?\n    let sun = new SceneObject(game.gl, models.SUN);\n    sun.translate(vec3.random(vec3.create(), randf(...SUN_INITIAL_SPAWN_DISTANCE)));\n    game.play.suns.push(sun);\n  }\n}\n\nfunction devMode(game: Game) {\n  game.freecam.camera.sync(game.play.ship, game.play.camera);\n  game.mode = GameMode.Freecam;\n}\n\nfunction undevMode(game: Game) {\n  game.mode = GameMode.Play;\n}\n\nfunction checkNextLevel(game: Game) {\n  if (game.play.levelFinishedAt != null) {\n    // We'eve finished the level\n    if (game.play.ticks - game.play.levelFinishedAt < LEVEL_WAIT_TICKS) {\n      return;\n    } else {\n      playGame(game, game.play.level + 1);\n    }\n  }\n\n  if (game.play.numAsteroids.every((n) => n == 0)) {\n    game.play.levelFinishedAt = game.play.ticks;\n  }\n}\n\nexport class FreeCamera {\n  public eye: vec3;\n  public forward: vec3;\n  public up: vec3;\n  public right: vec3;\n\n  public moveSpeed: number;\n\n  public readonly viewingTransform: mat4;\n  public readonly perspectiveTransform: mat4;\n\n  constructor({\n    eye,\n    lookAt,\n    lookUp,\n    width,\n    height,\n    fovDegrees,\n    near,\n    far,\n    moveSpeed,\n  }: {\n    eye: vec3;\n    lookAt: vec3;\n    lookUp: vec3;\n    width: number;\n    height: number;\n    fovDegrees: number;\n    near: number;\n    far: number;\n    moveSpeed: number;\n  }) {\n    this.eye = eye;\n    this.forward = lookAt;\n    this.up = lookUp;\n    this.right = vec3.cross(vec3.create(), lookAt, lookUp);\n\n    this.moveSpeed = moveSpeed;\n\n    this.viewingTransform = mat4.create();\n    this.perspectiveTransform = mat4.create();\n    this.refreshView();\n    mat4.perspective(\n      this.perspectiveTransform,\n      degrees(fovDegrees), // FOV y\n      width / height, // aspect ratio (W/H)\n      near, // near bound\n      far, // far bound\n    );\n  }\n\n  private refreshView() {\n    mat4.lookAt(\n      this.viewingTransform,\n      this.eye, // eye\n      vec3.add(vec3.create(), this.eye, this.forward), // center\n      this.up, // up\n    );\n  }\n\n  move(direction: vec3, distance: number) {\n    vec3.scaleAndAdd(this.eye, this.eye, direction, distance);\n    this.refreshView();\n  }\n\n  pitchUp(rads: number) {\n    this.transformView(mat4.fromRotation(mat4.create(), rads, this.right));\n    this.refreshView();\n  }\n\n  yawLeft(rads: number) {\n    this.transformView(mat4.fromRotation(mat4.create(), rads, this.up));\n    this.refreshView();\n  }\n\n  rollRight(rads: number) {\n    this.transformView(mat4.fromRotation(mat4.create(), rads, this.forward));\n    this.refreshView();\n  }\n\n  private transformView(transform: mat4) {\n    vec3.transformMat4(this.forward, this.forward, transform);\n    vec3.transformMat4(this.up, this.up, transform);\n    vec3.transformMat4(this.right, this.right, transform);\n  }\n\n  sync(ship: Ship, cam: Camera) {\n    vec3.copy(this.forward, ship.forward);\n    vec3.copy(this.up, ship.up);\n    vec3.copy(this.right, ship.right);\n    vec3.copy(this.eye, cam.eye);\n    mat4.copy(this.viewingTransform, cam.viewingTransform);\n  }\n}\n\nfunction handleKeyboard(game: Game) {\n  let keyboard = game.inputs.keyboard;\n\n  if (game.inputs.mouseDown) {\n    game.play.ship.tryFire(game);\n  }\n\n  if (keyboard.pressed.has(\"KeyP\")) {\n    game.inputs.pauseDebouncer.try(() => pauseGame(game));\n  }\n\n  if (keyboard.pressed.has(\"KeyE\")) {\n    game.play.ship.rollRight(SHIP_ROLL_SPEED);\n  }\n  if (keyboard.pressed.has(\"KeyQ\")) {\n    game.play.ship.rollRight(-SHIP_ROLL_SPEED);\n  }\n\n  if (keyboard.pressed.has(\"KeyW\")) {\n    game.play.ship.setThrottle(1.0);\n  } else {\n    game.play.ship.setThrottle(0.0);\n  }\n\n  if (keyboard.pressed.has(\"Space\")) {\n    game.play.ship.tryFire(game);\n  }\n}\n\nfunction handleGamepad(game: Game) {\n  let gamepad = navigator.getGamepads()[game.inputs.gamepad];\n  if (gamepad == null) {\n    return;\n  }\n\n  const PITCH_AXIS = 1;\n  const YAW_AXIS = 0;\n  const ROLL_AXIS = 2;\n  const THROTTLE_TRIGGER = 7;\n  const BUTTON_A = 0;\n  const BUTTON_R = 5;\n\n  game.play.ship.pitchUp(SHIP_GAMEPAD_TURN_SPEED * gamepad.axes[PITCH_AXIS]);\n  game.play.ship.yawLeft(-SHIP_GAMEPAD_TURN_SPEED * gamepad.axes[YAW_AXIS]);\n  game.play.ship.rollRight(SHIP_GAMEPAD_TURN_SPEED * gamepad.axes[ROLL_AXIS]);\n  game.play.ship.setThrottle(gamepad.buttons[THROTTLE_TRIGGER].value);\n  if (gamepad.buttons[BUTTON_R].pressed || gamepad.buttons[BUTTON_A].pressed) {\n    game.play.ship.tryFire(game);\n  }\n\n  console.log(gamepad);\n}\n\nfunction spawnSuns(game: Game) {\n  // TODO: Make sure the suns never appear close together?\n  while (game.play.suns.length < render.NUM_SUNS) {\n    let sun = new SceneObject(game.gl, models.SUN);\n    let pos: vec3;\n    if (vec3.length(game.play.ship.velocity) < SHIP_VELOCITY_EPSILON) {\n      pos = vec3.random(vec3.create());\n    } else {\n      let direction = vec3.normalize(vec3.create(), game.play.ship.velocity);\n      pos = randomArcRange(direction, SUN_SPAWN_ARC);\n    }\n    vec3.scaleAndAdd(pos, game.play.ship.obj.pos(), pos, SUN_SPAWN_DISTANCE);\n    sun.translate(pos);\n    game.play.suns.push(sun);\n  }\n}\n\n// Make the object appear vaguely in the direction we're going\nfunction spawnMenuAsteroids(game: Game) {\n  let camera = game.menu.camera;\n  while (game.menu.asteroids.length < MENU_NUM_ASTEROIDS) {\n    let pos = randomArc(camera.forward, MENU_ASTEROID_SPAWN_ARC);\n    // Now generate a velocity arc in the opposite direction\n    let velocity = randomArcRange(vec3.scale(vec3.create(), pos, -1), MENU_ASTEROID_VELOCITY_ARC);\n    vec3.scaleAndAdd(pos, camera.eye, pos, MENU_ASTEROID_SPAWN_DISTANCE);\n    vec3.scale(velocity, velocity, randf(...MENU_ASTEROID_SPEED));\n\n    let asteroid = new Asteroid(game.gl, 1, velocity);\n    asteroid.velocity = velocity;\n    asteroid.obj.translate(pos);\n    game.menu.asteroids.push(asteroid);\n  }\n}\n\n// Make the object appear vaguely in the direction we're going\nfunction despawnMenuAsteroids(game: Game) {\n  let deadAsteroids: number[] = [];\n  for (const [asteroidId, asteroid] of game.menu.asteroids.entries()) {\n    if (vec3.distance(game.menu.camera.eye, asteroid.obj.pos()) > ASTEROID_DESPAWN_DISTANCE) {\n      deadAsteroids.push(asteroidId);\n    }\n  }\n  for (let i = deadAsteroids.length - 1; i >= 0; i--) {\n    game.menu.asteroids.splice(deadAsteroids[i], 1);\n  }\n}\n\n// Make the object appear vaguely in the direction we're going\nfunction spawnAsteroids(game: Game) {\n  for (let tier = 0; tier < ASTEROID_TIERS; tier++) {\n    while (game.play.tieredAsteroids[tier].length < game.play.numAsteroids[tier]) {\n      let pos = randomArc(game.play.ship.forward, ASTEROID_SPAWN_ARC);\n      // Now generate a velocity arc in the opposite direction\n      let velocity = randomArc(\n        vec3.scale(vec3.create(), game.play.ship.forward, -1),\n        ASTEROID_VELOCITY_ARC,\n      );\n      vec3.scaleAndAdd(pos, game.play.ship.obj.pos(), pos, ASTEROID_SPAWN_DISTANCE);\n      vec3.scale(velocity, velocity, randf(...game.play.asteroidSpeed));\n\n      let asteroid = new Asteroid(game.gl, tier, velocity);\n      asteroid.velocity = velocity;\n      asteroid.obj.translate(pos);\n      game.play.tieredAsteroids[tier].push(asteroid);\n    }\n  }\n}\n\nfunction despawnSuns(game: Game) {\n  let deadSuns: number[] = [];\n  for (const [sunId, sun] of game.play.suns.entries()) {\n    if (vec3.distance(game.play.ship.obj.pos(), sun.pos()) > SUN_DESPAWN_DISTANCE) {\n      deadSuns.push(sunId);\n    }\n  }\n  for (let i = deadSuns.length - 1; i >= 0; i--) {\n    game.play.suns.splice(deadSuns[i], 1);\n  }\n}\n\nfunction despawnAsteroids(game: Game) {\n  let deadAsteroids: Tiered<number[]> = [[], []];\n  for (const [tier, asteroids] of game.play.tieredAsteroids.entries()) {\n    for (const [asteroidId, asteroid] of asteroids.entries()) {\n      if (vec3.distance(game.play.ship.obj.pos(), asteroid.obj.pos()) > ASTEROID_DESPAWN_DISTANCE) {\n        deadAsteroids[tier].push(asteroidId);\n      }\n    }\n  }\n  for (const [tier, dead] of deadAsteroids.entries()) {\n    for (let i = dead.length - 1; i >= 0; i--) {\n      game.play.tieredAsteroids[tier].splice(dead[i], 1);\n    }\n  }\n}\n\nfunction despawnMissiles(game: Game) {\n  // TODO: Use a queue or something more efficient?\n  while (\n    game.play.missiles.length > 0 &&\n    game.play.ticks - game.play.missiles[0].birth > MISSILE_LIFE_TICKS\n  ) {\n    game.play.missiles.shift();\n  }\n}\n\nfunction handleDeadAsteroids(game: Game) {\n  for (let tier = 0; tier < ASTEROID_TIERS; tier++) {\n    for (let i = game.play.tieredAsteroids[tier].length - 1; i >= 0; i--) {\n      let asteroid = game.play.tieredAsteroids[tier][i];\n      if (asteroid.health <= 0) {\n        if (tier + 1 < ASTEROID_TIERS) {\n          let children = asteroid.split(game.gl);\n          game.play.tieredAsteroids[tier + 1].push(...children);\n          game.play.numAsteroids[tier + 1] += children.length;\n        }\n        game.play.tieredAsteroids[tier].splice(i, 1);\n        game.play.numAsteroids[tier] -= 1;\n        game.play.score += ASTEROID_POINT_TIERS[tier];\n        updateScore(game);\n      }\n    }\n  }\n}\n\nfunction accelerateShip(game: Game) {\n  vec3.scaleAndAdd(\n    game.play.ship.velocity,\n    game.play.ship.velocity,\n    game.play.ship.forward,\n    SHIP_MAX_THRUST * game.play.ship.throttle.get(),\n  );\n}\n\nfunction refreshThrottle(game: Game) {\n  let ship = game.play.ship;\n  ship.throttle.step();\n  let throttle = ship.throttle.get();\n\n  mat4.scale(ship.flame.vertexTransform, ship.obj.vertexTransform, vec3.fromValues(1, throttle, 1));\n\n  let wiggleUp = 0.006 * Math.sin(0.707106781187 * game.play.ticks);\n  let wiggleSide = 0.004 * Math.sin((1.61803 / 2) * game.play.ticks);\n  // let wiggleUp = randf(-WIGGLE, WIGGLE);\n  // let wiggleSide = randf(-WIGGLE, WIGGLE);\n  mat4.rotate(\n    ship.flame.vertexTransform,\n    ship.flame.vertexTransform,\n    wiggleUp,\n    vec3.fromValues(1, 0, 0),\n  );\n  mat4.rotate(\n    ship.flame.vertexTransform,\n    ship.flame.vertexTransform,\n    wiggleSide,\n    vec3.fromValues(0, 0, 1),\n  );\n\n  ship.thrusterSfx.volume = SFX_VOLUME * throttle;\n}\n\nfunction rotateShip(game: Game) {\n  let ship = game.play.ship;\n\n  // In radians per tick\n  let turnSpeed = quat.getAxisAngle(vec3.create(), ship.worldRotation);\n  let rotationFactor =\n    (Math.log(turnSpeed) - Math.log(SHIP_ROTATION_EPSILON)) /\n    (Math.log(SHIP_ROTATION_TOPOUT) - Math.log(SHIP_ROTATION_EPSILON));\n  rotationFactor = clamp(rotationFactor, [0, 1]);\n  const scaleFactor = rotationFactor * SHIP_ROTATION_TOPOUT_SCALING;\n  quat.scale(ship.worldRotation, ship.worldRotation, scaleFactor);\n  quat.calculateW(ship.worldRotation, ship.worldRotation);\n\n  // Rotate\n  vec3.transformQuat(ship.forward, ship.forward, ship.worldRotation);\n  vec3.transformQuat(ship.up, ship.up, ship.worldRotation);\n  vec3.transformQuat(ship.right, ship.right, ship.worldRotation);\n\n  let pos = ship.obj.pos();\n  ship.obj.translate(vec3.scale(vec3.create(), pos, -1));\n  let rot = mat4.fromQuat(mat4.create(), ship.worldRotation);\n  mat4.multiply(ship.obj.vertexTransform, rot, ship.obj.vertexTransform);\n  ship.obj.translate(pos);\n}\n\nfunction moveShip(game: Game) {\n  game.play.ship.obj.translate(game.play.ship.velocity);\n}\n\nfunction moveMissiles(game: Game) {\n  for (const missile of game.play.missiles) {\n    missile.obj.translate(missile.velocity);\n  }\n}\n\nfunction moveAsteroids(game: Game) {\n  for (const asteroid of allAsteroids(game)) {\n    asteroid.obj.translate(asteroid.velocity);\n\n    let pos = asteroid.obj.pos();\n    asteroid.obj.translate(vec3.scale(vec3.create(), pos, -1));\n    let rot = mat4.fromQuat(mat4.create(), asteroid.rotation);\n    mat4.multiply(asteroid.obj.vertexTransform, rot, asteroid.obj.vertexTransform);\n    asteroid.obj.translate(pos);\n  }\n}\n\nfunction collideShipAsteroid(game: Game) {\n  // TODO: Do more intelligent things on a loss. Also probably just lower\n  // health and do certain things when health hits 0 collisions better\n  for (const asteroid of allAsteroids(game)) {\n    // TODO: Add asteroid momentum\n    for (const v of game.play.ship.collisionPoints()) {\n      // We use a slightly smaller radius to tilt errors in the players favor\n      if (vec3.distance(asteroid.obj.pos(), v) <= ASTEROID_RADIUS_FUDGE_FACTOR * asteroid.radius) {\n        // TODO: Add health and collisions\n        gameOver(game);\n      }\n    }\n  }\n}\n\nfunction collideShipSun(game: Game) {\n  for (const sun of game.play.suns) {\n    for (const v of game.play.ship.collisionPoints()) {\n      if (sunContains(sun, v)) {\n        gameOver(game);\n      }\n    }\n  }\n}\n\nfunction collideMissileAsteroid(game: Game) {\n  let deadMissiles: number[] = [];\n  for (const asteroid of allAsteroids(game)) {\n    for (const [missileId, missile] of game.play.missiles.entries()) {\n      let dist = vec3.distance(asteroid.obj.pos(), missile.obj.pos());\n      if (dist <= asteroid.radius) {\n        deadMissiles.push(missileId);\n        asteroid.damage();\n\n        let asteroidVolume = (4 / 3) * Math.PI * asteroid.radius ** 3;\n        let asteroidMass = ASTEROID_DENSITY * asteroidVolume;\n        let asteroidRotationalInertia = (2 / 5) * asteroidMass * asteroid.radius ** 2;\n\n        // TODO: Figure out where to put this and how to generalize this\n        // behavior\n        // TODO: Account for rotation\n        let normal = vec3.subtract(vec3.create(), missile.obj.pos(), asteroid.obj.pos());\n        let collisionRadius = vec3.length(normal);\n        vec3.normalize(normal, normal);\n        let normalSpeed = Math.abs(vec3.dot(normal, missile.velocity));\n\n        let perpendicularVelocity = vec3.scaleAndAdd(\n          vec3.create(),\n          missile.velocity,\n          normal,\n          -normalSpeed,\n        );\n\n        // Dividing by asteroid mass accounts for momentum\n        vec3.scaleAndAdd(\n          asteroid.velocity,\n          asteroid.velocity,\n          normal,\n          -normalSpeed * (MISSILE_MASS / asteroidMass),\n        );\n\n        let rotationAxis = vec3.cross(vec3.create(), normal, perpendicularVelocity);\n        vec3.normalize(rotationAxis, rotationAxis);\n        let missileTorque = collisionRadius * vec3.length(perpendicularVelocity) * MISSILE_MASS;\n        let rot = quat.setAxisAngle(\n          quat.create(),\n          rotationAxis,\n          missileTorque / asteroidRotationalInertia,\n        );\n        quat.multiply(asteroid.rotation, asteroid.rotation, rot);\n      }\n    }\n  }\n  for (let i = deadMissiles.length - 1; i >= 0; i--) {\n    game.play.missiles.splice(deadMissiles[i], 1);\n  }\n}\n\nfunction collideMissileSun(game: Game) {\n  let deadMissiles: number[] = [];\n  for (const sun of game.play.suns) {\n    for (const [missileId, missile] of game.play.missiles.entries()) {\n      if (sunContains(sun, missile.obj.pos())) {\n        deadMissiles.push(missileId);\n      }\n    }\n  }\n  for (let i = deadMissiles.length - 1; i >= 0; i--) {\n    game.play.missiles.splice(deadMissiles[i], 1);\n  }\n}\n\nfunction updatePlayCamera(game: Game) {\n  game.play.camera = game.play.ship.camera(game.play.lastCameraPosition);\n  game.play.lastCameraPosition = game.play.ship.eye();\n}\n\nfunction updateScore(game: Game) {\n  display.score.innerText = `Score: ${game.play.score}`;\n}\n\nfunction updateClock(game: Game) {\n  let totalSeconds = Math.floor(game.play.ticks / 60);\n  let minutes = Math.floor(totalSeconds / 60);\n  let seconds = totalSeconds % 60;\n  display.time.innerText = `Time: ${minutes}:${seconds.toString().padStart(2, \"0\")}`;\n}\n\nfunction updateLevel(game: Game) {\n  display.level.innerText = `Level: ${game.play.level}`;\n}\n\nfunction handleFreecamMoves(keyboard: Keyboard, camera: FreeCamera) {\n  let camMove = vec3.create();\n\n  // Camera movements\n  if (keyboard.pressed.has(\"KeyA\")) {\n    vec3.scaleAndAdd(camMove, camMove, camera.right, -1);\n  }\n  if (keyboard.pressed.has(\"KeyD\")) {\n    vec3.add(camMove, camMove, camera.right);\n  }\n  if (keyboard.pressed.has(\"KeyW\")) {\n    vec3.add(camMove, camMove, camera.forward);\n  }\n  if (keyboard.pressed.has(\"KeyS\")) {\n    vec3.scaleAndAdd(camMove, camMove, camera.forward, -1);\n  }\n  if (keyboard.pressed.has(\"ShiftLeft\")) {\n    vec3.scaleAndAdd(camMove, camMove, camera.up, -1);\n  }\n  if (keyboard.pressed.has(\"Space\")) {\n    vec3.add(camMove, camMove, camera.up);\n  }\n\n  if (!vec3.exactEquals(camMove, vec3.create())) {\n    vec3.normalize(camMove, camMove);\n    camera.move(camMove, camera.moveSpeed);\n  }\n\n  if (keyboard.pressed.has(\"KeyE\")) {\n    camera.rollRight(FRECAM_ROLL_SPEED);\n  }\n  if (keyboard.pressed.has(\"KeyQ\")) {\n    camera.rollRight(-FRECAM_ROLL_SPEED);\n  }\n\n  if (keyboard.pressed.has(\"ArrowUp\")) {\n    camera.moveSpeed += FREECAM_MOVE_SPEED_INCREMENT;\n  }\n  if (keyboard.pressed.has(\"ArrowDown\") && camera.moveSpeed > FREECAM_MOVE_SPEED_INCREMENT) {\n    camera.moveSpeed -= FREECAM_MOVE_SPEED_INCREMENT;\n  }\n}\n\nfunction devLoop(game: Game) {\n  let keyboard = game.inputs.keyboard;\n\n  handleFreecamMoves(keyboard, game.freecam.camera);\n\n  if (keyboard.pressed.has(\"ArrowLeft\")) {\n    game.freecam.generalDebouncer.try(() => {\n      game.play.level = Math.max(1, game.play.level - 1);\n      game.play.numAsteroids = numAsteroids(game.play.level);\n      updateLevel(game);\n    });\n  }\n  if (keyboard.pressed.has(\"ArrowRight\")) {\n    game.freecam.generalDebouncer.try(() => {\n      game.play.level += 1;\n      game.play.numAsteroids = numAsteroids(game.play.level);\n      updateLevel(game);\n    });\n  }\n\n  if (keyboard.pressed.has(\"KeyF\")) {\n    game.freecam.generalDebouncer.try(() => {\n      game.freecam.fog = !game.freecam.fog;\n    });\n  }\n\n  if (keyboard.pressed.has(\"KeyC\")) {\n    game.freecam.generalDebouncer.try(() => {\n      game.freecam.showShipCollisions = !game.freecam.showShipCollisions;\n    });\n  }\n\n  if (keyboard.pressed.has(\"KeyB\")) {\n    game.freecam.freecamModeDebouncer.try(() => undevMode(game));\n  }\n  render.render(\n    game.gl,\n    playLights(game),\n    playObjects(game),\n    playFrontObjects(game),\n    game.shaderInfo,\n    game.freecam.camera,\n    {\n      fog: game.freecam.fog,\n    },\n  );\n\n  scheduleNextFrame(game);\n}\n\nfunction menuLoop(game: Game) {\n  despawnMenuAsteroids(game);\n  spawnMenuAsteroids(game);\n\n  for (const asteroid of game.menu.asteroids) {\n    asteroid.obj.translate(asteroid.velocity);\n    let rotMatrix = mat4.fromQuat(mat4.create(), asteroid.rotation);\n    mat4.multiply(asteroid.obj.vertexTransform, asteroid.obj.vertexTransform, rotMatrix);\n  }\n\n  if (game.inputs.keyboard.pressed.has(\"KeyB\")) {\n    game.menu.moveModeDebouncer.try(() => {\n      if (game.menu.movingCamera) {\n        document.exitPointerLock();\n        game.menu.movingCamera = false;\n      } else {\n        canvas.requestPointerLock();\n        game.menu.movingCamera = true;\n      }\n    });\n  }\n\n  if (game.menu.movingCamera) {\n    handleFreecamMoves(game.inputs.keyboard, game.menu.camera);\n  }\n\n  render.render(\n    game.gl,\n    menuLights(game),\n    menuObjects(game),\n    [],\n    game.shaderInfo,\n    game.menu.camera,\n  );\n\n  scheduleNextFrame(game);\n}\n\nfunction pauseLoop(game: Game) {\n  if (game.inputs.keyboard.pressed.has(\"KeyP\")) {\n    game.inputs.pauseDebouncer.try(() => unpauseGame(game));\n  }\n\n  render.render(\n    game.gl,\n    playLights(game),\n    playObjects(game),\n    playFrontObjects(game),\n    game.shaderInfo,\n    game.play.camera,\n  );\n\n  scheduleNextFrame(game);\n}\n\nfunction playLoop(game: Game) {\n  checkNextLevel(game);\n\n  handleKeyboard(game);\n  handleGamepad(game);\n\n  // Despawn far away objects\n  despawnSuns(game);\n  despawnAsteroids(game);\n  despawnMissiles(game);\n\n  // Handle new object creation\n  spawnSuns(game);\n  spawnAsteroids(game);\n\n  // Handle collisions\n  collideMissileSun(game);\n  collideMissileAsteroid(game);\n\n  // Destroy objects\n  handleDeadAsteroids(game);\n\n  // Handle acceleration\n  accelerateShip(game);\n\n  // Handle velocity\n  moveShip(game);\n  moveMissiles(game);\n  moveAsteroids(game);\n\n  // Possibly kill ship\n  // We don't want to kill the ship if we've finished the level\n  if (game.play.levelFinishedAt == null) {\n    collideShipAsteroid(game);\n    collideShipSun(game);\n  }\n\n  updateClock(game);\n\n  updatePlayCamera(game);\n\n  // Sync the ship's model\n  refreshThrottle(game);\n  rotateShip(game);\n\n  if (game.inputs.keyboard.pressed.has(\"KeyB\")) {\n    game.freecam.freecamModeDebouncer.try(() => devMode(game));\n  }\n\n  game.play.ticks += 1;\n  render.render(\n    game.gl,\n    playLights(game),\n    playObjects(game),\n    playFrontObjects(game),\n    game.shaderInfo,\n    game.play.camera,\n  );\n\n  scheduleNextFrame(game);\n}\n\nconst canvas = <HTMLCanvasElement>document.getElementById(\"game-canvas\");\n// TODO: Make this dynamic instead of hardcoding certain positions. Also move\n// to \"text\" module\nconst display = {\n  score: <HTMLElement>document.getElementById(\"score-text\"),\n  time: <HTMLElement>document.getElementById(\"time-text\"),\n  level: <HTMLElement>document.getElementById(\"level-text\"),\n  menuButton: <HTMLButtonElement>document.getElementById(\"menu-button\"),\n  menuButton2: <HTMLButtonElement>document.getElementById(\"menu-button2\"),\n  mainText: <HTMLElement>document.getElementById(\"main-text\"),\n};\n\nfunction main() {\n  let gl = render.initWebgl(canvas);\n  let game = initGame(gl);\n\n  window.addEventListener(\"blur\", () => {\n    if (game.mode == GameMode.Play) {\n      pauseGame(game);\n    }\n    MUSIC.pause();\n  });\n\n  display.menuButton.onclick = () => {\n    playGame(game, 1);\n  };\n\n  canvas.onclick = () => {\n    if (game.mode == GameMode.Play || game.mode == GameMode.Freecam) {\n      canvas.requestPointerLock();\n    }\n  };\n  document.addEventListener(\"pointerlockchange\", () => {\n    if (document.pointerLockElement === canvas) {\n      document.addEventListener(\"mousemove\", updatePosition);\n    } else {\n      document.removeEventListener(\"mousemove\", updatePosition);\n    }\n  });\n  function updatePosition(e: MouseEvent) {\n    if (game.mode == GameMode.Freecam) {\n      game.freecam.camera.yawLeft(-FRECAM_MOUSE_TURN_SPEED * e.movementX);\n      game.freecam.camera.pitchUp(-FRECAM_MOUSE_TURN_SPEED * e.movementY);\n    } else if (game.mode == GameMode.Play) {\n      game.play.ship.yawLeft(-SHIP_MOUSE_TURN_SPEED * e.movementX);\n      game.play.ship.pitchUp(-SHIP_MOUSE_TURN_SPEED * e.movementY);\n    } else if (game.mode == GameMode.Menu) {\n      game.menu.camera.yawLeft(-FRECAM_MOUSE_TURN_SPEED * e.movementX);\n      game.menu.camera.pitchUp(-FRECAM_MOUSE_TURN_SPEED * e.movementY);\n    }\n  }\n  document.addEventListener(\"mousedown\", () => {\n    game.inputs.mouseDown = true;\n  });\n  document.addEventListener(\"mouseup\", () => {\n    game.inputs.mouseDown = false;\n  });\n\n  scheduleNextFrame(game);\n}\n\nmain();\n"],"names":["__webpack_require__","exports","definition","key","o","Object","defineProperty","enumerable","get","obj","prop","prototype","hasOwnProperty","call","Symbol","toStringTag","value","EPSILON","ARRAY_TYPE","Float32Array","Array","RANDOM","Math","random","create","out","clone","a","x","y","z","hypot","fromValues","copy","set","add","b","subtract","multiply","divide","ceil","floor","min","max","round","scale","scaleAndAdd","distance","squaredDistance","squaredLength","negate","inverse","normalize","len","sqrt","cross","ax","ay","az","bx","by","bz","lerp","t","hermite","c","d","factorTimes2","factor1","factor2","factor3","factor4","bezier","inverseFactor","inverseFactorTimesTwo","r","PI","zScale","cos","sin","transformMat4","m","w","transformMat3","transformQuat","q","qx","qy","qz","qw","uvx","uvy","uvz","uuvx","uuvy","uuvz","w2","rotateX","rad","p","rotateY","rotateZ","angle","mag","cosine","acos","zero","str","exactEquals","a0","a1","a2","b0","b1","b2","abs","i","arguments","length","vec","sub","mul","div","dist","sqrDist","sqrLen","forEach","stride","offset","count","fn","arg","l","a00","a01","a02","a03","a10","a11","a12","a13","a20","a21","a22","a23","a30","a31","a32","a33","b3","rotate","axis","s","b00","b01","b02","b10","b11","b12","b20","b21","b22","fromRotation","fromQuat","x2","y2","z2","xx","yx","yy","zx","zy","zz","wx","wy","wz","perspective","fovy","aspect","near","far","nf","f","tan","Infinity","lookAt","eye","center","up","x0","x1","y0","y1","z0","z1","eyex","eyey","eyez","upx","upy","upz","centerx","centery","centerz","identity","setAxisAngle","aw","bw","rgb","g","model","centroid","vertices","v","cube","sideLen","material","triangles","SUN_COLOR","SPACE_COLOR","SUN","ambient","diffuse","specular","n","DOT","SHIP","SHIP_NOZZLE","SHIP_COLLISION_POINTS","map","SHIP_FLAME","SHIP_FLAME_ACCENT","SHIP_RETICLE","shift","MISSILE","ASTEROID_COLOR","ASTEROID_DAMAGED_COLOR","ASTEROID_MATERIAL","FOG_COLOR","gl","vertexTransform","vertexPosArray","flat","vertexPosBuffer","createBuffer","bindBuffer","ARRAY_BUFFER","bufferData","STATIC_DRAW","triangleArray","triangleBuffer","ELEMENT_ARRAY_BUFFER","Uint16Array","this","triangleBufferSize","translate","rads","pos","mat","SHADER_ATTRIBUTES","SHADER_UNIFORMS","setupShaders","getExtension","vShader","createShader","VERTEX_SHADER","shaderSource","compileShader","getShaderParameter","COMPILE_STATUS","getShaderInfoLog","fShaderCode","toFixed","fShader","FRAGMENT_SHADER","shaderProgram","createProgram","attachShader","linkProgram","getProgramParameter","LINK_STATUS","getProgramInfoLog","useProgram","shaderAttributes","attribs","uniforms","attrib","getAttribLocation","enableVertexAttribArray","uniform","getUniformLocation","render","lights","objects","frontObjects","shaderInfo","camera","opts","undefined","fog","clear","COLOR_BUFFER_BIT","DEPTH_BUFFER_BIT","lightsArr","numLights","lightPos","push","drawObject","buffer","aVertexPos","vertexAttribPointer","FLOAT","uniformMatrix4fv","uVertexTransform","uniform3fv","uniform1f","drawElements","TRIANGLES","UNSIGNED_SHORT","uLights","uniform1i","uNumLights","uFog","uEyePos","uViewingTransform","viewingTransform","uPerspectiveTransform","perspectiveTransform","enable","DEPTH_TEST","objectsArr","from","disable","getTime","delayMs","debounceTime","lastChange","reset","ready","try","now","pressed","Set","register","document","addEventListener","e","code","delete","lo","hi","clamp","range","degrees","randomArc","direction","arc","randomArcRange","arcRange","perpendicular","arcVec","angleOut","angleAround","NEAR_BOUND","ASTEROID_RADIUS_TIERS","ASTEROID_HEALTH_TIERS","ASTEROID_POINT_TIERS","ASTEROID_ROTATION_SPEED","ASTEROID_SPLIT_SPEED","ASTEROID_INITIAL_SPAWN_DISTANCE","ASTEROID_SPAWN_ARC","ASTEROID_VELOCITY_ARC","SUN_INITIAL_SPAWN_DISTANCE","SUN_SPAWN_ARC","SHIP_THROTTLE_SPEED_LIMIT","SHIP_FOV_DEGREES","SHIP_ROLL_SPEED","MISSILE_LIFE_TICKS","MISSILE_DISTANCE","FREECAM_MOVE_SPEED_INCREMENT","MENU_ASTEROID_VELOCITY_ARC","MENU_ASTEROID_SPAWN_ARC","MENU_ASTEROID_SPEED","DEBOUNCE_MS","numAsteroids","level","MISSILE_SFX","Audio","MUSIC","volume","MUSIC_VOLUME","loop","GameMode","speedLimit","want","current","step","velocity","SceneObject","flame","flameAccent","reticle","lastFired","Number","NEGATIVE_INFINITY","throttle","Eased","worldRotation","forward","right","thrusterSfx","setThrottle","amount","play","pitchUp","yawLeft","rollRight","aboutWorld","worldImpulse","collisionPoints","tryFire","game","ticks","sfx","cloneNode","SFX_VOLUME","missileVelocity","missiles","birth","lastPos","fov","canvas","width","height","tier","opt","tierRadius","radius","sideLength","vertexes","disp","asteroid","JSON","parse","stringify","avgRadius","actualRadius","health","rotationAxis","rotation","split","speed","leftVelocity","left","Asteroid","rightVelocity","damage","healthPercent","color","sunContains","sun","point","every","allAsteroids","tieredAsteroids","playObjects","ship","freecam","showShipCollisions","suns","playFrontObjects","playLights","scheduleNextFrame","mode","Menu","requestAnimationFrame","deadAsteroids","menu","asteroids","entries","asteroidId","SPAWN_DISTANCE","splice","despawnMenuAsteroids","spawnMenuAsteroids","rotMatrix","inputs","keyboard","has","moveModeDebouncer","movingCamera","exitPointerLock","requestPointerLock","handleFreecamMoves","menuLights","menuObjects","menuLoop","Pause","pauseDebouncer","unpauseGame","pauseLoop","Play","levelFinishedAt","playGame","checkNextLevel","mouseDown","pauseGame","handleKeyboard","gamepad","navigator","getGamepads","axes","buttons","console","log","handleGamepad","deadSuns","sunId","despawnSuns","dead","despawnAsteroids","despawnMissiles","spawnSuns","asteroidSpeed","spawnAsteroids","deadMissiles","missileId","collideMissileSun","missile","asteroidMass","asteroidRotationalInertia","normal","collisionRadius","normalSpeed","perpendicularVelocity","missileTorque","rot","collideMissileAsteroid","children","score","updateScore","handleDeadAsteroids","accelerateShip","moveShip","moveMissiles","moveAsteroids","gameOver","collideShipAsteroid","collideShipSun","updateClock","lastCameraPosition","updatePlayCamera","wiggleUp","wiggleSide","refreshThrottle","out_axis","turnSpeed","rotationFactor","scaleFactor","rotateShip","freecamModeDebouncer","sync","Freecam","devMode","playLoop","generalDebouncer","updateLevel","undevMode","devLoop","quitGame","display","time","hidden","mainText","innerHTML","menuButton","onclick","menuButton2","pause","currentTime","Ship","lookUp","fovDegrees","moveSpeed","refreshView","move","transformView","transform","cam","innerText","totalSeconds","minutes","seconds","toString","padStart","camMove","getElementById","getContext","clearDepth","clearColor","Keyboard","Debouncer","Date","FreeCamera","backlight","menuScene","initGame","updatePosition","movementX","movementY","window","pointerLockElement","removeEventListener","main"],"sourceRoot":""} \ No newline at end of file diff --git a/asteroids/index.html b/asteroids/index.html new file mode 100644 index 0000000..0cb458c --- /dev/null +++ b/asteroids/index.html @@ -0,0 +1 @@ +3D Asteroids

Asteroids

Start
\ No newline at end of file diff --git a/asteroids/missile.mp3 b/asteroids/missile.mp3 new file mode 100644 index 0000000..78246d8 Binary files /dev/null and b/asteroids/missile.mp3 differ diff --git a/asteroids/music.wav b/asteroids/music.wav new file mode 100644 index 0000000..2a72914 Binary files /dev/null and b/asteroids/music.wav differ diff --git a/asteroids/thruster.wav b/asteroids/thruster.wav new file mode 100644 index 0000000..92b55bf Binary files /dev/null and b/asteroids/thruster.wav differ diff --git a/blog/index.html b/blog/index.html new file mode 100644 index 0000000..d614127 --- /dev/null +++ b/blog/index.html @@ -0,0 +1 @@ +Eli | Blog \ No newline at end of file diff --git a/blog/interviewees-t-test/index.html b/blog/interviewees-t-test/index.html new file mode 100644 index 0000000..d26b860 --- /dev/null +++ b/blog/interviewees-t-test/index.html @@ -0,0 +1,86 @@ +Eli | Interviewee's T-tests

Interviewee's T-tests

2024-10-17

I've been running a lot of coding interviews lately, especially for people coming directly from university. And it strikes me that many candidates will keep only a single informal test that they write and rewrite as they want to check things about their code.

This always sort of bothers me because when you delete a test the first time it passes, you lose the ability to catch regressions. But also because what a "test" is is so informal when you're rewriting the same piece of code over and over, many candidates don't really think about what exactly the goal is of any given test and won't comprehensively test their code.

The easy and practical way to avoid these pitfalls is to keep your old tests and copy-and-paste a new one instead of rewriting the same one over and over. But I'm going to propose a swaggier solution: the T test framework.

The test framework is called T because it's meant to be extremely short and easy to understand (plus it makes joke in the the title work). My hope is that you can read this post and then weeks later reproduce the test framework from memory and explain how it works in under a minute.

You can find the T framework for all the programming languages I feel comfortable doing interviews in—Rust, Python, and C—with their output below the code. But it should be easy to write versions in your programming language of choice.

Rust

fn test(name: &str, t: impl FnOnce() + std::panic::UnwindSafe) {
+    println!("=== {name}");
+    if std::panic::catch_unwind(t).is_ok() {
+        println!("=== PASS\n");
+    } else {
+        println!("=== FAIL\n");
+    }
+}
+
+fn main() {
+    test("failing", || {
+        assert!(false);
+    });
+    test("passing", || {
+        assert!(true);
+    });
+}
+
=== failing
+thread 'main' panicked at src/main.rs:12:9:
+assertion failed: false
+note: run with `RUST_BACKTRACE=1` environment variable to display a backtrace
+=== FAIL
+
+=== passing
+=== PASS
+

Python

import traceback
+
+def test(t):
+    print(f"=== {t.__name__}")
+    try:
+        t()
+        print("=== PASS\n")
+    except Exception as e:
+        traceback.print_exception(e)
+        print("=== FAIL\n")
+
+@test
+def failing():
+    assert False
+
+@test
+def passing():
+    assert True
+
=== failing
+Traceback (most recent call last):
+  File "/Users/eli.hunter/t.py", line 6, in test
+    t()
+  File "/Users/eli.hunter/t.py", line 14, in failing
+    assert False
+AssertionError
+=== FAIL
+
+=== passing
+=== PASS
+

C

#include <stdio.h>
+
+int failing() {
+    return 1;
+}
+
+int passing() {
+    return 0;
+}
+
+void test(char* name, int (*t) (void)) {
+    printf("=== %s\n", name);
+    int rtn = t();
+    if (rtn == 0) {
+        puts("=== PASS\n");
+    } else {
+        printf("returned %d\n", rtn);
+        puts("=== FAIL\n");
+    }
+}
+
+int main() {
+    test("failing", failing);
+    test("passing", passing);
+}
+
=== failing
+returned 1
+=== FAIL
+
+=== passing
+=== PASS
+
\ No newline at end of file diff --git a/blog/toothpaste-reviews-2020/index.html b/blog/toothpaste-reviews-2020/index.html new file mode 100644 index 0000000..96fbfb4 --- /dev/null +++ b/blog/toothpaste-reviews-2020/index.html @@ -0,0 +1 @@ +Eli | Toothpaste Reviews 2020

Toothpaste Reviews 2020

2020-09-07

For fun during quarantine I decided to go through my collection of travel-size toothpaste tubes to figure out which one is the best. This was back in late March, early April mind you. I was pretty bored with weeks of quarantine and definitely not adjusted to all the changes, so this was like a fun little game for myself I did. I kept individual notes on all the different toothpastes and ranked them individually.

When I told this to one of my friends they thought it was interesting and encouraged me to make it my first blog post. I think it's a cute enough idea and I've been wanting to start actually making some posts on my blog since I have a few draft posts around. Sadly I didn't think to take pictures of the toothpaste tubes as I was doing the reviews and I can't bring myself to take images from online at the risk of this seeming even remotely legitimate. I also don't include prices or links because I can't be bothered. Anyway, let's get into the ranking.

1. Crest Complete with Scope

Somewhat unsurprisingly, this is the toothpaste that I normally use, so obviously I'd like it. Compared to #2 (Crest Gum Detoxify), it has a slightly worse flavor and foaminess. But at a significant fraction of the price you still get a good-flavored paste that strikes a good balance between foam and paste.

2. Crest Gum Detoxify

At the price, you'd expect this toothpaste to be excellent, and you'd be right. It had the best texture and taste of any of the toothpastes I used and definitely left my mouth feeling the cleanest. It's just so expensive that I can't put it at first.

3. Colgate Clean Mint

This one reminded me a lot of #5 (Crest Cavity Protection Regular Paste) but better across the board. It tasted slightly stronger than it and had a noticeably more pleasant texture. Otherwise it's a pretty unremarkable toothpaste.

4. Listerine Essential Care Gel

This toothpaste (well, toothgel I guess?) surprised me the most of all the toothpastes I reviewed. It doesn't spread very well because it's a gel but the taste is incredibly pleasant and feels very clean. The taste is somewhere between Listerine mouthwash and regular crest toothpaste, leaving a very clean feel in your mouth. Also, once you get used to the gel aspect it actually spreads incredibly well, although it doesn't foam up as much as I prefer.

5. Crest Cavity Protection Regular Paste

Maybe it's because this is what I grew up with but this is exactly what comes to my mind when I think of toothpaste. It has a fairly weak mint flavor but is very agreeable. It spreads nicely and foams up pretty well. Yeah, it's what a toothpaste should do at a good price. I personally consider this the floor of good toothpastes.

6. Aquafresh Extreme Clean

Oh Aquafresh, I never used you before now and I'm glad. This was the hardest paste to spread (much worse than the gel above!) and hardly foamed at all once you actually got it all over your teach. The taste was the harshest mint I tried and didn't even leave your mouth feeling clean. It wasn't actively unpleasant to use but there are so many better options.

7. Crest 3D White

As a rule, I think whitening toothpastes and other products are a bad idea. Teeth aren't naturally perfectly white and there's no long term benefits to whitening them (that I know of). So whitening teeth is just superficial, expensive, and painful to me.

Crest 3D White toothpaste did nothing to change this for me. Every night brushing my teeth felt like punishment where I'd use a toothpaste that tasted, spread, and foamed like silt, leaving a somewhat dirty feeling in my mouth. Also, whenever I used it my teeth would burn a little. From talking to friends I think this is normal for whitening products, but I still don't want brushing my teeth to hurt. It was a bearable experience but made me not look forward to brushing my teeth even if they felt gross.

8. Kid's Crest Cavity Protection Sparkle Fun

Oh. My. God. This toothpaste was awful. I used it a few times as a kid during family vacations and the like, and I do not remember this toothpaste being So unpleasant. It foamed up so much and felt vaguely gritty I think from the glitter. The worst was the taste. All the others tasted like mint, which is what I've come to expect from a toothpaste. However, in an attempt to appeal to kids, this one tastes like bubblegum. I don't know whose idea it was to use a sugary food as a flavor for toothpaste but whenever I used this not only did it taste bad it also left a very dirty taste in my mouth, like I just ate candy. Using it as an adult was an awful experience, but from what I remember as a kid I actually liked it so maybe they're just hitting their target audience really well.

Raw Notes

Here is a literal transcription of my original notes from my phone.

  1. Crest Complete with Scope: A slightly worse Crest Gum Detoxify at a fraction of the price. My personal favorite.
  2. Crest Gum Detoxify: Pleasantly smooth and minty. Most expensive I tried but also best toothpaste I've ever used.
  3. Colgate Clean Mint: Slightly stronger mint than Crest's regular paste makes it slightly more pleasant. But otherwise unremarkable.
  4. Listerine Essential Care Gel: Doesn't spread very well because it's a gel. Taste is shockingly pleasant, somewhere between Listerine mouthwash and regular crest toothpaste. Leaves a very clean feel in your mouth.
  5. Crest Cavity Protection Regular Paste: Unremarkable and reasonably priced.
  6. Aquafresh Extreme Clean: Harsh taste and paste that doesn't spread or foam very well. Not unpleasant but took some getting used to.
  7. Crest 3D White: Tastes like clay and one of the more expensive toothpastes. Weird texture and vaguely burns after use. Unpleasant to use but bearable. Also teeth whitening is unnecessary IMO.
  8. Kid's Crest Cavity Protection Sparkle Fun: Foams up an absurd amount, vaguely gritty, tastes like awful bubble gum. Using it was an awful experience.
\ No newline at end of file diff --git a/elihunter173_resume.pdf b/elihunter173_resume.pdf new file mode 100644 index 0000000..fd661d5 Binary files /dev/null and b/elihunter173_resume.pdf differ diff --git a/favicon-128.png b/favicon-128.png new file mode 100644 index 0000000..4cf33d9 Binary files /dev/null and b/favicon-128.png differ diff --git a/favicon-180.png b/favicon-180.png new file mode 100644 index 0000000..4717864 Binary files /dev/null and b/favicon-180.png differ diff --git a/favicon-192.png b/favicon-192.png new file mode 100644 index 0000000..f54ccbd Binary files /dev/null and b/favicon-192.png differ diff --git a/favicon-32.png b/favicon-32.png new file mode 100644 index 0000000..72d7833 Binary files /dev/null and b/favicon-32.png differ diff --git a/index.html b/index.html new file mode 100644 index 0000000..a70f7b3 --- /dev/null +++ b/index.html @@ -0,0 +1 @@ +Eli \ No newline at end of file diff --git a/notes/index.html b/notes/index.html new file mode 100644 index 0000000..aca41d8 --- /dev/null +++ b/notes/index.html @@ -0,0 +1 @@ +Eli | Notes

NCSU Class Notes

Fall 2018

This was the semester before I settled on using markdown for notes, so I hand-wrote most of these notes but sadly didn't save them.

The other classes I took were: CH 101, E 101, E 115, EC 205, and MA 241.

Spring 2019

Fall 2019

Spring 2020

Fall 2020

Spring 2021

Fall 2021

Notes from Talks

Notes from talks and one-off presentations I attend.

Misc. Notes

Miscellaneous notes from online courses or other events.

\ No newline at end of file diff --git a/notes/nand2tetris/index.html b/notes/nand2tetris/index.html new file mode 100644 index 0000000..a21747d --- /dev/null +++ b/notes/nand2tetris/index.html @@ -0,0 +1 @@ +Eli | Nand2Tetris

Nand2Tetris

This course gradually builds a computer, using a custom architecture called Hack, which can run a functioning version of Tetris from first principles starting with NAND gates. The general flow is

  1. Create all logic gates out of NAND.
  2. Build an ALU (major part of CPU).
  3. Build registers and memory.
  4. Write some Hack programs in machine code.
  5. Use all previous chips to build an implementation of the Hack architecture.
  6. Create an assembler for Hack.
\ No newline at end of file diff --git a/notes/ncsu/1f/csc116/afs_tree.png b/notes/ncsu/1f/csc116/afs_tree.png new file mode 100644 index 0000000..cbf46de Binary files /dev/null and b/notes/ncsu/1f/csc116/afs_tree.png differ diff --git a/notes/ncsu/1f/csc116/index.html b/notes/ncsu/1f/csc116/index.html new file mode 100644 index 0000000..621aa9c --- /dev/null +++ b/notes/ncsu/1f/csc116/index.html @@ -0,0 +1,11 @@ +Eli | CSC 116: Introduction to Computing

CSC 116: Introduction to Computing

Instructor: Dr. Matthias Stallmann | Semester: Fall 2018

Table of Contents

These notes originate from before I settled on using markdown and (Neo)Vim for note-taking, so these are transcriptions from the original Google docs. I actually took way more notes in this class, but I seem to have misplaced most of them so here is what little I still have.

# Misc Shell Stuff

  • man COMMAND: Show the manual entry for that command.
  • Absolute Path: begins at root, starts with /
  • Relative Path: begins at current directory, doesn’t start with anything.
  • \: Escape character, allows for special characters to be encoded.
  • -: Single character / short flag.
  • --: Multiple character / long flag.
  • .: Current directory.
  • ..: Above directory.
  • ~: Home directory.

{{ figure(src="afs_tree.png, title="Simple Heap") }}

# Commands

  • pwd: print working directory
  • cd [DIRNAME]: Change directory to DIRNAME if specified. Otherwise home directory (~).
  • mkdir DIRNAME: Makes new empty directory.
  • rmdir DIRNAME: Removes directory. Fails if it is not already empty.
  • ls [PATH]: List contents of PATH if specified. Otherwise current directory.
    • -l: List contents in long form (exact size, permission access, last modified, etc).
    • -a: list ALL content (even hidden files/directories).
  • mv SOURCE DESTINATION: Move/rename file/directory to destination.
    • -n: No-clobber. Won't delete another file.
    • -i: Interactive. Asks before clobbering an old file.
  • cp PATH [PATH2 ...] DEST_PATH: Copy file/directory from path (and path2 ...) to DEST_PATH. If multiple paths are specified, DEST_PATH must be a directory.
    • -R/-r: recursive copy (copy directory and all subdirectories)
  • rm PATH: Remove file.
    • -i: Interactive. Asks for conformation.
    • -r: Recursive. Removes all files and child directories.
    • -f: Force. Ignore all failures and go ahead at all costs.
  • chmod PERMISSIONS PATH: Change the permissions of PATH. If PERMISSIONS is a 3-digit octal permission, then it sets the permissions. Otherwise, it modifies them based on the ugo+-rwx scheme.
  • diff FILE1 FILE2: Reports differences in FILE1 and FILE2. Doesn't display differences in binary files by default.
  • wc FILE: Find word count, line count, character count, of FILE.
  • more FILE: Scroll through the contents of FILE. This is called a pager.
    • q: Quit.
    • enter: See more.
    • space: Next page.
    • /pattern: Find pattern.
  • less filename: Scroll through the contents of FILE, with the ability to go up and down. This is a more advanced version of more.
    • Flags
      • -g: Highlight match of searched string.
      • -I: Use case insensitive searches.
      • -N: Show line numbers.
    • Keys
      • q: Quit.
      • space: Next page.
      • d: Next half page.
      • b: Previous page.
      • u: Previous half page.
      • v: Edit command.
      • <: First line.
      • >: Last line.
      • /: Forward search.
      • ?: Backward search.
  • cat [FILE1 ...]: Read and print file(s) as listed sequentially. It concatenates files! If given no files, it just forwards standard in (more on that later).
  • zip ZIPFILE FILE [FILE2 ...]: Zip compress FILE (and FILE2) and place them into ZIP_FILE, creating ZIPFILE if necessary.
    • -R: Recursive. Used for zipping directories.
  • unzip ZIPFILE: Unzips ZIPFILE and places its files in the current directory.
    • -d DIRNAME: Places unzipped files in destination dir.

# Andrew File System (AFS)

AFS uses an Access Control List (ACL) to control permissions to files and directories. It is an extended version of the UNIX permissions system, using the following permissions.

  • a (administer): Change the entries on the ACL
  • d (delete): Remove files and subdirectories from the directory or move them to other directories
  • i (insert): Add files or subdirectories to the directory by copying, moving or creating
  • k (lock): Set read locks or write locks on the files in the directory
  • l (lookup): List the files and subdirectories in the directory, stat the directory itself, and issue the fs listacl command to examine the directory's ACL
  • r (read): Read the contents of files in the directory; issue the ls -l command to stat the elements in the directory
  • w (write): Modify the contents of files in the directory, and issue the UNIX chmod command to change their mode bits

These are all subcommands of the root fs command. That is for a command listed as foo, you run fs foo. For more info read http://docs.openafs.org/Reference/1/

  • la [PATH]: List Access. Shows a list of all access permissions to current directory or specified directory.
  • sa PATH UNITY_ID ACCESS: Set Access. Sets access permissions to PATH for UNITY_ID.
  • lq PATH: List quota. Show how much space PATH is using versus your quota (total allowed).
  • mkm DIRPATH users.<UNITY_ID>.backup: Make Mount. Creates backup directory at DIRPATH containing a backup of UNITY_ID's home directory.
  • rmm dirname: Remove Mount. Removes mounted directory.

# Java Commands

  • javac FILENAME.java: Compile .java file into .class.
    • -d DIRNAME: places .class file into DIRNAME.
  • java FILENAME: Runs program with filename (no extension). There must be a .class file with that name in the classpath.
    • -cp dirname: Modifies the classpath. Basically, you specify the location of the class file.

# Javadoc

/**
+ * This is a Javadoc comment. You must use this
+ * for programs.
+ *
+ * @param paramName Use this to specify
+ * parameters.
+ *
+ * @author authorName Use to specify the author
+ * of the code.
+ */
+

# Git Commands

These are all subcommands of the root git command. That is for a command listed as foo, you run git foo.

  • clone URL [DIRNAME]: Clones git repository (repo) to the current directory or specified directory.
  • add PATH: Add changes to staging area for committing.
  • commit: Create a snapshot of the changes in the staging area and commit them to your current branch.
    • -m "MESSAGE": Specify message with commit. Otherwise opens up core.editor to edit commit message.
  • push [BRANCH]: Pushes most recent revision to remote repo. If you don't specify BRANCH then you're using the "upstream" branch, that is the branch on the server that your branch was made from. For this class it'll be master mostly.
  • status: Show status of current repostiroy. Lists files added, files modified but unadded, etc.
  • diff FILE: Show the differences between last commit and current status.
  • branch BRANCH: Create a new branch off your current branch.
    • -d: deletes existing branch
  • checkout BRANCH: Switch branches (and a whole bunch more).
    • -b: Creates branch and then switches to it.
  • log: Shows a log of recent commits.

## Configuration

Git has a bunch of configuration values that go in your git config file. We'll list the key nes for this class.

  • user.name: Name of user.
  • user.email: Email of user.
  • core.editor: Main editor for git commit messages and other things.

# Miscellaneous EOS Notes

These may or may not apply to all computers outside of EOS. Try and see what happens.

## Commands

  • script: Creates a log of every command executed and its output. Used for E115 assignments.
    • -f: Force log to begin immediately.
    • -a: Appends the log to a previous one.
  • clear: clears the screen
  • add: Show list of installable programs.
  • add PROGRAM: Add program to current session as command.
  • attach ABSOLUTE_PATH: Create shortcut at ABSOLUTE_PATH.
    • for E 115 use /ncsu/e115
  • last [USER]: Show everyone's last login or just USER's.
    • -l: Show only last login and logout.
  • write username: Send message to user.
  • who: Sees who is logged in.
  • passwd: changes password

## Shell Shortcuts

  • up: Previous command.
  • down: Next command.
  • ctrl + c: Stop command.
  • ctrl + z: Pause command.
  • fg: Reopens command.
  • tab: Autocomplete (iff unambiguous).
  • tab x2: Show all autocomplete options.
  • ";": Shows line has ended and allows multiple commands to be chained.
\ No newline at end of file diff --git a/notes/ncsu/1f/index.html b/notes/ncsu/1f/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/1f/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/ncsu/1s/csc216/abba_fsm.png b/notes/ncsu/1s/csc216/abba_fsm.png new file mode 100644 index 0000000..856d61f Binary files /dev/null and b/notes/ncsu/1s/csc216/abba_fsm.png differ diff --git a/notes/ncsu/1s/csc216/class_design.png b/notes/ncsu/1s/csc216/class_design.png new file mode 100644 index 0000000..a092835 Binary files /dev/null and b/notes/ncsu/1s/csc216/class_design.png differ diff --git a/notes/ncsu/1s/csc216/csc_216_lifecycle.png b/notes/ncsu/1s/csc216/csc_216_lifecycle.png new file mode 100644 index 0000000..abaac8f Binary files /dev/null and b/notes/ncsu/1s/csc216/csc_216_lifecycle.png differ diff --git a/notes/ncsu/1s/csc216/full_class_diagram.png b/notes/ncsu/1s/csc216/full_class_diagram.png new file mode 100644 index 0000000..31c6806 Binary files /dev/null and b/notes/ncsu/1s/csc216/full_class_diagram.png differ diff --git a/notes/ncsu/1s/csc216/index.html b/notes/ncsu/1s/csc216/index.html new file mode 100644 index 0000000..8a348bf --- /dev/null +++ b/notes/ncsu/1s/csc216/index.html @@ -0,0 +1,250 @@ +Eli | CSC 216: Intro to Software Engineering & Programming Concepts

CSC 216: Intro to Software Engineering & Programming Concepts

Instructor: Dr. Sarah Heckman | Semester: Spring 2019

Table of Contents

# Administrivia

## Grades

WeightComponentAdditional Info
12%Guided Projects
34%ProjectsTwo projects. 3% of each is part 1. 14% of each is part 2.
Guided Projects12
Labs15
Exam 112Exam 1 will cover material from approximately the first third of the course.
Exam 212Exam 2 will cover material from approximately the first two-thirds of the course.
Exam 315Exam 3 will cover all materials for the course.
  • Need >65% on exams to get a C or higher

## Lecture

  • Attendance: You must answer at least one of the Google form exercises per class.
    • If miss 4+ labs, -5 pt on final grade.
  • Instructor: Dr. Sarah Heckman (sesmith5)
  • Email: sarah_heckman@ncsu.edu
  • Web Page: https://people.engr.ncsu.edu/sesmith5/
  • Phone: 919-515-2042
  • Office Location: Engineering Building II, Room 2297
  • Office Hours: (See calendar for most up-to-date office hours)

## Lab

  • Name: Hanna Fernandez
  • Email: hfernan@ncsu.edu
  • Jenkins: go.ncsu.edu/jenkins-csc216-2
  • Attendance: Required.
    • Missing 4 labs will result in F
  • A lab grade may be dropped.

## Assignments

  • Projects:
    • Part 1: Design and black-box testing. Independent.
    • Part 2: Implementation and testing. Optionally independent.
  • Guided Projects:
    • There will be 3.
    • All independent.

## Academic Integrity

## Main Topics

  • Managing Complex Software: Software gets big. How do you handle it?
    • Tools: Eclipse :(
  • Test Driven Development: Writing tests first and then trying to make it so that your code passes those tests.
    • Tools: JUnit 4
  • Code Coverage: How much code is being tested
  • Static Analysis: Looks at the code itself.
    • Tools: Checkstyle, SpotBugs, PMD, EclEmma
  • Version Control: Manages source code across machines and tracks and merges changes.
    • Tools: Git
  • Continuous Integration: Whenever there is a change in the repository, test the code.
    • Tools: Jenkins

# Object Oriented Design (OO)

N.B. These are defined with reference to Java.

  • Procedural: Execute code without objects. Everything is simply a list of of things to run (i.e. a procedure!).
  • Object Oriented: We deal with objects, representations of real things, which can interact with other objects and classes in limited, controlled ways.
  • Method: A list of statements to run.
    • Static: A method which isn't connected to an object.
    • Non-static: A method which is connected to an object.
  • Class: A blueprint for an object. Has a list of methods and fields that each object should have, and it defines what each of those methods do (normally) and what type those fields are.
  • Object: An instance of a class. Takes up space in memory (well, most objects are really just reference objects) which defines the fields. It can leverage the methods it has given to it by the class to do stuff with its fields.
  • Reference Objects / Pointers: A much, much smaller bit of information that simply points to a place in memory. When you "copy" objects normally in Java, it just copies the reference object / the pointer

## FAQ

  • Why use abstract classes and interfaces? To promote code reuse and make sure that methods can be interacted with in a standard way. Abstract classes promise that there will be some functionality.
  • Why make the distinction? Because, in Java, you can only extend a single class but you can implement as many interfaces as you want.
  • How do you Javadoc abstract methods? Provide high-level guidance to what functionality is expected from this method.
  • How do you Javadoc interfaces? Provide similar comments like abstract classes, but even better because they are so broad.
  • Why use interfaces if you're just going to use it once? (A) It makes more sense. (B) It makes it easier for you to add more things in the future. (C) You might not be the only one who wants to use something like that.
  • Can you cast a parent to a child? Nope! Well, technically, yes but only if the child doesn't add anything on top of the parent. But, all children add at least a pointer to the parent.

## Vocabulary

  • Single Inheritance: A class can only inherit a single class or have a single parent.
    • Why? To prevent name space clashing (although this does have other solutions).
  • Polymorphism: Where you can treat multiple different types (of objects) as the same type.
    • This is normally visualized, in Java, as a hierarchy of classes, like a family tree.
  • Abstract Class: Classes that can have abstract methods.
    • Concrete children extends this abstract class but can only implement one.
    • Consider nouns.
  • Abstract Method: An exposed method in an abstract class (since it must be
  • implemented in a child).
  • Interfaces: Special classes that only describe abstract methods.
    • Concrete children implements this interface and can implement many.
    • All classes are public and abstract (because nothing else matters to outsiders).
  • Abstract classes and interfaces cannot be instantiated.
    • Abstract classes can specify constructors, however.
  • Delegation: The process of wrapping an Object so that it uses the Object's behaviors as its behaviors.

## Methods

  • Methods have a signature, which is their name and parameter types.
  • Parameters have a type and can be final.
  • Syntax: accessMod [static] ReturnType name([final] Type param1, [final] Type param2)

## Semantics

  • Value Semantics: This bit of data is dealt with directly. That is its actual information in memory.
  • Reference Semantics: This bit of data is interacted with by a reference object / pointer.
  • Dereferencing: Accessing the data or the method of an object.
    • Dot Notation: The process of accessing the methods of a reference.
      • e.g. reference.method(), reference.field

### Null Semantics

  • null: A built in value that does not refer to any object.
    • It cannot be dereferenced!
  • null can be passed, initialized, checked for, returned (for bad data), etc!

### Java Specifics/Oddities

  • Java uses reference semantics for all objects and value semantics for all primitives.
  • Implicit Parameter: this is an implied parameter in all methods of an object. It references the current object.
  • Default Values: All types have specific default values.
    • int = 0
    • double = 0.0
    • boolean = false
    • char = null (character)
    • Object = null (object)

### Invariants

  • Invariants: Things which you state are going to be always true. You must ensure it.
    • Java Invariants: If you override equals(), you should also override hashCode()
    • hashCode(): Hashes an objects

### Cloning

  • .clone(): Returns a shallow copy of a given object. This comes from interface Cloneable
  • What about deep copies?

## Composition and Delegation

  • Composition: A class has fields that are instances of other class(es).
  • Delegation: The course can call upon methods and other things of the objects it contains. Allows an object to not get too complex!
  • Abstraction: The process of separating ideas so you don't have to know everything! This is the beauty of OOD.
  • Encapsulation: Hide the plumbing or implementation details from the clients. They don't need to know and they might mess things up!
    • Ways: Make fields private so you can control what people do.

## Inheritance

  • Hierarchical. Allows specialization of broader class.
  • The super class (parent) is ignorant of the sub class (child)
  • Super class constructed first. That means that the sub class can override parts of the super class and a sub class has a pointer to its parent.
  • The sub class is an instance of the super class.
  • A child cannot modify the private variables of its parent.
    • However, it can modify protected variables. (But those are yuck!)
  • Everything in a hierarchy should define its own equals methods. Then, the child checks the parent's equality and then checks its specialization.

### Java Syntax

  • extends: Shows parent/superclass of child/subclass
  • super: References the parent/superclass of the current class.
  • A class can only extend one class.
public class SubClass extends SuperClass {
+  // This class has all of the (implemented)
+  // functionality of the super class
+}
+

### Usage

  • Children are clients of the parent and must use accessor/mutator methods to modify those fields.
  • A child can act as its parent. A parent can not act like its child.
  • If a child is acting as a parent, you cannot reference any of the child's (childish) things.

## Abstract Class

  • If you use interfaces or abstract classes to interact with someting, you can only interact with the methods present in those interfaces or abstract classes.
public abstract class Beer
+implements Drinkable, Brewable {
+
+  private String name;
+
+  public Beer(String name) {
+    this.name = name;
+  }
+
+  // Declare abstract methods
+  public abstract boolean
+  addIngredient(BeerIngredient i);
+  public abstract Collection<BeerIngredient>
+  getIngredients();
+
+  // Implement inherited methods
+  public void brew() {
+    System.out.println(
+      name + " is being brewed"
+    );
+  }
+
+  // I don't have to implement Drinkable because
+  // this is an abstract class
+}
+

## Interface

public interface Brewable {
+  void brew();
+}
+

## Nested Classes

  • Outer Class: A class that contains an inner class.
  • Inner Class: A class defined within another class.
  • Compiled Bytecode Class Names: OuterClass$InnerClass.class
  • In UML Diagrams:
    • Composition connector (black diamond)
    • Inner-class connector (white circle with black x)
  • Static Nested Class: A static class inside of an outer class.
    • These can only access the outer class's instance values.
  • To access parent outer explicitly use OuterClass.this.
  • To access public inner class, use OuterClass.InnerClass.

### Advantages

  • Encapsulation: Clients don't have to worry about them (if they're private)
  • Inner classes can change the instance fields of their outer class.
    • It cannot access the nested classes fields!

## Anonymous Objects

  • Anonymous Object: An object that is created with no reference to it.

## Anonymous Classes

  • Anonymous Classes: Creating a class in-line. A class that has no real name
    • Mostly used when creating an interface that implements some methods.
new Foo() {
+  public int someState;
+  public void doStuff() {
+    // Do things
+  }
+}
+

## Exceptions

  • Exception: A special object that represents an error or bad condition.
    • Unchecked Exception: Exception that doesn't have to be handled to be compiled.
    • Java Examples: InputMismatchException
    • For Java: extend RuntimeException
    • Checked Exception: Exception that must be handled to be compiled.
    • Java Examples: FileNotFoundException
    • For Java: extend Exception
    • Checked vs Unchecked is semi-arbitrarily decided by Java language developers.
  • throw: A keyword that throws an object that implements the Throwable interface.
  • throws: A keyword in the method header that states that the stated exception might be generated

### Try-Catch-Finally Blocks

  • Try: Statements that might throw exception.
    • Mandatory block.
  • Catch: Statements that handle exception.
    • Mandatory block.
  • Finally: Statements that always execute. Good place for closing resources.
    • Optional block.
  • Normal Flow: Specific exception, less specific exception, general exception
  • Multi-catch: Can catch a list of exceptions in a common catch block.
    • For Java 1.7+
  • Try-with-Resources: Declares one or more resources that must be closed. Essentially automatically closes resources when necessary. (Opened resources must implement Autoclosable)
    • Alternative to try.
    • For Java 1.7+
try {
+  // Do things
+} catch (ExceptionType name) {
+  // Handle errors
+}
+
try {
+  // Statements
+  // Exception thrown!
+  // Statements skipped
+} catch (UnmatchedExceptionType name) {
+  // Would handle exception, but doesn't go in
+  // here
+} catch (MatchedExceptionType name) {
+  // Handle thrown exception
+} catch (AlsoMatchedExceptionType name) {
+  // Would handle exception, but goes to first
+  // catch block.
+} finally {
+  // Statements here are always executed!
+}
+
try {
+  // Throws either Exception1 or Exception2,
+  // that need to be handled equally
+} catch (Exception1 | Exception2 name) {
+  // Handle exceptions
+}
+
try (File f = new File()) {
+  // May throw FileNotFoundException
+} catch (FileNotFoundException e) {
+  // Handle exception
+}
+// Resources automatically closed!
+

### Create Custom Exceptions

  • Don't go too crazy. They're generally not a very good idea.
    • If you can use a common Java exception, do!
  • Useful if you want to add more information or have a specific Exception that is not present in the Java exceptions library.
public class MyException extends Exception {
+  public MyException(String message) {
+    super(message);
+  }
+  public MyException() {
+    super("Exception message");
+  }
+}
+

## Errors

  • You rarely need to create errors.
  • Errors are fatal issues that are rarely encountered and should (almost) never be caught.
    • Java Examples: OutOfMemoryError

# (Java) Libraries

  • Libraries: A reusable collection of classes and pieces of software. Promotes code reuse, standard ways of doing things, efficient code, and focusing on what is really important for your project.
    • Examples: Java, Java Collections, JUnit, Apache
    • "It's a solved problem."
  • API: A list of instructions of how to interact with the software.
    • For this class, they are simple a series of webpages, created from Javadoc, that describe how to use our afternoon.
  • Installation of Libraries:
    • Add the JAR (Java ARchive) to your classpath.
  • Classpath: A set of locations that your Java Compiler and JVM will look at for code.
    • By default, your system PATH variable. However, you can update it with command line flags.
    • Eclipse does this automatically with your .project and .classpath files. This allows you to structure your projects like Eclipse expects and compile them easily within Eclipse.
    • In Eclipse, you add libraries to the build path on a per-project or a global scale.

## Library and Build Managers

  • Maven: Helps manage projects and libraries. Helps build.
  • Gradle: Like maven but different.
  • Ant: Helps manage projects and libraries.

## Java Iterators

Java collections can be iterated using a for-each loop.

for (Type item : container) {
+  // Do things
+}
+

This allows for more effiecient code, as you don't always have to pass through things multiple times. Instead, you can use an iterator which keeps track of its position and its value.

To make a class use iterators, you should implement Iterable<E>.

public class List<E> implements Iterable<E> {
+  // Stuff
+  public Iterator iterator() {
+    // Make iterator and stuff
+  }
+  public class Iterator<E> {
+    // Do stuff
+  }
+}
+

### API

  • hastNext() : boolean: Returns true if the Iterator can return another element.
  • next() : E: Returns the value of the next element. (This is also the thing the Iterator is currently on.)
  • remove(): Removes the current element under the Iterator.

## Limitations

  • Iterator is unidirectional.
  • Adding things while Iterating causes issues. (ConcurrentModificationException)

## Misc

  • Iterators keep track of their spots even if you remove stuff. If properly implemented.

## Java GUIs

  • Java GUI Libraries:
    • java.awt.*: Abstract Windowing Toolkit. The OG.
    • javax.swing.*: Java Extension Swing
    • Inherits from awt.
  • Components:
    • Frame: Top-level window with title and border.
    • Container: A thing that contains components.
    • Panel: A thing that can hold other components or panels.
    • Components: A thing that does a thing (e.g. buttons, text boxes).
    • Top-level containers: JFrame, JDialog, JApplet
    • General-purpose containers: JPanel, JScrollPane
    • Special-purpose containers: JRootPane, JLayeredPane
  • Layouts:
    • BorderLayout: The UI is divided into north, sound, east, west, and center.
    • FlowLayout: Components go from left to right and wrap when they run out of room.
    • BoxLayout: Components in row or column.
    • CardLayout: Components in a stack where only the top is shown.
    • GridLayout: Things are in a rectangular grid.
    • GridBagLayout: Things are in a rectangular grid and can span multiple grids.

GUIs are event-driven. That is, we wait for the user to interact with the GUI and they can do whatever they want. We can, however, restrict their access.

This means, even close buttons, don't truly close the program.

To create a GUI, try storyboarding and consider what your user needs to do. Draw a picture of your planned GUI and adjust it as you think about what a user must do with it. Try sectioning things off into logical blocks or creating a tree of components.

Generally, thinking about things as columns and rows is very helpful.

Java uses the event model to handle events in GUIs. This uses event objects that encapsulate the information required to handle the event; this includes the information entered, the type of action, and the source of the event (e.g. a button).

An event model uses events, handlers, and listeners. Events are things that the user has done or things that have occurred. Handlers are things that notify listeners when events have occurred. Listeners are things that take action given certain events. In Java, the event is an EventObject and a listener is an EventHandler. Because of this structure, we must register listeners to the handler.

To create listeners, you create an object that implements ActionListener. There are many ways to do this:

  • You could make your GUI implement ActionListener and then create a broad eventPerformed(ActionEvent) method that handles all events performed, using if statements.
    • Pros: Separates controller and view code.
    • Cons: God it's so fucking gross.
  • Create named ActionListener classes.
    • Pros: You can reuse code so much.
    • Cons: You have to write a ton of boilerplate and go across multiple classes.
  • Create anonymous ActionListeners with their specific code.
    • Pros: You don't get gross spaghetti code with tons of if statements.
    • Cons: It mixes controller and view code. It is harder to reuse things.
  • Create lambda expressions for handling events.
    • Pros: You don't have to write as much boilerplate as the anonymous class. You can also reuse some code.
    • Cons: It doesn't separate the controller and view code as much.

Low level events are interactions with the operating system, like key pressed. Semantic events are user-actions, like button clicks and text edits.

To handle low level events, it is recommended to use Java's *Adapter abstract classes. These make it easier to handle low level events and "convert" them to action events.

  • JButton:
    • .processEvent(): Takes in ActionEvent and takes action.
public class CSC216GUI extends JFrame
+implements ActionListener {
+
+  public CSC216GUI() {
+    // Setup
+    setTitle("CSC 216 GUI");
+    setSize(400, 400);
+    setLocation(600, 200);
+
+    // Create main container
+    Container c = getContentPane(
+      new BorderLayout()
+    );
+
+    // Components
+    JLabel lblCheer = new JLabel("Wolf!");
+    c.add(lblCheer, BorderLayout.NORTH);
+
+    JButton btnClick = new JButton("Click me!");
+    // Anonymous class
+    btnClick.addActionListener(
+      new ActionListener() {
+        void eventPerformed(ActionEvent e) {
+          System.out.println("Anonymous class");
+        }
+      }
+    );
+    // Lamda expression
+    btnClick.addActionListener(e -> {
+      System.out.println("Lambda expression")
+    });
+    // GUI is listener
+    btnClick.addActionListener(this);
+    c.add(btnClick, BorderLayout.SOUTH);
+
+    // so it actually closes
+    setDefaultCloseOperation(EXIT_ON_CLOSE);
+    // default is invisible :)
+    setVisible(true);
+  }
+
+  public void eventPerformed(ActionEvent e) {
+    System.out.println("GUI is listener");
+  }
+
+  public static void main(String[] args) {
+    CSC216 gui = new CSC216GUI();
+  }
+
+}
+

## ListIterator

A List specifically for lists. All linked lists are doubly linked lists. To support inserting in doubly linked lists, you need to make the first and last node actual nodes and not names for the boundary nodes (like what I said when I created Walker). ListIterator's think about being between two nodes.

  • Differences:
    • Can move forward and backward through the list (doubly linked).
    • Sits between two elements.
    • Can handle concurrent adding.

### ListIterator API

  • hasNext() : boolean: Returns true if the ListIterator can return the next element.
  • next() : E: Returns the next element.
  • nextIndex() : boolean: Returns the index of the next element.
  • hasPrevious() : boolean: Returns true if the ListIterator can return the previous element.
  • previous() : E: Returns the previous element.
  • previousIndex() : boolean: Returns the index of the previous element.
  • add(E): Inserts the specific element between the two elements the ListIterator is currently at.
  • remove(): Removes the element last returned by next() or previous().
  • set(E): Replaces the last element returned by next() or previous() using the given data.

### AbstractSequentialList

AbstractSequentialList is an abstract class is useful for creating lists. This implements almost everything except for listIterator() and size() because everything is done through ListIterator.

# Design Patterns

  • Design Pattern: A standard way to solve a specific problem
    • "It's a solved problem!"
    • Why? Because they help communication
  • Design patterns emerge.
  • Common Ones: Written by "The Gang of Four" and there are 23 written in a big book.

## Families

  • Creational: Process of object creation.
  • Structural: Composition of classes or objects.
  • Behavioral: Ways in which classes interact and distribute responsibility.
  • Concurrency: How to make code that is thread-safe and can run at the same time without breaking.

## Model-View-Controller (MVC)

  • What does it do? Separates the presentation of info from the working with the info.
  • Why?
    • You can hotplug the view and/or controller really easily!
    • You can debug issues more easily because you know what is failing.
  • Model: Contains data and the logic for maintaining that data.
  • View: Displays things to the user.
  • Controller: Handles and translates the data of the model for the view or
  • others.
  • Examples:
    • Java Swing Apps:
    • View and controller in the same class (very tightly coupled). (GUI class)
    • Web Apps:
    • View: HTML/XHTML + CSS.
    • Controller: GET and POST.
    • Model: Whatever backend underlies the project.

## Observer

You have a single object that you want to be able to notify any number of other objects about when it changes.

To do this, you make the single object you want to have other things observe extend Observable, which means it knows how to handle adding observers and notifiers. Then you have your observers extend Observer, which means they know how to handle being notified by an observable object.

Why would you do this? It allows you to decouple the thing your objects want to watch, meaning that it doesn't have to know about its listeners. This allows you to make easier to refactor to the higher level observers without breaking the observable.

This is commonly done in GUIs.

// In the Observable when something changes
+this.setChanged();
+notify();
+

## Singleton

A class controls the number of instances and the manner of creation of its instances.

Here, we will only ever use a singleton that manages one instance of itself.

Why do this? So outsiders only look at a single instance or controlled instance by the class.

## State Pattern

A way to implement FSMs with objects.

Essentially, you have a state object representing each state. The machine parses the input and calls the appropriate method on the current state object. That state object then acts and changes the parent state object as necessary.

# Design Suggestions

  • Don't implement functionality you don't know the clear use of.
  • Don't implement any functionality if its not in the requirements.
    • You should update the requirements, not implement what isn't there!
  • Limit class mutability as much as possible.
    • Omit mutators that have no use.
    • Limit object creation to the constructor.
  • Classes should be as cohesive as possible. They are a single level of abstraction
    • Should this class/object really know this?
  • Limit coupling. Make classes orthogonal
  • Design documents are persuasive papers.
  • Don't create a bunch of objects. It's inefficient.
  • Changing things is dangerous. Adding things is less.
  • Duplicating works is dumb.
    • One reason OO is useful.

# Software Engineering & Design

## Methods of Showing Design

  • UML (Unified Modeling Language) Diagram: Shows the interaction between different classes and objects.

  • CRC (Class, Responsibilities, Collaborators): Shows, on a per class basis, what each Object does and is responsible for.

    • Responsibilities: Behaviors
    • Collaborators: State, interacting classes

  • Software Design Models: A generalized approach to creating some piece of software.

    • Waterfall
    • Spiral
    • Iterative (Agile!)

  • Software Process Development Phases

    1. Requirements/Analysis
    2. Design
    3. Implementation/Code
    4. Testing
    5. Integration
    6. Maintenance

  • Software Artifacts: Any bit of documentation that is associated to the software.

  • Best Practices:

    • Design Practices
    • IDEs
    • Programming languages
    • Reviews and Inspections
    • Static Analysis
    • Testing Practices (diabolic testing)
    • Code Coverage
    • Version Control
    • Continuous Integration
    • Why use best practices?
    • Improve programmer productivity.
    • Reduce software faults and failures.
    • Support collaboration.

## Software Process

  • Goal of Design: Decide the software's structure and the hardware's configuration.
    • How will individual classes and software components work together?
  • Small Programs: ~10s classes/interfaces
  • Medium Programs: ~1000s classes/interfaces
  • General Design Flow:
    • What are the useful objects (candidate objects)?
    • What are the useful things objects should do (candidate behaviors)?
    • What are the useful things for each object to know (candidate state)?

### Requirements/Analysis

  • Goal: Understand customer requirements for the software system.
  • Difficult to get right because customers don't know what they want or how to communicate it.
  • Requirements often evolve.
  • Software Artifacts: Requirements documents, use cases, user stories.
    • CSC-216 uses "use cases".
    • Requirements Documents: Very formal "the system shall"
    • Use Cases: Grouped list of abilities of the system.
    • User Stories: A specific story about what a user is doing.

### Design

  • Goal: Decide the structure of the software and the hardware configurations that support it.
  • What am I designing for?
  • Software Artifacts: Design documents, class diagrams, UML diagrams.

### Implementation/Code

  • Goal: Translate requirements/design into concrete system.
  • Decide the implementation language (should be driven by how you designed).
  • Software Artifacts: Source code, bug database, config files, media, executables, source code repo

### Testing

  • Goal: Find errors in software.
  • Do this as quickly as possible!
  • Software Artifacts: Test code (test harnesses, scaffolding, etc.), bug database, test database, test inputs/outputs, documentation.

### Integration

  • Goal: Bring the software system together.
  • Individual programmers work together to bring all their parts together.
  • Software Artifacts: APIs, interfaces, integration documentation.

## Software Design Models

### Planned/Waterfall

  • A planned, step by step method of development

Waterfall Design Process

#### Pros

  • Allows workforce specialization
  • Great for known requirements.

#### Cons

  • Very hard to fix early issues.
  • Takes forever to deliver.

### Iterative/Agile Model

  • An iterative model that results in immediately useful products.

#### Pros

  • Allows for more interaction between developers and consumers, reducing the likelihood of misunderstanding.
  • Allows for more communication between developers reducing the risk of error, since they have to talk more between each iteration.

#### Cons

  • Scope Creep: The expectation of the software increasing.

## Task Planning

  • Task Planning: Assigning tasks in a logical way that optimizes the work people accomplish.
  • Tasks should be focused around deliverables.
    • Deliverables: Specific objects/things that must be turned in or delivered.
  • Tasks should have a time estimate attached to them
    • Ideal Time: The amount of time something should take ideally, no distractions, work 100% of time with 100% efficiency.
    • Elapsed Time: The amount of time it actually takes to do something.
  • Story Points: A relative, unit-less measure of time to express the size/difficulty of a task.

### Pros

  • Defines project scope
  • Illuminates project deliverables
    • What actually matters?
  • Accountability for teams
    • Reduce conflicts by identifying task owners
    • Increase leaderships

## Testing

  • Testing = Process to find faults. "The dynamic verification of the behavior of a program on a finite set of test cases, suitably selected from the usually infinite executions domain, against the expected behavior."
  • Write black box test cases first! That way you aren't biased.
  • Tips:
    • Really just try to mess things up.
    • Think about equivalence classes.
    • For white box tests, think about cyclomatic complexity.
  • Test code should be separate from source code.
  • Test code should be javadoc'd as well as source code.
  • Iterate between tests and coding

### Vocabulary

  • Fault A bug. An incorrect process, step, or data definition.
  • Verification: Evaluates whether the product is being built right.
    • White box testing. Code is known.
    • Test individual paths, correctly loops at boundaries, internal data structures, logical decisions are complete (handle true and false).
  • Validation: Evaluates whether the right product is being built.
    • Black box testing. Code is unknown.
    • Incorrect or missing functions, interface errors, errors in data structures, behavior or performance errors, initialization and termination errors.
  • Equivalence Classes: Chunks of input/output space that (should) all work identically. Pick a representative (middle!) value from these chunks.
    • This is part of the suitably selected part of testing.
  • Cyclomatic Complexity: The number of paths of execution that can be taken through a program (or at least an estimate of it).
    • Easy way to find: Number of decisions + 1 (not always correct!)

### Types of Testing

  • Unit: Tests a single bit of software (normally a method). Should be automated.
    • JUnit
  • Integration: Tests a small group of software units together (or integrated!). Should be automated.
    • JUnit
  • Functional/System: Tests a full, complete, integrated system / piece of software. Should be external.
  • Acceptance: Tests done by client to make sure that software works as expected.
  • Regression: A selective retesting of all other types of testing. This should always be (more or less) the same and should always be passed. DONE TO MAKE SURE THAT PROGRAM WORKS AS EXPECTED. Should be automated.
  • Beta: Tests done by a subset of consumers. They just use the software and see if they like it!

### Test Case Information

  • Unique Identifier
    • Black Box: Name of test in document.
    • White Box: Name of test method or specific assert.
  • Input into the program or program unit
    • Black Box: How the user runs and interacts with the program. Should be extremely specific.
    • White Box: Inputs to a method that set up the test.
  • Expected Results from the program or program unit
    • What you expect to get back, based off the requirements. Should be extremely specific.
  • Actual Results from the program or program unit
    • Black Box: What the user is shown.
    • White Box: Return values or state from other methods or objects.

### Code Coverage

  • Code Coverage: A measure of test case completeness.
    • Method Coverage: How many methods have been tested?
    • Statement Coverage: How many statements in each method have been tested?
    • Decision/Branch Coverage: How many decisions have been evaluated on their true and false path?
    • Condition Coverage: How many individual conditionals have been executed for both their true and false path? (EclEmma's Branch coverage)
  • If you have 100% statement coverage, you have 100% condition coverage
  • Coverage is not perfect and doesn't say that your test cases are strong.
  • 80-90% line/statement coverage is expected for each non-UI class.
    • Never stop testing.
    • Double check on Jenkins.
  • You can test coverage on non-whitebox tests too! :)

## Debugging

  • Eclipse can debug code!
  • Debugging lets you see code as it is running.
    • What line its executing.
    • The stacktrack.
    • The current data.
  • Breakpoints: Things you can insert from the gutter to stop/pause code execution when it reaches that line.
    • Allows you to walk through your code step by step.
  • Steps: How your program executes.
    • Step Over: Executes the next method as if it was a black box.
    • Step In: Executes a method by going into it.
    • Step Return: Goes to the return statement and finishes it.

## Analysis Types

  • Static Analysis: Evaluating the code without executing it.
  • Dynamic Analysis: Evaluating the code by executing it.
  • Looks for obvious problems or misuses of APIs, ignoring invariants, etc.
  • Issues:
    • False Positive: Reports bugs that program doesn't contain.
    • False Negative: Contains bugs that analyzer does not report.
  • Our Tools:
    • FindBugs: Finds subtle bugs.
    • CheckStyle: Make sure that code is properly constructed in correct style.
    • PMD: Finds more style issues and content issues.

## UML (Unified Modelling Language)

  • UML: Models OO software.
    • Converged from earlier standards (OMT, OOSE, Booch)
  • Use Case Diagrams: Models the interactions between use cases.
    • Ovals: Use case
    • Stick Figure: User (can be library, person, etc)
  • Class Diagram: Shows the interaction between different classes and objects. Static.
  • Sequence Diagram: Shows the flow of the program through different methods and classes through a specific scenario. Dynamic.
  • State Chart Diagram: Shows how models change state when performing a task.

### Class Diagrams

#### Class Attributes

  • Attributes: An instance variable (including static).
  • Form: visibility name : type
  • Visibilities:
    • + -- Public
    • # -- Protected
    • - -- Private
    • ~ -- Package (default)
    • / -- Derived
  • Static Attributes: Underlined

#### Class Operations/Methods

  • Operations: Actions that the class can perform.
  • Form: visibility name(parameters : types) : return_type
    • If return_type is void, omit it.
  • Visibilities:
    • + -- Public
    • # -- Protected
    • - -- Private
    • ~ -- Package (default)
  • Static Methods: Underlined.

#### Connectors

  • Connector: Any arrow that connects two classes
  • Generalization (is-a): Shows inheritance.
    • Interface Connector: Dashed arrow with triangular head points from concrete class to interface.
    • Abstract Class Connector: Solid arrow with triangular head points from concrete class to interface.
  • Composition (has-a): There are quite a few different ones!
    • Attributes: Small things (Strings, primitives), part of existing library, immutable value objects.
    • Dependency: A Class needs another Class to work, but doesn't have any fields that are one.
    • Shouldn't be included in CSC-216!
    • Connector: A dashed line.
    • Association: A Class knows about an instance of another Class, but they are somewhat independent.
    • Connector: A solid arrow with > head from the container (source) to the contained (target) with numbers (multiplicity) to show how many containers have how many contained.
    • Aggregation: The container class essentially just controls a group of those Classes. Unidirectional.
    • Connector: A line with a white diamond next to the aggregate class.
    • Composition: The container class controls every part of the contained. Unidirectional.
    • Connector: A line with a black diamond next to the container class.
  • Abstracts: Shows Classes that can't be directly instantiated. Italicized.
    • Implements: When a class implements an interfaces. Shown with dashed line with a white triangle head.
  • Interfaces: Shows interfaces. Depend on the particular instance.

Event Class

Wolf Scheduler Diagram

### Sequence Diagram

  • Message: Any piece of information or control that is passed between two classes. Solid arrow pointing to where the message went.
  • Return Message: The result of the sent message. Dashed arrow showing the message going back to where it was called from

### Tools for Creating UML Diagrams

  • Microsoft Visio
  • Commercial Eclipse Plugins
  • Violet UML (open source)
  • Dia (freeware)

# Algorithmic Efficiency

  • Big Idea: Generally, there is a trade off between runtime efficiency and size efficiency.

## Big O

  • Big O Notation: A way of showing the trend of worst, case running time of an algorithm.
  • You can specify specific cases and those will have different times, but then those are considered different algorithms.
  • Specific, common growth rates are shown at the bottom in a table.
NameBig O Notation
ConstantO(1)
LogarithmicO(log(N))
LinearO(N)
Log-LinearO(N∗log(N))
QuadraticO(N2)
ExponentialO(2N)

# Data Structures

## Stack

  • Stack: A collection of data that can only be accessed in a Last-In First-Out (LIFO) manner. That is, you can only access the newest element.

### Methods of Interaction

  • push: Adds an element at the top of the stack.
  • pop: Removes and returns the element at the top of the stack.
  • peek: Returns the element at the top of the stack.

### Usage

  • Can't do for-each style coding because you can't access the inner elements.
  • Instead do while not empty pop style.

### Uses

  • When using postfix (12+) or prefix (+12) notation, these can be stack evaluated.
    • For prefix notation, you push tokens onto the stack and, once you reach a function that takes N arguments, you push N more times and then pop $N
    • 1$ times (to remove the arguments and the operator), evaluate the function, and then push the result onto the stack.
    • For postfix notation, you push tokens onto the stack unless it is a function that takes N arguments. Then you pop N times, evaluate the arguments, and push the result onto the stack.

## Queue

  • Queue: A colleciton of data that can only be accessed in a First-In First-Out (FIFO) manner. That is, you can only access the oldest element.

### Methods of Interaction

  • enqueue: Adds an element at the back of the queue.
  • dequeue: Removes and returns the element at the front of the queue.
  • peek: Returns the element at the front of the queue.

## Trees

A tree is a directed, acyclic structure of linked nodes. These can be binary, heaped, and more.

Trees are inherently recursive and thus it is strongly recommended that you program recursively with it, especially traversal which is where you visit every node in the tree.

For traversals, you should probably draw a diagram to see what order and how you are traversing the tree.

Some uses of trees are representing the file structure using a filesystem tree, representing/implementing AI machines using decision trees, and compiling code using an abstract syntax tree / parse tree.

### Vocabulary

  • Directed means links are one-way.
  • Acyclic means no path crosses a node twice.
  • Balanced: The property of a tree being at or near its minimum height.
  • Tree Properties:
    • Height: The number of nodes between the current node and the lowest leaf node.
    • Really +1 the height of its child.
    • Depth: The number of nodes between the current node and the root node.
  • Types of Traversals:
    • Pre-order is where you process the branch, the left, then the right.
    • Start from the top and go down.
    • Post-order is where you process the left, the right, then branch.
    • Go to the bottom and then go up.
    • In-order is where you process the left, the branch, then the right.
    • If you draw the tree such that the distance between sibling nodes halves each level you go down, this is really easy.
  • Types of Nodes:
    • Branch nodes have a parent and a child.
    • Leafs have no children.
    • The root has no parent, and is the ancestor of all nodes. This can also be a branch or leaf.
  • Node Relations:
    • A parent is a node that points to the current node.
    • A child is a node that the current node points to.
    • A sibling is a node with a common parent of the child.

## Binary Search Tree

A binary tree is a tree where each branch only has two children.

A binary search tree is a binary tree that cannot contain duplicates where each branch is strictly greater than the max value in its left child's tree (and thus is greater than its left child) and strictly less than the min value in its right child's tree (and thus less than its right child) and each of its children are binary search trees.

A binary search tree has to take at most the height of the root node to find an element at a given element. This makes it important to try your best to keep the tree as close to its minimum height as possible (this means balanced). For balanced binary search trees, the efficiency is near O(log2(n)). For unbalanced binary search trees, the efficiency is near O(n).

### Adding Elements

  1. Start at the root as your branch.
  2. If the element is the same as the branch,
  3. Else if the branch is empty, insert the element there.
  4. Else if the element is less than the branch, add the element to the left side.
  5. Else if the element is greater than the branch, add the element to the right side.

In Java, it is recommended to do adds by reassigning your node with a function.

public void add(E element) {
+  this.root = add(overallRoot, value);
+}
+private Node add(Node branch, E element) {
+  if (branch == null) {
+    branch = new Node(element);
+  } else if (E < branch.data) {
+    // You'd really do compareTo here but it's
+    // hard to read
+    branch.left = add(branch.left, element);
+  } else {
+    branch.right = add(branch.right, element);
+  }
+}
+

### Getting Elements

  • Getting Minimum:
    1. If you don't have a left, return yourself.
    2. If you do, go left.
  • Getting Maximum:
    1. If you don't have a right, return yourself.
    2. If you do, go right.

### Removing Elements

  1. Find your appropriate node.
  2. If you have two children, set yourself to the min of the right tree (or max of the left tree).
  3. If you have one child, replace yourself with your child.
  4. If you have no children, kill yourself.

## Heaped Trees / Heaps

A heaped tree or heap is a tree which satisfies the heaping property, that is each node is either greater than or less than its children. If it has the prior, it is called a max heap because the root is the max element. If it has the latter, it is called a min heap because the root is the min element.

# Data Structure Modification

## Searching

How do you find things in data structures? One way is by arranging things in some natural order.

There are two categories, sorted and unsorted.

  • Sorted: Slower insertion/up-front. Faster retrieval/end.
  • Unsorted: Faster insertion/up-front. Slow retrieval/end.

There are many methods, each have trade-offs:

  • Sequential Search:
    • Definition: Start at element 0. If you are on the element you want, you found it. Otherwise, go to next element. At any time, if you are at the end, the list does not contain the element.
    • Efficiency: O(n)
    • Pros: Works for unsorted lists.
    • Cons: It's fairly slow.
  • Binary Search:
    • Definition: Locate target by selecting middle element, this is your pivot point. If your element should go before the pivot point, look only at that half. Likewise for your element after the pivot point. Select middle element of that half as your new pivot point. Recurse.
    • Efficiency: O(log2(n))
    • Pros: Is fast.
    • Cons: The list must be sorted.
// This is like java.util.Arrays#binarySearch
+private static int
+binarySearch(int[] list, int value, int min,
+             int max) {
+  if (min > max) {
+    // Missed element
+    return -1;
+    // java.util.Arrays#binarySearch(array,
+    // value) returns -(min + 1), or insertion
+    // point
+  } else {
+    // List not empty
+    int pivot = (min + max) / 2;
+    if (value < list[pivot]) {
+      //
+      binarySearch(list, value, min, pivot - 1);
+    } else if (value > list[pivot]) {
+      binarySearch(list, value, pivot + 1, max);
+    } else {
+      return pivot;
+    }
+  }
+}
+

## Sorting

Sorting is ordering items into their natural ordering. There are many different ways to do this, each with trade offs:

  • Bogo Sort:
    • Method: Shuffle and check if its sorted. Repeat until sorted.
    • Efficiency: O(n!).
  • Selection Sort:
    • Method: There are two parts of the list: the sorted and the unsorted; everything starts unsorted. Find the smallest value in the unsorted part and place it at the end of the sorted part.
    • Efficiency: O(n2).
  • Bubble Sort:
    • Method: Start on the first element. Compare the current element to the next, swapping them if they are not in the right order. Do this until you reach the end of the list. Do this until the list is completely sorted.
    • Efficiency: O(n2) but slower than selection sort due to doing more swaps.
  • Insertion Sort:
    • Method: There are two parts of the list: the sorted and the unsorted; everything starts unsorted. Take the first element in the list and insert it into the sorted part in sorted order. Do this until there is no unsorted part.
    • Efficiency: $O(n^2) but normally faster than selection sort because you do fewer comparisons.
  • Merge Sort:
    • Method: We already know how to merge two sorted lists (by having multiple read heads and taking the smallest value at any of the read heads). If our list is length 1, it is trivially sorted. If our list is unsorted, we split the list into a left and right half and merge sort those. Then we merge those two now sorted halves (each lists their own!). The list is now sorted.
    • Efficiency: O(n∗log2(n))
  • Quick Sort:
    • Method: Pick a pivot element and split the list into two parts, either larger or smaller than the pivot. Sort those sub lists. The pivot goes right between these two sublists. The list is now sorted.
    • Efficiency: O(n∗log2(n)) (can be worse with bad pivots).
    • It really matters what pivot you pick. There are different ways to do it:
    • Pick first. (good and easy if unsorted)
    • Pick randomly. (good on average)
    • Pick median of first, middle, and last. (great for sorted and reverse sorted elements)

# Finite State Machines

  • Finite State Machine: A system that can have only a fixed set of inputs, states, and transitions.
    • The state is held in memory.
  • Why use FSMs?: They can describe almost all systems easily. They are very easy to implement. They're also just interesting!
  • Guard: Something which must be true for a transition to occur.

## Diagrams

  • FSM Diagram:
    • State: A circle.
    • Final State: A double-layered circle.
    • Inputs: A letter or other identifier.
    • Transition: Arrows labeled with the input given.
  • Transition Tables: A tabular method of showing the possible states.
    • Inputs: Heading.
    • State: First Column.
    • Transition: Intersection between state's row and heading column.

## Examples

  • A vending machine modeled by a finite state machine:

Vending Machine Diagram

  • Compilation of code:

Pascal Real Constant Compiler

  • Substring Finding:

Simple Text Processing for 'abba'

  • Text Processing:

wc as a FSM

StateA-Za-z\nOther
01: ++wc, ++cc0: ++lc, ++cc0: ++cc
11: ++cc0: ++lc, ++cc0: ++cc

## While-Switch Idiom

  • While you have input, switch on your state, and then modify your state and other variables based off your given state and the input.
    • Switching on state doesn't really matter, but Dr. Heckman cares.
while you have input:
+  switch(STATE):
+    case STATE_0: ...
+    case STATE_1: ...
+    case STATE_2: ...
+    case STATE_3: ...
+
// Replicates wc functionality
+while ((next = br.read()) != −1) {
+  ch = (char) next;
+  switch (state) {
+    case 0:
+      if (ch == '\n') {
+        ++lc;
+        ++cc;
+      } else if (Character.isLetter(ch)) {
+        state = 1;
+        ++wc;
+        ++cc;
+      } else {
+        ++cc;
+      }
+      break;
+
+    case 1:
+      if (ch == '\n') {
+        state = 0;
+        ++lc;
+        ++cc;
+      } else if (Character.isLetter(ch)) {
+        ++cc;
+      } else {
+        state = 0;
+        ++cc;
+      }
+      break;
+
+    default:
+      System.out.println(
+        "Invalid state: " + state
+      );
+  }
+}
+

## Object Oriented Implementation

This only works for object-oriented paradigms.

Use the state pattern. This is useful if all your states have to handle all/most types of input.

This works with bounded recursive loops. (This is when a state has some data, which is formally illegal but simplifies implementation.)

## Functional Implementation

This only works with functional paradigms.

Instead of having objects that implement a common interface, you can have a set of functions that represent state. Each function knows how to handle an arbitrary input, parses it, and returns the appropriate state (function).

You set the current function to the call of the current function with the input.

StateFunction curr = defaultStateFunction
+while input:
+  // curr returns a StateFunction
+  curr = curr(input)
+

This does not work with bounded recursive loops.

# Recursion

  • Recursion: Defining something using itself.
  • Why use it?
    • It works better for some things. For example, some things are inherently
    • recursive.
    • Trees are inherently recursive (so are files).
    • Some searches are inherently recursive.
    • Some functional languages use only recursion. (e.g. Haskell, Scheme, etc.)
    • It can be mathematically proved to work much more easily through induction.
    • It's really elegant.
  • How do you write recursively?
    • You just treat the problem as if you've already solved a smaller but completely identical problem.
    • Try to break the problem into a smaller but identical problem.

## Verification Methods

  • Static Analysis (Static): Check for various style and general techniques.
  • Testing (Dynamic): Actually run your code and make sure it works.
  • Formal Analysis (Static): Mathematically prove this program calculates correctly (normally using discrete mathematics).
    • It is harder to prove that it does what the client whats for the given inputs.
    • You normally use mathematical induction.
    • Mathematically Induction? You use your basis step (base case) followed by inductive step (recursive).
    • You have to correctly identify the recursive/inductive step.

## Important Notes

  • Calling a function takes over the flow of control, unless you are using forking / multiprocessing / multithreading.
  • Sometimes recursive solutions are very inefficient if they need to calculate values repetitively or need to make several function calls for something trivial.

## Types of Recursive Functions

  • Linear/Trivial: The function only calls itself once. Can almost always be iterative.
    • Often O(n)
  • Branching: The function calls multiple instances of itself. Often must be recursive.
    • Sometimes O(n2)

## Creating a Recursive Solution

  • Base Case(s): A trivial example of the problem with a known solution.
    • Try to choose the cleanest, best, simplest base case.
  • Recursive Case: A more complex example that can be solved by solving a simpler version and then doing something with it.
  • Your function must have a size parameter, so that it can end. It should be decreasing (but not necessarily monotonically).
  • Check the size parameter, it it is small, solve the base case. If not, solve the recursive case.

## Public-Private Pairs in Recursive Methods/Functions

Sometimes you need more information to accumulate in a recursive method that always has the same default value. To do this, you create a public method that has only a restricted number of parameters. This public method then calls on the private method with the "default value".

This is essentially a workaround for not having true default values and also making sure your clients don't have to worry about that.

public void crawl(File f) {
+  crawl(File, "");
+}
+
+public void crawl(File f, String indent) {
+  System.out.println(f);
+  if (f.isDirectory()) {
+    for (File subfile : f.listFiles()) {
+      crawl(subfile, indent + "  ");
+    }
+  }
+}
+

## Using Control Flow as a Data Structure

Using recursion, you can use the method call stack as a data structure. How? You store a local variable in the method cal, call the method recursively, and then do something with the local variable after the recursive method completes.

// This only works with synchronous method calls
+void reverseLines(Scanner input) {
+  if (input.hasNextLine()) {
+    // "Push" something onto the "stack"
+    String line = input.nextLine();
+    // Add a new method to the call stack
+    reverseLines(input);
+    // "Pop" something from the "stack"
+    System.out.println(line);
+  }
+}
+
  • Cohesion: How much one class represents a single abstraction. (Allows for reuse!)
  • Coupling: The amount with which one program calls upon another.
    • Internal Coupling: One class modifying another's data.
    • Parameter Coupling: Using services provided by another class.
  • Encapsulation: A piece of software having a small, controlled, logical number of ways to interact with it.
  • Software Artifacts: Any documentation. Design documents, class diagrams, other UML diagrams.
  • Serialization: The process of saving a Java object's state to a file.
  • Deserialization: The process of reading a Java object's state from a file.

# Misc

## Horner's Rule

  • Horner's Rule: A method for parsing numbers as polynomials.
    • 1092=(((1)B+0)B+9)+2 where B is the given base
  • Why is Horner's rule useful? Because it can be used to convert ASCII into numbers, since ASCII digits are all consecutive in terms of value.
  • Summary: Read value, shift by base, repeat.
\ No newline at end of file diff --git a/notes/ncsu/1s/csc216/pascal_compiler_fsm.png b/notes/ncsu/1s/csc216/pascal_compiler_fsm.png new file mode 100644 index 0000000..ceba203 Binary files /dev/null and b/notes/ncsu/1s/csc216/pascal_compiler_fsm.png differ diff --git a/notes/ncsu/1s/csc216/vending_machine_fsm.png b/notes/ncsu/1s/csc216/vending_machine_fsm.png new file mode 100644 index 0000000..5f8fa2c Binary files /dev/null and b/notes/ncsu/1s/csc216/vending_machine_fsm.png differ diff --git a/notes/ncsu/1s/csc216/waterfall.png b/notes/ncsu/1s/csc216/waterfall.png new file mode 100644 index 0000000..4130ecf Binary files /dev/null and b/notes/ncsu/1s/csc216/waterfall.png differ diff --git a/notes/ncsu/1s/csc216/wc_fsm.png b/notes/ncsu/1s/csc216/wc_fsm.png new file mode 100644 index 0000000..b4d3f38 Binary files /dev/null and b/notes/ncsu/1s/csc216/wc_fsm.png differ diff --git a/notes/ncsu/1s/e102/ghg_emissions.png b/notes/ncsu/1s/e102/ghg_emissions.png new file mode 100644 index 0000000..eef4a3b Binary files /dev/null and b/notes/ncsu/1s/e102/ghg_emissions.png differ diff --git a/notes/ncsu/1s/e102/index.html b/notes/ncsu/1s/e102/index.html new file mode 100644 index 0000000..ae53d5d --- /dev/null +++ b/notes/ncsu/1s/e102/index.html @@ -0,0 +1 @@ +Eli | E 102: Engineering in the 21st Century

E 102: Engineering in the 21st Century

Instructor: Ms. Hailey Queen | Semester: Spring 2019

Table of Contents

# Administrivia

  • Goal of E-101: Show engineering as a profession, the design cycle, basic problem solving.
  • Goals of E-102: Specific the grand challenges engineers face, how engineers tackle those, and how those challenges impact history, politics, society, etc.
    • This is a GEP (interdisciplinary perspectives).
  • We only meet once a week on Thursday!
  • 1 Free absence allowed. After -5% per class (for unexcused)

## Professor

  • Name: Hailey Queen
  • Email: haqueen@ncsu.edu
  • Office hours on syllabus

## TA

  • Name: Lexi Kloeppel
  • Major: Chemical Engineering Major, Biomanufacturing Minor - Senior
  • Email: lrkloeppel@ncsu.edu
  • Takes care of absences

## Grades

WeightComponentDetails
5%ParticipationKahoot
15%HomeworkMoodle Assignments (14)
20%Midterm ExamIn class, closed notes
15%PaperBased on Grand Challenges
15%Team PosterBased on Grand Challenges
30%Final ExamComprehensive

# Grand Challenges

  • 14 Engineering Grand Challenges
  • Founded by National Academy of Engineers (NAE)
  • Created in 2008
  • National Academy of Engineers: A large body of engineers that helps set ethics standards, promote engineering concerns, and set goals (the Grand Challenges)
    • Established 1964
    • Members elected by current members based on research (~2000)
      • NC State has 14 :)
    • Part of National Academy of Sciences founded by Abraham Lincoln

## Categories

  • Health
    • Advance health informatics
    • Engineer better medicines
    • Reverse-engineer the brain
  • Security
    • Prevent nuclear terror
    • Secure cyberspace
  • Sustainability
    • Make solar energy affordable
    • Provide energy from fusion
    • Developer carbon sequestration methods
    • Manage the nitrogen cycle
    • Provide access to clean water
  • Joy of Living
    • Enhance virtual reality
    • Advance personalized learning
    • Engineer the tools for scientific discovery

## Enhancing Virtual Reality

Virtual reality is all about simulating reality so we can have more control in education, training, entertainment, and even more scenarios.

Currently, the main components are goggles/headsets, headphones/earbuds, and movement sensors. In the future, omnidirectional treadmills, touch simulators, and possibly other tools will become part of the standard VR toolset.

This has connections to [personalizing learning](#Advance Personalized Learning)

  • Important People:
    • Jaron Lanier

## Advance Personalized Learning

  • Big Ideas:
    • People are different
    • Motivation
    • Let students move at their own rate.
    • We collect more data to figure out how students learn, what they are learning, and how to better help them. (machine learning and data science???)
    • Get quick feedback from immediate assessment to send help people.
    • Figure out what students are interested in and use that to help keep them interesting.
  • Why is it important?
    • We need educated people for almost everything.
    • Our education system kinda sucks.
    • We have a shit ton of people drop out.
  • Connections:
    • Personalized Medicine: Using data.
    • Reverse Engineer the Brain: How does it work?
    • Enhancing Virtual Reality: Cool new way to teach!

## Carbon Sequestration

  • Chemical Engineering's most important and personal grand challenges.
  • Scrubber: Removes CO2 from gas.
    • Types: Wet gas scrubber.
  • US Expected Cost from Climate Change: 20$ trillion.
    • 2nd highest in the world.
  • Current Solutions: Shift energy sources, land management, carbon injection, biochar/biomass, rock storage.
  • Current Issues: Which solution should we do? God it's so expensive. No solution is very good so far.
    • Carbon Tax: Companies lobby against it because they don't want to spend it.

Greenhouse Gas Emissions Diagram

## Manage the Nitrogen Cycle

  • Sustainability: Maintaining balance of resource use in environment.
  • Things that Add Nitrogen to Ground: Legumes (nitrogen fixing root nodules), fertilizer, nitrifying bacteria.
  • Things that Remove Nitrogen from Ground: Denitrifying bacteria, soil leeching (water), plant roots.
  • How does nitrogen get added by humans? Primarily creating nitrogen based fertilizer and disrupting ecosystems (killing nitrogen providing legumes).
  • Why is the nitrogen cycle important? Because nitrous oxide is a very strong greenhouse gas and nitrogen can get into water (from runoff) and ruin aquatic ecosystems (fish kills, eutrophication, algal blooms).

Nitrogen Cycle Diagram

## Reverse-Engineering the Brain

  • Impacts:
    • Cure/help neurological diseases.
    • Advance computing.
    • Understanding humans.
    • Advances in prosthetics.

## Health Informations

  • Health Informations: The acquisition, management, and use of data in health and medical setting.
  • Very closely related with engineering better medicines. How can you create better medicine if you don't have info?

## Preventing Nuclear Terror

  • Currently, our "best" method of preventing nuclear terror is Mutually Assured
  • Destruction (MAD), which is a shit method.
  • Three parts to using nuclear weapons.
    • Obtaining nuclear materials - The hardest one.
      • Uranium 235, Plutonium 239 are used because they are fissile (can sustain chain reactions).
      • You get plutonium 239 from a breeder reactor (creates it) and uranium 235 from enrichment.
    • Obtaining a detonation method.
    • Delivering the weapons.
  • Solutions:
    • Systems for tracking nuclear materials and weapons.
    • Nuclear car wash.
    • Computer modeling of nuclear attacks to guide warning systems and clean up.

### Anantomy of Nuclear Weapons/Reactor

  • For a weapon to work, a reaction needs to be supercritical.
  • Subcritical: Not enough neutrons are released to sustain the reaction. Dies out.
  • Critical: Just enoug neutrons to release to sustain the reaction. Self sustains.
  • Supercritical: More neutrons are released than need to sustain the reaciton. Goes boom.
  • Types of Nuclear Assemblies / Detonators:
    • Gun type: A conventional explosive to the side of two nuclear pieces explodes and pushes the two pieces together. Can only be used for uranium
    • Implosion type: A conventional explosive surrounds the nuclear material and explodes, compressing the nuclear material. Can be used for everything.
  • Enriching uranium 235: You use mass separation. This is normally done now by gaseous centrifuging, since uranium 235 is lighter than normal uranium 239.
  • Breeding plutonium 239: Basically there is a series of nuclear processes that convert uranium 238 to plutonium 239.
    • Normal reactors create plutonium 240, which can't be used for nuclear weapons because it blows itself up before it goes supercritical.

## Restore Urban Infrastructure

  • Why security? Urban infrastructure impacts the safety/stability of society as a whole.
    • Think Flint, Michigan and the Hyatt Regency walkway collapse.
  • Issues:
    • US gets a D+ from the American Society of Civil Engineers
  • Why is it hard?
    • It's really expensive
    • It isn't sexy.
    • People don't see the benefit.

# Majors

## Biomedical Engineering

  • Focuses: biomaterials, biomechanical,

## Chemical Engineering

  • AKA: Process engineering.
  • Not always in manufaturing.
  • Often used as a spring board to medical/dental school.
  • 7 concentrations.
  • Research: Biofuels, biomolecular, complex fluids, nanoscience, polymers, engineering, computational, kinetics/electrochemical.

### Jobs

  • Traditional: Chemical processing, petroleum refining, paper production, synthetic materials, textiles, food processing, brewing.
  • Emerging: Pharmaceutical, nanotechnology, bioengineering, green engineering, microelectronics, alternative energy.
  • NC State pay after school: ~69,500$

## Industrial and System Engineering

  • Determine the most effective ways to use people, resources, information, energy, etc.
    • Quality, efficiency, cost
  • Essentially fancy management, planning, and HR
  • Relevant Fields: Management and planning of manufacturing, hospitals, and also Disney by some strange alchemy.

### Impacts

  • The moving assembly line
    • Effective use of labor resources
    • Increased speed
    • Increased quality
  • The widespread adoption of cars (boo!)
    • Model T: 93 Minutes and $290

## Material Science Engineering

  • Largest Users of Solar (by raw amount): China > Japan > Germany > US
  • Solar Energy ~1% of energy produced
  • Focus: Metals, ceramics, polymers, composites, microelectronics
  • "Making Stuff: Stronger, Smaller, Cleaner, and Smarter"

## Nuclear Engineering

  • Possible Fields: Energy, medicine, medical imaging, military, nuclear terror (politics).
  • Related Grand Challenges: Provide energy from fusion, engineer better medicines, reverse-engineer the brain, prevent nuclear terror, engineer the tools for discovery.

### Fusion

  • Method: Fuse tritium (formed from nuclear reaction Lithium) and deuterium.
  • Pros: Creates a lot of energy, extremely clean, very reliable, won't have runaway reactions.
  • Cons: It's really hard, like, really really hard.

### Fission

  • Pros: It creates a lot energy, it produces no carbon emissions, very reliable.
  • Cons: It's much cheaper, it can be unsafe, it can have runaway reactions.

### Medical Field

  • Single-Photon Emission Computerized Tomography (SPECT): A form of imaging that can better show brain-related issues.

## Paper Science and Engineering

  • Paper Science and Engineering: Specialization of chemical engineering.
  • In the College of Engineering and College of Natural Resources
  • Often double major in PSE and CHE
  • Lots of hands-on learning.

### Finances

  • Highest paid NC State Engineering major.
  • 50%-60% of students have a scholarship.

## Civil Engineering

  • Deals with design, construction, and maintenance of infrastructure.
  • 2nd oldest.
  • Subdisciplines:
    • Structural engineering
    • Transportation engineering
    • Geotechnical engineering
    • Construction engineering
    • Water resources and engineering
    • Environmental engineering
  • Size: 1000 undergraduates.
\ No newline at end of file diff --git a/notes/ncsu/1s/e102/nitrogen_cycle.png b/notes/ncsu/1s/e102/nitrogen_cycle.png new file mode 100644 index 0000000..1bb31a3 Binary files /dev/null and b/notes/ncsu/1s/e102/nitrogen_cycle.png differ diff --git a/notes/ncsu/1s/index.html b/notes/ncsu/1s/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/1s/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/ncsu/1s/ma225/index.html b/notes/ncsu/1s/ma225/index.html new file mode 100644 index 0000000..8291417 --- /dev/null +++ b/notes/ncsu/1s/ma225/index.html @@ -0,0 +1 @@ +Eli | MA 225: Foundations of Advanced Mathematics

MA 225: Foundations of Advanced Mathematics

Instructor: Dr. Fulp | Semester: Spring 2019

Table of Contents

Sadly I did not scan in my paper notes for this class, so all I have is this small cheatsheet.

# Vocabulary

  • Axiom: A statement simply accepted to be true.
  • Theorem: A statement proved to be true using the axioms.
  • Lemma: A small theorem used in a specific proof to make the proof cleaner/easier.
  • Proposition: A sentence with one of two truth values.
    • "The sky is blue."
    • "4 divides 5."
  • Universe (U): All possible elements within the realm of discussion.
  • Open Sentence: A propsoition dependent on a variable within the universe.
  • Universal Quantifier (∀): (∀x)P(x) is true iff the truth set of P(x) is U.
  • Existential Quantifier (∃): (∃x)P(x) is true iff the truth set of P(x) is non-empty.
  • Unique Quantifier (∃!): (∃!x)P(x) is true iff the truth set of P(x) contains only one value.
  • Set: A collection of unique elements that cannot contain itself. (Sets can be elements!)
  • Argot: The standard human language used to describe logical statements.

# Logical Equivalences

Let P, Q, and R be propositions about elements x in universe U. We write P(x) iff proposition P holds for some specific element x∈U. If we instead write simply P, we consider some specific element x∈U where P(x) holds.

  • Double Negation:
    • P⟺¬(¬P)
  • Commutative Law:
    • P∨Q⟺Q∨P
    • P∧Q⟺Q∧P
  • Associative Law:
    • P∨(Q∨R)⟺(P∨Q)∨R
    • P∧(Q∧R)⟺(P∧Q)∧R
  • Distributive Law:
    • P∧(Q∨R)⟺(P∧Q)∨(P∧R)
    • P∨(Q∧R)⟺(P∨Q)∧(P∨R)
  • DeMorgan's Law:
    • ¬(P∧Q)⟺¬P∨¬Q
    • ¬(P∨Q)⟺¬P∧¬Q
  • Implication Properties:
    • P⟹Q⟺¬P∨Q
    • ¬(P⟹Q)⟺P∧¬Q
    • ¬(P∧Q)⟺P⟹¬Q
    • ¬(P∧Q)⟺Q⟹¬P
    • (P⟺Q)⟺(P⟹Q)∧(Q⟹P)
    • P⟹(P⟹R)⟺(P∧Q)⟹R
    • P⟹(P∧R)⟺(P⟹Q)∧(P⟹R)
    • (P∧Q)⟹R⟺(P⟹R)∧(Q⟹R)
    • Contraposition:
      • P⟹Q⟺¬Q⟹¬P
  • Quantifiers and Negation: Normally, this would be written out in English instead of being symbolic. However, to avoid ambiguity, we write this symbolically.
    • ¬[(∃x)P(x)]⟺(∀x)[¬P(x)]
    • ¬[(∀x)P(x)]⟺(∃x)[¬P(x)]

# Set Equivalences

Let A and B be sets in some universe U.

  • Ac={x∈U:x∉A}
  • A−B=A∖B=A∪Bc
  • A⊂B=Bc⊂Ac
  • DeMorgan's Law:
    • (⋂A⊆UU)c=⋃A⊆U(Ac)
    • (⋃A⊆UU)c=⋂A⊆U(Ac)

# Argot of Logical Statements

Let P and Q be propositions.

  • P⟹Q
    • P implies Q.
    • If P, then Q.
    • Q, if P.
    • P only if Q.
    • Q, when P.
    • Q whenever P.
    • P is sufficient for Q
    • Q is necessary for P.
    • Q is a necessary consequent of P.
  • P⟺Q
    • P implies Q, and conversely.
    • P if and only if Q.
    • P iff Q.
    • P is equivalent to Q.
    • P is necessary and sufficient for Q.
\ No newline at end of file diff --git a/notes/ncsu/1s/ma242/index.html b/notes/ncsu/1s/ma242/index.html new file mode 100644 index 0000000..bd709c8 --- /dev/null +++ b/notes/ncsu/1s/ma242/index.html @@ -0,0 +1 @@ +Eli | MA 242: Calculus 3

MA 242: Calculus 3

Instructor: Ms. Leslie Kurtz | Semester: Spring 2019

Table of Contents

Sadly I did not scan in my paper notes for this class, so all I have is this small cheatsheet.

# Vector Property Equations

  • aT=r→′⋅r→″||r→′||
  • aN=||r→′×r→″||||r→′||
  • K=||r→′×r→″||||r→′||3
  • T^=r→′||r→′||
  • B^=r→′×r→″||r→′×r→″||
  • N^=B^×T^
\ No newline at end of file diff --git a/notes/ncsu/1s/py205/index.html b/notes/ncsu/1s/py205/index.html new file mode 100644 index 0000000..5aacd29 --- /dev/null +++ b/notes/ncsu/1s/py205/index.html @@ -0,0 +1 @@ +Eli | PY 205: Physics I (Mechanics & Energy)

PY 205: Physics I (Mechanics & Energy)

Instructor: Dr. Kory Green | Semester: Spring 2019

Table of Contents

Sadly I did not scan in my paper notes for this class, so all I have is this small cheatsheet.

# Units

## Fundamental Units

DimensionSymbolSI Unit
LengthLmeter (m)
MassMkilogram (kg)
TimeTsecond (s)

## Derived Units

DimensionSI Unit
Areasquare meter (m2)
Volumecubic meter (m3)
Velocitymeters per second (m/s)
Accelerationmeters per second per second (m/s2)
ForceNewtons or (N=kg⋅m/s2)
PressureNewtons per meter (N/m=kg/s2)

## SI Prefixes

Prefix10n
tera- (T)12
giga- (G)9
mega- (M)6
kilo- (k)3
centi- (c)-2
milli- (m)-3
micro- (μ)-6
nano- (n)-9
pico- (p)-12
fempto- (f)-15

# Kinematics

SymbolPropertySI Units
x or yPositionm
vVelocitym/s
aAccelerationm/s2
tTimes

## Equations

  • vf=vi+at
  • xf=xi+vit+12at2
  • v¯=vf+vi2
  • xf=xi+(vx,f+vx,i2)t
  • vf2=vi2+2a(xf−xi)

## Constants

  • gearth=9.80m/s2

# Rotation

## Variables

SymbolPropertySI Units
θAngle/Angular Positionrad
ωAngular speedrad/s
αAngular accelerationrad/s2
τTorque (angular force)N⋅m
IMoment of inertiakg⋅m2
rRadiusm
TPeriods
FFrequency1/s or Hz
vLinear velocitym/s
ac=arCentripetal/center-seeking accelerationm/s2
atTangential accelerationm/s2

## Equations

  • ω=2πT
  • v=2πrT
  • ac=v2r
  • T=2πrv
  • F=1T
  • τ=Iα
  • I=ICM+MD2 (Parallel Axis Theorem)
  • ωf=ωi+at
  • θf=θi+ωit+12αt2
  • ω¯=ωf+ωi2
  • θf=θi+(ωf+ωi2)t
  • ωf2=ωi2+2α(θf−θi)

### Common Moments of Inertia

ShapeEquation
PointI=MR2
Rod attached in middleI=112MR2
Rod attached on endI=13MR2
Thin circular hoopI⊥=MR2 and I∥=12MR2
Thin solid diskI⊥=12MR2 and I∥=14MR2
Hollow sphereI=23MR2
Solid sphereI=25MR2

## Vocab

  • Lever/Moment Arm: The perpendicular distance between the axis of rotation and the application of force.
    • AKA: The part that matters.

# Newtonian Physics

## Principles

  • Archimede's Principle (for bouyancy): The bouyant force is the weight of the fluid displaced.

## Laws

  1. ∑F→=0⟹a→=0
  2. ∑F→=ma→=ddt(mv→)
  3. Equal and opposite reaction.

## Types of Forces

  • Contact: Objects must be touching to have an effect
    • Normal/Flex: Perpendicular to plane, prevents clipping.
    • Tension: From rope or rope-like objects.
    • Friction: Opposes motion of body against another.
    • Spring: Seeks equilibrium in springs.
    • Buoyant: Pushes things with/against gravity depending on density.
  • Field: Acts even without touching.
    • Gravitational: Pull all material objects together.
    • Electromagnetic: Pull/push magnetic things.

## Equations for Forces

Force TypeEquationNote
WeightW=mg=m∗GMbodyr2Assumes uniform gravitational field.
NormalN=F⊥insideThe force that prevents two bodies from intersecting.
SpringFsp=−kxk is the unique spring constant.
BouyantB=ρfluidgVdispFor fully submered bodies, Vdisp=Vobj.

# Energy

## Vocabulary

  • Energy: The ability to do work.
  • Work: A measure of change of state and its associated difficulty in a system.

## Principles

  • Energy in a system is constant unless is receives some work external to the system or does some work external to the system.

## Variables

SymbolPropertySI Units
EEnergyJ
WWork / Change in EnergyJ
PPower / Rate of Change in EnergyJ/s or W
UPotential EnergyJ
UgGravitational Potential EnergyJ
UspSpring Potential EnergyJ
KEKinetic EnergyJ

## Equations

  • E=F→⋅r→
  • Ef=Ei+W
  • Wf=∫!f,dr

### Energy Equations

Energy TypeEquationsNotes
Potential Spring Energy (Us)12kx2
Potential Gravitational Energy (Ug)mghAssumes uniform gravitational field
Translational Kinetic Energy (KE)12mv2
Rotational Kinetic Energy (KE)12Iω2
\ No newline at end of file diff --git a/notes/ncsu/2f/csc230/aligned_struct.png b/notes/ncsu/2f/csc230/aligned_struct.png new file mode 100644 index 0000000..061ba74 Binary files /dev/null and b/notes/ncsu/2f/csc230/aligned_struct.png differ diff --git a/notes/ncsu/2f/csc230/copy_bits.png b/notes/ncsu/2f/csc230/copy_bits.png new file mode 100644 index 0000000..1041b59 Binary files /dev/null and b/notes/ncsu/2f/csc230/copy_bits.png differ diff --git a/notes/ncsu/2f/csc230/index.html b/notes/ncsu/2f/csc230/index.html new file mode 100644 index 0000000..76ab7cc --- /dev/null +++ b/notes/ncsu/2f/csc230/index.html @@ -0,0 +1,760 @@ +Eli | CSC 230: C & Software Tools

CSC 230: C & Software Tools

Instructor: Dr. Susan Balik | Semester: Fall 2019

Table of Contents

# Coding Style

We use Javadoc-style Doxygen comments.

We avoid magic numbers, instead using constants via preprocessor directives (#define VALUE_NAME <VALUE>).

Indent with soft tabs (i.e. spaces). One statement per line. End all lines with \n.

Avoid global variables because they're really unsafe and it's hard to track their modification.

# Compilation

Java uses cross-platform bytecode that the JVM will use on runtime to produce and run machine code. The JVM either uses a bytecode interpreter or Just-In-Time (JIT) compilation. JIT is faster.

C directly generates machine code.

  • Java
    • Cross platform bytecode binaries.
    • Can be easier to debug.
  • C
    • Produces faster code.

## Steps

The parts are split into a frontend and backend. Frontends deal with the language specifics. Backends deal with the architecture specifics. The middle speaks a standard language.

This let's the hardest parts (optimization) be handled in a repeatable way for different languages and architectures.

  • Frontend: preprocessing, lexical analysis, parsing, assembler.
  • Backend: code generation, assembler.

## Preprocessing

Goes in and processes all the preprocessor directives (lines that start with #) in the source code.

There are a bunch of different kinds of preprocessor directives:

  • #define MACRO_NAME(ARGS) MACRO_VALUE: Defines a macro with the given name, which textually expands to the macro value, textually replacing the given arguments.
  • #include <filename>: Copies the given filename in place of this. This first looks into the system directories and then looks in the current directory.
  • #include "filename": Does the same thing as the above, but looks in the current directory first and then looks into the system directories.

### Macros

C preprocessor macros are textual and unhygienic (meaning they can have name collisions). Because of this, you really should only use them for defining constants.

// Defining simple constants.
+#define SIZE 5
+

Macros do allow you to define multi-line functions. These functions are pass-by-name, where they have access to whatever names were present in the code at the time. (Make sure that you aren't using global variables here. Because of variable shadowing, this may not do what you expect.) Also, because of operator precedence, we should surround all variables in parentheses and the entire macro value in parentheses, if we're using multiple operators.

// Bad behavior!
+#define TIMES_TWO(x) x * 2
+// this expands to: 1 + 1 * 2 = 3
+TIMES_TWO(1 + 1);
+// Better behavior
+#define TIMES_TWO(x) ((x) * 2)
+

However, macros do allow for (very limited, very messy) generic programming.

// Generic Programming with Macros
+// Relying on operators working with types
+#define MAX(x, y) ((x) > (y) ? (x) : (y))
+// Taking an explicit type
+#define SWAP(x, y, type) { \
+  type tmp = x; \
+  x = y; \
+  y = tmp; \
+}
+

You can also control macro expansion using

  • #x: Puts quotes around the value x of the given argument. Useful for debugging sometimes.
  • x ## y: Puts quotes around the value x and y. Due to implicit string literal concatenation, these concatenate each other.

### Include Guard

## Lexical Analysis

Converts source code into tokens.

The C scanner / lexical analyzer is a maximal muncher. This means it goes as far as it can with its first guess whenever there is ambiguity.

## Parsing

Converts the string of tokens into an Abstract Syntax Tree (AST).

## Optimization

Analyzes, modifies, and makes the AST more efficient. This can run few to many times, depending on the compilation parameters.

## Code Generation

Converts the AST into a specific architecture's assembly instructions.

## Assembler

A specific architecture's assembler goes in and converts the assembly to machine code.

# Revision Control

Why do we need revision control? To coordinate work, allow faster conflict resolution, allow people to work on the same file at the same time, etc. Here's an example of revision control systems.

  • SCCS (Source Code Control System, 1972): Centralized
  • RCS (Revision Control System, 1982): Centralized
  • CVS (Concurrent Versioning System, 1990): Centralized
  • SVN (Subversion, 2000): Centralized
  • git (2005): Decentralized

Centralized version control has a single, authoritative server/repo. Everyone who checks out from the server just copies the files, with no local repo.

Decentralized version control means everyone has a clone of the server. Officially, there is no authoritative copy (although there is an agreed one).

# Debugging

  • GNU Debugger (gdb): A symbolic debugger for your program.
  • Valgrind: A dynamic analysis checker, ensuring that memory is properly allocated, initialized, and freed.

We use the GNU Debugger (gdb), for debugging. The GNU Debugger is a symbolic debugger, meaning you get to see and interact with the symbols associated with the memory addresses.

Since compilers normally don't store symbol information and other debugging info, you have to add that using the -g flag.

$ gcc -Wall -std=c99 -g filename.c -o filename
+$ gdb ./filename [args...]
+

## GDB Commands

These all have shortcuts and you can find more by running help in gdb.

  • break [procedureName]: Create breakpoint on procedure name.
  • break [lineNumber]: Create breakpoint on line number.
  • delete [breakpointNumber]: Delete breakpoint.
  • condition [breakpointNumber] [condition]: Make breakpoint conditional on condition.
  • set variable n = 25: Change the value of a variable.

### Inspecting Code

  • print [expression]: Print the value of the expression.
  • backtrace: Displace the stack trace.
  • up: Look at the variable values in the above stack trace (i.e. child).
  • down: Look at the variable values in the below stack trace (i.e. parent).
  • list: Look at source code surrounding current statement.
  • list [procedureName]: Look at code for procedure.

### Executing Code

  • run: Go! You can also do redirection.
  • continue: Go until next breakpoint.
  • next: Go to next statement.
  • step: Go to next statement, going into function calls.
  • until [lineNumber]: Run until you hit the line number.
  • finish: Go until the function exists.

## assert.h

Note: It is recommended to disable assertions in production code (by defining NDEBUG). It is recommended to not disable them during debugging and testing though. Normally, you write assert statements in your procedures to validate input.

C allows you to perform easy sanity checks using assert.h (such as bound checks). This provides an assert procedure, that asserts that some given boolean is true, otherwise is crashes the program and prints out information about the issue.

It is recommended that you include assert statements to catch errors during development and document assumptions. They can be trivially disabled during production compilation.

### Examples

A simple procedure with assert.

#include <assert.h>
+
+int f(int a, int b)
+{
+  assert( a != 0 && b > 0 );
+  ...
+}
+

Compiling.

# No debugging
+$ gcc -DNDEBUG -std=c99 -Wall ...
+# With debugging
+$ gcc -g -std=c99 -Wall ...
+

## Valgrind

Valgrind is a dynamic error detection tool. It runs your code in a VM using JIT compilation. It adds several error-checking instructions in your code. It can also use symbol information, so you should generally use -g to compile with symbolic debugging information.

Note: This causes significant overhead. 10-100x.

Valgrind has several tools, but you can only run one at a time.

By default, it uses memcheck, which checks for misuse of heap-allocated memory, out of bounds memory access for heap-allocated memory (not stack or static), and leaked memory (with --leak-check=full). There are options for this, such as --track-fds=yes that tracks file descriptors.

There's an experimental tool called exp-sgcheck that does static and global bounds checking. It uses heuristics and may return false positives and false negatives.

Note: Valgrind produces a lot of output. Most of it useful.

### Examples

# Compile your program with symbol information
+$ gcc -g -std=c99 –Wall program.c -o program
+
+# General usage
+$ valgrind valgrind-options ./program args
+
+# Example usage
+# You could --tool=toolname, but memcheck is
+# the default (and what we'll use)
+$ valgrind --leak-check=full ./program
+

## CPPCheck

CPPCheck (cppcheck) is a static analysis tool. It's not great, but it can catch un-obfuscated issues bound access.

# Types and Variables

## Standard/Fundamental Types

C has a fairly rich standard library of types, but it doesn't mandate much about actual sizes. That means the size is platform dependent. See limits.h for your platform's sizes.

We have integral values. For every type, there is a signed and unsigned version. By default things are signed.

  • long long: At least 64 bits or as large as long.
  • long: At least 64 bits or as large as int.
  • int: At least 32 bits or as large as short.
  • short: At least 16 bits or as large as char.
  • char: At least 8 bits.

We have real values.

  • long double: At least as large as double.
  • double: Double precision float.
  • float: Single precision float.

There's also a few "fake" or odd types.

  • _Bool: A "fake" type that is an integer underneath. Really, 0 is false (both integer and float) and anything else is true.
    • This has a strange name to preserve backwards compatibility.
    • If you include stdbool.h, you get the nice preprocessor constants of bool => _Bool, true => 1, and false => 0.
  • void: Nothing and anything.

## Making Variables

Variables have

  • Name: How the variable is accessed. Must be a legal identifier.
  • Type: How the contents of the variable's memory is organized (and thought about).
  • Scope: Where the variable can be used.
  • Storage Class: How the variable is stored and initialized.

C allows for variable shadowing. This just means you can declare a new variable of the same name in a narrower scope and you can only access the newer variable with the same name. This should generally be avoided.

## Literals

Literals are different from variables because they don't have a name, type, scope, or storage class (well, string literals have static storage).

The C compiler infers/coerces your literal to the type required.

Adjacent string literals are implicitly concatenated. This is most useful for multi-line strings.

### Integers

The compiler infers their type type by treating the number as the smallest type required to store the literal and then using its type promotion semantics.

You can specify the type of integers by appending

  • U for unsigned.
  • L for long.
  • LL for long long.

Integer literals that start with 0 are octal. Integer literals that start with 0x are hexadecimal.

### Floats

Floats are computerized scientific notation. They are split into a sign bit, mantissa, and exponent.

  • Sign Bit: A single bit at the beginning of a list
  • Mantissa: The value part of the number.
  • Exponent: Determines the order of magnitude.

Since, scientific notation mandates that the number before the decimal not be zero and binary is only 1s and 0s, we always know that floats start with a 0.

Unlike integers, floats cannot have overflow. However, they can have underflow. Since floats represent continuous fields as discrete values using "scientific notation", floats far from zero are fairly imprecise. This means that you can get "stuck" at certain high values because you cannot "jump past" the number, since they're so far apart.

### Strings

C is weird and annoying. A string is really just a null-terminated array of characters (i.e. unsigned bytes). Null terminated? Yeah, that just means that a \0 ends the array.

They can be encoded in any way but normally using ASCII or UTF-8 (or UTF-16 if you're Windows and hate yourself). Here we will use ASCII encoded strings.

Since strings are just arrays, you can iterate over them like arrays. However, you can also iterate over them using pointers until you reach a null character! IMO, this is more clear because it is more like a for each loop.

for (char *c = string; *c != '\0'; c++) {
+  // Using pointers. Means you can avoid array
+  // syntax.
+}
+for (int i = 0; string[i]; i++) {
+  // Using arrays, along with the null
+  // terminator (0) being falsey.
+}
+

## Type Promotion

In C, some integers are considered "more specific"/wider while others are "less specific"/narrower. Narrower numbers are automatically casted to the wider numbers. This is called type promotion and it follows the following graph.

Type Promotion Graph

Integers specifically have the concept of rank, which is basically the same thing as narrow vs wide. A int is a higher rank than a short. A int is the same rank as a int.

The following rules apply in the following order.

  1. A lower rank integer of a certain sign-ness is promoted to a higher rank integer of the same sign-ness.
  2. A lower rank unsigned integer is promoted to a higher rank signed integer (since they can fit). This occurs automatically when a same-rank signed and unsigned integer interact; they both get promoted to a higher rank signed.
  3. A same rank signed integer becomes a same rank unsigned integer if you can't promote them both.

These semantics are summed up by the following flow charts.

Integer Rank 1

Integer Rank 2

Integer Rank 3

## Operators

There's bunch of friends we get from Java, so I'll only cover the new ones.

The sizeof <TYPE> operator returns the number of bytes in a type. For integers, this is the special size_t type.

int bro = sizeof( int );
+

Since C has type promotion, you don't always need casting, but it helps the compiler and allows you to shrink types explicitly. You can always explicitly throw away values by casting to void.

// Convert long to short
+short a = (short) 123L;
+// Explicitly throw away return value
+(void) getchr();
+

# Standard Library

A great resource is http://www.cplusplus.com/.

## stdio.h

C uses streams for IO. A stream is just a stream of characters/bytes and is an abstraction of all input. There all three standard streams:

  • stdout (0): Normal, expected output.

  • stderr (2): Exceptional output.

  • stdin (1): Normal input.

  • int getchar(): Reads a single character from stdin as an int.

  • void putchr(int): Outputs a single character into stdout.

  • int printf(const *char, ...): Outputs a string into stdout using the format string followed by the arguments/values for the format specifers in the format string.

  • int scanf(const *char, ...): Outputs format string to stdout, pausing for input whenever it reaches an input specifier. It then tries to parse the input correctly and put it into the corresponding pointer in the arguments after the format string. The pointers are used in the order given. Returns number of successfully parsed values. This fails fast and matches greedily.

### File IO

stdio.h includes opaque FILE structs which are used to interact with file streams. These streams are only interacted with through procedures provided by stdio.h. The earlier standard streams are also provided as preprocessor macros that expand to specific FILE structs.

Most OSes limit the number of files a process can have. This is both practical and acts as a small stopgap for malpractice. In Linux, we can have 1024 open files (meaning Linux gives us 10 bits). In practice we can only have 1021 because of stdout, stderr, and stdin.

  • FILE *fopen(const char *filename, const char *mode): Returns a file pointer to the desired file.
  • int fclose(FILE *filestream): Closes the given file stream. This is important because file streams use buffering (aka caching) and the OS limits the number of files we can have.
  • int feof(FILE *stream): Returns true if EOF has been read by any file IO class. This is set by the reading functions.
    • You should generally not use this because it is error prone. Really, just think about what's happening.
  • int ferror(FILE *stream): Returns true if any operation on the file failed/errored. This is error is set whenever any operation fails. No future successful operations will overwrite this error flag.
  • void clearerr(FILE *stream): Clears the error flag from the file. Must be called manually, otherwise errors will never be cleared.
  • int fprintf(FILE *filestream, const char *format, ...): Like printf, except it prints into the given file stream.
  • int fscanf(FILE *filestream, const char *format, ...): Like scanf, except it scans from the given file stream.
  • int fgetc(FILE *stream): Like getchar but reads from the given file.
  • int getc(FILE *stream): Same as getc, but may be a macro.
  • int ungetc(int c, FILE *stream): Puts character c back onto the stream and clears the EOF flag. This works even for stdin.
    • You can't write EOF back.
    • This works because streams perform buffering. You can just write some values back to the buffer or scroll back the buffer one.
  • int put(FILE *stream): Same as putc, but may be a macro.
  • int fflush(FILE *stream): Flushes the buffer for the given file. All file IO in C is buffered by default. Returns EOF if failure and sets the error on the stream.
    • stdout normally flushes with new lines.
  • size_t fread(void *ptr, size_t size, size_t nmemb, FILE *stream): Read nmemb members, each with size size into the memory at ptr from file stream. Returns number of bytes read.
  • size_t fwrite(void *ptr, size_t size, size_t nmemb, FILE *stream): Same as fread except it writes to the file stream rather than reading.
  • int rewind(FILE *stream ): Restart the file pointer from the start.
    • If you're using this, you're probably doing something you shouldn't.
  • int fseek(FILE *stream, long offset, int whence): Seek to anywhere in the file. Offset can be positive or negative, depending on whence.
    • whence tells you with respect to what you're seeking. It can be:
      • SEEK_SET: Relative to start.
      • SEEK_CUR: Relative to current position.
      • SEEK_END: Relative to end of file.
    • This is best for binary data because text has inconsistent offsets cross platform, meaning it might "lie" to you.
  • long ftell(FILE *stream): Return current position in file from beginning.
  • int remove(const char *pathname): Remove file.
  • int rename(const char *old, const char *new): Rename file. Return EOF on failure.
  • FILE *mktemp(): Create temporary file.

#### Buffered File IO

Calls to the OS (required for writing/reading files) are costly, so C caches/buffers our desired input and output. When we fill up the buffer, we preform a single call to the OS. This is one reason why closing files is important. Closing a file flushes the buffer by preforming a call to the OS.

#### Binary File IO

You can open files in text mode or binary mode in C. On the common platform, they happen to be the same but this isn't generally true.

Text mode tries to hide some details of the file, such line termination. Meanwhile, binary mode gives you literally the bytes in the file.

#### Block File IO

Sometimes, reading character by character isn't very useful. We can instead read arbitrary blocks of binary data into any part of our program. This is useful for serialization and deserialization of arbitrary data types.

This can also provide a performance advantage.

#### File Open Modes

  • r: Read
  • rb: Read binary
  • wb: Write binary
  • w: Write
  • r+: Read and write
  • a: Append

## string.h

string.h is a standard library header file that provides useful procedures for using null-terminated strings:

  • int strlen(const char*): Get the number of characters in the string (excluding the null terminator).
    • Note: This should not be used for iteration, because it requires looping over the array multiple times.
  • char *strcpy(char *dest, const char* src): Copies the contents of src to dest, up to the first null character in src.
    • It is generally recommended not to use this.
    • Note: This does not check for dest being too small (because it can't), so you must assure this yourself (or use strncpy).
  • char *strncpy(char *dest, const char* src, int n): Copies the contents of src to dest, up to the first null character in src or the nth character in src, whichever comes first. This prevents overwriting memory.
    • If src is smaller than n, strncpy pads the rest of the characters with zero.
    • This does not put a null character at the end of the string if it runs out of space. To guarantee this, always set the last the last character in the buffer to null.
  • char *strcat(char *dest, const char *src): Appends the characters from src to dest (overwriting and replacing the null character on dest). This may write outside of the buffer and will not always put a null character on the end.
  • char *strncat(char *dest, const char *src, size_t n): Appends the characters from src to dest (overwriting and replacing the null character on dest), where the max length of dest is n. If appending the characters to dest would make it be longer than n, it stops and puts a null character at the end.
    • This always puts a null character at the end.
  • int strcmp(const char *s1, const char *s2): Compares s1 and s2 lexicographically.
    • Returns: < 0 when s1 < s2. 0 when s1 == s2. > 0 when s1 > s2.
  • int strncmp(const char *s1, const char *s2, size_t n): Compares s1 and s2 lexicographically, reading at most n characters from both strings.
    • This is only really useful when you don't have null terminate strings or you only want to compare the first few elements.
  • int sscanf(const char *str, const char *format, ...): Like scanf except reads from str as input. Unlike scanf and fscanf, this does not move the string forward (see str is const).
    • Has special format specifier %n. This writes a char *, holding the position where sscanf left.
  • int sprintf(char *str, const char *format, ...): Like printf except writes to str.
  • int snprintf(char *str, size_t size, const char *format, ...): Like sprintf except it writes at most size bytes including the null character to str. That is, size is the size of the string buffer.

We also have the following number parsing procedures. When these fail, they return 0, so they are not the best way to do this. Generally, you should prefer sscanf.

  • int atoi(const char*): Convert ASCII to integer.
  • float atoi(const char*): Convert ASCII to float.
  • double atoi(const char*): Convert ASCII to double.
  • long atol(const char*): Convert ASCII to long.

### Bounds Inconsistencies

Proceduren Behavior
strncpy()n is a number of characters to write padding with zeros if possible may not null terminate if there's no extra room.
strncmp()n is a maximum number of characters to compare will stop when we reach n, when there's a difference or either string ends (at null termination).
strncat()n is a maximum number of characters to append not counting the null terminator will always write a null terminator.
snprintf()n is a buffer capacity on the destination including the null terminator will always write a null terminator.

### scanf

Since we must manually allocate strings (using character arrays) in C and we are normally fairly lazy (very justifiably), we normally just allocate a large enough character array for usual input. For example,

// 100 will probably be enough, right? (No)
+char someString[100];
+scanf("%s", someString);
+

However, C does not bound check arrays, so scanf can and will write more characters than allowed to the array, if the user inputs more than expected. Using the previous example, if the user enters 100 characters, we'd be in trouble (because C adds null terminators, remember?).

To guard against this, we can provide scanf a length specifier.

char someString[100];
+// now we're safe!
+scanf("%99s", someString);
+

scanf also has some oddities with whitespace. Any whitespace in the specifier means gobble all whitespace possible.

// I won't match "2 + 2" but I will match "2+2"
+scanf("%d+%d", &a, &b);
+// I will match "2 + 2" and "2+2"
+scanf("%d + %d", &a, &b);
+

scanf also accept regex character classes, so that scanf only accepts things in that character class.

// I accept any upper case letters
+scanf("%[A-Z]", &string);
+// I accept anything but upper case letters
+scanf("%[^A-Z]", &string);
+

scanf allows us to capture but disregard things by placing a * after the %.

scanf("%*s %s", &onlyOneString);
+

### Memory Management

  • void* memcpy(void* dest, const void* src, size_t count): Copies count bytes from src to dest. Returns pointer to dest.
    • These must not overlap.
  • void *memmove(void *dest, const void *src, size_t n): Same as memcpy, but uses a small internal buffer to allow for overlapping regions.
  • void *memset(void *s, int c, size_t n): Set n bytes of memory from s to c.

## stdlib.h

stdlib.h is a giant trash can header file. Anything that doesn't fit well anywhere else gets thrown here.

### Random Numbers

C's random number generator is (generally) cryptographically secure, only if it has been securely seeded. By default, C's random number generator is not seeded at all.

  • int rand(): Generate random number from 0 to RAND_MAX.
  • RAND_MAX: Maximum number returned by rand.
  • void srand(unsigned int seed): Seed rand using the given seed. This must be done if you don't want the same numbers every time.
    • Normally, for non-cryptographic contexts, seeding it with the time is sufficient. Do this by doing void srand(time(NULL)).
      • time is in time.h.

### Environment Variables

C can really easily deal with environment variables (envar), but it can only do so locally to the program.

  • char *getenv(const char *varname): Get value of varname envar.
  • void setenv(const char *varname, const char *newValue, int overwrite): Set value of varname envar to the new value. Doesn't overwrite if overwrite is zero.

## stdarg.h

C implements variadic functions by providing a bunch of macros in stdarg.h. In C, your variadic function must take at least one non-variadic argument. You mark variadic arguments using ... as the last argument. The variadic arguments don't need to have a consistent type. C also does not store the type or length of the variadic arguments. Instead, you must essentially treat it like a state machine.

int printf(const char *fmt, ...);
+

To use variadic arguments, we must declare a va_list, and then use va_start(list) on it to initialize it. Then, we use va_arg(list, type), to try to extract a variable of the given type from the list. We then must call va_end(list) to end the list.

int addIntegers(int n, ...) {
+  va_list ap; // for argument pointer
+  va_start(ap, n);
+  int total = 0;
+  for (int i = 0; i < n; i++) {
+    total += va_arg(ap, int);
+  }
+  va_end(ap);
+  return total;
+}
+

### Knowing When to Stop

As mentioned earlier, C doesn't store the type or length of arguments. To handle this, you can accept some specifiers that you can count (e.g. how printf does it). You can use special final values (e.g. NULL). You can accept an argument specifying the number of arguments.

All of these are error prone and rely on you to trust the caller. Be prepared to fail.

## setjmp.h

setjmp.h is a way to implement exceptions using gotos that can jump across function boundaries (unlike C's normal gotos). However, it is more controlled because you can only jump back to a single marked location, and that marked location must handle different possibilities. It is debated on whether this is a good thing. It can be confusing and hard to track, but you choose! Sometimes it's good.

To use this, you first create a jmp_buf that stores your program's entire environment. You then switch on a setjmp, where each of the cases are the possible error codes. (Zero is the initial error code.) Then, the code in the zero case may call longjmp with an int code. This then jumps back to the setjmp where setjmp returns the given int code.

// May long jump
+int readValues(jmp_buf *eenv) {
+  int sum = 0;
+  int m, v;
+  while ((m = scanf("%d", &v)) == 1) {
+    sum += v;
+  }
+  if (m != EOF) {
+    longjmp(*eenv, 1);
+  }
+  return sum;
+}
+
+// Handles long jump
+int main() {
+  jmp_buf eenv;
+  if ( setjmp( eenv ) == 0 ) {
+    readValues(&eenv);
+  } else {
+    printf("Invalid input!\n");
+  }
+}
+

### Cleaning Up

In some cases, we may need to do cleanup of a function that may jump up. To handle this, we do a setjmp in that function and then, in the case of error, clean up and longjmp again. Yes, it's annoying, but welcome to long jump.

## errno.h

C handles errors by setting a "global int" called errno which is used to represent a bunch of different error conditions. It's not actually a global variable under the covers. It's a transparent preprocessor macro which has some special handling we won't get into.

Most errnos you will ever deal with are named, documented, and supported. Each errno has short messages describing then, which can be accessed through perror.

  • void perror(const char *s): Print an error message corresponding to the current error. Prefix it with s.
FILE *fp = fopen(“someFile.txt”, “r”);
+if (fp == NULL) {
+  perror(“someFile.txt”);
+  exit(1);
+}
+

## math.h

You have to tell the linker to search for a named library, if it isn't part of the standard C library. For math, you have to supply -lm at the end of the flags. This is because it is a linker flag (i.e. LDFLAGS), which must be put at the end of the command.

  • M_E: e.
  • M_PI: π.
  • M_SQRT2: 2.
  • sin(x): Sine in radians.
  • cos(x): Cosine in radians.
  • tan(x): Tangent in radians.
  • asin(x): Arcsine in radians.
  • acos(x): Arc-cosine in radians.
  • atan(x): Arctangent in radians.
  • atan2(y, x): Find angle θ that points from (0,0) to (x,y).
  • exp(x): ex.
  • exp2(x): 2x.
  • exp10(x): 10x.
  • log(x): ln(x).
  • log2(x): log2(x).
  • log10(x): log10(x).
  • pow(x, y): xy.
  • sqrt(x): x.
  • round(x): Nearest integer as double.
  • fabs(x): Absolute value.
  • floor(x): Floor.
  • ceil(x): Ceiling.
  • fmod(x, y): Floating point modulus.

# Memory Segmentation

Memory in C is segmented into the machine code, statically-allocated data, the heap, and the stack:

Memory Segmentation in C

An important note is that scope isn't the same as storage class. Storage class is an implementation/memory concept, while lifetime is a compiler/coding concept. So, for example, you can create static local variables. This isn't recommended though because it is confusing.

## Machine Code

The actual compiled procedures and statements that run your code.

## Static/Global Variables

Variables with static storage are initialized at start up (really at compile-time). If you don't initialize them, they have a zero value. If you do, they must be initialized to a constant expression.

Note: C isn't very smart with constant expressions. If a global variable A is set to a constant expression and global variable B is set to A. A is considered constant and B is not:

char globalC = 'a'; // Yes
+int globalI = 15 + (39 % 3); // Yes
+int globalJ = globalI + 1; // No
+

## Heap

Data from the heap is explicitly requested and is explicitly released.

## Stack

All local variables are initialized on the stack by default. Variables initialized on the stack must have a size known at compile-time. Otherwise, you must allocate it dynamically on the heap and store a reference/pointer to it.

# Pointers

In C, everything is passed by value. To get around always copying the data we care about, we use pointers and dereferencing. Creating diagrams where variable are nodes are your friend!

Pointers are simply memory addresses with a method of getting the value at that memory address. Really, pointers are to the start of a memory block and the type of the pointer determines the size of the block.

When declaring a pointer, the number of asterisks (*) describes how deep you have to go before you reach the given type. I personally think this is easiest to understand by postfixing the type with *, since it is distinct from dereferencing, but that isn't always standard.

int a; // just a int
+char *b; // pointer to a char
+float **c; // pointer to a pointer to a float
+

When using a declared pointer, you can use the dereference operator by prefixing the name by *. This says to follow the pointer to get the value of that memory address. (You technically could do this for any size_t, but that's unsafe and error-prone so C stops you.) This can be applied n times where n is the number of asterisks you used when declaring the pointer (i.e. how deep the pointer is).

When using any variable, you can use the address of operator by prefixing the name by &. This gets the address of the variable in memory. (You can't apply this multiple times because C doesn't implicitly declare a variable when using &, so there is no memory address to get for &&.)

Putting it all together.

int a = 5; // int 'a' with value 5.
+int *pa; // int pointer 'pa'.
+pa = &a; // make pa point to a.
+// Do the same but briefer
+int *pa = &a;
+
int a = 5; // int
+int *pa = &a; // int pointer
+int **ppa = &pa; // int double pointer
+
+*pa = **ppa + 1; // a = 6, *pa = 6, **ppa = 6
+

There also exists a special macro constant called NULL. This is just *0. This just means a pointer to memory address 0, which is either an invalid or protected segment of memory.

Wait a minute! You just said we can have pointers to invalid/protected segments of memory. We can also do pointer arithmetic to directly muck with pointers. Isn't this unsafe?

Yes! Trying to access an invalid segment of memory causes your OS to immediately terminate your program with a "segmentation fault". This is like the NullPointerException from Java except unrecoverable.

Note: Pointers in C do not follow type promotion semantics because they use type to determine how much memory they look at. For example, if you wanted to make a int* point to a char, the pointer would look for 4 bytes while the char only is 1 byte. (You can silence these with casting, but why would you want to?)

## Some Odd Syntax

It is important to realize that [] (arrays) have higher precedence than * when declaring. This means

// I am an array of 10 int pointers
+int *ap[ 10 ];
+// I think this is clearer here
+int* ap[10];
+

const is another type operator (like [] or *). This just says, don't let me change this value during it's lifetime. This has some non-obvious interactions with pointers. Most of the time, you'll just use const pointers to declare to users that you won't change the value.

// pointer to a const int
+int const * x = &a;
+// const pointer to a int
+int * const y = &b;
+// const pointer to a const int
+int const * const z = &c;
+

Hint: In general, you should read const and points backwards.

## Pointer Arithmetic

You can do integer arithmetic directly on pointers. When you add a number n to a pointer p, you're actually shifting the pointer over by n times the sizeof(*p). For example

// These are all play examples
+short *a = 0;
+a + 1; // shifts a over 2 bytes
+int *b = 0;
+b + 1; // shifts b over 4 bytes
+

Using this, you can really easily see that array notation is really syntactic sugar for pointer arithmetic, which means you can use array notation for any pointer! So,

int i;
+int a[10];
+a[i] == *(a + i);
+

Weirdly, this means you can also swap the array and the index because addition is commutative.

int i;
+int a[10];
+i[a] == a[i];
+

Why do we use arrays at all then? Well, static arrays have stronger type checking (can't change their length) and sizeof returns the number of bytes in the static array, rather than the number of bytes in the pointer.

## Pointer Iteration

You can use pointers to iterate over collections. This is generally more performant as you don't have to do integer arithmetic and incrementation every loop. Just incrementation.

However, this is generally pretty overkill because integer arithmetic is very cheap, and the compiler is very good. It also is a little harder to think about, so it's not recommended unless you have a good reason to do so.

int a[] = { 1, 4, 9, 16, 25 };
+int len = sizeof( a ) / sizeof( a[ 0 ] );
+// This points right after the array. This is
+// okay as long as we don't dereference it
+int *end = a + len;
+int sum = 0;
+for ( int *p = a; p < end; p++ ) {
+  sum += *p;
+}
+return sum;
+

## Void Pointers

Sometimes, you're lazy or can't know about what your pointer points to. To handle this, we use void pointers, which are just memory addresses that can point to anything. We receive void pointers from malloc, which we'll get later.

void *ptr; // We now have a void pointer
+

# Dynamic Allocation

For the stack, you must know how much memory you want to allocate at compile time so that the compiler will know where to put things without overwriting them. The stack also has limited size. As you can see, the stack is limited.

If you want more memory or to dynamically allocate your memory. You need to use the heap. However, you have to (mostly) manually manage this memory using malloc (memory allocate) and free (release allocated memory back to OS).

When you use malloc, you as for a certain number of bytes of memory and you will receive a pointer to the first address. If there is no memory, it returns NULL. When you use free, you simply provide the address to the first address you received from malloc. free knows how much memory to release because malloc and free track the memory used.

malloc and free are declared in stdlib.h with the following signature:

// stdlib.h
+// returns memory address
+void *malloc(size_t size);
+// returns `addr` to system allocator
+void free(void *addr);
+

A common usage of dynamic allocation is for large or variable length arrays. This is useful when you don't have enough space, can't know at compile time, or can't be bothered to make it known at compile time. For example,

#include <stdlib.h>
+// Allocate a dynamic array for 1000 integers
+// how they like to do it
+int *list = (int *) malloc(1000 * sizeof(int));
+// how I like to do it
+int *list = malloc(1000 * sizeof(*list));
+

## Dynamic Allocation Hazards

Dynamic allocation has a lot of issues. Taken together, we call these issues memory safety issues.

  • Segmentation Faults: We forget to check that malloc returns null. Your program will just crash.
  • Buffer Overflow: We try to write outside of our memory bounds. This may cause invalidation of important memory or cause you to read invalid memory.
  • Memory Leak: We forget to use free in certain cases. This causes your program to keep using more and more memory until you crash. You also get performance issues.
  • Mistaken frees: You free memory you didn't malloc.
  • Multiple frees: You free memory multiple times. You might invalidate memory management data structures. May allow that memory to be malloc'd twice.
  • Dangling Pointer / Use After free: You try to access memory after you free it. You'll either get garbage, old invalid data, or malicious code. Really hard to debug.
    • Set the given pointer to NULL to avoid! Then you just crash.

## Dynamic Allocation Benefits

Yes, dynamic allocation is more expensive, since you must call the OS. It's also hard to work with.

However, it does have benefits. You can store pointers to valid memory across multiple procedure calls. You can allocate larger things. You can allocate things not known at compile time.

A great usage of this is resizing arrays. This is basically the same as Java. You create some initial array. Then you can add, remove, and access things in it. When you run out of space, you create a new array that's larger, you copy everything from your old array into it, you update your pointer to point into the new memory, and then you free the old memory. It's a good idea to double the length of the array each time, because this gives us an amortized cost of O(1), since malloc is slow.

## Move and Copy

C has some convenience methods that allow you to more easily copy arbitrary memory:

  • void *memcpy(void *dest, void const *src, size_t n): Copy n bytes from src to dest, keeping them both.
  • void *memmove(void *dest, void const *src, size_t n): Copy n bytes from src to dest, freeing src.
    • A little more expensive than memcpy.
  • void *realloc(void *ptr, size_t size): Changes the size of the allocated memory address to the given size. It returns the address of the reallocated block.
    • When growing the array, it increases the size in place, if possible. If it can't, it finds where the memory can be allocated and then copies and moves everything over.
    • When shrinking the array, it decreases the size in place, discarding the data that doesn't fit.
    • You should always use the value it returns. Don't assume it will be the same.

# Managing Larger Projects

In C, to use variables and functions from other files, you must declare the variable and function prototype for the compiler to allow you to use the values. The linker will link the declarations in the object (*.o) files into a single executable.

To declare a variable without allocating it, you must use extern when declaring the variable.

// There exists some global named x. I don't
+// know where, but it's there and I want it.
+extern int x;
+

To declare a function, you just declare the function prototype.

// There exists some global procedure named f. I
+// don't know where, but it's there and I want
+// it.
+int f( x );
+

However, every file that uses these globals and functions declared in some file (say stuff.c) must have these exact same declarations to access parts of stuff.c. Manually declaring these dependencies is brittle and annoying. This lead us to header files and the #include preprocessor directive.

## Header Files

Header files are C files that contain only declarations of procedures and globals. Each source file (*.c) that exports some procedures or globals declares them in its corresponding header file (*.h). Users then #include the header files from the libraries they want to use.

How do these work? Well, #include just pastes the contents of the included file. This gives you the declarations of the header file, allowing you to use the declared items. When you compile the source file (*.c) into an object file (*.o), you have these external declarations that must (or at least should) be defined. Then, when you go to produce the executable, the linker takes your object file along with the object file (*.o) for your library, links the declarations in your object file to the definition/implementations in the library. It then produces an executable.

Note: It is a good practice for a source file to include its own header file. This detects disagreements with declaration and implementation and won't compile if there is one.

The linker then takes the object

If you put static in front of a global variable or procedure definition, you get internal linkage, meaning others can't use it.

# Compile main.c into main.o but don't link it.
+$ gcc -c main.c
+

# Goto

Goto is now considered bad, unsafe, and abstract-breaking. However, this is how machine code does branching, so we'll cover how C does it.

Any statement in C can be labeled with a label on its own line like so

label_name:
+printf("%s", "bro");
+
+// more code...
+
+goto label_name;
+

However, C does have a slightly muzzled goto. You can't goto another label in another procedure/function. You can, however, go to inner and outer code blocks.

# Side Effects

Side effects are just when some procedure modifies or manipulates a piece of data directly. This affects the caller sometimes in unexpected ways.

This a common source of bugs and is very difficult to fix efficiently in C. Commonly, the solution is just RTFM, which isn't great.

Side effects are hard to reason about because they are hard to notice and are strongly affected by performance and sequence points. Sequence points are essentially just where C finishes a statement. These are the following: ;, ,, &&, ||, ?.

# Procedure Evaluation

The C compiler matches the called procedure's name and its actual parameters with the formal parameters of the procedure.

  • Actual Parameters: Types of arguments passed in before types are promoted.

  • Formal Parameters: Types of parameters the procedure expects.

Procedures in C can only return one value, like Java. This is sad, but we get around it by taking in pointers which we fill with values normally.

## Procedure Declaration

We can declare functions, which helps the C compiler be aware of what procedures we have. This is a core part of a header file! (which we haven't gotten to yet). Function declarations look like the following:

// Declaration. Variable names are optional, but
+// good for documentation.
+int expunge( float x, long y );
+
+// Definition.
+int expunge( float x, long y )
+{
+  // do things
+}
+

## Variadic Procedure

You can also have variadic arguments via a few special procedures. A variadic function looks something like the following:

void printFloats( int n, ... );
+

We'll get more into this later.

## Performance Considerations

It is (somewhat) important to note that procedure calls aren't free (duh!). We have to transfer control to another procedure, by saving the parameters, allocating variables on the stack for the procedure, save the return address, jump to the procedure's address, do the things, clear the stack, and jump back to the caller.

In Java, we have procedures (there, methods) check for the validity of their arguments and complain when they are invalid. This is normally a fantastic idea; however, this does add additional overhead on calling procedures. If we want a performance boost, when can declare that the procedure shall have undefined behavior for invalid values and thus place the onus of validation on the caller. This is normally a bad idea, since they aren't that expensive and can remove a whole class of errors.

# Arrays

C arrays are syntactically similar to Java.

## Allocation

However, in C arrays are either allocated statically or dynamically. Statically allocated arrays must have a constant expression for their length (known at compile time) and because they are allocated on the stack. Dynamically allocated arrays can have a length only known at runtime, but must be allocated on the heap. (We store a pointer to the first element in the array.)

// Declare and allocate an array of length 10
+int a[10];
+// Declare and allocate an array of length 10.
+// Initialize array to zero.
+int a[10] = {};
+// Declare and allocate array and partially
+// initialize it.
+int a[10] = {1, 2, 3};
+// Declare and allocate an array large enough to
+// fit the given data.
+int a[] = {1, 2, 3};
+// Declare and allocate an array large enough to
+// fit the given data. Giving indexes. Elements
+// unspecified are zeroed.
+int a[] = {[3] = 1, 2, [6] = 3};
+// {0, 0, 0, 1, 2, 0, 3}
+

In Java, all arrays are dynamically allocated on the heap, but Java manages it behind the scenes.

## Multi-Dimensional Arrays

For multi-dimensional arrays, C uses the same syntax as Java.

// Declare and allocate 2D array with 3 rows and
+// 4 columns.
+int table[3][4];
+// Declare and allocate 2D array with 3 rows and
+// 4 columns. Initialize to zero.
+int table[3][4] = {};
+// Declare and allocate 2D array with 3 rows and
+// 4 columns. Initialize values.
+int table[3][4] = {
+  {0, 1, 4, 9},
+  {16, 25, 36, 49},
+  {64, 81, 100, 121 }
+};
+// Declare and allocate 2D array with 3 rows and
+// 4 columns. Partially initialize values. All
+// other values initialized to zero.
+int table[3][4] = {
+  {0, 1},
+  {16, 25, 36, 49},
+  {64}
+};
+// We also have the special indexing
+// initialization.
+

C can only infer the size of the outermost array. It cannot for any inner array. It does this because then you would have arrays to pointers, which we'd then have to individually initialize. This syntax is supposed to create a local block of memory. Having an array of pointers to another arrays would not be local. This isn't what what we'd expect, so we don't do it.

For some reason, C can only infer the size of the outer array. I haven't quite figured out why it doesn't take the max of the inferred size of the inner arrays. Maybe it's error prone?

C arranges multi-dimensional arrays in row-major order. Essentially, it arranges everything as a string, where the outer dimension is more significant than the inner. (This is only for statically allocated arrays!)

This method of memory allocation makes indexing faster. In Java, we have an array on the heap of pointers to other arrays on the heap.

### Unspecified Lengths

In C, you can have unspecified lengths for outer arrays, but you must have the length for the inner array, if you're initializing this. We'll get into this more in [Arrays are Just Pointers]. However, suffice it to say

### Limitations

Since the stack is only so, we can't create HUGE arrays on the stack (e.g. int[1000000]). To normal workaround is to either use the heap or to use a static lifetime array, so the compiler properly plans ahead.

## Variable Length Arrays

C99 began to allow for variable length arrays on the stack.

TODO: Write more.

## Arrays are Just Pointers

In C, arrays are just pointers with nice syntax for creating and pointer arithmetic. This is easiest to see with procedure parameters (e.g. int test[]). We don't know the size of the array because it's just a pointer!

Since we don't know the size of the array, we can't safely iterate over it. To account for this, we normally take length as a parameter.

Note: This requires us to trust the caller. This is another security issue.

### Inner Dimensions

You may be confused why we declare the inner dimension of an array in procedures. We don't strictly need to (Java doesn't), but this allows us to have faster, smaller, more local memory. The reason it allows this is because it means C doesn't make your array an array of pointers to arrays, but instead an array of statically allocated arrays.

This may be initially confusing, but realize that array syntax is just syntactic sugar for pointer syntax.

// array syntax
+void foo(int array[][3]);
+// pointer syntax, equivalent
+void foo(int (*array)[3]);
+

Now you should be able to more easily see that we need to know what our pointer points to. If we had int array[][], we'd really just have a double pointer (e.g. int **array). That is, we'd have an array that pointed to other arrays.

Sometimes this is what you want, sometimes not.

## Bounds Checking

Unlike almost every other language, C has no bounds checks for array access.

This basically means you can write or read memory on accident. This is called buffer overflows.

Sadly, bugs like this normally fail at some future point and cause security issues. Exploits using array bound checking issues are called stack smashing exploits. There are several static analysis tools (clang, fortify, etc.)

Worst case, these bugs arise as segmentation faults (trying to access memory forbidden by OS). Sometimes you also get a bus error.

# Function Pointers

Realize that procedures/functions are really just the address of the first instruction in the procedure. This means we can pass them around and call them! We just need some (type) semantics to make sure the compiler know what to do with args and to be (somewhat) safe.

Procedures/functions have a type based off of their parameters and their return value.

## Syntax

C has some pretty garbage syntax for function pointers IMO. This comes from it not having a function keyword.

Here's a quick breakdown of the syntax.

// Declare a variable called foo which is a
+// pointer to a function that takes in a pointer
+// to a character and returns an integer.
+int (*foo)(char*);
+
+// Declare a function that takes in a function
+// which takes a character and returns an
+// integer.
+void someFunc(int (*)(char*));
+
+// Declare an array of function pointers. Call
+// this array testList
+bool (*testList[10]) (int);
+

When we assign function pointers, we're technically supposed to use the & address of operator. And then, when we apply them, we should dereference them (*). For example,

int (*funcPtr)() = &func;
+// Apply it
+(*funcPtr)();
+

However, this is pretty garbage syntax for something that is unambiguous, since we can't do arithmetic on function pointers. Therefore, C allows us to not use those operators and instead do this:

int (*funcPtr)() = func;
+// Apply it
+funcPtr();
+

## Why?

Well, first off, it allows for basic, low level first class functions, which is rad. More practically, it allows for the strategy pattern, the chain of command pattern, and callbacks.

The strategy pattern is where we have a common function that takes a specific function that changes its behavior. Imagine we have a function that plays a game and takes in a strategy, which is itself a function. This allows for easier modification and more code reuse.

The chain of command pattern is where we apply a series of functions, taking the first successful output.

# Struct

Structs are what has made C last so long.

A struct is just a collection of heterogeneously typed, named fields stored contiguously. We access the field of a struct a using a.fieldName struct. We access the field of a struct pointer aPtr using aPtr->fieldName.

Structs have unspecified order within the struct. This is so that we can make platform-specific optimizations. For example, most architectures have some sort of "alignment" for their data (e.g. 2-byte alignment, 4-byte alignment). Data that is aligned is faster to access. Data that is not aligned is slower to access.

Poorly Aligned Struct, using given order

Well Aligned Struct, overriding given order

## Semantics

Like everything in C, structs are passed by value and allocated on the stack. However, you can have enormous structs. Therefore, we normally work with pointers to structs!

When working with struct *s you have the choice of using * with . to deference and get fields, or the nicer -> syntax (see [Pointers to Structs]).

When returning structs within procedures, you must be careful. If you return it by value, that might be slow but you'll be safe. If you return a pointer, make sure you won't get a dangling pointer (i.e. make sure that you malloc the struct and later free it in the caller).

## Syntax

### Named Structs

// Declare a struct
+struct StructName {
+  type name;
+  ...
+};
+
+// Declare example struct
+struct Person {
+  char name[ 12 ];
+  double height;
+  int age;
+};
+
+
+// Declare an uninitialized person struct
+struct Person p1;
+// Initialize the struct
+p1.height = 1.75;
+p1.age = 24;
+// Note that we can't do p1.name = "William"
+// because p1.name is an array and not a pointer
+strcpy(p1.name, "William");
+
+// Declare and initialize a struct
+struct Person p2 = { "William", 1.85, 27 };
+
+// More explicit initialization syntax
+struct Person p3 = {
+  .age = 33,
+  .name = "Agatha",
+  .height = 1.7
+};
+

### Anonymous Structs

We can declare anonymous structs by just not giving them a name. These are useful for global structs (like singletons) or one-time use structs. No other struct has the same type.

// Declare anonymous struct with an instance
+// named varName
+typedef struct {
+  type name;
+  ...
+} varName;
+
+// Typedef a struct. Basically assign the
+// anonymous struct type to the given. This is
+// hotly debated. I generally don't typedef
+// structs, but it doesn't matter much to me.
+typedef struct {
+  int foo;
+  char bar;
+} Example;
+

### Pointers to Structs

Since structs are passed by value, like everything in C, and structs can get large, we like to deal with struct *s. This means, to get a field on the struct *, we must first dereference it (duh). This looks like

// readStruct returns a pointer to an malloc'd
+// struct. We won't free that here.
+struct Person *p1 = readStruct();
+printf("%s\n", (*p1).name);
+

However, this gets really ugly with nested pointers, nested structs, and even basic things like this. Therefore, we invented -> syntax, which is just * and . combined. The above would like like

// readStruct returns a pointer to an malloc'd
+// struct. We won't free that here.
+struct Person *p1 = readStruct();
+printf("%s\n", p1->name);
+

# Typedef

Typedef is used by the compiler to create aliases for types (not actually defining new types!).

When to use typedef is debated. Generally, you should only do it when you have a good reason to. Otherwise, it can add more cognitive load to people keeping track of what your types are.

Note: A typedef only applies after the line on which the typedef occurred, for some reason.

## Syntax

// General Syntax. For types such as arrays, the
+// name must be mixed with the type because C
+// has annoying syntax.
+typedef TYPE IDENTIFIER;
+
+// "Complex" basic type. Generally not
+// recommended.
+typedef char Table[NUM_ROWS][NUM_COLS];
+
+// Pointer type. Strongly advised against.
+typedef char *str;
+
+// Anonymous enum.
+typedef enum { NAME1, NAME2 } ExampleEnum;
+
+// Anonymous struct.
+typedef struct {
+  int field1,
+  char field2,
+} ExampleStruct;
+
+// Function. Strongly recommended.
+typedef void *mallocLike(size_t size);
+

## Recommendations

First off, you should generally not use typedef a bunch. It is very weak in C because you can use the original type and the aliases type interchangeably, so it doesn't add much type safety. It also doesn't allow for any behaviors (like associated methods in Go). Additionally, people don't expect to see several typedefs in C code.

You should never typedef a pointer type. This adds an incredibly amount of cognitive load, since whether or not a value is a pointer changes both the semantics and the syntax of the type. For example, people could pass their type to a procedure and expect it to be passed by value (because it says it is), but then the procedure mutates their variable.

There are two strong cases for using typedef. When you have compiler flags which you want to change the types (using #ifdef) and when you have a complex, completely opaque type to the consumer (opaque means the user does not interact with it directly).

Using specific types is normally not necessary unless you have had issues with a specific architecture (don't do premature optimization!). If you do a typedef, then you only have one #ifdef, like

#ifdef SOME_PREPROCESSOR
+typedef Something uint16_t
+#else
+typedef Something uint32_t
+#endif
+

An example of a completely opaque type is FILE, where you only interact with it through accessor/mutator procedures. This simplifies the client code and allows you more flexibility with modifying the type.

// We declare the following anonymous struct to
+// have the name OpaqueStruct This means you can
+// use the type as OpaqueStruct instead of
+// struct OpaqueStruct.
+typedef struct {
+  int field1,
+  char field2,
+} OpaqueStruct;
+

# Data Structures

There are two main ways to keep data organized. You can either keep it all in one place (i.e. arrays and structs), or you can use links/pointers (i.e. linked data structures).

Linked List

Here's a quick comparison of the benefits two

  • Contiguous Memory:
    • Can use (pointer) arithmetic to quickly and randomly access any data.
    • Very simple for fixed-size data.
  • Linked Memory:
    • Easier to grow and add stuff to.
    • Doesn't require large, contiguous section of memory.
    • Are more intuitive for certain data structures (e.g. graphs)

## Linked List Example

// Create a struct with a useful short name and
+// long name
+typedef struct NodeStruct {
+  int value;
+  // We must use struct NodeStruct, because the
+  // typedef only applies after the typedef in
+  // the file
+  struct NodeStruct *next;
+} Node;
+
+Node *head = malloc(sizeof(Node));
+*head = (Node) {
+  .value = 1;
+  .next = NULL;
+}
+
+// Simple traversal, relying on next being NULL
+// at the end of the list and NULL being falsey
+for ( Node *n = head; n; n = n->next ) {
+  printf( "%d ", n->value );
+}
+printf( "\n" );
+

## Simple Object Orientation

In C, object orientation is achieved by having procedures that take the first parameter as a pointer to your type. Then, the procedure mutates it as you wish.

Note: This is actually how object orientation works for most languages. In fact, Some languages, such as Go, Rust, and Python, don't even hide this. Their method syntax is explicitly just syntactic sugar around this core feature. I prefer this way!

For example, suppose you have a type T and a procedure f. If you want f to mutate a variable of type T, have it accept T* as its first parameter. That is f(T*, ...).

Concretely,

// Use Node from earlier
+typedef struct {
+  Node *head;
+} List;
+
+void addValue(List *list, int val)
+{
+  Node *n = (Node *)malloc( sizeof( Node ) );
+  n->value = val;
+  n->next = list->head;
+  list->head = n;
+}
+

## Memory Management of Linked Structures

With linked structures, since we're doing dynamic allocation, you must be very careful that you don't leave anything dangling.

// Freeing a list iteratively
+while (head) {
+  Node *next = head->next;
+  free(head);
+  head = next;
+}
+
+// Freeing a list recursively
+void freeNode(Node *n) {
+  if (n->next) {
+    freeNode(n->next);
+  }
+  free(n);
+}
+

## Adding and Removing in Linked Lists

In Java, we had to do the really annoying special cases for removing at the front. However, because C allows us to use pointers more easily, we can get rid of that special case by "taking a step back" and using a pointer the current node we're on. We can then just mutate the thing we're pointing to.

You already know this and there's a great Computerphile video about it, so I won't talk to much about it.

https://www.youtube.com/watch?v=t5NszbIerYc

# Advanced Object Orientation

OOP in C is difficult, hard to read, hard to maintain, and overall not idiomatic. However, for educational purposes, it is good to see how object orientation can be / is done at a low level. We'll only talk about inheritance, constructors, destructors, methods, and single dispatch.

Inheritance is the hardest of these.

## Inheritance

For inheritance, C's type system actively fights us. To make it work, we can do multiple things. We can either have our subtyped struct have an instance of the superclass struct as the first element (bad) or we could have our subtype struct declare the same fields in the same order (worse).

Here, we'll only cover how to do single inheritance because multiple inheritance is very difficult because you need to do address manipulation.

For the safe-ish method, the way you use the subtype is by casting it to the supertype. Since C will put the first field at the start of the struct, when you cast it you still have a valid address. This also means you can upcast in the future as long as you're using pointers and not passing things by value.

For the unsafe method, the way you use the subtype is by casting it to the supertype and hope that the you remembered to declare the fields in the correct order and the compiler left them in the same order. Otherwise its the same.

## Constructors

Constructors are just procedures which dynamically

# Handling Binary Data

Sadly, C99 has no way of reading in binary, printing out binary, or writing binary literals.

## Little/Big Endianness

Differ architectures use differ byte orders for memory. This is because computer engineers disagree on which is better, because there's not much of a difference.

Little endian machines put the least significant byte first. Big endian machines put the most significant byte first; this is the way people normally write it.

int a = 3;
+// Little Endian: 03 00 00 00
+// Big Endian: 00 00 00 03
+

## Binary/Bitwise Operators

In C, there are many operators that operate on bits. All of the binary operators have equivalent assignment operators as you'd expect.

  • Bitwise OR x | y: 0b10 | 0b01 is 0b11.
    • Logical OR ||.
  • Bitwise AND x & y: 0b10 & 0b01 is 0b00.
    • Logical AND &&.
  • Bitwise NOT ~x: ~0b10 is 0b01.
    • Logical NOT !.
  • Bitwise XOR ^x: 0b110 ^ 0b100 is 0b010.
  • Left Shift x << n: Shifts the bits left by n, putting 0s in for the "walk off". 0b110 << 1 is 0b100.
  • Right Logical Shift x >> n: Shifts the bits right by n, putting 0s in for the "walk off". 0b011 >> 1 is 0b001. Applies only to unsigned integers.
  • Right Arithmetic Shift x >> n: Same as right logical shift, except that the "walk off" (on the left) is replaced with the sign bit. Applies only to signed integers.

0x1A < 5

## Bit Masking

Sometimes, we only care about certain bits. To get at these bits, we apply a mask. A mask is just a number with specific bits flipped based off of what you care about.

By ANDing the mask with the bits of interest, we keep only the bits that were 1 in the original bits, making everything else 0. This is called clearing selected bits.

// Clear bits 0 and 2
+bits = 0b0110
+mask = 0b1010
+bits & mask // 0b0010
+

By ORing the mask with the bits of interest, we keep only the bits that were 0 in the original bits, making everything else 1. This is called setting selected bits.

// Set bits 3 and 1
+bits = 0b0110
+mask = 0b1010
+bits | mask // 0b1110
+

By XORing the mask with the bits of interest, we invert all the bits of interest.

// Invert bits 3 and 1
+bits = 0b0110
+mask = 0b1010
+bits ^ mask // 0b1100
+

We can copy bit ranges by creating a mask of 1s with that range. We then AND the source with the mask, AND the destination with the inverse of the mask, and then OR those together.

Copying Bits

## Bit Fields / Packing

We can pack multiple smaller integers inside of a large integer by using masks and bit shifting for modification and access. This allows for less memory use at the cost of runtime (normally), since memory access that isn't along address boundaries is less efficient on most CPUs.

Integer Packing

You really shouldn't do this by hand if you do it at all. It's very easy to make mistakes and it makes simple operations much more tedious.

If you're going to do this, we can make the compiler handle this by using bit fields in structs. This makes the compiler handle all the shifting nonsense required for field access and modification. It also handles when the number of bit fields is longer than a single integer.

typedef struct {
+  unsigned short red;
+  unsigned short green;
+  unsigned char blue;
+  unsigned char alpha;
+} RegularColor;
+sizeof(RegularColor); // 6
+
+typedef struct {
+  unsigned short red : 9;
+  unsigned short green : 9;
+  unsigned char blue : 6;
+  unsigned char alpha : 6;
+} PackedColor;
+sizeof(PackedColor); // 4
+

In general, these act exactly like normal fields. However, you cannot access the address of the values, since they may not line up along address boundaries.

Note: This is generally a bad idea and unnecessary on most modern systems, since memory is cheap and its not very portable.

## 2's Complement

There's a fantastic video about this. This explains 2's complement in decimal.

We normally use 2's complement, rather than 1's complement. This is because 1's complement has a complicated "end around borrow" concept and a negative 0.

# Object Oriented / Component Design

Changing header files is expensive because that requires recompiling the client code and the library code. If we just change the library file, then we only need to recompile the library code, which is faster.

For that reason, you want your header file to be as minimal as possible, only making a library promise without exposing unnecessary implementation details. There are a few ways to do this.

## Abstract/Hidden Object

We completely hide the object in question. The library maintains a static singleton instance that isn't exposed in the header. The client can only interact with this library code using procedures which interact with this singleton instance behind the scenes. This is like project 3's wordlist!

This is generally okay, but it only allows us to have a single instance, so it's very inflexible.

## Incomplete Type / Abstract Data Type

In the header file, we can declare that certain types/structs exist without providing any fields on them. This means that clients can know that the library provides such objects, but can't see any of their fields. In other words, these objects are opaque to the client.

// Incomplete types in header
+typedef struct Node Node;
+
// Specific implementations in source
+typedef struct Node {
+  // Here we're storing any generic data using a
+  // void pointer and a size
+  size_t size;
+  void *data;
+  struct Node *next;
+}
+

This is a lot like how Java and other traditional object oriented languages work. However, they make it easier to use procedures that mutate the object by using method notation, which attaches the procedure to the namespace of a specific object. They also do a bunch of fancy single dispatch, polymorphism, inheritance, and all that jazz.

Note: This is an excellent trade off because it doesn't make either the library or the client code more complicated, but it does make the library significantly more flexible.

### Generic Abstract Data Types

Many times, we want a certain object to work with an entire family of objects. (You want containers to work with any contained data.) C has the garbage, OG way of doing this. To do this in C, you store a raw pointer and the number of bytes associated with that piece of data. Then, client code must provide the type either through function pointers that manipulate that data or using casting whenever they want to pull something out of the object.

Here's a complete example that is a set implemented using an unordered linked list.

#include "set.h"
+
+// An inner component of our actual data type,
+// Set
+struct Node {
+  void *val;
+  struct Node *next;
+};
+
+typedef bool eq_fn(void const *v1,
+                   void const *v2);
+
+// This is our actual data type this file deals
+// with
+typedef struct SetStruct {
+  // I can store any data, but I must know their
+  // size and how to compare the data
+  size_t vsize;
+  eq_fn same;
+  struct Node *head;
+} Set;
+
+Set *makeSet(size_t vsize, eq_fn same) {
+  Set *s = malloc(sizeof(Set)) ;
+  s->head = NULL;
+  s->vsize = vsize;
+  s->same = same;
+  return s;
+}
+

Note: This makes both the library and the client code more complicated with the benefit that it makes the library more flexible. This is generally seen as a reasonable fair trade off as it doesn't make the client code significantly more complicated, although it does make the library code significantly more complicated.

# Security & Safety

C has no training wheels. This makes it very powerful and efficient. However, it also makes it easy to introduce bugs and security exploits.

## Resource Leak

If you malloc something and return it in one path but not another, make sure that you free it in the other path.

/**
+  Read an entire block of data from fp.
+  @return Pointer to the block on success, or
+  NULL on failure
+*/
+char *getBlock( FILE *fp ) {
+  char *buf = (char *)malloc( BLOCK_SZ );
+  if (!buf) {
+    // Don't need to friend here.
+    return NULL;
+  }
+  if ( fread( buf, 1, BLOCK_SZ, fp )
+       != BLOCK_SZ ) {
+    free(buf); // MAKE SURE TO FREE HERE!!!
+    return NULL;
+  }
+  return buf;
+}
+

Likewise with file pointers.

bool getFile( char *name, int cap,
+              char *buffer ) {
+  FILE *fp = fopen( name, "r" );
+  if ( !fp ) {
+    return false;
+  }
+  int len = fread( buffer, 1, cap, fp );
+  fclose(fp); // MAKE SURE NOT TO FORGET HERE
+  return len > 0;
+}
+

## Input Validation

When you do input validation, it's better to whitelist rather than blacklist. Also, should you try to avoid taking in user input and pasting that into some sort of "eval" function.

The best way to validate inputs is by using an open-source library that validates and escapes things immediately.

C has a int system(const char*) procedure, that allows us to just run the given string as if it were a shell command, and returns its return code. You should never use this because it's slow and insecure. If you use it, make sure to completely and totally validate all input.

# Enums

C enums allow us to avoid using preprocessor macros. This lets us have more sophisticated scope rules.

C also automatically determines the optimal integer type for the enum in terms of size and speed.

// Simple enum
+enum Color { RED, GREEN, BLUE };
+enum Color c = RED;
+
+// Enum with specified values
+enum Mood {
+  HAPPY = 2,
+  AFRAID,
+  BORED = 0,
+  BLUE,
+  GLAD,
+};
+enum Mood m = HAPPY;
+

There are a few limits on enums. You can't have two enums in the same scope with the same value. Also, enums are literally just integers, so you can add them, use them as booleans, increment them, and all that nonsense. They are also printed as integers.

enum Color { red, green, blue };
+ // This won't work because `blue` is reused.
+enum Mood { happy, sad, blue };
+
+enum Mood m = happy;
+m++; // m == sad
+

## Enum Hack

Since enums are constant expressions and respect scope, we can use them as compile time constants if we're using a common name (e.g. SIZE).

// Okay, but doesn't respect scope
+#define SIZE 100
+struct Contact {
+  char name[ SIZE ];
+  char email[ SIZE ];
+};
+
+// Does respect scope, but a little hacky
+struct Contact {
+  enum { SIZE = 100 };
+  char name[ SIZE ];
+  char email[ SIZE ];
+}
+

# Unions

# Odd Keywords

C normally makes optimizations such as storing values to the register and not rereading memory. This is good because it's more performant. However, sometimes (e.g. when doing concurrency), that value might have changed. We use the volatile keyword to tell C to not do optimizations for this value.

# Testing & Profiling

Profiling is the process of figuring out what your program is spending its time and resources doing. You know what testing and coverage is.

## Test Coverage

In this class, we use gcov (GNU Coverage tool) to get test coverage. This requires we enable some features on compilation. -fprofile-arcs tracks branch coverage. -ftest-coverage tracks statement coverage.

## Profiling

In this class, we use gprof (GNU Profiler tool) to profile things.

## DIY Optimizations

Generally, you should not do these DIY code optimizations if they hurt readability. Most compilers are optimizing and will do this for you. A few exceptions are inlining simple functions, passing by const reference, and putting the most common conditions first.

# C++

We'll learning C++11. It has the following features.

  • Namespaces
  • Classes and objects.
  • Destructors.
  • Operate overloading.
  • Move Semantics: How to safely describe memory changes / ownership.
  • constexpr: Evaluate arbitrary expressions at compile time.
  • Range Based For Loops: Iterators.
  • Lambda Expressions.
  • Lambda Captures: Strongly documented closures.
  • nullptr: Essentially renamed NULL.
  • Templates: Allows you to define how to build a function given some arbitrary compile time values. Created for compile time generics.
    • Can be used for many other things.
  • C backwards compatibility.

Here's an overview of the terminology that differs from Java's terminology.

  • Base Class: Super(most) class.
  • Derived Class: Subclass.

## Hello World!

Notice how we use the bitshift operators? That's standard in C++! We overload the stream with nice-looking operators to give use new, easier syntax.

// So we get access to std::cout
+#include <iostream>
+
+int main() {
+  // Put the folowing string to the std::cout
+  // stream. std::cout is buffered stdout.
+  std::cout << "Hello, World!\n";
+
+  // Alternatively, use std::endl, the platform
+  // specific line terminator.
+  std::count << "Hello, World!" << std::endl;
+  // std::flush tells the buffered output to
+  // flush manually.
+  std::count << "Hello, World!" << '\n'
+    << std::flush;
+
+  // Generally, you shouldn't use std::endl or
+  // std::flush because generally the OS knows
+  // better when it should flush the buffer than
+  // you.
+}
+

## Namespaces

Namespace extensions

C++ defaults to searching in the current namespace (including any namespaces you're using). If it can't find the name you're looking for, then that's an error.

C++ has the scope resolution operation: ::. You put this after a namespace to get a name within the namespace.

int val = 3;
+void f() {
+  // Prints 3
+  std::cout << val;
+}
+
+namespace MyNamespace {
+  int val = -10;
+  void f() {
+    std::cout << "val: " << val << "\n";
+    std::cout << "global: " << ::val << "\n";
+  }
+}
+
+// ...
+
+// Call global f
+f();
+// Call f in MyNamespace
+MyNamespace::f();
+

## Using C Libraries

We can use C libraries easily in C++. The only difference is that they are in the std namespace and their header files get a makeover. Remove the .h and prepend the name with a c. We use namespaces because they're nice.

// Import stdio.h from C
+#include <cstdio>
+
+// Like a * import from other languages. Import
+// everything from std namespace into our
+// namespace. Use with care! (Or not at all.)
+using namespace std;
+
+int main() {
+  printf("Hello, within C!\n");
+}
+

## File IO

File IO is done using input streams (istreams) and output streams (ostreams). Specifically, it's done with a specialization of both of these streams, fstreams.

## RAII (Resource Acquisition Is Initialization)

RAII is a standard idiom in programming. It essentially says that all resources should have a constructor and destructor. The constructor is called at resource acquisition time. C++ itself automatically calls the destructor whenever your object goes out of scope. It guarantees that it calls this in all possible paths, even if your program crashes. You can manually call the destructor.

This is sometimes called SBRM (Scope Based Resource Management). It's the same thing.

This pattern means we don't need to worry about a lot of resources. For example, we don't need to close files when we're done with them. (Although it's not a bad idea.)

## References and Move Semantics

References are a safe abstraction around pointers that allows for additional optimizations, because we're guaranteed by the compiler the pointers are known to be identical.

Syntactically, we treat it as if we had the value itself. Essentially, it's just an alias for the other value. This means we can also assign to returned references, which is really cool.

// Takes a reference to a and b
+void swap(int &a, int &b) {
+  // notice how we're not dereferencing. It
+  // calls int's copy constructor
+  int tmp = a;
+  a = b;
+  b = temp;
+}
+
int &a = some[complicated]->object.thing;
+// ...
+cout << a << std::endl;
+a = 12;
+
int &lookup( char *name ) {
+  ...;
+}
+
+// ...
+
+// Assigning from reference
+int x = lookup( "mary" );
+// Assigning to reference
+lookup( "bob" ) = 35;
+
+// Notice how there's no pointer syntax!
+

## Templates

We want to define our functions to work with abstract data. How do we do that? In C++, we use templates!

Templates are compile time feature, where the compiler figures out all the different versions of your template you call and compile them all as separate functions.

## Default Parameters

The syntax is almost exactly what you think it would be!

void repeat(char const *str = "Good Evening",
+            int count = 10) {
+  for (int i = 0; i < count; i++) {
+    std::cout << str;
+  }
+}
+

## String Class

Strings are mutable character buffers wrapped in objects. You can treat them like primitives and they use copy semantics.

They also have array indexing overloaded, so you can treat them like char arrays!

string a = "123";
+string b = "xyz";
+string c;
+// copies a to c
+c = a;
+// makes c a copy of a and b concatenated
+c = a + b;
+
+// Compares the contents of a and b
+if (a == b) {
+  cout << "Hi!";
+}
+

### String IO

You can use streams (as earlier), but there's also a few helpful functions.

  • getline(istream &is, string &str): Reads a line from is into str, dynamically resizing str as necessary.

### String Methods

  • string substr(int pos, int len): Create a substring of len characters, starting at pos by copying the characters.
  • size_t find(string &str): Return starting index of the first occurrence of str. Returns string::npos if no matches are found.
  • insert(int pos, string &str): Insert str at position pos, displacing all characters on the right.
  • erase(int pos, int len): Remove len characters starting at pos, shifting all characters on the right.
  • char *c_str(): Return the underlying char array for the string.

## Standard Template Library (STL)

The standard template library in C++ is the standard library's collection framework. It's pretty big, so we won't cover them all.

### Vector

Vector is the simplest and most used container. It is in the <vector> header. It is like an ArrayList in Java, a resizable array of generic elements.

You can use the following to initialize vectors.

vector<int> iList( 10 );
+vector<short> sList( 20, -1 );
+

Vectors have the traditional mutation methods

Vectors support deep copying, just use simple a assignment.

### Iterators

C++11 has a for each loop.

// Value iteration. Generally lame.
+for (int v : container) {
+  count << v << endl;
+}
+// Reference iteration. Only do if you need
+// mutability.
+for (int &v : container) {
+  count << v << endl;
+}
+// Const reference iteration. Use most of the
+// time.
+for (const int &v : container) {
+  count << v << endl;
+}
+

## Memory Management

Like the malloc and free procedures in C, we have new and delete in C++.

## Classes and Structs

In C++, classes and structs are identical except that for classes, the default access is private, structs, the default access is public. Generally, however, we use structs just to be blobs of data and classes for, well, classes.

C++ has a lot of energy dedicated to making classes good. Here are a bunch of special member functions.

### Constructors

They are responsible to assigning values to the fields to the class. The memory for the object is already allocated by the time it runs.

class Person {
+  string name;
+  int age;
+
+  public:
+  Person(string name, int age) {
+    // Use the implicit this reference
+    // (generally preferred)
+    this->name = name;
+    // Use the scope resolution operator
+    Person::age = age;
+  }
+
+  ...;
+};
+

### Default Constructor

The default constructor is a parameterless constructor that gets call automatically when you allocate the object. This is important to assign the fields to their start / null values.

class SomeClass {
+public:
+  SomeClass() {
+    std::cout << "Hi!" << std::endl;
+  }
+}
+
+// calls default constructor
+SomeClass c;
+// calls default constructor
+SomeClass *cp = new SomeClass;
+// calls default constructor 5 times
+SomeClass c[5];
+

### Copy Constructor

The copy constructor is used whenever you pass an object by value (whether passing it to a function or assigning it to something else).

class List {
+public:
+  // other is what you want to copy. This must
+  // be a reference because otherwise you'd have
+  // to call the copy constructor to call the
+  // copy constructor.
+  List(const List &other) {
+    Node **ptr = &head;
+    for (Node *n = other.head; n; n = n->next) {
+      *ptr = new Node;
+      (*ptr)->val = n->val;
+      ptr = &((*ptr)->next);
+    }
+    // terminate the list
+    *ptr = NULL;
+  }
+};
+
+// Example usage
+List alist;
+alist.push(2);
+// Calls copy constructor
+List blist = alist;
+alist.push(3);
+alist.size() == 2;
+blist.size() == 3;
+

### Destructor

Destructors are called automatically when the object goes out of scope (allocated on the stack) or when delete is called manually. C++ will default to having a destructor that does nothing. This is not okay for objects that dynamically allocate things.

### Operator Overloading

All operator's are overloaded by defining a operatorSYMBOL member function. They only must accept a certain number of arguments, but their types are returns are not mandated.

They can be member functions or not.

### Suppressing Value Semantics (and others)

TODO:

It uses = delete after declaring the method.

### Friendship

If you want to access private elements of a class (or something) in a certain function defined outside of the class, you must declare it a friend, otherwise they cannot access the private elements.

In the following example, since we want ostream to be the left hand side, we must declare the overloaded operator as a non-member function. Since this wants to access a private member of List, this must be a friend.

class List {
+  // Allows this function's definition to access
+  // its private parts.
+  friend ostream &
+  operator<<(ostream &output, const List &lst);
+};
+
+// If you didn't declare this a friend earlier,
+// then this could not access lst.head.
+ostream &operator<<(ostream &output,
+                    const List &lst) {
+  for (List::Node *n = lst.head; n;
+       n = n->next) {
+    output << n->val << " ";
+  }
+  return output;
+}
+

## Headers in C++

In C++, it's a good idea to declare all public classes in a header file, for the same reason we do in C. This does require we use a different syntax for implementing because we have namespaces.

class List {
+  struct Node {
+    int val;
+    Node *next;
+  };
+  Node *head;
+public:
+  // It's not my job to declare this
+  static int x;
+
+  List();
+  List( const List & );
+  ~List();
+  ...;
+}
+
// list.c
+#include <iostream>
+
+#include "list.h"
+
+using namespace std;
+
+static int List::x = 5;
+
+List::List() {
+  head = NULL;
+}
+
+// Implementing copy constructor, destructor,
+// etc.
+

## Throwing

In C++, we can throw anything! We have the exact same try-catch system.

int f(int val) {
+  if (val <= 0) {
+    throw 42;
+  }
+  if ( val % 3 != 0 ) {
+    throw "That value isn't divisible by 3";
+  }
+  return val / 3;
+}
+
+// Calling code
+try {
+  int result = f( val );
+  cout << result << endl;
+} catch ( const char *str ) {
+  cout << "Error: " << str << endl;
+} catch ( int code ) {
+  cout << "Internal Error: " << code << endl;
+}
+

## Inheritance

We'll only cover public inheritance. You can look up private (and protected) inheritance.

As you know, the main reason to do inheritance is for abstraction (not code reuse!).

### Virtual Methods

Virtual functions are the way you tell the compiler you'd like to use single dispatch for that function.

### Const Methods

Const methods are member functions that are not allowed to mutate the object. You can only call const methods on const objects. You can call both const methods and non-const methods on non-const objects.

class EmailContact : public Contact {
+  char *email;
+public:
+  ...;
+  void print() const override {
+    // Print our name and our email.
+    cout << getName() << " " << email << endl;
+  }
+};
+
\ No newline at end of file diff --git a/notes/ncsu/2f/csc230/integer_packing.png b/notes/ncsu/2f/csc230/integer_packing.png new file mode 100644 index 0000000..593f538 Binary files /dev/null and b/notes/ncsu/2f/csc230/integer_packing.png differ diff --git a/notes/ncsu/2f/csc230/integer_rank1.png b/notes/ncsu/2f/csc230/integer_rank1.png new file mode 100644 index 0000000..1c55d6f Binary files /dev/null and b/notes/ncsu/2f/csc230/integer_rank1.png differ diff --git a/notes/ncsu/2f/csc230/integer_rank2.png b/notes/ncsu/2f/csc230/integer_rank2.png new file mode 100644 index 0000000..3a0ccf3 Binary files /dev/null and b/notes/ncsu/2f/csc230/integer_rank2.png differ diff --git a/notes/ncsu/2f/csc230/integer_rank3.png b/notes/ncsu/2f/csc230/integer_rank3.png new file mode 100644 index 0000000..de90d17 Binary files /dev/null and b/notes/ncsu/2f/csc230/integer_rank3.png differ diff --git a/notes/ncsu/2f/csc230/left_shift.png b/notes/ncsu/2f/csc230/left_shift.png new file mode 100644 index 0000000..c32db61 Binary files /dev/null and b/notes/ncsu/2f/csc230/left_shift.png differ diff --git a/notes/ncsu/2f/csc230/linked_list.png b/notes/ncsu/2f/csc230/linked_list.png new file mode 100644 index 0000000..380d7aa Binary files /dev/null and b/notes/ncsu/2f/csc230/linked_list.png differ diff --git a/notes/ncsu/2f/csc230/memory_segmentation.png b/notes/ncsu/2f/csc230/memory_segmentation.png new file mode 100644 index 0000000..68c7ee1 Binary files /dev/null and b/notes/ncsu/2f/csc230/memory_segmentation.png differ diff --git a/notes/ncsu/2f/csc230/misaligned_struct.png b/notes/ncsu/2f/csc230/misaligned_struct.png new file mode 100644 index 0000000..e4365be Binary files /dev/null and b/notes/ncsu/2f/csc230/misaligned_struct.png differ diff --git a/notes/ncsu/2f/csc230/type_promotion.png b/notes/ncsu/2f/csc230/type_promotion.png new file mode 100644 index 0000000..12cef29 Binary files /dev/null and b/notes/ncsu/2f/csc230/type_promotion.png differ diff --git a/notes/ncsu/2f/csc316/2_4_tree.png b/notes/ncsu/2f/csc316/2_4_tree.png new file mode 100644 index 0000000..61cea9e Binary files /dev/null and b/notes/ncsu/2f/csc316/2_4_tree.png differ diff --git a/notes/ncsu/2f/csc316/avl_h_derivation.png b/notes/ncsu/2f/csc316/avl_h_derivation.png new file mode 100644 index 0000000..b5e5741 Binary files /dev/null and b/notes/ncsu/2f/csc316/avl_h_derivation.png differ diff --git a/notes/ncsu/2f/csc316/balanced_bst.png b/notes/ncsu/2f/csc316/balanced_bst.png new file mode 100644 index 0000000..611d5fb Binary files /dev/null and b/notes/ncsu/2f/csc316/balanced_bst.png differ diff --git a/notes/ncsu/2f/csc316/balanced_quicksort.png b/notes/ncsu/2f/csc316/balanced_quicksort.png new file mode 100644 index 0000000..b1312ba Binary files /dev/null and b/notes/ncsu/2f/csc316/balanced_quicksort.png differ diff --git a/notes/ncsu/2f/csc316/bst_rotation.png b/notes/ncsu/2f/csc316/bst_rotation.png new file mode 100644 index 0000000..65e01a4 Binary files /dev/null and b/notes/ncsu/2f/csc316/bst_rotation.png differ diff --git a/notes/ncsu/2f/csc316/circular_array.png b/notes/ncsu/2f/csc316/circular_array.png new file mode 100644 index 0000000..60502d8 Binary files /dev/null and b/notes/ncsu/2f/csc316/circular_array.png differ diff --git a/notes/ncsu/2f/csc316/complete_binary_tree.png b/notes/ncsu/2f/csc316/complete_binary_tree.png new file mode 100644 index 0000000..6637e73 Binary files /dev/null and b/notes/ncsu/2f/csc316/complete_binary_tree.png differ diff --git a/notes/ncsu/2f/csc316/euler_tour.png b/notes/ncsu/2f/csc316/euler_tour.png new file mode 100644 index 0000000..ef5dc11 Binary files /dev/null and b/notes/ncsu/2f/csc316/euler_tour.png differ diff --git a/notes/ncsu/2f/csc316/golden_ratio_n_1.png b/notes/ncsu/2f/csc316/golden_ratio_n_1.png new file mode 100644 index 0000000..8fa9436 Binary files /dev/null and b/notes/ncsu/2f/csc316/golden_ratio_n_1.png differ diff --git a/notes/ncsu/2f/csc316/golden_ratio_n_2.png b/notes/ncsu/2f/csc316/golden_ratio_n_2.png new file mode 100644 index 0000000..958e9c6 Binary files /dev/null and b/notes/ncsu/2f/csc316/golden_ratio_n_2.png differ diff --git a/notes/ncsu/2f/csc316/golden_ratio_n_3.png b/notes/ncsu/2f/csc316/golden_ratio_n_3.png new file mode 100644 index 0000000..19ecd43 Binary files /dev/null and b/notes/ncsu/2f/csc316/golden_ratio_n_3.png differ diff --git a/notes/ncsu/2f/csc316/hash_table_coalesced_chaining.png b/notes/ncsu/2f/csc316/hash_table_coalesced_chaining.png new file mode 100644 index 0000000..8d12064 Binary files /dev/null and b/notes/ncsu/2f/csc316/hash_table_coalesced_chaining.png differ diff --git a/notes/ncsu/2f/csc316/hash_table_coalesced_chaining_cellar.png b/notes/ncsu/2f/csc316/hash_table_coalesced_chaining_cellar.png new file mode 100644 index 0000000..c8d2eab Binary files /dev/null and b/notes/ncsu/2f/csc316/hash_table_coalesced_chaining_cellar.png differ diff --git a/notes/ncsu/2f/csc316/hash_table_separate_chaining.png b/notes/ncsu/2f/csc316/hash_table_separate_chaining.png new file mode 100644 index 0000000..ca71909 Binary files /dev/null and b/notes/ncsu/2f/csc316/hash_table_separate_chaining.png differ diff --git a/notes/ncsu/2f/csc316/heap.png b/notes/ncsu/2f/csc316/heap.png new file mode 100644 index 0000000..223e28d Binary files /dev/null and b/notes/ncsu/2f/csc316/heap.png differ diff --git a/notes/ncsu/2f/csc316/heap_array.png b/notes/ncsu/2f/csc316/heap_array.png new file mode 100644 index 0000000..29c1bbb Binary files /dev/null and b/notes/ncsu/2f/csc316/heap_array.png differ diff --git a/notes/ncsu/2f/csc316/imbalanced_quicksort.png b/notes/ncsu/2f/csc316/imbalanced_quicksort.png new file mode 100644 index 0000000..96ee8b6 Binary files /dev/null and b/notes/ncsu/2f/csc316/imbalanced_quicksort.png differ diff --git a/notes/ncsu/2f/csc316/index.html b/notes/ncsu/2f/csc316/index.html new file mode 100644 index 0000000..f77e940 --- /dev/null +++ b/notes/ncsu/2f/csc316/index.html @@ -0,0 +1,67 @@ +Eli | CSC 316: Data Structures & Algorithms

CSC 316: Data Structures & Algorithms

Instructor: Dr. Jason King | Semester: Fall 2019

Table of Contents

# Terms

  • Problem: Question to answer.
  • Problem Specification: Specific description of problem parameters and solutions.
  • Parameters: The specific, current input to a problem. Parts of a problem that can change without changing the fundamental nature of the problem.
  • Solution: Description of the properties needed for the algorithm to have. Or, The actual solving algorithm.
  • Algorithm: A general, finite solution to a problem. Normally specified in pseudocode. Good algorithms are efficient, adaptable, and easy to implement.
    • Greedy Algorithm: Algorithm that tries to minimize/maximize as early as possible.
    • Brute Force Algorithm: Algorithm that just tries every possibility.
  • Pseudo-Code: A human-focused, informal, language-agnostic piece of pseudo-code.
  • Abstract Data Type: A way to model a data type using the possible operations that can be done on it. Like an interface/protocol!
  • Data Structure: Systematic way of organizing and accessing data. Abstract, but impact how computer memory is organized.
    • Deterministic Data Structures: Data structures where the same actions always produces the same results.
    • Probabilistic Data Structures: Data structures where the same actions do not always produces the same results.
  • Theory of Algorithms: Designing and analyzing computational procedures.
  • Complexity Theory: Classifying problems based on their runtime/difficulty. Sometimes proving you can't have an efficient implementation.

# Runtime Analysis

In this class, we just do theoretical analysis because real life is messy. Actual runtime depends on specific parameters of problem instance, what else was running on hardware, how program was written, language of program, how program was compiled, etc.

In this class, if you have multiple parameters for the asymptotic efficiency, specify them.

## Operational Analysis

Operational analysis analyzes the asymptotic growth rate of a single operation. There are the following asymptotic growth rates:

  • Big-Oh: Upper bound.
    • f∈O(g)⟺∃c,n0∋∀n>n0f(n)≤g(n).
  • Big-Omega: Lower bound.
    • f∈Ω(g)⟺∃c,n0∋∀n>n0f(n)≥g(n).
  • Big-Theta: Family or tight upper bound.
    • f∈(O(f)∩Ω(f)).

We use theoretical analysis of program runtime using arbitrary timestamps, characterizing algorithm runtime by the size of input. Why? So we can abstract our analysis to any software and hardware combo.

We use the RAM model of a computer. In the RAM model, our machine has a CPU, where all simple operations take a consistent constant time, and an arbitrary amount of RAM, where all accesses take a constant time.

Since doing a full blown analysis to get the proper function is painful, we normally do a fuzzy analysis to just get the Big-Oh class. This is done by looking at the "essential operation" (i.e. the operation we care about).

Since not all programs are a sequential list of instructions and instead branch, we take the branch that will cause more essential operations.

### Limit Test

If f(n) and g(n) are monotone increasing and positive, then, where result is limn→∞(f(n)g(n)),

  • result=0⟹f∈O(g). (i.e. g(n) grows faster.)
  • 0<result<∞⟹f∈Θ(g). (i.e. f(n) and g(n) grow at the same rate.)
  • result=∞⟹f∈Ω(g). (i.e. f(n) grows faster.)

## Amortized Analysis

Amortized analysis exists because operational analysis can be "too pessimistic". Amortized analysis attempts to analyze the average case of an algorithm in a formal way.

Note: You can only analyze average cost over a *series of operations.

The word "amortized" comes initially from business, where an amortized cost is a cost whose cost "decreases" due to saving money in the long term. Think of education.

  • Aggregate Cost: Total cost of a series of operations.
    • T(n) is aggregate cost for a sequence of n operations.
  • Amortized Cost: Average cost over a series of operations.
    • T(n)n is amortized cost. This is just the average cost!
    • You use this when you occasionally do a heavy operation that will make future operations faster (e.g. growing an array based list).

We still use our good old asymptotic growth rate friend (e.g. big-oh, big-omega, big-theta). This means T(n)=n2+n⟹T(n)∈O(n2)∧T(n)n∈O(n).

Note: In this class, we are fairly fuzzy on the difference between aggregate cost and amortized cost. Sometimes we call them both amortized cost.

### Example

Let's see why we double lists (doubling strategy) instead of adding some constant (incremental strategy).

First, we analyze the incremental strategy.

We grow times ⌊n−1c⌋, where n is number of elements to add and c is how many elements we grow by.

T(n)=(c+1)+...+((n−1)c+1) =c∑i=1n−1i+n =c((n−1)n2)+n =c(n2−n2)+n.

This gives use T(n) ∈ O(n2), so the amortized cost T(n)n ∈ O(n).

We have shown the amortized cost is O(n).

Now, we analyze the doubling strategy.

We grow where 2c=n⟹c=log2(n) times, where n is number of elements to add (to an empty list). c is the number of times we've grown the list.

T(n)=1+(1+1)+...+(2c−1+2c−1)

Note: We add the second number to account for how many additions we can do after we grow the list before we grow it again. =1+2∑i=0c−12 =1+2(20−2c1−2) =1+2(2c−1) =2∗2c−1 =2∗2log2(n)−1 =2n−1. T(n)∈O(n). T(n)/n=2−1/n∈O(1).

## Experimental Analysis

You have to use the same hardware and software set up with little influence from other programs, temperature, etc. You must document your hardware.

This is beneficial in showing bad implementation problems.

### Graphing

When we make graphs, we use a log-log plot so it's easier to see polynomial growth rates, as they are transformed into lines. You can use whatever you want to graph things. R, Matlab, Excel, Google Sheets, etc.

y=axk. log(y)=klog(x)+log(a). Y=log(y). X=log(x). ∴Y=kX+log(a).

To find the runtime of our graph, we plot a normalized collection of lines. We then make the lines intersect at a point by finding a∋f(n)=ag(n) where g(n) is our normalized graph and f(n) is our actual runtime. We do this by choosing an arbitrary n and doing a=f(n)g(n).

## Analysis in This Class

In this class, we use the following set of steps to analyze an algorithm:

  1. Write an algorithm using pseudo-code, only using our ADT methods.
  2. Choose/identify your data structure implementations. If they are not specified, choose the most efficient one. Otherwise, use what they say.
  3. Analyze the algorithm.

# Algorithm Design

There are a few common designs:

  • Exhaustive Search: Examine all possibilities.
  • Divide and Conquer: Solve some original problem by decomposing it into smaller/easier problems and solving them recursively.
  • Greedy Approach: Optimize as early as possible.
  • Dynamic Problem: Solve small problems first and then save partial results and reuse them later in the larger problem.

# Pseudo-Code

We use a semi-standardized pseudo-code because we want to have an easy, common language to avoid regrade requests and complaints.

## Algorithm

Algorithm nameOfAlgorithm(param1, param2, ...)
+  Input
+    param1, description of param1, including
+      variables derived from / attached to
+      param1.
+    param2, ...
+  Output
+    Description of output
+
+  steps...
+

## For Loops

Arithmetic Iteration:

# start and end are inclusive
+for i <- 1 to n-1 do
+  if i = 2 then
+    i <- 3
+  print(i)
+

Collection Iteration:

# iteration through collection
+for each elem in List do
+  print(elem)
+

## If-Else

# start and end are inclusive
+if i = 2 then
+  print(i)
+else
+  print("Oh no")
+

# Iterative Algorithms

TODO: Integrate this with [Algorithm Analysis]

## Sorting Algorithms

Sorting algorithms can have the following properties:

  • Stable: Elements with the same key are sorted in the order they originally appeared.

### Comparison Based

Sort by making comparisons between pairs of elements. Analyze as number of comparisons. Normally efficient on small data sets with data that is almost sorted.

  • Bogo Sort: While the list isn't in order, shuffle the list.
    • O(???): Has unbounded running time.
  • Bubble Sort: Compare pairs of adjacent elements. If they are not in order, swap them. Repeat until no swaps are needed.
    • O(n2): Because you loop through the list n times. The worst case is a reversed list, when you have to reverse everything.
  • Insertion Sort: Split your list into two conceptual parts. The front is the sorted part and has no elements. The rest is the unsorted part. Take the first part of the unsorted part and insert it into the correct location of the sorted part.
    • O(n2): The worst scenario is when the list is in reversed order, since you have to do the maximum number of insertions each time. When this is the case, you have to do the familiar n+(n−1)+(n−2)+..., since you have to do n swaps at first, then n−1 swaps, etc. Another way of doing this, difficult to find of this fuzzy worst case, is to find the worst case scenario for each loop.
  • Selection Sort: Split your list into two conceptual parts. The front is the sorted part and has no elements. The rest is the unsorted part. Find the smallest value in the unsorted part and select it to go at the end of the sorted part.
    • O(n2): You have to make n comparisons to find the first min. Then you have to make n−1, then n−2, ...

### Non-Comparison Based

Makes no direct comparisons between elements.

#### Counting Sort / Pigeonhole Sort

You count the number of instances of each key, putting the counts into another list with the counts ordered by key. You then take the cumsum of the sorted keys to find the ranges for each key. You then go through the list, finding the index using the key of the element to get the cumsummed count. You decrement the cumsummed count so you don't overwrite anything.

This is O(n+k) where n is number of elements in list and k is the range of the elements.

If you go through the list backwards, it is stable. Otherwise, it is unstable. However, here, we always go through the list forwards to differentiate it from radix sort, eve though they're basically identical.

#### Radix Sort

First, some names: N is the radix, B is a list of N buckets. w is the word size of integers (number of digits in things being sorted).

Basically, this is counting sort where you only consider a single digit at a time, slowly going through all digits. The counting sort version must be stable (processing the list in reverse).

This has O(wn) runtime because you are essentially running counting sort (O(n+k)) w times with a constant k.

You normally should go from least significant digit (LSD) to most significant digit (MSD), otherwise you will have less significant digit's overriding more significant digits.

Note: You could go from MSD to LSD, but then you must only sort within the digit buckets. You could do this in parallel though!

#### Heap Sort

In heap sort, you take advantage of the heap property, where the smallest element is always on top of the heap (for a min heap). Basically, you just insert all the elements you want to sort into a heap. Then, you remove everything from the heap and it's in sorted order because of the magic of heaps!

## Recursive Algorithms

Recursive algorithms are quite simply a base case and a recursive case. A base case is a special case for some certain (normally small) input. A recursive case is a general case that breaks the current case into (normally smaller) case(s) and calls itself.

You can find which case is the recursive case by finding all paths that call the algorithm again. Vice versa for the base case.

Because recursion, our T(n) function is also recursive. It again is set up into a base case and recursive case, specifically by input size.

T(n)=g(n);n≤d T(n)=aT(b)+f(n);n>d

  • g(n) is the number of essential operations (a.k.a. the runtime) of the base case.
  • f(n) is the number of essential operations (a.k.a. the runtime) of the recursive case.
  • d is the input size of the base case.
  • a is the number of recursive calls in the recursive case.
  • b is the new input size to a recursive call.

In this class, we look for T(n) (i.e. the actual runtime equation), not O(n).

### Analyzing

In CSC 216, we tried to find a closed-form (i.e. non-recursive form) by unfolding the recursive algorithm until we spotted a pattern. We then use this pattern to construct our closed-form solution. Do not simplify when creating the pattern.

Here, we will use a tree/levels method.

### Sorting Algorithms

Here, we only cover comparison based recursive sorting algorithms.

Again, because we're using comparison based algorithms, our essential operation is a comparison.

#### Merge Sort

Merge sort works by splitting up a list of elements into two halves, left and right. It then sorts those halves and merges them. If merge sort sees an empty list or a list with a single element, it declares it trivially sorted.

You already know the runtime is O(nlog(n)). Let's derive it! (On paper).

TODO: Add my paper notes to this.

#### Quick Sort

First, we pick a pivot. (There are many strategies!) Then, we create 3 lists: L (less than pivot), E (equal to pivot), G (greater than pivot). We then sort L and G. Then we concatenate L, E, G.

Quick sort produces imbalanced trees due to the selection of pivot. It is vital to have an effective pivot selection

Imbalanced Pivot

Balanced Pivot

As you can see intuitively, and we can theoretically prove, it is much more efficient to select the median (or near the median) of the element.

In face, picking the worst (min or max) each time is O(n2), while picking the best (median) each time is O(nlog(n)).

There are a few ways to pick a pivot:

  • Simple: Just pick the left or right.
  • Randomized: Pick a random pivot.
  • Heuristic: Pick the median of left, right, and middle. (Or some other elements!)

### Types of Recursion

There are a few types of recursion.

  • Tail Recursion: The final call is a recursive call to itself.
  • General Recursion: The final call is not a recursive call.

Tail recursion, outside of being epic, can be trivially converted into being iterative. This is good for efficiency because it means you don't have to store the last stack frame and can instead just replace your current stack frame with the new stack frame. This is called tail call optimization and doesn't just apply to tail recursion. Essentially, this just means you switch to a loop where your tail call becomes assigning the new values.

General recursion is much harder to convert to an iterative. Whenever you do a recursive call, you must put your current frame onto a stack (hence stack frame!), and then pop it out once you regain control flow.

As you can imagine, since tail recursion doesn't need a stack to store the context of every parent's call, it is vastly more memory and runtime efficient.

However, not every compiler performs tail call optimization because there can be other design considerations. For example, the JVM does not natively perform tail call optimization so it can properly report stack frames during an exception.

Note: You should probably keep your algorithm recursive because you get some extra guarantees on your algorithm (immutability safety). It also is often easier to understand.

# Indexed Lists

## Array Based / Contiguous Memory List

Array based lists are a solid chunk of memory, where adjacent in list means adjacent in memory. There are a few types:

  • Static Array-Based List: A array list with a constant size that can't grow.
    • Issues: You can waste memory if you allocate too much. You're screwed if you don't have enough space.
  • Dynamic Array-Based List: A array list that can copy itself into a new memory location to grow.
    • Issues: Sometimes you have to grow the array (O(n)!). The array doesn't shrink most of the time. Not actually that great for highly dynamic arrays, since they'll have to grow repeatedly.

How do we analyze the cost of adding to the end of an array based list? It's technically O(n) because you have to grow the array sometimes, but that's super pessimistic. So instead we use amortized cost to more properly represent the average case.

## Linked / Linked-Memory List

Elements can be scattered anywhere in memory. Each element keeps track of its value and then a pointer to the next value.

The way we navigate the list is by keeping track of a special head element and then following the pointers the appropriate number of times.

There are a few big families:

  • Singly-Linked List: The list is a chain where the nodes point to their successor. The final node points to nothing.
  • Circularly (Singly) Linked List: The list is a loop where the nodes point to their successor. The final node points to the first list.
  • Doubly-Linked List: The list is a string of nodes where the nodes point both to their successor and predecessor.

A few concepts they all share:

  • Dummy Node: A node with no information that sits at the end of (one side) of the list.

### Singly Linked List

### Circularly (Singly) Linked List

### Doubly Linked List

# Positional Lists

A type of list that allows us to interact with lists via positions/elements in the list instead of index.

Why do this? This is incredibly efficient (everything except search is O(n)). And, sometimes we really don't care that much about indexes, so it is nice to have a fast list. This also is an easy way to start learning how graphs work!

We will implement this as a doubly linked list with dummy nodes, since we have to regularly interact with elements either before or after a certain position and we don't want to be super careful about not missing previous elements.

# Stack

OperationDescription
pop()Removes and returns the element at the top of the stack.
top()Returns, but does not remove, the element at the top of the stack.
size()Returns the number of elements in the stack.
isEmpty()Returns true if the stack is empty; otherwise, returns false.

A stack has limited operations, where you can only access the top (peek), add to the top (push), or remove from the top (pop). Think of it as a Tower of Hanoi!

Visualization for Stack

Why use a stack? It's really easy to make an efficient implementation. We can also do a lot of interesting things (see stack machines).

## Array Based Stack

For traditional (i.e. non-circular) array based stacks, we want to push and pop from the end of the array. This allows us to push and pop in O(1) time since we don't have to do any shifts.

# Queue

OperationDescription
dequeue()Removes and returns the element at the front of the queue.
front()Returns, but does not remove, the element at the front of the queue.
size()Returns the number of elements in the queue.
isEmpty()Returns true if the queue is empty; otherwise, returns false.

Why use a queue? They are really easy to make an efficient implementation (i.e. O(1) for all operations). We can also do a lot of interesting things (see process schedulers).

## Singly Linked List

You want to dequeue at the head and enqueue at the tail, so you can do both in constant time. (You can enqueue in constant time at the head but dequeuing at the tail takes O(n).)

## Circular Buffer/Array

This is exactly my ArrayTapeList from last semester. You just treat the array as a circle and use modular arithmetic to get the indexes.

In this class, we assert that we always have one empty space. We also maintain front and rear where front is the index of the first element and rear is the space after the circular array. IMO, it would be easier if we maintained size.

Circular Array

You can enqueue/dequeue at either end equally efficiently, but here we will enqueue at rear and dequeue at front. This lines up well since rear is an empty space.

# Iterators

While they're not really their own data structure, they are a common language structure.

Iterators allow us to iterate over a collection in an abstract way. This is important because it allows data structures to implement their own method of iteration, allowing for more efficient iteration. The necessity for this over list.get(i) in a loop is easiest to see with linked lists. list.get(i) in a loop is O(n2) for linked lists while an iterator is O(n).

# Maps / Dictionaries / Associative Arrays

These have a bunch of names and are the most important data structure imo.

Maps are key value pairs, where you insert, retrieve, and interact with data in the structure using keys.

For some reason, we differentiate between dictionaries and maps. Here, dictionaries can have multiple values with the same key while maps cannot. We also change the method names.

## Dictionary ADT

This can have multiple values for a single key.
OperationDescription
insert(k, v)Inserts the given key-value entry into the dictionary
lookUp(k)Returns the value associated with the given key
delete(k, v)Removes and returns the given key-value entry from the dictionary
size()Returns the number of key-value entries in the dictionary
isEmpty()Returns true if the dictionary has no key-value entries

## Map ADT

This has a single value for a single key.
OperationDescription
put(k, v)Sets the value for the given key to be value, adding if necessary
get(k)Returns the value associated with the given key
remove(k)Removes the key from the map and return the previous value
size()Returns the number of key-value entries in the dictionary
isEmpty()Returns true if the dictionary has no key-value entries

## Unordered List Based Implementations

For unordered lists, we store a list key-value pairs (like a tuple!).

For both array based lists and linked lists:

  • Lookup is O(n) because we have to walk through every element in the worst case.
  • Put (with no duplicate keys) is O(n) because we have to walk through every element and then set the element or search through every element and then add at any arbitrary place (we assume addition is O(1)).
  • Remove is O(n) because we have to search through the list.

## Heuristic List Based Implementations

It really sucks that everything is O(n). Notice that we have better performance in general if the keys we care about are near where we search (here, we assume the first). To make this case more common, we can use some heuristics that work for any arbitrary element.

These heuristics tell us how to move an element after lookup.

Generally, we insert elements where we search first (normally the front).

The move to front (MTF) heuristic is when, after we look something up, we move that entry to the front. This is most common for linked lists. This is good because it can make drastic changes very quickly, so if a small subset of the keys in the list are normally looked up.

The transpose heuristic is when, after we look something up, we swap the entry with the previous. This is most common for array based lists.

## Search List

To improve lookup, we can keep a sorted array. This allows us to do binary search for lookup, meaning we have O(log(n)) look up. This does, however, make insertion and removal O(n) because we have to shift over elements.

This must be an array based list (or some list with random access).

## Skip List

A skip list is probabilistic due to its insertion algorithm and uses <2n space (yes, it's also O(n)). You can prove this quickly to yourself to see that each

We can approximate the performance of binary search using linked lists if we use a skip list.

A skip list consists of a list of h lists such that

S0∋S1∋S2∋...∋Sh

and

length(Si−1)≈length(Si)/2

where each list starts and ends with two dummy nodes. And has about half the size of the previous (For integers, we normally just use −∞ and ∞.) We arrange these as an ordered list (often viewed vertically) where the corresponding nodes are linked to the one before them, after them, above them, and below them. We call this a quad!

Skip List Diagram

A skip list uses far more memory than a normal list, because it holds duplicates of the elements (well, really duplicate pointers to the element). We also hold sentinel nodes on both side. You can see this below.

### Look Up in Skip List

The algorithm for lookup is, start at the top left. If the element to your right is equal to your element, you found it. If the element to your right is greater than your element, drop down and start over. If you can't drop down, give up.

You can see this emulates binary search because each step to the right skips about half the list.

### Removal in Skip List

The algorithm for removal is to first find the element. Once you find it, remove it and go down removing its "siblings" until you hit the bottom.

If you now have two top lists that are just the dummy nodes, remove them.

### Insertion in Skip List

Insertion in a skip list uses RNG (50/50 true vs false) to determine whether the inserted element should also be inserted into the list above.

Here, we say you flip a coin every time you insert at a level. If you get a tails, you insert into the next level. If you get a heads, you stop.

# Trees

A tree is directed, acyclic, and leveled. Directed means links have direction, acyclic means no path wraps around to the same node, and leveled means nodes have a single particular level.

We apply trees all over the space. Decision trees, abstract syntax trees, file systems, process trees, etc.

## Terms

Most of the terms we use to describe a tree are very simple.

  • Subtree: A tree within another tree.

### Parts of Tree

  • Node: A single element in the tree. Knows its data and its children.
  • Root: The single, top node in the tree. A node with no parents.
  • Leaf / External Node: A node with no children.
  • Branch: Any internal node that isn't a leaf.

### Relationships between Nodes

  • Parent: Single node above current node.
  • Child: One of possibly many nodes that are directly underneath your node.
  • Sibling: A child of your parent.
  • Ancestor: Your parent or your ancestor's parent.

### Shape of Tree

  • Height: Max level of any node in tree.
  • Depth / Level: Number of steps it takes to go from root to current node.

## ADT / Interface

OperationDescription
parent(p)Returns the parent of the given node p.
children(p)Returns a list of children of the given node p.
numChildren(p)Returns the number of children of the given node p.
isInternal(p)Returns true if the node has one or more children.
isLeaf(p)Returns true if the node has no children.
isRoot(p)Returns true if the node is the root of the tree (has no parent).
root()Returns the root of the tree.
size()Returns the number of entries in the tree.
isEmpty()Returns true if the tree is empty; otherwise, returns false.

## Traversal

Traversing a tree is the process of visiting every node in a tree. Visiting means performing some arbitrary action.

There is pre-order traversal, where you visit the current node and then its children. It has O(n) runtime, assuming the language has a O(1) stack.

Algorithm preOrder(node)
+  if node is null then
+    return
+  visit node
+  for each child of node do
+    preOrder(child)
+

There is post-order traversal, where you visit the node's children and then the node itself. It has O(n) runtime, assuming the language has a O(1) stack.

Algorithm postOrder(node)
+  if node is null then
+    return
+  for each child of node do
+    postOrder(child)
+  visit node
+

You can draw out a Euler tour to do the traversal for pre or post order traversals. You start on the left of the root. For pre-order, you traverse when you touch the left of a node. For the post-order, the right.

Euler Tour

You can also do level order traversals, where you process a level at a time left to right. It has O(n) runtime, assuming you use a O(1) queue.

Algorithm levelOrder(node)
+  Q <- new empty Queue
+  if v is null then
+    return
+
+  Q.enqueue(v)
+  while NOT Q.isEmpty() do
+    q <- Q.dequeue()
+    visit(q)
+    for each child of q do
+      Q.enqueue(child)
+

## Algorithms on Trees

Almost all algorithms on trees are essentially traversals, except we preform some important operation while visiting. This can help when breaking down unfamiliar algorithms.

## Building Trees from Traversals

We can use the pre-order and post-order traversals of a general tree to reconstruct it. Here, I'll assume the traversals are listed pre-order above post-order.

To do this, we take the root element (first node in pre-order or last node in post-order) out of the root element. Then we list the pre-order and post-order traversals without the root. The first node in the pre-order traversal is a child of the root. We then create a block from this child at the top left to the same node in the post-order traversal. All node in this block are children of the found child node. We then repeat ignoring this block to get the next child.

If we want to recreate the tree, we recurse for every child we find.

# Binary Trees

Binary trees are just trees where the nodes have a max of 2 children. Traditionally, these are ordered and we call one left and the other right.

## ADT / Interface

This has the same interface as a tree, plus the following.
OperationDescription
left(p)Returns the left child of the node p.
right(p)Returns the right child of the node p.
sibling(p)Returns the sibling of the node p.

## Traversals

We can, again, do everything a tree can do, but we can also do an in-order traversal. This is, again, O(1) assuming the language has a O(1) stack.

Algorithm inOrder(node)
+  if node is null then
+    return
+  inOrder(left(node))
+  visit node
+  inOrder(right(node))
+

## Special Binary Trees

We have a few special cases for binary trees that allow us to make some useful assumptions.

### Proper Binary Tree / Full Binary Tree / 2-tree

Every non-leaf node has two children.

This gives us count(leaves) = count(non-leaves) + 1.

Proper Binary Tree

### Perfect Binary Tree

A proper binary tree where all leaves have the same depth. This tree contains the most elements possible for the given height of the tree. Perfect trees have the most elements for their height h.

This gives us, for a tree with height h:

  • 2h+1−1 nodes.
  • 2h leaves.
  • 2h−1 non-leaves / internal nodes.

Perfect Binary Tree

### Complete Binary Tree

A complete tree is an approximation of a perfect tree. All levels are filled except possibly the last level, which is filled from left to right. Complete trees have the least height among all binary trees with n nodes.

They have nodes 2h≤n<2h+1.

Complete Binary Tree

## Array Based Binary Tree

TODO

Array based implementation

# Binary Search Tree (BSTs)

Binary search trees are binary trees where for every interior (non-leaf) node N, left(N)<N<right(N). If there interior node has no left or right node, it is vacuously true. This is called the shape property.

Essentially, this means if you do an in order traversal of the tree you get a sorted list.

This means we can use trees for sorting and organization! This let's use search, insert, and manipulate trees using the binary search algorithm (O(logn)), giving us a fairly efficient data structure.

## Look Up

When you search through a binary search tree, the height determines how many searches you need to do in the worst case.

This should make sense since by looking up you're basically determining the path to find your element. In the worst case, your element is the lowest element (or between the lowest element and its in-order successor/predecessor), so you're having to compare for every node passed.

## Insertion

For insertion, we look search for the element. If we find it, we replace it's value with what we want. If we don't find it, we add it to where we ended up looking. (This relies on the fact that, when we search, we go to where the element "should" be.)

This means, in general, insertions increase the height of the tree.

## Removal

There are 3 cases you need to handle for removing a node N from BSTs:

  • children(N)=0: Just delete N.
  • children(N)=1: Replace N with its child only child.
  • children(N)=2: Replace N with the minimum from the right subtree (i.e. bottom left on right). We call this the in-order successor
    • We could also do max from the left subtree (i.e. bottom right on left, the in-order predecessor), but here we'll only be doing in-order successors because it makes grading easier.

This is basically a lookup (find the element to remove and find the lowest), so it has a runtime based off height.

## Runtime

In summary, where n is number of nodes in tree and h is height of tree:

  • Look Up: O(h)
  • Insertion: O(h)
  • Removal: O(h)

For balanced, complete trees, this means that everything is O(logn) because for complete trees O(h)=O(logn). (Because n≤log2(h))

For unbalanced, non-complete trees, this means that everything is O(n) because O(h)=O(n).

This means the worst case performance for everything is O(n).

# Balanceable Binary Search Trees

As we just covered, BSTs are most efficient when they are balanced (e.g. almost complete). Therefore, we can get improved performance if we get try to keep a balanced tree.

Unbalanced BST

Balanced BST

It should be pretty easy to see that the only operations which can make a balanced tree unbalanced are get and put.

## Rotations

To maintain a tree as balanced, we must do rotations. A left rotation is where you take the left child L of a node N and make it so that L is a parent of N and N is the right child of L. Vice versa for right rotations.

Simple BST Rotation

We normally follow trinode restructuring. Where we have 3 important nodes, labeled "a", "b", and "c" in in-order traversal order. These are child, parent, and grand-parent (irrespectively). We try to make it so that "b" is the root, "a" is the left child, and "c" is the right child. This is useful because this is the simplest restructuring that reduces the height of the tree by one.

I strongly recommend visualizing these being moved and how the nodes and subtrees shift/disconnect.

Trinode Rotation #1

Trinode Rotation #2

Trinode Rotation #3

Trinode Rotation #4

## AVL Trees

This was invented by Georgy Adelson-Velsky and Evgenii Landis

AVL Trees have the following properties:

  • Height Balance Property: Where, for every node, its children's height differs by at most 1.

The lowest node which violates the height-balance property is the node that violates it. We find the nodes that violate the height-balance property by, after inserting or removing, going up and updating the heights. Once we find one that violates it, mark it. Then, chose its child with a larger height. Do this again; if its children have the same height, choose such that you form a "line". Make sure that you are labeling nodes correctly by their value. Now, you have "a", "b", and "c" (make sure that you have them labeled correctly)

For insertion, since you are only ever adding a leaf at possible a new level, you only have to do one rotation at most. For removal, you can potentially do many as you can be starting from high within the tree.

Intuitively, the AVL tree always makes the most conservative rotations possible.

Make sure you only do the trinode rotations from earlier.

### AVL Tree Performance

Temporarily, we'll use h since we haven't derived h in terms of n.

  • Lookup: O(h)
    • Trace Down: O(h)
  • Insert: O(h)
    • Trace Down: O(h)
    • Insert at Leaf: O(1)
    • Trace Up and Update Heights: O(h)
    • Restructure at most once: O(1)
      • Rotation: O(1)
  • Removal: O(h)
    • Trace Down: O(h)
    • Remove Node: O(1)
    • Trace Up and Update Heights: O(h)
    • Restructure as many h times: O(h)
      • Rotation: O(1)

Now, let's derive h in terms of n! We'll find the lowest n for a given h. We'll always make the left subtree larger to make analysis easier.

h and n Visualized

Since we defined the left subtree as always being the larger, let

  • n(h) be number of nodes in tree.
  • n(h−1) be number of nodes in left subtree.
  • n(h−2) be number of nodes in right subtree.

Given n(1)=1, n(2)=2,

n(h)=1+n(h−1)+n(h−2) n(h)>1+n(h−2)+n(h−2) Since we know n(h−1)≤n(h−2) n(h)>2n(h−2)

Doing this recursively, we get n(h)>2n(h−2) n(h)>4n(h−4) n(h)>8n(h−6)

You can probably see (and probably already knew), that this means

n(h)>2i∗n(h−2i) for i>0 and h−2i≥1 (since we know)

## Splay Trees

Splay trees are trees which implement a splay operation, which reorganizes the tree. It does this by moving itself to be the root without breaking the binary search property (thing move to front heuristic). Every operation (lookUp, insert, delete) calls splay.

Note: Splay trees do not make any guarantees about the height of the tree (unlike AVL trees). This makes analysis significantly harder.

splay does this by doing repeated rotations (until the node is in sorted order). There are three cases:

  • p == tree.root(): Stop.
  • parent(p) == tree.root(): Perform zig.
  • p has parent u and grandparent w:
    • p and w are same direction children: Perform zig-zig. These are like trinode restructuring that go a "step too far".
    • p and w are opposite direction children: Perform zig-zig. These are just trinode restructring.

Right Rotation: 'Zig'

Left Rotation: 'Zig'

Right Rotation: 'Zig-Zig'

Left Rotation: 'Zig-Zig'

Right Heavy: 'Zig-Zag'

Left Heavy: 'Zig-Zag'

### Insertion

When we insert a node, we insert it like we would a binary search tree. We then splay the just inserted node.

### Removal

When we remove, we set the value of the node with its in-order successor's value (this can be itself if it has no in-order successor). We then remove the in-order successor's original node. Now, we splay the parent of the removed node.

### Look Up

When we look up a node, we splay the looked up node.

### Other Variations

Here, we use a variant of a splay tree called a "bottom up" splay tree. This means we insert into the bottom of the tree and then rotate as we go up. We could also do a "top down" splay tree, where we rotate as we go down.

### Why?

Moving everything might seem pointless / too much. They are most often used when locality matters. That is, if you want some node A, you might also be interested in its neighbors. A good example is looking for a book in a library.

### Runtime Analysis

TODO: re notate

The worst case scenario for a splay tree is where you insert keys in ascending or descending order. This yields a perfectly unbalanced tree (i.e. h=n).

  • Look Up: O(h)
    • Trace down: O(h)
    • Splay to the root: O(h)
  • Insert: O(h)
    • Trace Down: O(h)
    • Insert new leaf: O(1)
    • Splay to Root: O(h)
      • Because you need to do at most h splays.
  • Delete: O(h)
    • Trace Down: O(h)
    • Delete leaf: O(1)
    • Splay to Root: O(h)
      • Because you need to do at most h splays.

What makes splay trees annoying to analyze is that they have a worst case of O(h)=O(n) for everything. However, this is only in the case that you are operating on it only in ascending order, so it's misleading to say this. Therefore, we must use amortized analysis to get the average case.

We care mostly about how costly splaying is in a splay tree. This is because we do it at every operation.

First, let's define a bunch of variables:

  • Let T be a splay tree with n keys.
  • Let w be some node in T.
  • Let size(w) be the number of nodes in the subtree rooted as w.
    • size(w) = 1 + size(left(w)) + size(right(w)).
  • Let rank r(w)=log2(size(w)).

Rank is basically a measure of the balance of your tree. Lowering rank means better lookup. To analyze the runtime, let's break this down into scenarios and analyze the change in rank (Δr). Δr is, essentially, our "savings" from doing the rotation. This savings comes from us making the tree more balanced, so it is easier to look up in future.

#### Zig-Zig

Suppose we have nodes x, y, and z, that are being involved in a splay operation. Let r′(w) be the rank after splaying.

Zig-Zig Rank Analysis

r′(x)=r(z) r′(y)≤r′(x) r(x)≤r(y)

## 2-4 Trees

2-4 trees are actually a special type of [A-B Trees]. They can have more than 2 children.

Every inner node in a 2-4 tree has between 2 and 4 children and 1 and 3 children, respectively.

A 2-4 tree has the following properties:

  • All leaves have the same depth and contain 1, 2, or 3 keys.
    • That is, it's always a perfect tree!
  • An interior node can be:
    • A 2-node: 1 key and 2 children.
    • A 3-node: 2 key and 3 children.
    • A 4-node: 3 key and 4 children.
  • It is a search tree.
    • For 2-node, child[0] < keys[0] < child[1].
    • For 3-node, child[0] < keys[0] < child[1] < key[1] < child[2].
    • For 4-node, child[0] < keys[0] < child[1] < key[1] < child[2] < key[2] < child[3].
    • Essentially, it's sorted.

Types of Nodes in 2-4 Tree

To always maintain perfect balance it grows up.

### Look Up

Look up is fairly simple. We try to find what values we sit between in the current node, stopping if we find our node. If we don't find out node, we trace down to the node that is between the two nodes our value sits between. We then repeat.

### Insertion

Insertion starts by searching for your element, stopping when you find it or reach a leaf. You then insert the element into the leaf in correct order. Then, you check for overflow.

Overflow occurs when your node has 4 elements. To resolve this, split the node, pushing the 3rd up to the parent (in correct order) and put the 1st and 2nd in their own node and the 4rd in its own node. We then check the parent for overflow and repeat as necessary.

Note: We push 3rd up for consistency. You could just as easily push your 2nd up.

### Removal

Removal is the most complicated operation. When we remove, we search for the element we want to remove. If it is a leaf node, we just remove the element from the node. If it is an internal node, we replace the element with its in order successor and remove the in-order successor from its original node. We then check the node we just removed an element from for underflow.

Underflow occurs when your node has 0 elements. We have three ways to resolve this: deletion, transfer, or fusion.

  • Deletion: When the node is the root, we know the root is no longer necessary, since we only propagate removals up when we have a single child. (see fusion)
  • Transfer: When the node has at least one 3-node or 4-node sibling, it just rotates the adjacent child and parent around. (see image below)
  • Fusion: When the both node's siblings are 2-nodes, it must must fuse with its parent

## A-B Trees

A-B trees are multi-way search trees are a generalization of [2-4 Trees]. This should be easy to understand, since 2-4 was somewhat arbitrary.

A is the minimum number of children. B is the maximum number of trees.

## B Trees

B trees are a type of A-B tree with b=2a−1. They only store data in the nodes.

B trees are best known for being used to efficiently access storage. This is great because accessing storage is incredibly expensive. The idea is you store the address that points to the next storage node. You then do searches to find where you should next access memory until you reach the final memory block.

They are great because they can be very wide, meaning we don't need several accesses to physical storage to reach the nodes that actually hold the data. Additionally, most of the time, starting access to storage access is the most expensive process. This means you can get a lot of data in a single access, another benefit.

## Red-Black Trees

A summary of the trees we've learned so far:

  • AVL Trees: Require O(logn) restructuring after deletion.
  • Splay Trees: Cannot guarantee O(logn) performance on any single operation because there are no guarantees about height.
  • 2-4 Trees: Require O(logn) split when inserting or O(logn) fusion when deleting.

Red-black trees have none of the above downsides, requiring only O(1) structural changes after insertion or deletion, making them more performant than any other tree we will learn. However, they are also the most complicated tree we will learn.

Note: Red-black trees are really a BST implementation of 2-4 trees. More on that later.

Red-Black Tree

### Properties of Red-Black Trees

  • Root Property: Root is black.
  • Leaf Property: Every leaf is black.
    • If you use dummy nodes, this becomes easier to see.
  • Red Property: The children of red nodes are black.
  • Depth/Black Property: All leaf nodes have the same number of black ancestors. ("black depth")
    • More generally, from any starting node N, all paths to the dummy leaf descendants contain the same number of black nodes.

These properties guarantee that the shortest path (all black) is no more than twice the length of the shortest path (alternating red and black). This is how we make our balance guarantee. In other words

h≤2d

### Connection to 2-4 Trees

Red-black trees are 2-4 trees because, given a red-black tree, we can construct a 2-4 tree. The inverse is not always true.

You do this by merging every red node with its parent, storing its entry in the parent and making all its children the children of the parent.

Red-Black Tree to 2-4 Tree

### Look Up

Look up in a red-black tree is the exact same as for a general BST.

Red-Black Tree Lookup

### Insertion

We start insertion using the traditional BST insertion operation. Then, we determine the color.

  • Inserting at Root: Black.
  • Otherwise: Red.

For free, this preserves:

  • Root property since we insert the root as black
  • Leaf property, since use use black dummy nodes.
  • Depth property, since we only care about black depth and we just inserted red.

This means the only property we may have violated is the red property. If the parent of the inserted node is black, we have not violated the red property. Otherwise, we have a double-red violation of the red property, which we must resolve.

#### Resolving Double-Red Violations

First off, names. Name the node we just inserted x, its parent y, its grandparent z, and its uncle s.

Resolving this violation is broken into two cases.

  • Case 1: s is black.
    • Recall that we already know y is red because we have a double-red violation and z is black by the red property.
  • Case 2: s is red.
    • Again, recall that y is red and z is black.

In case 1, we resolve this with a single (O(1)) trinode restructuring of x, y, and z. You then recolor whatever your b was (root of subtree after restructuring) to be black and your a and c red. This ensures that both sides follow the depth property, since the black z may no longer be the root, we want to make sure its previous descendants still follow the depth property. We have now resolved the issue and do not need to do any further checks.

In case 2, the double red may propagate, but we don't have to do any restructuring. This corresponds to a split in a 2-4 tree! (Although not always the 3rd element split we do.) To resolve this, we recolor y and s black (i.e. flip the color of the 2 levels above) and recolor z black, unless it is the root. We then check z for a double-red violation and resolve it accordingly.

Case 2 vs 2-4 Tree

Node: In the worst case, we must do O(h) recolorings in the worst case, where we always have case 2 violations. However, we consider this a trivial operation (i.e. not the essential operation).

### Removal

We start removal using the traditional BST removal operation. Recall that, for deleting internal nodes, we replace the value of a node with the value of its in-order successor and then we delete the in-order successor node.

If we removed a red node, we have finished, since black depth has not been changed.

If we removed a black node, we have violated the black depth property. We mark this by marking the dummy sentinel/NIL node as a double-black to account for the missing black ancestor.

### Resolving Double-Black Violations

First off, names. Name the double black node p, its parent z, its sibling y, and one of its siblings children (i.e. nephews) x (it doesn't matter which one).

TODO: Does it really not matter?

Resolving the violation is broken into two cases.

  • Case 1: y is black and has a red child x.
  • Case 2: y is black and both its children are black.
  • Case 2: y is red.

In case 1, we resolve this with a single (O(1)) trinode restructuring of x, y, and z. We then recolor a and c to black and b to be z's original color. Essentially, we just added a black depth to p, and then made sure that we didn't affect y's black depth. This corresponds to a transfer in a 2-4 tree.

Double-Black vs Transfer

In case 2, we recolor y from black to red and recolor z to black. If it already was black, make it double black and resolve that issue. (Unless it is the root, then just reduce it because then everything is reduced.) Basically, we just pushed the black up a level.

Double-Black When Red vs Fusion

Double-Black When Black vs Fusion

In case 3, we rotate y around z and recolor y to black and z to red. This doesn't actually improve anything directly, but it should get us one step closer. Now, you just try to resolve the double black again.

### Performance

  • Look Up: O(h)
    • Trace Down: O(h)
  • Insert: O(h)
    • Trace Down: O(h)
    • Insert new node: O(1)
    • Restructuring / Recoloring: O(h)
      • Case 1: O(1)
      • Case 2: O(h)
  • Remove: O(h)
    • Trace Down: O(h)
    • Remove node: O(1)
    • Restructuring / Recoloring: O(h)
      • Case 1: O(1)
      • Case 2: O(h)
      • Case 3: O(h)
        • Since it may lead to case 2.

#### Proofs

We want to reparameterize our runtimes to be in terms of n instead of h. To do this, we show that ninterior≥2d−1 using a proof by induction.

In our base case, d=1 and ninterior=1. Therefore, ninterior≥2d−1=20≥1 holds.

Now, we split our inductive case into three cases, based off of the color of the children of the black node. This is easiest to see by converting the red black tree into a 2-4 tree and then analyzing the number of keys.

2-Node Equivalent

ninterior≥n1+n2+1 ≥2d−2+2d−2+1 ≥2∗2d−2+1 ≥2d−1+1

3-Node Equivalent

ninterior≥n1+n2+n3+2 ≥2d−2+2d−2+2d−2+1 ≥3∗2d−2+2 ≥2d−1+2

4-Node Equivalent

ninterior≥n1+n2+n3+n4+3 ≥2d−2+2d−2+2d−2+2d−2+3 ≥4∗2d−2+3 ≥2d+3

In the smallest of these cases (case 1), we have ninterior≥2d−1+1, which is greater than 2d−1.

We have now proven that, for every red black tree,

ninterior≥2d−1

Using h≤2d⟹h2≤d and n≥2d−1, we get

n≥2h2−1 log2n≥h2−1 h2≤log2n+1 h≤2log2n+2

Now, reparameterizing our runtimes, we get

O(h)=O(logn)

### Height

The proof for heights uses the known height of a 2-4 tree and making connections between red-black trees and 2-4 trees. This is an alternate way to prove runtime.

Let T be a red black tree of n entries with height h and black-depth d. Let T′ be the corresponding 2-4 tree of height h′.

We know d=h′+1 and h′≤log2n, from the connection between 2-4 trees and red-black trees. We know h≤2d, by the property of red-black trees. This gives us

h≤2d h≤2(h′+1) h≤2(log2n+1)

This shows that the height of a red-black tree is O(logn).

### Red-Black Tree Summary

  • Insert:
    • Case 1: Sibling s of parent y is black.
      • Rotations: 2 (trinode restructuring).
      • Recolorings: Constant #.
    • Case 2: Sibling s of parent y is red.
      • Rotations: 0.
      • Recolorings: Constant #, but may propagate.
  • Delete:
    • Case 1: Sibling y of p is black and has a red child x.
      • Rotations: 2 (trinode restructuring).
      • Recolorings: Constant #.
    • Case 2: Sibling y of p is black and both of y's children are black.
      • Rotations: 0.
      • Recolorings: Constant #, then case 1 or 2.
    • Case 3: Sibling y of p is red.
      • Rotations: 1.
      • Recolorings: Constant #, then case 1 or 2.

# Hash Maps

Hash maps are great if you don't care about memory efficiency and do care a lot about runtime efficiency. We especially use them when key space (K) is huge (e.g. compiler symbol tables and IP addresses) and lookup and insertion is common, with few deletes, since deletion is more difficult.

Hash maps are expected to have O(1) runtime for all map functions. However, hash maps are fairly memory inefficient, due to maintaining a table much larger than the actual map.

## Idea

The idea is we have an array of size m and a hash function that that converts your elements into an integer from 0 to m−1. This array holds lists of our given elements.

For insertion, you get the index of your new element by hashing it and then add your element at to the list at the given index.

For access, you get the index of your element by hashing it and then search for your element in the list at the given index.

For removal, you get the index of your element by hashing it and then remove your element from the list at the given index.

## Hash Function

Normally, your hash function is split up into two parts. You create a hash code, which can be arbitrarily large. Then, you compress it to be in the appropriate range (normally using modulus).

## Hash Code

There are a few different strategies. Here, we'll cover additive, polynomial, and cyclic-shift. For simplicity, we'll only be hashing strings, but you could easily extend this for other structured data.

### Additive

For a key of k=c0c1c2...cn−1. Our hash function is

f(k)=∑i=0n−1ci

This has the issue where there are a ton of collisions due to anagrams.

### Polynomial

For a key of k=c0c1c2...cn−1. Our hash function is

f(k)=∑i=0n−1ci∗ri

Where r is some constant that has been optimized either mathematically or experimentally.

This might easier to show via accumulation

from functools import reduce
+def hasher(string):
+    reduce(
+        lambda acc, c: r * acc + ord(c),
+        string,
+    )
+

### Cyclic Shifting

This is the same as polynomial hashing, but instead of accumulating by multiplying the accumulator by r, we cycle the accumulator by n bits before we sum the current hash.

In practice, we can do the cycling using bit shifts.

from functools import reduce
+def rol(byte, n):
+    """Rotates `byte` left by n bits."""
+def hasher(string):
+    reduce(
+        lambda acc, c: rol(acc, n) + ord(c)
+        string,
+    )
+

A good value for n when hashing English words is 5. This was determined experimentally.

## Compression Function

A compression function takes some random integer f(k), which is the hash of key k, and returns an integer h(k) in the range 0..m−1

There are a few different strategies. Here, we'll cover division, multiply-and-divide (MAD), and golden ratio method.

### Division Method

The division method is immediately obvious. It's what you think of. Just mod the numbers!

Given hash table of size m and a hash code f(k).

h(k)=mod(f(k),m)

#### Guidelines

Choosing m is very important and depends on your input space and your r (assuming you did polynomial hashing).

You should not choose m that evenly divides r−1. Suppose m=r−1.

h(ABC)=mod(f(ABC),r−1) =mod(67r2+66r+65,r−1) =mod(67((r−1)2+2(r−1)+1)+66((r−1)+1)+65,r−1) =mod((67(r−1)+134+66)(r−1)+67+66+65),r−1) =mod(65+66+67,r−1)

This basically means all anagrams will be identical, which is what we wanted to avoid by using polynomial hashing.

You should chose m to be prime because that avoids the issues above (with polynomial keys).

You should not chose m that divides rk±x for k=1,2 and x=1,2. Suppose m=r.

h(ABC)=mod(f(ABC),r) =mod(67r2+66r+65,r) =mod((67r+66)r+65,r) =mod(65,r)

This basically means all words that start with the same first letter will be identical.

### MAD Method (Multiply-And-Divide)

This method may eliminate some patterns in a set of hash codes due to being slightly more sophisticated.

h(k)=mod(αf(k)+β,m)

Where m is prime, α>0, and β≥0.

### Golden Ratio Method / Fibonacci Hashing

Has efficient compression for any m, not just primes.

In general, you divide your hash by the golden ratio. Then you take the fractional part and scale it by m to get the index. It's actually really intuitive! Don't get caught up in the symbols.

h(k)=⌊mf(k)ϕ⌋

Where x is the fractional part of x.

Note: Sometimes, in code, we prefer to multiply by the inverse of ϕ.

#### Why This is Good

This is generally the best compression method because it depends on all characters, meaning permutations are unlikely to collide.

This compression function has also been proven to evenly distribute keys, assuming evenly distributed key space. To throw out some bigs words, keys with small hamming distance in the key space are separated largely and randomly within the compression space.

An intuitive proof of this is that starting with n=1 gives you a fraction which is ϕ−1. Going to n+1 falls into the segment of greatest length, dividing the segment by the golden ratio.

Golden Ratio with n=1

Golden Ratio with n=2

Golden Ratio with n=3

Note: This also has the benefit that if m=2i, you can calculate this very quickly on computers by performing some shortcuts using binary.

## Java's hashCode()

In Java, we compute the initial hash code (no compression), using the hashCode() method.

Java has the invariant that A.equals(B) necessarily implies A.hashCode() == B.hashCode(). However, the reverse is not necessarily true. Therefore, if you override equals(), you almost certainly need to override hashCode().

There exist the following guidelines/recommendations for implementing hashCode() in Java.

  • Store some constant nonzero value, say, 17, in an int variable called result.
  • For each field taken into account by the equals method
    • Compute an int hash code c for the field:
      • If the field is a boolean, compute (f ? 1 : 0).
      • If the field is a byte, char, short, or int, compute (int) f.
      • If the field is a long, compute (int) (f ^ (f >>> 32)).
      • If the field is a float, compute Float.floatToIntBits(f).
      • If the field is a double, compute Double.doubleToLongBits(f), and then hash the resulting long as above
      • If the field is an object reference and this class’s equals method compares the field by recursively invoking equals, recursively invoke hashCode on the field. If the value of the field is null, return 0 (or some other constant, but 0 is traditional)
      • If the field is an array, treat it as if each element were a separate field. That is, compute a hash code for each significant element by applying these rules recursively, and combine these values. If every element in an array field is significant, you can use one of the Arrays.hashCode methods added in Java 1.5.
    • Combine the hash code c computed in the previous step into result as follows:
      • result = 31 * result + c;
  • Return result.

# Hash Collision Resolution

We can't guarantee that we never have collisions. So, how do we tell our program where to look next?

There are two broad categories:

  • Chaining: Collided keys are linked together.
  • Open Addressing: Some algorithm determines how to search through the table.

Here's a quick comparison of the benefits of each.

  • Chaining: Removing is simple, requires more memory for small data.
  • Open Addressing: No dynamic memory management, more processor locality.

## Separate Chaining

### Standard Separate Chaining

Items are not stored in the buckets of the hash table. Instead, the buckets store pointers to a secondary map. (This means its a 2-level data structure.)

To use this, you hash your key, get the map at the hash, and then operate on that smaller map.

Separate Chaining

The advantages of this is that it's really easy to implement and has good performance. The disadvantages is that you need references and dynamic memory management.

### Coalesced Chaining

We consider coalesced chaining an example of separate chaining. It's actually a hybrid of open addressing and separate chaining!

The goal here is, like open addressing, to avoid dynamic memory management and pointers, but to maintain the benefits of chaining.

We do this by making our table contain entries which contain a piece of data and then a "next" pointer/index. We first insert the element directly into the table, with a no next. If we get a collision, we check the "next" and follow it. If it does not have a next, we start searching from the start of the table for an empty slot to insert into. If it does have a next, follow it and try to insert there and repeat as necessary.

As you can see, this means that our displaced keys (search from beginning to insert) take up space meant for our keys, since we just start from the front, causing more collisions.

Coalesced Hashing

### Coalesced Chaining with a Cellar

Coalesced chaining with a cellar is just coalesced chaining, except that our displaced keys initially go into a cellar meant exclusively for displaced keys. Whenever the cellar runs out of space, you just move outside of the cellar.

For good performance, make your cellar ~14% of m.

Coalesced Hashing with a Cellar

## Open Addressing

### Linear Probing

In linear probing, you store items directly into the hash table. If you get a collision during insertion, you look at the next index and try to insert there. For searching, you get the hash. You then look at that index. If the slot is empty, you've failed. If the slot isn't empty but you haven't found it, take some constant size step (normally one) and then check that slot.

### Double Hashing

Double hashing is the exact same as linear probing. However, instead of using a constant step size, you use some second hashing function to determine the step size.

Make sure the secondary hash is never 0.

## Performance

For hash tables, expected performance often depends on the load factor λ.

λ=nm

Where n is the number of items in the map and m is the number of items in the map.

We also consider the number of probes required in the map. This just means accesses. S(λ) is the average number of probes required by successful lookup. U(λ) is the same except for unsuccessful lookups.

Here's a quick breakdown of the performance. We won't derive these here. S is the average runtime of a successful lookup. U is the average runtime of an unsuccessful lookup. These all assume perfect hash functions (i.e. ones which evenly distribute everything.)

### Separate Chaining

S(λ)≈2+λ/2 U(λ)≈1+λ

### Linear Probing

S(λ)≈12(1+11−λ) U(λ)≈12(1+1(1−λ)2)

### Double Hashing

S(λ)≈1λln(11−λ) U(λ)≈11−λ

# Heap

Heaps are special binary trees that have the following properties:

  • Partial Order Property: Every node's child is either smaller than it (min heap) or larger than it (max heap). This has the result of making the smallest element in the heap on top, for a min heap, and the largest element in the heap on top, for a max heap.
    • Other people call this the heap property.
  • Complete Binary Tree Property: Heaps are always complete trees. Meaning they have the smallest height possible for their number of elements.
    • Therefore, h=log(n).

Simple Heap

The special thing about heaps is that all paths from root to leaf are in sorted order, in ascending order for a min heap and descending order for a max heap.

Additionally, we only interact with the root of the heap. That is, the largest or smallest element from the collection.

## Removing

When we remove the root of the heap, we the change value of the root with the value of one of the leaves and remove that leaf node. (Here, we pick the rightmost leaf.) Now we might have just violated the partial order property, so we perform a down heap on the root.

When performing a down heap, we swap the current node with its smallest child, until we are smaller than the smallest child (i.e. the partial order property is no longer violated).

## Insertion

When we insert into the heap, we insert into one of the leaves. Here, we insert into bottom level as far left as we can, to line up with remove.

When we do this, we may have just violated the partial order property. To resolve this, we perform an up heap on the node just inserted.

When performing an up heap, we swap the current node with its parent child, until we are larger than the parent. (i.e. the partial order property is no longer violated).

## Array Based Implementations

This may surprise you because we normally create trees using linked nodes. However, since heaps are complete trees, we don't waste as much memory with huge gaps, so it makes more sense to use an array. Also, if you look at an image, it makes a lot of sense.

Array Based Heap

As you can see, the array is just a level-order traversal of the tree! You can also see why we remove the bottommost rightmost; it's just size() - 1. You can also see why we insert into the bottommost leftmost empty position; its just size().

Finally, doing it this way doesn't make traditional up heaping or down heaping any harder.

# Priority Queue

Priority queues are a way to organize entries based off some priority. It is not related to queues whatsoever. This is used a lot in schedulers, packet routers, etc.

Here, we treat priority like a key. However, as you could probably guess, we allow multiple things of the same priority. We treat the object like a value.

Recall the total order relation's (i.e. ≤) properties:

  • Reflexive: k≤k
  • Antisymmetric: k1≤k2∧k2≤k1⟹k1=k2
  • Transitive: k1≤k2∧k2≤k3⟹k1≤k3

## ADT / Interface

OperationDescription
insert(k, v)Adds the entry with key K and value V to the priority queue
min()Returns, but does not remove, the entry with the smallest key
deleteMin()Removes and returns the entry with the smallest key
size()Returns the number of entries in the priority queue
isEmpty()Returns true if the priority queue is empty; otherwise, returns false

## List Based Implementations

List based implementations definitely are not the best. But they are simple to understand.

For sorted lists, whenever we insert an element, we insert it in sorted order. This yields O(n) insertion but O(1) removal.

For unsorted lists, whenever we remove an element, we make sure to remove the min element. This yields O(1) insertion but O(n) removal.

## Heap Based Implementations

Often, we implement priority queues using heaps. It should be pretty easy to see the parallel. You literally just create the concept of a custom "entry" containing your priority and data. Then, you just min/max on the heap using the entry.

# Adaptable Priority Queue

An adaptable heap is a more pragmatic, less perfect heap. Basically, this just allows you to remove arbitrary values and update priorities of values. Here, we also include updating the value of a node.

## ADT / Interface

This also supports all operations on a traditional priority queue.
OperationDescription
remove(e)Removes and returns entry e from the priority queue
replaceKey(e, k)Replaces the key of existing entry e
replaceValue(e, v)Replaces the value of the existing entry e

## Location-Aware Heap Implementation

We could search for elements in our heap whenever we want to operate on arbitrary elements. Alternatively, we can allow for instant access by making the entries in the heap know their index. This allows for random access, but it does mean we have to keep it updated.

# Sets

Sets are super simple. They are unordered, finite collections of elements without duplicates. They are just like mathematical sets. They're optimized for membership tests.

They're normally implemented like maps with no associated value. If you're literally wrapping existing maps, you either always insert null or the same thing as the key.

## ADT / Interface

OperationDescription
add(e)Adds the element e to the set (if e is not already present in the set).
remove(e)Removes and returns the element e from the set (if e is present in the set).
contains(e)Returns true if the set contains the element e; otherwise, returns false.
addAll(T)Updates the current set to also include all elements contained in the set T (also called “union”).
retainAll(T)Updates the current set to keep only those elements that are also elements in T (also called “intersection”).
removeAll(T)Updates the current set to remove any of the elements that are contained in T (also called “subtraction”).
size()Returns the number of elements in the set.
isEmpty()Returns true if the set contains no elements.

# Disjoint Sets

Disjoint sets are split into two main parts. There's the universe set, which holds all disjoint sets. There's the disjoint subsets / splits which partition the universal set.

If this sounds familiar, it should. These are covered in discrete mathematics when discussing how you partition a set. This is just a computer implementation.

For this class, each disjoint subset has a specific identifier element. We can pick these arbitrarily because its unimportant.

## ADT / Interface

These all return pointers to the sets/nodes.
OperationDescription
makeSet(e)Creates a disjoint set that contains the element e, then returns the position that identifies the set.
union(s, t)Merges the disjoint sets that contain positions s and t.
find(e)Returns the position of the identifier for the disjoint set that contains the element.

## Applications

Disjoint sets are useful in graph theory. If you have a set of nodes and graphs made up of subsets of those nodes, you can determine which graphs are combined by whether or not they have any intersection (i.e. if they're disjoint sets or not).

## Up-Tree Forest

Up-trees are just normal trees except that the links point to the parents (up) instead of to the children (down). We still call oldest parent the root!

A forest is just a set of disjoint trees.

Up-Tree Forest

We implement disjoint sets like this to have efficient find and union. To help us with this, we use linked general trees.

For us, each tree keeps track of its parent and its number of children (count) so that we can do a balanced union.

### makeSet

Just create a new tree node with its parent as itself. We do the weird parent thing to make implementation simpler?

### union

Find the root of both s and t. Call these rs and rt. Then, we need to merge the roots. We could do this arbitrarily by making one of them the parent. But for this class we use the heuristic by making the node with more successors (i.e. larger count) be the parent so that we stay roughly balanced.

### find

Take the node and then walk to its root.

We can do path compression find, where we update the parent pointer of everything along the path from the node to the parent to point to the parent. This effectively flattens the tree, making it faster in the future.

### Implementation Difficulties

Since up-trees only have parent pointers, its pretty difficult to individually access the elements, since you have an unknown number of required handles to get every element. (The number of handles required would be the number of leafs!)

#### Auxiliary Map

Along with your disjoint sets, you have another map that maps from the elements to the nodes. This requires more memory and everything.

#### Array Representation

If you can convert your elements to integers, you can store the parent index in the slot. For roots, you store the negative count.

Basically, this is just a hash table that points to the parent index of the hash table.

# Graphs

Simple Undirected Graph

Simple Directed Graph

Graphs are discussed using set-theoretic terms. Essentially, graphs are just sets of vertices and edges.

  • Graph: Set of vertices and edges.
    • Here we mean specifically undirected graph.
  • Digraph: Set of vertices and arcs.
    • Here we mean specifically directed graph.
  • Vertex: Node that can contain data.
  • Edge: Unordered pair of vertices.
    • To show they are unordered, we notate them u,v.
  • Arc: Ordered pair of vertices.
    • We normally call arcs edges.
    • To show they are ordered, we notate them (u,v).
  • Self Loop: Edge with the same vertex as both endpoints.
  • Incident Edges: All edges on a certain vertex.
  • Adjacent Vertices: Vertices connected by a single edge.
  • Degree: Number of connected edges on a vertex.
  • Complete Graph: Graph with edge between every distinct pair of vertices.

## Paths

Paths are fundamental to understanding and analyzing graph.

  • Path: A sequence of edges describing how to move through the graph.
  • Simple Path: A path where all vertices are distinct.
  • Cycle: A path that starts and ends on the same vertex, with no successive edges being identical. In other words, you can't forwards and then back.

## Subgraphs

  • Subgraph: Graph that is made up of only vertexes and edges of some other graph.
  • Spanning Subgraph: Graph that has all of the vertexes but not all of the vertexes of some other graph.

Many times, you can break up a graph into a smaller simpler graph. If you can prove/analyze properties of the smaller, simpler graph and then apply those to the parent graph, it makes your job simpler.

## Connections

It's often beneficial to think about how connected a graph is. This makes certain problems way easier to analyze.

For an undirected graph, we use the following terms

  • Connected Graph: From any vertex, it is possible to find a path to any other vertex.
  • Maximally Connected Graph: A connected graph where no path must be longer than 1.
  • Connected Component: Maximally connected subgraph.
    • In the most extreme case, this is a single vertex.

For a directed graph, we use the above terms when the connection may only go in one direction. We append the term strongly, when the relationship goes in both directions.

## Applications

Graphs are often used in networks and path planning. They can also be used for other things! In real life, vertices normally contain data and edges/arcs describe relations between bits of data.

## Properties Graphs

Here, graph is defined by set E of n edges and V of m vertices.

For an undirected graph, where deg(v) defines the degree of vertex v.

∑v∈Vdeg(v)=2m m≤n(n−1)2

For an directed graph, where indeg(v) defines the number of incoming arcs and outdeg(v) defines the number of outgoing arcs for vertex v.

∑v∈Vindeg(v)=∑v∈Voutdeg(v)=m m≤n(n−1)

## ADT / Interface

OperationDescription
.isDirected().Returns true if the graph is a directed graph. Otherwise returns false.
numVertices()Returns number of vertices in the graph.
vertices()Returns an iteration of all vertices in the graph.
numEdges()Returns the number of edges in the graph.
edges()Returns an iteration of all edges in the graph.
getEdge(u, v)Returns the edge that connects vertex u and vertex v; if no edge connects the two vertices, return null. For undirected graphs, getEdge(u,v) = getEdge(v,u).
endVertices(e)Returns the two endpoint vertices of edge e. For a directed graph, the first vertex is the source vertex and the second is the destination vertex.
opposite(v, e)Returns the other vertex of the edge, given an edge e incident to vertex v.
outDegree(v)Returns the number of outgoing edges from v.
inDegree(v)Returns the number of incoming edges to v.
outgoingEdges(v)Returns an iteration of all outgoing edges from vertex v.
incomingEdges(v)Returns an iteration of all incoming edges to vertex v.
insertVertex(x)Creates and returns a new Vertex storing element x.
insertEdge(u,v,x)Creates and returns a new Edge from vertex u to vertex v and stores element x.
removeVertex(v)Removes vertex v and all its incident edges from the graph.
removeEdge(e)Removes edge e from the graph.

# Graph Traversals

We've already seen traversals with trees. Remember that trees are just acyclic, connected graphs!

A graph traversal is a systematic way to visit all vertices v in graph G. These traversals are only possible if the graph is connected. (Duh!)

Graph traversals have many applications:

  • Garbage Collection: Given the references/names in your program, all pieces of memory should be connected. Unconnected pieces are garbage and should be freed.
  • Compute minimum spanning tree
  • Exploring/Moving Around Graph: Find optimal path from one vertex to another.
  • Determine Possibilities: Determine if graph is connected

## Types of Edges

Discovery edge

back edge

forward edge

cross edge

## Depth First Search (DFS)

DFS is like pre-order or post-order traversals for trees.

DFS for undirected graphs can only ever have discovery or back edges. DFS for directed graphs can have any edge. I won't prove that here, but it's pretty easy to see intuitively.

You keep a set of visited nodes. Then, whenever you visit a node, it marks it as visited and check all outgoing edges. For every outgoing edge, if the edge is to an unvisited node, mark it is a discovery edge recursively traverse that node. If the edge is to a visited node, mark it as a back, forward, or cross edge as appropriate.

Basically, go as deep as possible until you can't anymore. Then backtrack.

## Breadth First Search (BFS)

BFS is like level-order traversals for trees.

BFS for undirected graphs can only ever have discovery or cross edges. BFS for directed graphs can only ever have discovery, cross, or edges. I won't prove that here, but it's pretty easy to see intuitively.

## Transitive Closures

We can solve things more rapidly if we create a transitive closure or, basically, a graph of shortcuts.

Mathematically, for a graph G=(V,E), the transitive closure G′=(V,E′) is a graph that has all the same vertices and G′ has and edge (u,v) whenever G has a path from u to v.

If our edges have weights, these algorithm can also help us precompute the weights.

### Depth-First Search for Transitive Closures

We can construct a transitive closure by doing a depth first search on every vertex to find all vertices reachable by that vertex. Then we can link them.

Recall DFS has runtime of O(n+m). This algorithm has O(n(n+m)).

### Floyd-Warshall Algorithm for Transitive Closures

Note: In class, v1 is i, v2 is j, and v3 is j.

Floyd-Warshall's algorithm by checking every possible pair of vertices v1 and v2. If there's an edge between them, then we go through all other vertices v3 and find if v2 and v3 are connected by an edge. If v2 and v3 are connected, then we know we can go from v1 to v3. Add an edge between them if there isn't already one.

## Shortest Paths

Several times we'll want find the shortest path between two points. Mapping, network routing, etc.

To find the shortest path, we need some sort of weight for the edges.

### Floyd-Warshall Algorithm for Shortest Paths

### Dijkstra's Algorithm

  • Purpose: Find the shortest path from some vertex s to all other vertices. (This is called finding the single source shortest paths.)
    • The version we're taught it in class doesn't handle negative weights. If we were more liberal with what we checked, it probably would.
  • Methods: Dynamic programming, greedy.
  • Runtime: O((n+m)logn). O(mlogn) for connected graph since $m \ge n
    • 1$.

Dijkstra's algorithm uses an adaptable priority queue to keep track of what it wants to visit. It is a priority queue because it wants to check the closest/lightest path first. It is adaptable because the edge weights can update.

We start the algorithm by creating a priority queue containing vertexes with the weight for reaching that vertex from the starting vertex. Since we haven't discovered anything yet, everything except is ∞ except for the start which is 0.

Then, we start processing. First, we look at the lowest weight / easiest to reach vertex v in the priority queue. We then look at all of its neighboring vertexes vn. We compare the weight for reaching vn from v (weight(v)+weight(edge(v,vn))) with the current weight of vn. We then set the weight of vn to the minimum of those, updating the parent as appropriate. We then remove v from the priority queue and repeat until we've handled everything in the queue.

## Minimum Spanning Trees (MST)

A minimum spanning tree is a set of edges that connects all vertices with the lowest total weight of all edges.

Note: You can have multiple minimum spanning trees.

### Prim-Jarnik's Algorithm

  • Purpose: find the minimum spanning tree for some vertex.
  • Methods: Greedy.
  • Runtime: O((n+m)logn). O(mlogn) for connected graph since $m \ge n
    • 1$.

Prim-Jarnik's algorithm is very similar to Dijkstra's algorithm, except it's does minimum spanning trees.

You start with some arbitrary vertex and maintain a growing "cloud" of vertices by adding the lowest cost vertices to add new vertices.

We start the algorithm by creating a priority queue containing vertexes with the weight for reaching that vertex from the starting vertex. Since we haven't discovered anything yet, everything except is ∞ except for the start which is 0.

Now, consider the vertex with the lowest weight.

### Kruskal's Algorithm

  • Purpose: find the minimum spanning tree for some vertex.
  • Methods: Greedy.
  • Runtime: O(mlog(m)+mlog(n)+n). O(mlogm) for a connected graph. O(mlogn) since m≤n(n−1)2 for an undirected graph and m≤n(n−1) for a directed graph and logn2=O(logn).
    • We do O(mlogn) to show that Prim-Jarnik's Algorithm and Kruskal's algorithm theoretically have the same performance. Note: Your specific application does matter.

Kruskal's algorithm works by keeping a collection of edges and adding the next cheapest edge as long as it doesn't create a cycle.

You start by considering all edges in order of increasing weight. (Use a heap!) If adding the edge doesn't create a cycle with the edges you've already added, add it. Otherwise, skip it because you already have an edge connecting those for cheaper.

Note: An easy and efficient way to determine whether something would create a cycle is by maintaining a disjoint set of vertices.

## Graph Applications

### Biconnectivity

  • Biconnectivity: A measure of redundancy of a network.
  • Vertex-Disjoint Path: Two paths have the same start and end vertex but share no other vertexes.
  • Edge-Disjoint Path: Two paths have the same start and end vertex but share no edges.
  • Articulation Point / Cut-Vertex: A vertex in a connected graph that, if removed, makes the graph not connected.
    • Formally, given a MST, a vertex v is a cut-vertex if
      • It is the root and has more than one child.
      • It is not the root and has a child w such that no descendant of w reaches an ancestor and v.
  • Biconnected Graph: A connected graph that contains no cut-vertexes.
    • In other words, for every path between vi and vf, there exists at least two vertex-disjoint paths between vi and vf. (Hence the name!)

We'd like to measure how redundant our network is. Biconnectivity is a formal way to quantify redundancy.

The straightforward approach to find out if a connected graph is biconnected would be, starting from the initial graph, delete a single vertex/edge. Then run BFS/DFS to find out if the graph is still connected. Do this for every edge and node.

However, we can be more efficient by being clever with DFS.

TODO: Add the cleverness

### PageRank

PageRank handles finding the wanted node in the network given an ambiguous query. This was initially created for Google search by Larry Page. This is a very difficult problem for the following reasons:

  • Keywords are inexpressive.
  • There are multiple terms for the same concept. (Synonyms.)
  • There are multiple concepts for the same term. (Polysemy.)

The main idea of PageRank is that nodes that link to a lot of other nodes are important and that nodes that are linked to by a lot of other nodes are important.

PageRank is an iterative algorithm that runs until everything stabilizes. It starts out by assigning each node an equal importance (normally 1n). To find the next iteration, every node splits its importance between all of the nodes it links to, sending each one of them a fraction of its importance.

Note: The total weight never actually changes. It just gets redistributed.

This has a few issues:

  • How do we deal with dangling pages?
    • We normally deal with dangling pages by saying that they link to every node.
  • The Internet is huge. How do we speed it up?
    • We can decompose the graph into smaller graphs and run PageRank on them. Then do something to bring them all back together.
    • We can stop early. The precise values returned by PageRank don't normally matter. We only need to find the relative ordering.
  • This doesn't model things perfectly. What about random switches?
    • We normally add a damping factor. This damping factor is the probability that the user randomly switches webpages.

# P (Polynomial) vs NP (Non-Deterministic Polynomial)

  • Polynomial Time: Anything less than O(nlogn).
  • Non-Polynomial Time: Anything greater than or equal to O(nlogn).
  • P: Problems that have both polynomial time solutions and verifications.
  • NP: Problems that have a polynomial time verification, but it is unknown on whether they have a polynomial time solution.

The P vs NP problem asks, if there is a polynomial time algorithm to verify a solution, does that imply that there is a polynomial time algorithm to solve the problem? In other words, are all NP problems actually P problems.

Important! NP does not mean that a polynomial time solution does not exist. It just means we don't know if it exists.

How would you prove P = NP? The idea is you pick an NP-complete problem. The NP-complete problems are problems where we only know the solution using a brute force method. If you can prove that one of these is P, then you did it.

## Comparison Based Sorting Algorithms

We will motivate this discussion using comparison based sorting.

There does exist polynomial time solutions to sort a list (e.g. merge sort O(nlogn), bubble sort O(n2)). There also exists polynomial time verifications (check over every element in the list O(n)).

Is there a algorithm to solve faster than O(nlogn)? No. We can check this by forming a decision tree.

Sorting Decision Tree

The first level can have up to n children, all nodes in the next level can have n−1 children, and so on. Thus the total number of nodes is n∗n−1∗...∗1=n!. This means we know this means the height of the tree is at least log(n!). Since log(n!)≥log(n/2)n/2. This is Ω(nlogn).

We have shown that no solution can be faster than O(nlogn).

\ No newline at end of file diff --git a/notes/ncsu/2f/csc316/left_heavy_zig_zag.png b/notes/ncsu/2f/csc316/left_heavy_zig_zag.png new file mode 100644 index 0000000..f7ccb04 Binary files /dev/null and b/notes/ncsu/2f/csc316/left_heavy_zig_zag.png differ diff --git a/notes/ncsu/2f/csc316/left_zig.png b/notes/ncsu/2f/csc316/left_zig.png new file mode 100644 index 0000000..d1c959f Binary files /dev/null and b/notes/ncsu/2f/csc316/left_zig.png differ diff --git a/notes/ncsu/2f/csc316/left_zig_zig.png b/notes/ncsu/2f/csc316/left_zig_zig.png new file mode 100644 index 0000000..b708dd9 Binary files /dev/null and b/notes/ncsu/2f/csc316/left_zig_zig.png differ diff --git a/notes/ncsu/2f/csc316/perfect_binary_tree.png b/notes/ncsu/2f/csc316/perfect_binary_tree.png new file mode 100644 index 0000000..47c26d2 Binary files /dev/null and b/notes/ncsu/2f/csc316/perfect_binary_tree.png differ diff --git a/notes/ncsu/2f/csc316/proper_binary_tree.png b/notes/ncsu/2f/csc316/proper_binary_tree.png new file mode 100644 index 0000000..9d40748 Binary files /dev/null and b/notes/ncsu/2f/csc316/proper_binary_tree.png differ diff --git a/notes/ncsu/2f/csc316/red_black_2_node.png b/notes/ncsu/2f/csc316/red_black_2_node.png new file mode 100644 index 0000000..993e3a4 Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_2_node.png differ diff --git a/notes/ncsu/2f/csc316/red_black_3_node.png b/notes/ncsu/2f/csc316/red_black_3_node.png new file mode 100644 index 0000000..b89ef37 Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_3_node.png differ diff --git a/notes/ncsu/2f/csc316/red_black_4_node.png b/notes/ncsu/2f/csc316/red_black_4_node.png new file mode 100644 index 0000000..20cfa7a Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_4_node.png differ diff --git a/notes/ncsu/2f/csc316/red_black_case_2_vs_2_4.png b/notes/ncsu/2f/csc316/red_black_case_2_vs_2_4.png new file mode 100644 index 0000000..c9df543 Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_case_2_vs_2_4.png differ diff --git a/notes/ncsu/2f/csc316/red_black_double_black_fusion1.png b/notes/ncsu/2f/csc316/red_black_double_black_fusion1.png new file mode 100644 index 0000000..c44de61 Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_double_black_fusion1.png differ diff --git a/notes/ncsu/2f/csc316/red_black_double_black_fusion2.png b/notes/ncsu/2f/csc316/red_black_double_black_fusion2.png new file mode 100644 index 0000000..b5d8fcd Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_double_black_fusion2.png differ diff --git a/notes/ncsu/2f/csc316/red_black_double_black_transfer.png b/notes/ncsu/2f/csc316/red_black_double_black_transfer.png new file mode 100644 index 0000000..7a69060 Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_double_black_transfer.png differ diff --git a/notes/ncsu/2f/csc316/red_black_lookup.png b/notes/ncsu/2f/csc316/red_black_lookup.png new file mode 100644 index 0000000..49232a3 Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_lookup.png differ diff --git a/notes/ncsu/2f/csc316/red_black_to_2_4.png b/notes/ncsu/2f/csc316/red_black_to_2_4.png new file mode 100644 index 0000000..a0adc09 Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_to_2_4.png differ diff --git a/notes/ncsu/2f/csc316/red_black_tree.png b/notes/ncsu/2f/csc316/red_black_tree.png new file mode 100644 index 0000000..7ce15ca Binary files /dev/null and b/notes/ncsu/2f/csc316/red_black_tree.png differ diff --git a/notes/ncsu/2f/csc316/right_heavy_zig_zag.png b/notes/ncsu/2f/csc316/right_heavy_zig_zag.png new file mode 100644 index 0000000..72defc9 Binary files /dev/null and b/notes/ncsu/2f/csc316/right_heavy_zig_zag.png differ diff --git a/notes/ncsu/2f/csc316/right_zig.png b/notes/ncsu/2f/csc316/right_zig.png new file mode 100644 index 0000000..b42c4fc Binary files /dev/null and b/notes/ncsu/2f/csc316/right_zig.png differ diff --git a/notes/ncsu/2f/csc316/right_zig_zig.png b/notes/ncsu/2f/csc316/right_zig_zig.png new file mode 100644 index 0000000..591fda7 Binary files /dev/null and b/notes/ncsu/2f/csc316/right_zig_zig.png differ diff --git a/notes/ncsu/2f/csc316/simple_digraph.png b/notes/ncsu/2f/csc316/simple_digraph.png new file mode 100644 index 0000000..d55aeab Binary files /dev/null and b/notes/ncsu/2f/csc316/simple_digraph.png differ diff --git a/notes/ncsu/2f/csc316/simple_graph.png b/notes/ncsu/2f/csc316/simple_graph.png new file mode 100644 index 0000000..488d1f1 Binary files /dev/null and b/notes/ncsu/2f/csc316/simple_graph.png differ diff --git a/notes/ncsu/2f/csc316/skip_list.png b/notes/ncsu/2f/csc316/skip_list.png new file mode 100644 index 0000000..aabdea8 Binary files /dev/null and b/notes/ncsu/2f/csc316/skip_list.png differ diff --git a/notes/ncsu/2f/csc316/sorting_decision_tree.png b/notes/ncsu/2f/csc316/sorting_decision_tree.png new file mode 100644 index 0000000..c73fad2 Binary files /dev/null and b/notes/ncsu/2f/csc316/sorting_decision_tree.png differ diff --git a/notes/ncsu/2f/csc316/stack_view.png b/notes/ncsu/2f/csc316/stack_view.png new file mode 100644 index 0000000..f2c2a0b Binary files /dev/null and b/notes/ncsu/2f/csc316/stack_view.png differ diff --git a/notes/ncsu/2f/csc316/trinode_rotation1.png b/notes/ncsu/2f/csc316/trinode_rotation1.png new file mode 100644 index 0000000..ec38f8e Binary files /dev/null and b/notes/ncsu/2f/csc316/trinode_rotation1.png differ diff --git a/notes/ncsu/2f/csc316/trinode_rotation2.png b/notes/ncsu/2f/csc316/trinode_rotation2.png new file mode 100644 index 0000000..3fe9660 Binary files /dev/null and b/notes/ncsu/2f/csc316/trinode_rotation2.png differ diff --git a/notes/ncsu/2f/csc316/trinode_rotation3.png b/notes/ncsu/2f/csc316/trinode_rotation3.png new file mode 100644 index 0000000..cb46b4e Binary files /dev/null and b/notes/ncsu/2f/csc316/trinode_rotation3.png differ diff --git a/notes/ncsu/2f/csc316/trinode_rotation4.png b/notes/ncsu/2f/csc316/trinode_rotation4.png new file mode 100644 index 0000000..f9bd0c4 Binary files /dev/null and b/notes/ncsu/2f/csc316/trinode_rotation4.png differ diff --git a/notes/ncsu/2f/csc316/unbalanced_bst.png b/notes/ncsu/2f/csc316/unbalanced_bst.png new file mode 100644 index 0000000..a635744 Binary files /dev/null and b/notes/ncsu/2f/csc316/unbalanced_bst.png differ diff --git a/notes/ncsu/2f/csc316/up_tree_forest.png b/notes/ncsu/2f/csc316/up_tree_forest.png new file mode 100644 index 0000000..70e17c2 Binary files /dev/null and b/notes/ncsu/2f/csc316/up_tree_forest.png differ diff --git a/notes/ncsu/2f/csc316/zig_zig_analysis.png b/notes/ncsu/2f/csc316/zig_zig_analysis.png new file mode 100644 index 0000000..69a640d Binary files /dev/null and b/notes/ncsu/2f/csc316/zig_zig_analysis.png differ diff --git a/notes/ncsu/2f/index.html b/notes/ncsu/2f/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/2f/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/ncsu/2f/py208/index.html b/notes/ncsu/2f/py208/index.html new file mode 100644 index 0000000..60eab19 --- /dev/null +++ b/notes/ncsu/2f/py208/index.html @@ -0,0 +1 @@ +Eli | PY 208: Physics II (Electricity and Magnetism)

PY 208: Physics II (Electricity and Magnetism)

Instructor: Dr. Shuang Fang Lim | Semester: Fall 2019

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/2f/soc202/crude_divorce_rate.png b/notes/ncsu/2f/soc202/crude_divorce_rate.png new file mode 100644 index 0000000..1bb5161 Binary files /dev/null and b/notes/ncsu/2f/soc202/crude_divorce_rate.png differ diff --git a/notes/ncsu/2f/soc202/index.html b/notes/ncsu/2f/soc202/index.html new file mode 100644 index 0000000..0835d77 --- /dev/null +++ b/notes/ncsu/2f/soc202/index.html @@ -0,0 +1 @@ +Eli | SOC 202: Principles of Sociology

SOC 202: Principles of Sociology

Instructor: Thomas-Winfield, M.S. | Semester: Fall 2019

Table of Contents

# Administrivia

  • No final exam. Just a final semi-independent project.
  • Grades on Moodle.
  • No late work.
  • No more than 2 absences. 3 tardies = 1 absence.
  • Notes for day uploaded at start of class.

# Terms

  • Sociology: Science of human social behavior and individuals interaction with society.
  • Sociological Imagination/Perspective: Ability to see relation between individual lives and society at large. Specifically dealing with troubles and issues.
  • Diversity: Abstract concept of the variety of experiences of members in a group.
  • Positivism: The scientific method, where knowledge and inquiry is above all.
  • Ethnography: Study done using observation and interviews.

## Sociological Concepts

It is important to realize society changes people and people change society.

  • Social Interaction: Meaningful behavior involving 2+ people.
  • Social Structure: Organized pattern for relationships and institutions that make up a society. Common social forces of society.
  • Social Institutions: Organized system of social behaviors with a specific purpose. (e.g. marriage, government, family)
    • Unlike individual behavior, this cannot be directly observed.
  • Social Organization: Order established within social groups. A structured system/pattern of social relationships in a group of people. This makes society easier to understand.
    • Formal Social Organizations: Goal directed. Military, universities, hospitals.
    • Informal Social Organizations: Not goal directed. Friend groups, individual relationships, social groups.
  • Social Change: The change society experiences over time for any reason.
    • This can be motivated to attempt to cause significant transformation of behavior patterns, social institutions, and cultural values. This is called applied sociology normally.
  • Structural Effects: Pushes on individuals from society.
  • Cultural Capital: Skills, behaviors, and experiences that can change your lot (can benefit or harm you). Everyone has cultural capital but the type/quality of it depends. Examples include speech style, education, negotiation abilities, self advocacy, discipline.

### Societal Concepts

  • Issues: Largely felt troubles coming form a common origin in society. Hard to pinpoint specific cause.
    • Synonyms: Public Issues of Social Structure.
    • Parallel: Troubles.
  • Structure: Social systems that constrain actions of individuals.
    • Parallel: Agency.
  • Context: Setting for a society.
    • Parallel: Social Context
  • Macroscopic/Large-Scale Social Phenomena: Groups, organizations, cultures, society, the world, and the relationships among them.
    • Parallel Microscopic ...

### Individual Concepts

  • Troubles: Privately felt difficulties
    • Synonyms: Personal Troubles of Mileau (i.e. social setting of troubles)
    • Parallel: Issues.
    • Examples: Divorce (rate), student loan debt, unemployment (in recession/depression), obesity.
  • Agency: Capacity to act independently.
    • Parallel: Structure.
  • Social Context: Influence of society on individuals.
    • Parallel: Context.
  • Microscopic/Small-Scale Social Phenomena: Individuals and their thoughts and actions.
    • Parallel Macroscopic ...

# People

See page 19 of "Sociology: The Essentials, 9th ed." for a table. All people here discussed American society.

  • Alexis de Tocqueville (1805–1859): French man. "Tyranny of the majority".
  • Harriet Martineau (1802–1876): British woman. Wrote "Society in America (1937)".
  • Jane Addams (1860-1935): White woman. Leader in "settlement house movement" and other movements to help poor and immigrants.
  • Ida B. Wells-Barnett (1862–1931): Black woman; born a slave. Leader of anti-lynching movement and women's and black's rights.
  • W. E. B. DuBois (1868-1963): Black man. Founder of NAACP (National Association for the Advancement of Colored People).
  • C. Wright Mills (1916-1962): "Sociological imagination".

# Sociological Research

Broadly research involves a puzzle and idea.

  • Puzzle: Research Question
  • Idea: Hook or twist to research question. What makes your research unique.

Sociologists generally don't replicate a study unless a previous research study had questionable practices. (This is rationalized because of peer review) If there is replication, there tends to be a "twist" and researches themselves will recommend twists.

Sociological research tends to be split between quantitative and qualitative. Here's a broad overview:

  • Quantitative:
    • Deductive (theory/hypotheses to research)
    • Methods: surveys, polls, structured questionnaires, experiments (i.e. numerical data)
    • Asks: relate, effect, cause, impact
    • Broad
    • Generalizable
  • Qualitative:
    • Inductive (research to theory/hypotheses)
    • Methods: participant observation, focus groups, in-depth interviews (i.e. text-based data)
    • Asks “what” or “how”
    • Deep
    • Not generalizable

It is important to note that sociological research tends to have values that can impact their research (see positionality). This positionality is more impactful for qualitative research.

To try to combat positionality, sociologists (especially qualitative) tend to be very reflective, describing their position and history and how that may impact their research.

## Quantitative Research

Quantitative research seeks to create associations/correlations and uses hypotheses. Actual numbers and counts (of groups) are used; numbers are often hard to get, so we can be pretty liberal.

To show causality, sociologists only must only show the following to a reasonable person.

  • Correlation: We need to see them together.
  • Temporal Ordering: We need to know that our independent variable occurs before our dependent variable.
  • Non-Spuriousness: The relationship makes sense / isn't caused by anything else.

As you can see, sociologists are pretty liberal. Their requirements are sound in theory, but it's hard to prove non-spuriousness in practice without experiments, which we can't (normally) do because of ethics.

Quantitative research normally uses surveys, polls, structured questionnaires, experiments (i.e., numerical data).

Quantitative research tends to be easy to generalize.

### Examples

Does critical thinking ability relate to student achievement?

Is there a relationship between neighborhood type (e.g. residential, business district) and types of crimes committed (e.g. car theft, robbery)?

## Qualitative Research

Qualitative research seeks to understand individual people's perceptions of their experiences, what meaning people attribute to themselves, and the social processes that help form their lives.

There are no hypotheses and it is very individual and touchy-feely. It's a lot like case-studies except normal.

Qualitative research tends to be very exploratory, where people start with a central question that spawns sub-questions.

Normally works with symbolic interaction on the micro level.

Qualitative research normally uses participant observation, focus groups, in-depth interviews (i.e. text-based data)

Qualitative research tends to be hard to generalize.

### Examples

What are the experiences of minority students in predominantly white educational institutions?

How do parents discuss sex and sexuality with early adolescent girls and boys?

## Themes

  • (Social) Diversity: The variety of group experiences that come from social structure.
    • Group differences in opportunities
    • Shaping of social institutions by various factors.
  • (Social) Inequality: Ways social categories are differentially positioned with social goods (e.g. labor market, education, healthcare, political representation, etc.)
  • Globalization: Increased economic, political, and social connectedness and interdependence among societies around the world.
    • Pros: More access to goods and services, shared technology, etc.
    • Cons: Job displacement, pollution impacts, "deviant globalization" (terrorism, sex trafficking, black market, etc.)
    • Causes: Internet, container ships, airplanes.

## "Levels" of Study

  • Personal Level (micro): Studying individual people
    • Examples: symbolic interaction, family conflict, aging
  • Societal Level (macro): Examine whole semi-homogeneous group.
    • Examples: crime and law, poverty and wealth, social movements
  • Global Level (macro): Examine whole world.
    • Examples: war and peace, global economy
    • Increasingly similar to societal level.

## Ethics

Here are some examples of ethical controversies:

  • Philip Zimbardo: Stanford Prison Experiment (1971)
  • Federal Government: [Tuskegee Syphilis Study] (1932-1972)
  • Laud Humphreys': [Tearoom Trade Study] (1965-1968)
    • Issue: Men did not know they were being studied (no informed consent). He deceived the participants. Collected personal information on participants. Did follow up studies again deceiving the participants.
    • https://en.wikipedia.org/wiki/Tearoom_Trade
  • Mark Regnerus: Study on Same-Sex Parenting (2012)
    • Issue: Conflict of interest, funded by anti-LGBTQ groups. Had troublesome research practices.

As a reaction, we have the following informal ethical principles.

  • Respect for Persons: Treat individuals as autonomous people, protecting children and others with diminished-autonomy.
  • Beneficence: Minimize harm to studied individuals (and everyone) and maximize the benefits to studied individuals (and everyone)
  • Justice: Benefits and harms should be distributed justly/fairly equally

Also, every institution that does research on humans must have an institutional review board (IRB) that reviews research proposals, that apply common ethical standards. Researches cannot begin until the IRB approves.

### Common Ethical Standards

  • Achieve Valid Results: Your research is meant to get correct info.
  • Ensure Honesty and Openness: Scientists must disclose their methods and honest in presenting their finding.
  • Protect Research Participants:
    • Do no harm to participants.
    • Participants must be anonymous, unless explicitly waived with informed consent.
    • Benefits should outweigh risks.
  • Informed Consent:
    • Participants must know how and why the research is being done, unless them knowing prevents the study.

## Peer Review

All research must go through peer review process. The peer review process is when you send your paper to a board. They give you feedback and one of the following happens:

  • Your paper is rejected.
  • Your paper is temporarily rejected with feedback.
  • Your paper is accepted.

## Finding and Parsing Research

In this class, we will only look at peer-reviewed articles from NC State's database which were published by sociological journals.

You can search for you topic, filtering for only peer-reviewed articles, and then scour for one published by a journal. Or you can search in all for sociological journals. Then, pick the one you want, and go directly to the journal's website.

You can also use Google Scholar, find what you want, and then look for it on NC State's libraries.

When reading articles, always read the abstract first.

### Research Outline

  • Title and Author Information
  • Abstract
  • Introduction
  • Literature Review
    • Qualitative: State a grounded theory, which is what they're stating.
  • Hypotheses (Quantitative Articles Only)
  • Method
    • Quantitative: Independent variables, dependent variables, controls.
    • Qualitative: Demographics, interview process, recruitment strategies.
  • Analysis
    • Quantitative: What they did statistically.
    • Qualitative: How they thought about the results.
  • Results/Findings
    • Quantitative: Give descriptive statistics. State whether their hypothesis was supported. Show data. Don't interpret.
    • Qualitative: Provide examples and interpretations
  • Discussion/Conclusion
    • Quantitative: Where they interpret, elaborate, and say stuff about their findings. Talk about limitations. Suggestions for future research and policy.
    • Qualitative: What they think their interpretation/findings mean. Suggestions for future research and policy.
  • References
  • Appendix (e.g., interview questionnaire, survey example)

## Citations

When you summarize or paraphrase work, provide the author's names and year of publication.

Gender inequality... (West and Zimmerman 2009)

When directly quoting, include author's name, year of publication, and page numbers from work within directly after the quote.

Firebaugh argues "..." (Firebaugh 2008:50)

If you have works with several authors, you cite every author the first time and then just the first author "et al.".

# Purpose of Sociology

  • Scientific / Descriptivist View: Just describe and investigate society's structure.
  • Social Reform / Prescriptivist View: Take the results of research into society's relationship and use it to solve social problems.
  • Hybrid: You do both! How much? It's a spectrum.

# Debates

## Agency vs Structure

  • Do people act as free agents or as a social structure? It's hard to determine and seems to depend! I tend to think structure.

# Theories

Sociology theory arose during the 1800s because of and with industrialization and urbanization. (A lot of things were changing!)

## Social Construction of Reality Theory (SCT)

  • Social Construction: Social mechanism, phenomenon, and category created and developed by society. These are jointly constructed using shared assumptions about reality.
    • These do not strictly exists biologically (although are often linked).
    • Examples: Gender, race

How can you tell what is a social construction? There are examples of societies that have different social constructions or it is comprehensible that there exists a society with different social constructions.

How do we get these? Media, family, history, agriculture(!), etc.

Sociologists consider (our perception of) reality a social construction (i.e. social construction of reality theory) because we learn and comprehend a lot about reality via language and communication, which is a social construction. This is just a HOT way to say that you get biases from your culture/upbringing/society that you hold to be fundamental truths being constantly reaffirmed due to confirmation bias and self-fulfilling prophecies. (There is no reality! Hahaha.)

The concept of a shared social reality is said to be the commonly held social constructions in a group that helps form the basis of a society and hold them together.

### Examples

A poorer, more crime-heavy neighborhood gets randomly frisked and high levels of police surveillance. This neighborhood things police are a good thing. A richer, less crime-heavy neighborhood rarely gets bothered by police and only sees them when there is a severe issue. This neighborhood thinks police are a good thing.

We assume there are only two genders that are completely linked with sex. (Wait, I thought sex and gender are the same? Exactly! Sex is a physical thing; gender is a social thing.)

## Functionalism (Macro)

They are optimistic about inequality and believe it helps us.

The core assumption is that society is like a living organism. Each part has a function and purpose and society needs all parts to survive.

Belief that inequality/stratification is inevitable and functional for society because social inequality motivates people to fill different positions in society that are necessary.

  • Social Cohesion: Degree to which those in social system identify with it, feel bound to it, and are willing to cooperate in a society.
  • Social Facts: Social patterns external to individuals (e.g. customs).
  • Functions: Positive consequence of a structure. Help society.
    • Family: raise kids, provide micro support structure, help create and prolong society (values, language, etc.).
  • Dysfunctions: Negative consequence of a structure. Harm society.
    • Border Control: Can split families, harm innocent people (especially unfairly).

### People

  • Auguste Comte (1798–1857): French man. Pioneered "sociology" and "positivism".
  • Emile Durkheim (1858-1917): Jewish, French man. "[Functionalism]" and "[sui generis]" (society is greater than the sum of its part). Interested anti-Semitism unifying people.

## Conflict Theory (Macro)

They are pessimistic about inequality and believe it is inevitable and harms us. Basically, "If we could just solve inequality...".

This theory was brought around mostly because of capitalism and is focused mostly on the economy and capitalism. Focuses heavily on class struggle.

The belief that struggle over scare resources leads to inequality. Inequality leads to conflict and unequal power distribution, some dominating others.

Why wasn't Marx (and conflict theory) right?

  • It was, kinda.

  • Not just class/economics that separate people (e.g. racism).

  • Revolts are dangerous.

  • We have the "American Dream".

  • Globalization and technology is like WOAH. The online shopping, containerization, and the Internet has made a lot of the assumptions for a healthy market ABSURDLY more accurate.

  • Power: Ability to control others, events, and resources. General ability to make things happen.

  • (Social) Classes: Different groups of society, separated economically.

    • Capitalist (or Bourgeoisie): Rich large business owners. Oppressors.
    • Petty Bourgeoisie: Small business owners.
    • Proletariat (or Working Class): Workers. Oppressed.
    • Lumpenproletariat: Those discarded by capitalism (e.g. homeless).

  • Class Struggle: Capitalists driven to decrease wages of workers. Workers want high wages. This causes struggle.

  • Rationalization: Act of social structures becoming more direct and efficient.

    • Pros:
      • Fewer people need to work.
      • We have more stuff in less time.
      • Can have less human error.
    • Cons:
      • Fewer people have jobs.
      • Job displacement (altho only an issue in capitalism).
      • Stressful.
      • Environment can get hurt.
      • Less interaction with people.
      • People get comfortable being isolated.
    • Examples:
      • Consumers increasingly are doing more work (pumping gas, bagging groceries). "Consumer workers".

### People

  • Karl Marx (1818-1883):
    • Analyzed society economically.
  • Max Weber (Vay-Ber) (1864-1920):
    • Analyzed society and power with political, economic, and cultural (religious) dimensions.
    • Created "verstehen" (understanding social actions from those who do them).
    • Connected economy and religion, showing that protestant economies tend to be more successful (fluke?).
    • Created rationalization.

### Symbolic Interactionism (Micro)

Assumes that interaction and communication is extremely important.

Focuses on how people interact, the meaning of certain symbols/statements, and how those symbols/statements affect people.

## Dramaturgy (Instance of SCT)

Created by Goffman. Models social interaction as a drama/theater, with a front stage and a back stage. Where, during the front stage, we try to manage and manipulate others' impressions of us, while, during the back stage, we don't care.

  • Front Stage: When we're interacting with people.
  • Back Stage: When we're not interacting with other people.

This is similar to the looking glass self theory, where we always consider other people's impressions of you, which impacts your behavior.

# Socialization

  • Socialization: How an individual learns and accepts the way their society/group works. Lifelong process of learning the expectations, values, norms, and roles of a culture. How an individual learns their "place" in society.

Socialization is split into childhood / primary and adult socialization.

Primary socialization is how newborns and young children acquire language, identities, and culture (routines, norms, and values). This is chiefly responsible for transforming children into prepared adults (called anticipatory socialization). Parents and the family unit are responsible for this.

For the longest time, primary socialization was assumed to be one-direction, from parent to child. Recent research shows that this is two-directional. This is most easily seen by children of immigrants teaching and exposing their parents to the language and culture of their new home. Additionally with technology. This backflow is called reverse socialization.

Adult socialization occurs with peers (and also children). Generally, this is people slowly evolving in a changing society. The most common change is changing your "presentation of self". Adult socialization can also occur with resocialization, where people have to unlearn their old behaviors, norms, and culture and learn new ones. This occurs most in total institutions, which are closed off enclaves of culture (e.g. military and prison).

## Nature vs Nurture

Sociologists tend to believe nurture plays a very large role. They don't believe in "human nature" in general (i.e. women want to have children). They believe most human behavior is shaped strongly by socialization and the environment.

## Agents of Socialization

There are many things that socialize you. Here's a quick breakdown:

  • Family: Basic introduction into family and societal culture (i.e. tasks, rituals, beliefs, gender, social-class, etc.). There are noticeable class and racial differences.
  • Schools: Teachers have implicit biases and beliefs that their students are exposed to ("hidden curriculum"). Gender roles become more extreme here due to exposure to other people in the same age and the "hidden curriculum" (e.g. boys line up here, girls play with these toys, etc.).
  • Peers: Your peers beliefs amplify and affect your beliefs. Acting as an "echo chamber".
  • Media: Beliefs are spread widely and talked as though generally accepted.
  • Religion: Religions have their own culture, beliefs, and norms.

## Theories of Socialization

Here's a quick breakdown:

  • Psychoanalytic Theory:
    • Created by Sigmund Freud
    • Focuses on the unconscious.
    • Pretty wack, not really covered.
  • Social Learning Theory ("Role Modeling"):
    • Like "behaviorism" from sociology.
    • Says formation of identity is a learned both by modeling your actions and beliefs after others and by changing your beliefs and actions based on people's reactions to them.
    • Behavior exhibited by many people is more likely to be repeated.
    • Behavior that is positively reinforced is more likely to be repeated.
    • Sociologists use different terms from psychologists because ugh:
      • Positive Reinforcement: Good!
      • Negative Reinforcement: Bad!
  • Functionalism:
    • Socialization is how people are integrated into society and how society maintains stability.
    • Focus on social consensus and conformity.
  • Conflict Theory:
    • View socialization as a way to perpetuate the status quo.
    • People learn to accept the current system and their social status rather than challenge them.
  • Symbolic Interaction (SI) Theory:
    • Recall symbolic interaction theory focuses on the self and interactions between individuals.
    • Focuses on the concept of "self", which is socially built and reinforced.
    • There are many different SI theories.

### Symbolic Interaction (SI) Theories

  • Cooley's - The "Looking-Glass Self":
    • A lot like social learning theory. Explains that formation of self is a social process based on your interactions with other people.
    • The "looking-glass self" is our understanding of how other people perceive and judge us.
  • Mead's Theory of Socialization:
    • Argued that social roles are the basis of social interaction.
    • Argues identity emerged from the roles you play in the following stages:
      • Imitation Stage: Child copies the roles of others without understanding them.
        • Children cursing
      • Play Stage: Children take the roles of people in the environment, but only one at a time. Understand their roles relationships with other people.
        • Playing "House", "Cops and Robbers"
      • Game Stage: Children become capable of understanding and playing multiple roles. Children get a generalized other, which is the abstract composition of all your roles in every situation. Has two dimensions, the active, self-defining "I", the passive, defined "Me".

# Culture

Culture refers to

  • shared system of beliefs, knowledge, meanings, and symbols
  • shared forms of communication
  • set of values, beliefs, and practices

There are non-material parts of culture: norms, laws, customs, ideas, and beliefs. There are material parts of culture: money, technology, and houses.

Culture is learned, shared, common, and taken for granted.

Culture is made up of a few fundamental elements:

  • Values: Standards defining what is good, desirable, right, important, and vice versa.
  • Norms: Informal, unwritten rules that guide how people live. Sometimes combined with laws.
  • Laws: Codified rules that enforce how people live. Sometimes combined with norms.
  • Beliefs: Shared ideas believed collectively to be true.
  • Language: Actual, real language. Set of meaningful symbols allowing communication. Allows for the spreading and storage of culture.

## Norms

Norms are reinforced with sanctions, which can be either punishments, when norms are violated, or rewards, when norms are followed.

Mores are extremely important, heavily punished norms (tend to be laws). Folkways are unimportant norms that are not heavily punished.

## Different Culture within a Society

There can be many different cultures within a society! There is the dominant or mainstream culture, which is the culture of the most powerful group (also tends to be the largest). This mainstream culture tends to be considered the "most correct" or "most legitimate" that other subcultures do not have. Subcultures are any cultures within a society that are not the mainstream culture. They have to different from mainstream culture in some significant way, but they don't have to be totally incompatible. Any extreme, far-leaning political or religious groups can be categorized as subcultures. Some examples are Amish, LGTBQ+, and polyamorists. Counter-culture is similar to subculture except their culture tends to actively and vocally reject mainstream cultures and they can often impact/change mainstream culture. Examples include Alt-Right, Antifa, (old) LGBTQ+, and the civil rights movement.

In America, rich, politicians, and celebrities "define" the mainstream culture. This also tends to be white, upper-middle class culture in America.

## Analyzing Other Cultures

  • Ethnocentrism: Tendency to analyze other cultures using your own culture as a "normal standard".

  • Cultural Relativism: Belief that something can only be understood and judged in relation to the cultural context in which appears.

# Social Structure & Interaction

  • Society: A system of social interaction. Typically geographically based with interdependence among people.
  • Social Interaction: Behavior between people with a meaning. Helps form social bonds. Foundation of society.
  • Social Organization: Order established within social groups. A structured system/pattern of social relationships in a group of people. This makes society easier to understand.
    • Formal Social Organizations: Goal directed. Military, universities, hospitals.
    • Informal Social Organizations: Not goal directed. Friend groups, individual relationships, social groups.
  • Social Institution: Established, organized system of social behavior with a recognized purpose.
    • Great example of functionalism.
    • Examples: Family, education, religion, government, work, economy, sports, mass media.
  • Social Structure: Underlying pattern of interaction and social relationships. Can both enable and confine someone. Society is made up of social structures.
    • Examples: Social class (access to goods), economy, the government.
  • Status: Established position in social structure, carrying certain rank, value, and meaning.
    • Achieved Status: Attained through effort.
    • Ascribed Status: Assigned from the features of the person. Had from the moment of birth.
    • Master Status: The most dominant status that a person has. Generally overrides all other statuses.
  • Role: Behavior others expect from a person in a status.
    • Example: Police, students, professors, doctors, men, women.

People try to study society at two levels: macro and micro. Macro level studies an entire society, looking for large patterns, often simplifying certain things. Micro level focuses on individuals, analyzing patterns within a single person's life.

Why do we form a society? Well, there's a lot of reasons, but broadly we say it is necessary because of solidarity.

## (Durkheim's) Social Solidarity

  • Mechanical Solidarity:
    • Social cohesions from homogeneity of people.
    • Everyone plays similar roles (hunter-gatherer societies)
    • Social bonds based on common sentiments and morality.
    • Became less important as society grew.
    • I'm pretty sure this has never actually been important.
  • Organic Society
    • People specialize and play a variety of roles.
    • Unity is based on need of other people's specialties.
    • "Division of Labor"

## Interaction

Interaction occurs between a collection of interconnected social groups. In these groups, people communicate, have common goals/norms, and has a subject sense of "we".

Note: Categories, people with some common features, aren't necessarily social groups.

## Formal Organizations

There are broadly 3 categories

  • Normative Organizations: Voluntary organizations where people pursue goals they enjoy / find worthwhile.
    • Examples: service, civil rights, religious
  • Coercive Organizations: Largely involuntary organizations where people have a need to be there.
    • Examples: prison, hospital
  • Utilitarian Organization: Organizations people join for a specific purpose. They aren't intrinsically enjoyable.
    • Examples: companies, colleges

Often, social organizations become a bureaucracy, which is an example of rationalization. Bureaucracies organize individuals to be more efficient and are large and impersonal and large, but organize individuals.

### Ideal Type Bureaucracy

An ideal type bureaucracy is the ideal bureaucracy that satisfies the following; it would be the "most efficient" social organization/bureaucracy:

  • High degree of division of labor: Be more efficient.
  • Hierarchy of authority: Be more efficient.
  • Rules and regulations: Treat everyone equally.
  • Impersonal: Treat everyone equally.
  • Career ladders: Encourage people to work.
  • Efficiency: Be more efficient.

### Informal Structure of Bureaucracies

However, real bureaucracies are never ideal type because we're humans and we can't really be impersonal. This means bureaucracies have an informal structure, which are activities which violate/bypass the formal structure of the bureaucracy. For example, people preferring their friends or people from a certain group. This is what we call corruption.

### Problems with Bureaucracies

  • Ritualism: Excessive following of rules.
  • Alienation: When a person is mentally separated from the organization and its goals. People feel like they are just "cogs in a machine".
    • Issues: Increased turnover, tardiness, low satisfaction.
  • McDonaldization: Basically hyper-rationalization with a focus on the negative effects (e.g. impersonal structure).
    • As you could probably guess, this comes from McDonald's and the general fast food industry's philosophy being applied to other things.
    • Pros: Cheap, efficient, quick, consistent, wider range of goods to more people (cheap), people (normally) treated more equally, culture spreads easily.
    • Cons: Deskilling (workers are replaceable), impersonality, workers (normally) paid worse, consumer workers (e.g. self-checkout), worker burnout.
    • Main Dimensions:
      • Efficiency: Always do things the same, efficient way.
      • Calculability: Assess outcomes quantitatively.
      • Predictability: Encourage homogeneity.
      • Control: Replace human labor with more predictable things (e.g. machines) wherever possible.
    • Identified by Ritzer.

# Social Networks

  • Social Networks: The graph/network of relationships between people, where people are nodes and relationships are edges.
  • Social Capital: Resources available to people through their network.
    • "Embedded" in social networks.

Society is generally organized as a graph of "bubbles", where the bubbles have weak ties between then and strong ties within them.

  • Weak Ties: People you see / hang out with only occasionally. Very cheap.
  • Strong Ties: People you see / hang out with regularly. Very expensive.

For job searching, weak ties are more important because they are far more expansive and often have access to unique information and contacts.

## Network Exclusion

Often, particular groups of people are excluded, either intentionally or unintentionally. (This is called nepotism.) Why?

This can be due to intentional/explicit segregation or subconscious bias. However, most common is people in the network are similar, so they are more likely to have opportunities for networking (through people wanting to hang out). Additionally, if people don't already have a connection to a network, it is difficult to make those initial connections because no one knows you and you are likely to not have significant things in common, making it harder to make those connections and network.

Another difficulty is people don't always notice they're being excluded, so what can they do?

# Conformity

  • Conformity: When people do/think things they otherwise wouldn't because of group influences.

Generally, people conform to authority and group influences because they either want to fit in or feel less responsible for their actions because they are in a group. The responsibility issue is easiest seen with the Kitty Genovese case and the bystander effect.

Conformity can be both good and bad. We mostly talk about bad thought.

## Milgram Experiment

You should remember this from AP psychology. This is the experiment where the researcher commanded people to shock an individual. The people could "hear" the other person being shocked, but they couldn't see them (because they were recordings). The purpose of the experiment was to see how people will react/listen to authority. It was inspired by Nazi Germany.

85% of people gave the maximum voltage.

## Asch Conformity Experiment

There was a group of 5 people. Only one person (the final one) was an actual subject. They had to judge the length of lines. On certain questions, every confederate would give an incorrect answer vocally and then the subject answered vocally. Another variation was every confederate except one would give an incorrect answer vocally and then the subject answered vocally. Another variation was where every confederate gave an incorrect answer vocally and the subject answered on paper.

There were two main reasons people changed their answer: conflict avoidance or affecting their actual beliefs/views.

37% of the people gave the incorrect answer when every confederate gave the incorrect answer.

5% of the people gave the incorrect answer when every confederate gave the right answer but one gave the right answer.

## Kitty Genovese / Bystander Effect / Diffusion of Responsibility

You should remember Kitty Genovese from AP psychology. She was murdered and several people were aware of her being murder, but no one called the police. This was due to the bystander effect and also a fear of danger, from the murderer.

The bystander effect is the more people that witness an event, the less responsible each person feels. This means people are less likely to take action.

## Examples

  • Current American immigration camps
  • Me Too movement (both before and during)

# Inequality and Stratification

## Causes of Poverty

There are two main arguments for the cause of poverty: cultural and structural.

### Cultural

The culture of poverty argument or blaming the victim argument attributes the causes of poverty to the personal work values / irresponsibility of the poor. Broadly denounced.

### Structural

There are multiple parts, but broadly it attributes poverty to the forces in an economy and society. There are a 3 main parts.

  • Economic Restructuring: Recent changes in the economy have made things worse for working class.
    • Decline in manufacturing leads to worse jobs (e.g. service jobs)
    • Rise of globalization
  • Job Openings: Most newer jobs are low-paying.
  • Limited "Opportunity Structure": Not enough "good" or "appropriate" jobs for people.

## Stratification

Stratification is a fixed, hierarchical arrangement/ranking in society where people have different access to resources/power/perceived worth. Structured inequality. There are a variety of stratification systems:

  • Estate System: Feudalism, where people are bound to owners.
  • Caste System: Strict, hierarchical organization, where people are born into and bound to a specific caste for life.
  • Class System: Less-strict, hierarchical organization, where people can potentially change.

Social class is the social position of groups relative to the cultural, economic, and social resources. Essentially, a group of your life changes.

We cannot directly measure social class, instead we use some indicators:

  • Income
  • Occupational Prestige: How much do people respect your job
  • Educational Attainment
  • Sometimes also occupation and place of residence

Note: These do not strictly define class.

Status attainment is the process by which people gain a specific position in a stratification system. Socioeconomic status (SES) is commonly how we describe status, and it includes the above measures.

# Gender and Sexuality

  • Gender Socialization: Process by which people learn about the expectations and identities for your gender in society.
  • Femininities and Masculinities: Traits acquired during gender socialization.
    • It is plural because there are many different forms and traits within a society, based off ethnicity, age, social class, etc.
  • Homophobia: Negative attitudes towards non-straight people.
    • Homophobia is more prominent in men, as a way to discourage feminine traits in men.
  • Gender Identity: Person's definition or perception of themselves as a particular gender.
  • Transgender: People whose gender identity and/or gender presentation differs from the gender they were "assigned" at birth due to their sex.
    • May take hormones or surgery to change physical aspects of their physical sex.
    • Sometimes has different terms such as genderqueer, agender, and gender fluid.
    • Violence against transgender people is very high.
  • Intersex: Individuals who are born with both genitalia.
  • Sexual Identity: Internal sense of one's sexual self.
  • Sexual Orientation: Element of sexual identity referring to who you desire (fantasies), who you want to have sexual relations with (behaviors), and who you feel connected to (feeling).
    • We tend to simplify hugely. It's not a binary, but a spectrum.
  • Sexuality: Capacity to sexual feelings towards certain groups.
    • This tends to be organized as a continuum.
  • Asexuality: Lack of sexual attraction, desire, etc. Not just low sex drive.
    • Outside of the continuum.
  • Heterosexism/Heteronormativity: Belief that heterosexuality is superior to other sexual orientations.

In society, gender and sexuality are incredibly linked.

Recall that sociologists discuss the social construction of gender, where they draw a significant difference between sex and gender:

  • Sex: Biological male or female. Given by genetics.
    • Biological Determinism: Attributes gender differences to physical differences of the sexes.
  • Gender: Socially learned expectations, identities, and behaviors associated with each sex. A system of social practices that creates the gender categories.

## Theories of Gender

### Gender Performance

This theory is similar to the dramaturgy theory of social interaction applied to gender and sexuality.

This was created by West and Zimmerman in 1987 and onward.They argue that gender is interaction, a routine and standard of interaction which is shaped and evaluated by everyday interactions.

Basically, gender performance is about doing gender and receiving recognition of that gender. When you do gender, you reproduce the existing social order.

### Intersectionality

Intersectionality attempts to look at overlapping/intersecting social identities and how they create unique specific systems of oppression and discrimination. Essentially, you can't create overlapping buckets and expect the overlap to behave the same as the non-overlap.

This was coined by Kimberle Crenshaw in 1989.

The biggest example is analyzing the discrimination against women of color. You can get a more full analysis if you analyze the discrimination of women and the discrimination of people of color. Then, you synthesize this discrimination to understand discrimination against women of color.

### Hegemonic Masculinity

Hegemonic comes from hegemony.

This was created by R. W. Connell in 1995.

Hegemonic masculinity argues that there is a hegemonic masculinity that is the ideal vision of masculinity. This ideal vision of masculinity justifies the dominant position of men. Many men attempt to achieve hegemonic masculinity, but are disqualified for some reason. Men who cannot achieve this instead achieve subordinate masculinity. Examples of subordinate masculinity are gay men or men of color.

Hegemonic masculinity also argues that there is an emphasized femininity that is the ideal vision of femininity. It justifies the subordinate position of women. Likewise, women try to achieve emphasized femininity. Women who don't achieve these ideals are likewise seen as lesser than those who do.

Hegemonic masculinity says that, even if you have subordinate masculinity, you still benefit from it because of the subordination of women. It also argues that you can only analyze femininity and masculinity in relation to each other.

# Racial Inequality

Overall, race, ethnicity, and everything can be changed and are normally defined by the group in power. In other words, they are socially constructed.

  • Race: Distinct group in society based on some biological characteristics.
    • Almost entirely biological.
    • Examples: skin color, lip form, hair texture.
  • Ethnicity: Distinct, but not necessarily exclusive, group that is based on cultural similarities.
  • White: Light skinned people of European descent.
  • Whiteness: Construction of white race, white culture, and the system of privileges.
    • Early in America: White Anglo Saxon Protestants where white.
    • Now: Any western European (for the most part).
  • Prejudice: Beliefs about some group that is unlikely to change based on evidence.
    • Includes: racism, stereotyping, scapegoating
  • Discrimination: Actions which negatively impact some group. These are motivated by prejudices.

## Mass Incarceration

  • Mass Incarceration: Process by which people are placed in criminal justice system, branded as criminals and felons, locked up for extremely long periods of time, and then released and second-class citizens.
    • Began in the 1960s, when we changed from rehabilitation for drug addiction to punishment/imprisonment.
      • 1963-1993 incarceration rate increased independent of crime.
    • Marked by President Nixon's War on Drugs (1970s).
    • Disproportionately affects minorities (especially black) and men (with the intersection having it the worst).
  • Institutional Racism: Racism in the day-to-day operation of social institutions/structures, codified in the rules, policies, and practices of these institutions.
    • Basically, routine and unequal treatment.
    • Worse than individual racism because its widespread and better at prolonging itself.
    • Opioid Epidemic vs War on Drugs: The opioid epidemic is more focused on rehabilitation and affects whites more. The war on drugs was more focused on imprisonment and affected blacks more.
    • Education System: Black and Latino student bodies receive significantly less funding than whites.

Prisoners and felons become second-class citizens because they lose the right to vote, can no longer serve jury duty, and are legally discriminated against in employment and housing.

Mass incarceration is a race issue 1.5 million black men are "missing".

Michelle Alexander (2014) argues that mass incarceration is a system of racial and social control, which has ushered in the Negro problem of poverty. She argues prisons has been used a "solution" to this problem. She also argues that prison privatization has caused additional issues, where people profit off of imprisonment of people.

## Colorblind Racism

Bonilla-Silva (2009) attempted to explore the intent, methods, and analysis for current racial inequality. Basically, he argues that colorblindness is a new form of racism, where people ignore/fail to acknowledge real racial inequality. This causes people to not address the actual institutional racism. It also discounts the affect race has on people's lives.

This is often called the new Jim-Crow.

He split his analysis into four main causes for the modern racial inequality.

  • TODO

# Fighting Inequality

Why don't people resist inequality?

  • Current system is legitimized by certain ideologies. For example, equal opportunity.
  • People don't see realistic alternatives.
  • People don't realize that there is inequality.
  • People don't realize when they're causing inequality.
  • Even if you're resisting inequality successfully, it will take years to see any change.
  • People are depoliticized, meaning they feel powerless to change things and essentially give up or stop caring.
  • People derive benefits from the inequality.
  • Several people are still doing well with the status quo, so they are not motivated to change things. Middle class inertia.

# Family

## Divorce

  • Crude Divorce Rate: Relative to general population.
  • Refined Divorce Rate: Relative to unmarried women population.

Crude Divorce Rate

Refined Divorce Rate

Note: Several states stopped keeping track of marriage rates from 1998 to

As you can see, by in large divorce is more common than it used to be because of

  • Legality: No fault divorce laws make it so you don't have to prove a "breach of the marriage contract" (e.g. infidelity or abuse).
  • Societal Perspective: Divorce is not stigmatized.
  • Romantic Love Fades: People often marry when they're just in romantic love.
    • Companionate love is not tied to sexual passion and develops more gradually.
  • Rise of Individualism: People can feasibly live separately.
  • Feminism: Women are less economically dependent on men.
  • Stress of Marriages: Sharing finances is incredibly difficult, especially since women are more independent economically. Children exacerbate this because they're expensive.
    • Strongly impacted by the economy.

However, the divorce rate has decreased in recent years because of

  • Increased cohabitation before marriage, meaning people are more "experienced" by the time they marry in general.
  • People are waiting longer to get married in general, meaning they are more likely to find "the right person" or to be stuck.

# Work & the Economy

## Industrial Revolution

In the 1800s, the industrial revolution occurred. It has the following effects:

  • Skilled workers replaced by unskilled workers operating "skilled" machines.
  • Longer hours.
  • Lower pay because unskilled laborers.
  • Workers could be more easily replaced.
  • The rise of unions.

## Deindustrialization

Deindustrialization is the decline in manufacturing and the rise in service jobs. It was brought about by

  • Rise of Automation: Don't need unskilled workers at all anymore.
  • Globalization: More developed nations' workers had to compete with less developed nations' workers.
  • Rise of Consumerism: Cheaper goods led to higher demand.
  • Rise of Service Sector

## Dual Labor Market Theory

The market's jobs can be broadly split into two markets:

  • Primary Labor Market: High wage jobs with good benefits, good working conditions, opportunities for promotion, job protection, and due process.
    • More likely to be unionized and men and majority.
    • Examples: Engineering, law, medicine, executives.
  • Secondary Labor Market: Low wage jobs with poor benefits, high turnover, poor working conditions, and have little opportunity for advancement.
    • More likely to be women and minorities.
    • Examples: Service, retail, fast food jobs, grocery workers.

## Types of Capitalism

Capitalism is a fuzzy system that has a bunch of different effects and facets. Competitive capitalism is the ideal, but it leads to monopoly capitalism because the most competitive firm often purchases the less competitive firm or the less competitive firm goes out of business (and the less competitive firm's workers and customer often head to the more competitive firm).

  • Competitive Capitalism: Large number of small firms. No firm dominates.
  • Monopoly Capitalism: One or a few (oligopoly) huge cooperations dominate certain markets (can be one or many markets).

## Applications to the United States

C. Wright Mill' power elite theory says there there exists a power elite that controls a large amount of wealth, privilege, and political power. This power stretches across institutions: government, military, and economy. They are largely unified on their desire to maintain power, although they have some disagreements.

## Occupational Sex Segregation

This is a bit of gender and a bit of economy. Occupational sex segregation is where, in the same job, there are differences in how men and women are treated. There's a few explanations for this:

  • Neoclassical Explanation: Sex segregation in the workplace suggests men and women allocate different amount of effort between workplace and the household. Basically, says women put more effort into family.
    • Shown to not hold in recent years. It's not the "effort" but more the traits associated with the job (i.e. some jobs are "manly" and some are "womanly").
  • Women Sustain Disadvantage in the Workplace: Traditional ideologies are upheld in the workplace by employers ranking prospective employees on their potential productivity and their characteristics. Women are seen to be more likely to quit / be less productive because of children. Also, since most of these jobs are already male-dominated, the employers and current employees are more likely to highly rate men, since they are in their ingroup. This is an example of the old boys network.

One of the biggest effects of occupational sex segregation is in terms of pay and the gender wage gap. The pay gap comes from women generally being in lower paying jobs and women being paid less within the same job. Interestingly, previously female dominated jobs tend to be higher paid when they become male dominated.

This has led to the devaluation hypothesis which says that female dominated jobs are paid less because society devalues women's labor.

There's also the glass ceiling for women, which describes how women who enter male dominated fields tend to eventually hit a "ceiling" in their promotion, where they eventually are no longer promoted. There's also the glass escalator for men, which describes how men who enter female dominated fields tend to be more readily promoted into management.

Theres a concept of emotional labor, which is the management of your feelings and emotions for job. This puts a lot of stress on the individual and increases rate of depression and mental illness. Service and secondary labor market labor tends to be more emotional labor heavy. Women tend to have more service jobs, meaning they have a higher rate of depression and mental illness because of their jobs.

# Education

  • Meritocracy: System based on the ideology that all people have an equal chance of succeeding with hard work.
    • Requires people's background to be unrelated to mobility.
    • Idea: People succeed based off their own merit.
  • Tracking / Curriculum Differentiation: Separating students within schools according to some measure of ability.
    • Issues:
      • Lack of standardization.
      • Non-standardized tracking policies.
      • Race and class affect student placement.
      • Lack of mobility across tracks. (Working class students are often tracked into vocational education.)
      • Subjective / non-objective measures can be used (e.g. parents just asking).
    • This worsens educational inequality and segregation.
    • Basically, AG, AP, NCSSM, and the like.
  • Districting / Redlining: The process of explicitly or implicitly districting schools along race and income lines.
    • Worsens educational inequality especially by race and income.
  • Stereotype Threat: Individual has stress/fear of confirming negative stereotypes about their race / gender.

America strives to be a meritocracy. However, it is unequal with the following failures

  • Students with highest reading and math scores at end of high school are parents who have most education.
  • Asians and Whites are more likely than Blacks and Latinos to complete high school and attain higher education.
  • Women have better high school completion rates and are more likely to attain higher education.

## Coleman Report

James Coleman (1966) estimated how much schools differ in equality and found that achievement was most related to teacher quality, family background, and racial composition. He found that black children in integrated schools did better than those in non-integrated schools.

Coleman's report was against school redlining or segregation.

## Gender in Education

Women are more likely to be more educated. However, they receive less rewards. What gives?

  • Differential Reference Groups: Women compare themselves to other women, seeing that women can do well with high education.
  • Pollyanna Hypothesis: Women see gender inequality to be thing of past, so who gives a shit.
  • Social Powerlessness: Women go to college to get a rich man.
  • Sex-Role Socialization: Women tend to believe that their abilities are innate and unchangeable, but men tend to believe that can develop or improve their abilities with practice and effort. This
    • The evidence for this is that girls with higher IQ tend to give up more quickly than those with a low IQ.

# Lareau (2011) - Unequal Childhoods

In most cases of child care, social class trumps race, since race is something other people interpret while social class is something you feel.

## Parenting

You can sum up the difference in that broadly poor parents see their children as kids to provide for while rich parents see their children as growing adults to nurture. To use her terms:

  • Concerted Cultivation: The process by which middle class parents raise their children to interact with and question adults through many diverse, organized activities. Organized leisure activities controlled by parents to help a child develop.
  • Accomplishment of Natural Growth: The process by which poor parents raise their children by providing their necessities and making sure they are healthy and alive. Generally, they stay out of the child's social and emotional life; believing that it will unfold naturally.

Although this divide makes rich/middle-class parents sound strictly better, there are economic differences. Middle class parents don't have to worry about food, basic medicine, or how to keep your child healthy and alive as much.

Concerted cultivation tends to better prepare children for being adults but is more stressful.

Accomplishment of natural growth tends to lead to more relaxed children who are more capable of creating activities by themselves. The nature of poor parents also tends to make the children less trusting of and more apprehensive around authority.

This does cause issues though because schools encourage concerted cultivation, which causes dissonance or something for poor kids.

Our dominant set of cultural repertoires (or the way we think about something) for children tends to be that it is best to treat them like adults and to reason with them, but these change all the time. Rich parents also tend to change more quickly. Since rich parents adopt more quickly, they tend to be more in-line with the common body of education thought (i.e. schools). This gives the children and parents an advantage of being considered "better" by the school.

## Children

Rich children tend to have a sense of entitlement, where they believe that they deserve to manage their own time and have their opinions be heard. They tend to be better at expressing their wishes and manipulating adults to give them what they want. They tend to be worse about organizing their time and being considered subordinate to adults.

Poor children tend to have a sense of constrain, where they are unlikely to make special requests, tend to not resist authority figures (as much), and tend to disregard rules (e.g. encouraging/being proud of your kid "beating up" another kid).

Poor children tend to see their parents fail to change institutions / have them listen, while rich children tend to see their parents succeed.

# Rank (2011) - Rethinking American Poverty

Generally, America has viewed poverty as a personal failure. This means we broadly don't feel socially obligated to help them. This is seen by our lack of sympathy for working-age poor, but large(r) sympathy for old poor.

This refusal of reality allows us to reinforce our ideals: individualism and self-reliance, hard work pays off, and there are economic opportunities for all. This has also led to hyper-competitiveness, as people try to "improve" the system by just making everyone better. However, the real problem is lack of opportunity.

Additionally, things have been getting worse. Jobs are not as stable, health care benefits are worse, wages are stagnated, and many social welfare programs are being cut.

## Necessary Changes to Solve Poverty

  • Recognize that poverty indirectly affects everyone in society.
    • Poverty has a steep price (e.g. emergency room visits rather than yearly checkups, social programs, higher rate of doing crime)
    • Many Americans will experience poverty at some point (e.g. 66% on social welfare at some point, 60% in poverty for a year)
    • "Out of sight, out of mind" oftentimes with inner city or rural.
    • It's been getting worse.
  • Realize that the existence of poverty is a structural issue.
    • Caused by our economics and politics.
    • While there may be individual reasons for poverty (e.g. lack of education), these can also be structural issues. Also, this doesn't explain lack of opportunity in the first place. (That is, why do people have to lose?)
    • Economy has been producing more low-paying, part time, and no-benefits jobs.
      • 33% of jobs pay less than $11.50
    • Think of musical chairs analogy. Sure, the losers may have reasons for being slower (i.e. old or disabled), but why don't we have enough chairs?
  • Taking a more proactive approach towards preventing poverty, by viewing it as a moral injustice. This would prevent / make more abuses more difficult.
    • Examples of Abuses: burnout, pay cuts, reduction in benefits
    • In 1980, a CEO was paid 42 times that of an average worker. Now, it is 400 times.

## Stats

  • 50% of children will be on food stamps at some point in childhood.
  • Bottom 60% hold less than 1% of wealth.
  • 66% of counties where black children are growing up and considered high poverty.

# Rist (1970)

  • Goal: Understand how schools reproduce the class structure and divisions of society.
  • Methods: Longitudinal observational study. She started observing children in kindergarten. She went through to at least 2nd grade.

Her takeaways in kindergarten were that the teacher divided the class into three tables. Table 1, table 2, and table 3, with the following behaviors.

  • Table 1:
    • "Fast learners".
    • 0 smelled like urine.
    • More likely to be middle / upper class.
    • Had middle class cultural capital, like the teacher.
    • Learn directly from the teacher through her direct interactions with you.
    • Generally felt superior to table 2 and 3. Made fun of table 2 and 3.
  • Table 2:
    • "Slow learners".
    • 2 smelled like urine.
    • Learn through watching the teacher interact with table 1.
  • Table 3:
    • "Slow learners".
    • 5 smelled like urine.
    • Learn through watching the teacher interact with table 1.

For 1st and 2nd grade, the same division occurred, where students were unlikely to change their group. In 1st grade, these tables became tables A, B, and C respectively. In 2nd grade, these tables became the Tigers, Cardinals, and Clowns.

\ No newline at end of file diff --git a/notes/ncsu/2f/soc202/refined_divorce_rate.png b/notes/ncsu/2f/soc202/refined_divorce_rate.png new file mode 100644 index 0000000..a571e50 Binary files /dev/null and b/notes/ncsu/2f/soc202/refined_divorce_rate.png differ diff --git a/notes/ncsu/2f/st370/index.html b/notes/ncsu/2f/st370/index.html new file mode 100644 index 0000000..35675b1 --- /dev/null +++ b/notes/ncsu/2f/st370/index.html @@ -0,0 +1 @@ +Eli | ST 370: Probability & Statistics for Engineers

ST 370: Probability & Statistics for Engineers

Instructor: Dr. Paul Savariappan | Semester: Fall 2019

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/2s/csc236/index.html b/notes/ncsu/2s/csc236/index.html new file mode 100644 index 0000000..53971dd --- /dev/null +++ b/notes/ncsu/2s/csc236/index.html @@ -0,0 +1,252 @@ +Eli | CSC 236: Computer Architecture & Assembly

CSC 236: Computer Architecture & Assembly

Instructor: Dr. Vincent Freeh | Semester: Spring 2020

Table of Contents

# Views of System

There are two orthogonal views of a system, logical and physical. Logical is reasoning about function. Physical is reasoning about construction. This class attempts to analyze a computer using both. Logical view is also the architectural view.

# Number Systems

Computers, like us, use a positional number system. You already know this, so I won't go too deep into it, but basically to find the value v of some string of digits D in some radix r (or base), you do

v=∑di∈Ddi∗ri.

In this class, we will follow the math standard of postfixing a number with a subscript of the radix (or base) rather than the standard computer science prefix. For example, we write 1012 rather than 0b101.

## Unsigned Integers

Unsigned binary integers are pretty simple. All bits (or binary digits) are value digits.

We represent these without a + or −.

### Overflows

What happens if we run out of bits after some operation? Well, we get an overflow! This means we lose the largest bit. Think about an odometer (or some other counter) rolling over.

Note: Most hardware detects overflows like this, but software doesn't always pay attention because not all platforms support it.

## Signed Integers

There are many representations for signed integers. The most common is two's complement, but there used to be a lot of diversity.

We represent these with a mandatory + or −.

### Signed Magnitude

This was used by the Gemini program in NASA.

The MSB is the sign bit (0 is positive, 1 is negative), the rest is the magnitude. You choose the most significant bit normally because that gives the signed positive and unsigned numbers the same representation for most numbers.

0000 0111 == +7
+1000 0111 == -7
+

The rules for addition are:

  • If the signs are the sames, add the digits as if they were unsigned. The result has the sign of the operands.
  • If the magnitudes are different, subtract the digits of the smaller number from the digits of the larger number. The result has the sign of the larger number.
  • If the magnitudes are the same, the result is zero, either positive or negative.

Why isn't this used?

  • There is +0 (0000 0000) and −0 (1000 0000).
  • Arithmetic is complicated.

### One's Complement

This was used by the Apollo program, the PDP-1, and Univac 1100.

The MSB is the sign bit (0 is positive, 1 is negative). If the sign is negative, you invert the bits to get the positive version. This is really easy to do in hardware.

0000 0111 == +7
+1111 1000 == -7
+

The rules for addition are, to add the binary as if it was unsigned. Then you do an end around carry, where if you have a carry bit, you add one again.

 111
+  1110 # -1
++ 1110 # -1
+  ----
+  1100
+     1
+  ----
+  1101 # -2
+

Why is this good? Negation and addition is really quick and easy. The end around carry is simple in hardware.

Why isn't this used? It has a positive and negative zero, which have weird rules. End around carries aren't hard, but still something you have to consider.

### Two's Complement

This is used by almost all computers now.

The two's complement TC for a number with d bits is N+TC(N)=2d. We negate a number by taking the two's complement of it. In other words, we solve for TC(N) to get TC(N)=2d−N. Solve for that in your done! Luckily, in hardware there is a very easy way to do this. You just flip the bits and add one. When looking at the binary as a person, you keep everything to the right of the first 1, including the 1, and flip everything to the left.

0000 0111 == +7
+1111 1001 == -7
+

The rules for addition are, just add the binary as if it was unsigned. That's it!

Two's Complement Wheel

Why is this used? It has the all the benefits of one's complement, but it only has a single 0. Nice!

How do you detect overflow? When summing numbers with like signs, the result should have the same sign. When summing numbers of different signs, they cannot overflow, since the magnitude is decreasing. In hardware, you just make sure the sign bit is the same as the carry-out bit.

# Multiplication and Division

Sadly, no one has found out a way to do signed and unsigned multiplication (and division) with the same instruction.

## Multiplication

Multiplication can get really big. x digits times y digits requires x+y digits. So, how do you multiply two words? It could give you a 32 bit back, in x86 we handle this by storing the result in a different place and potentially in two registers.

  • [i]mul byte: al * byte = ax
  • [i]mul word: ax * word = dx:ax

Note: mul is unsigned multiplication. imul is signed multiplication.

For performance reasons, we often to know whether we ended up needing more space than you were originally used (basically another digit). We store this information in the carry flag (CF), to tell you if the significant part of the solution outgrew your original data size. (CF=1 means it did outgrow. CF=0 means it did not.) This works because multiplication can never overflow.

Weirdly, you can't multiply by an immediate, only a register or memory value.

## Division

We often care about both the remainder and the quotient, so we store both the remainder and quotient.

  • [i]div byte: ax is the numerator, byte is the divisor. ah is the remainder, al the quotient.
  • [i]div word: dx:ax is the numerator, word is the divisor. dx is the remainder, ax the quotient.

Note: div is unsigned multiplication. idiv is signed multiplication.

Note: Status flags are not updated by divide.

If you want to convert a word into long / double word, you use the cwd instruction. This acts on ax.

You can get a divide overflow by not having enough space for the quotient. (You'll always have room for the remainder.) If you get a divide overflow (e.g. by dividing by zero or by dividing something large by something small), DOS interrupts your program and then terminates it. The way to get around this is normally either to check your division before you do it or to write an interrupt handler. You probably shouldn't do this.

We won't prove it here, but if the upper half of the digits of the denominator is less than that of the numerator, then the division will overflow. Otherwise, it won't. In other words, we want a large denominator to not overflow.

The sign of the quotient acts exactly like you think it would. For the remainder, you have to deal with negative remainders. Remember that the remainder is defined as quotient * divisor + remainder = value. For example, the remainder of −1/5 is −1 because the quotient would be 0.

# Computer Architecture

Modern computers follow the John von Neumann architecture, where there is memory, which holds instructions and data, and a processor, which executes instructions on data.

Note: Most of what a CPU has is actually a cache.

## Anatomy of Instructions

Instructions (and thus assembly) is made up of opcodes and operands. Opcodes define what operation you want to perform and operands define what data you are operating on.

Instructions are normally executed in a pipeline, where each step of the pipeline performs some different operation. Multiple instructions can be in the pipeline at once, allowing the CPU to execute "multiple things at once". However, sometimes the pipeline has "bubbles", where nothing is occupying that spot in the pipeline. This is due to conditional branching primarily. The hardware can get around this with speculative execution, where it takes a guess and either trashes the pipeline if it guessed wrong or executes as normal if it was right. (This isn't important for this class.) A standard, simple pipeline is fetch, decode, execute, and store.

Note: Modern Intel CPUs have complex instruction sets, but they have a "translator" that converts the instructions into CISC operations, which are actually executed.

There are two main "philosophies" on what instructions the hardware should provide and why.

### Complex Instruction Set Computer (CISC)

The hardware provides many functions natively, having many special instructions and many address modes. What was used primarily from the 1960s to 1990s. x86 is CISC.

Why is this no longer preferred? Instructions have variable size and variable execution time. This tends to make it slower and harder to decode.

### Reduced Instruction Set Computer (RISC)

The hardware provides few instructions natively, only having simple load and store from memory and the rest operating on registers.

Why is this now preferred? Instructions have fixed size and have fixed execution time. This makes it faster and easier to decode.

## Memory Technology

There are a bunch of different kinds of memory which are used at different times because of their different strengths and weaknesses.

  • SRAM (Static Ram): Fast, expensive, uses transistors. Used as part of CPU cache.
    • 6 transistors per bit.
    • Access Time: 5-10 ns.
    • ~$1000/GiB.
  • DRAM (Dynamic Ram): Slow, less expensive, capacitors. Used as part of main memory. Bunch of types.
    • 1 transistors and 1 capacitor per bit.
    • Access time: 50-150 ns.
    • ~$10/GiB.
    • Types:
      • EDO: Faster DRAM.
      • SDRAM: Synchronous DRAM.
      • DDR-SDRAM: Double Data Rate SDRAM.
      • RDRAM: Rambus DRAM.

There's also SCM (storage class memory), which is basically an SSD that is as fast as RAM.

## Anatomy of CPU

  • Registers: Data held within the CPU. Can be general purpose or contain CPU state.
    • Special Registers (x86):
      • Program Counter / Instruction Address Register (IAR): Address of next instruction. By default, it increments after every instruction.
  • Arithmetic Logic Unit (ALU): A chip containing circuits which do various operations, which the CPU can select.
    • Common Chips:
      • Add
      • Invert
      • Boolean Logic (AND, OR, etc.)
      • Multiply / Divide (less common)
  • Instruction Decode Unit (I Unit): Fetches opcode, updates IAR, finds effective address (locate data), sends control to E unit.
    • Address Mode: Instructions on how to determine effective address.
    • Effective Address: Actual location of data; provided by address mode.
  • Execution Unit (E Unit): Executes provided instruction.

## Memory Bus

The magic that makes the CPU and DRAM talk.

  • Address Bus (CPU -> Memory): Carries desired memory address from CPU to memory.
    • 64-bit computers "can" address 264 bytes, but most only implement 236.
  • Data Bus (CPU <-> Memory): Sends data to the CPU or to the memory, depending on read/write line.
  • Address Valid Line (CPU -> Memory): Must be set for memory to send data over data bus.
  • Read/Write Line (CPU -> Memory): Whether the CPU is writing to memory or the memory is sending to the CPU.
  • Clock Line (CPU -> Memory): Keeps CPU and memory in sync.

# History

DOS was less of an OS and more of a monitor. The processes it started had complete control of the computer. DOS would just ask you what you want.

## Software

There were three big players: IBM, Motorola, and Intel. IBM was the biggest and there were many others.

When the PC age came in, the biggest player IBM bought hardware from Intel and software from Microsoft. Why? It was far cheaper to do since IBM's hardware was focused on high-quality mainframes.

Motorola had a 16 bit 6800. They decided to make a huge redesign, the 68000, which was an extremely well designed 32 bit architecture. However, the software was incompatible.

Intel had a 16 bit 8080. They decided to make an incremental redesign, the 8086, which was a 32 bit architecture that could only support 20 bits of memory. However, the software was compatible. This ended up making it when. How did they make it work? They used memory segments / blocks to indirect the desired memory address from the actual physical address.

# Architecture Woes

Computers are complex things that grow and evolve over time. Here's a chronicle of some of disagreements and compromises that have been made throughout history.

## Memory Segments

Memory on the 8086 had 20 bit addresses. However, it only have 16 bit registers. To get around this, we added the concept of segments. Note: Memory segments were a hack to get around limitations.

Segments are 16 byte blocks of addresses, where each segment is a 16 bit number. We throw away the smallest 4 bits (or last hex digit). To get the actual address, you multiple the address of the segment by 16 (add a 0 to the right in hex) and add the offset.

# Data offset
+DS = 0x1234
+# Memory offset
+memory_address = 0x5678
+# Actual address
+DS + memory_address
+0x1234 * 0x10 + 0x5678
+0x12340 + 0x5678
+0x179b8
+

We have four different types of segments:

  • Data segment.
  • Code segment.
  • Stack segment.
  • Extra segment. (Exists only because we used 2 bits to address segments.)

Why is this bad? It's an extra thing we always have to do, which is slow. We didn't extend the amount of memory a process could have, so if you need that you need to determine what segment you want, where the segment you want is, and then load it in.

Note: This no longer exists anymore for the most part.

## Endianness

Endianness used to be incredibly important when we had 1 byte or otherwise small memory buses. It no longer matters as much, but we are still bound by the legacy decision.

Intel machines are little endian, meaning that the least significant byte is stored first in memory. The alternative is big endian, meaning the most significant byte is stored first in memory.

Why be little endian? When we get large values into the CPU from memory (i.e. more than one byte), the CPU expects the smallest byte first. To prevent jumping around, we store the bytes in memory such that we first see the smallest byte.

Note: This byte reversal only occurs in memory and not in the CPU.

# x86 Anatomy

## Registers

There are 4 general purpose registers in x86, and they are 16 bit (words). You can replace the x with an h to access only the upper half (more significant) half of the register; use l to use the lower half.

  • ax: Accumulator. Default for many operations.
  • bx: Base.
  • cx: Count.
  • dx: Data.

There are also a few special purpose registers in x86, also 16 bit registers.

  • SP: Stack pointer. Location of top of stack.
  • BP: Base pointer. Location of bottom of stack.
  • IP: Instruction pointer.
  • SI: Source index. For string operations.
  • DI: Destination index. For string operations.

## Status Flags / Condition Codes

All status flags give you status on the last operation performed. Except there are some that don't set the flags.

  • SF: Sign flag. 1 means negative. 0 means positive. This only looks at the most significant bit.
  • ZF: Zero flag. 1 means last operation was zero. 0 means last operation was not zero.
  • OF: Overflow flag. 1 means overflow. 0 means no overflow. It is set when the sign of the two incoming numbers are the same but the result is not.
    • Checks signed overflow.
  • CF: Carry flag. 1 means there was a carry. 0 means there was not.
    • Checks unsigned overflow.

# DOS Anatomy

DOS was written for the 8086, which could only address 1MiB of RAM. DOS further limits this to 640KiB for user programs, of this ~100KiB is used by DOS itself. The remaining 384KiB are reserved for the ROM, BIOS, and memory-mapped for IO.

The display happens to be assigned to addresses Bx xxx. To update the display, you just write to that part of memory and the hardware handles the rest.

# Assembly

Every line of assembly is like the following. You don't always have dest or source for an opcode. You can always have a label or comment, even if you don't have an opcode.

label:
+ opcode dest,source ;comment
+
  • label: An identifier that can be used for GOTOs (or other) later.
  • opcode Short, human-readable name for an instruction.
  • dest What the instruction operates on.
  • source What the instruction gets its data from.
  • comment A command. Completely ignored by assembler.

There are a few limitations / things you have to get right:

  • dest and source must be the same size.
  • You cannot have two memory references.

Note: In this class, every line needs a comment and you put block comments in front of sections.

You can also declare data in memory like the following.

varname (db|dw) value ; comment
+
  • varname: An identifier that can be used for later references.
    • Future references must be wrapped in square brackets (e.g. [varname]).
  • db: Declare data to be bytes.
  • dw: Declare data to be words (2 bytes).
  • value: An immediate value.

## Address Mode

The address mode describes how the machine should locate the value. Here's a list of ones:

  • Register Direct: Get value from address.
    • Can always be source and destination.
  • Immediate: Hard code a value into the binary and use that.
    • Can always be source but never destination.
  • Memory Direct: Get value from memory.
    • Can always be source and destination, unless memory direct is both source and destination.
  • List / Structure: You use a register (si, di, bx, or bp) to indirectly address some piece of memory.
    • Valid Combinations:
      • Base or index optionally with displacement.
      • Base and index optionally with displacement.
    • Default Segments: You can force the segment you want by prefixing the index with a certain segment register (i.e. cs:[si]).
      • Data Segment: si, di, bx.
      • Stack Segment: bp.

## Instructions / Opcodes

  • mov: Copies source into destination.
    • Cannot move immediate into segment register.
    • Cannot move between segment registers.
    • Does not set condition code.
  • add: dest += source.
  • sub: dest -= source.
    • Due to the way hardware implements subtraction (inverting and then adding), the carry flag "shouldn't" be set the way you expect. However, Intel engineers made it so it is set how you'd expect.
  • inc: Increments dest, without setting the carry flag. It doesn't set the carry flag because inc is most often used for iteration, so you may want to keep the carry information from a previous loop. It's also unlikely that you'll has signed overflow from incrementing.
  • cmp: dest - source, throwing away values but sets flags.
  • jmp: Unconditional jump to dest as an instruction address. This normally jumps to a label or an offset, which are things provided by the assembler.
    • Just slaps dest into the instruction pointer (IP).
  • Conditional Jumps: There a large collection of different opcodes that check all the different flags we have. To use them, you must first do some arithmetic (normally cmp) and then use the appropriate conditional jump. When the condition is true, they jump; otherwise, they fall through.
    • You can look on the class website (notes 6-16).
  • int: Triggers interrupt identified by dest. 21h is the dest for DOS syscalls. DOS looks for the syscall ID in ah and the arguments in al.
    • NOTE: All DOS syscalls may use ax register. This is actually the cause of the NT bug, which was when a bunch of assembly programs broke when NT started using the ax register for the write syscall and didn't previously.
  • loop: Decrement cx and jump if cx isn't zero. Preserves condition codes.
speed db ??? ; speed in mph (unsigned byte)
+
+; Go to trouble if speed is greather than 55mph
+cmp [speed],55 ; Check speed (speed - 55)
+ja trouble  ; ja because unsigned >
+

### Syscalls

DOS decided to make 21h be the interrupt for DOS syscalls. There are a bunch of syscalls, but all of them send/receive information via the al register and are identified in the ah register.

; Read character from stdin into al register
+mov ah,8
+int 21h
+; Write character to stdout
+mov ah,2
+mov al,'a'
+int 21h
+

## Immediates

The machine has no concept of negatives. Instead, it must be managed by the programmer.

Our assembly has no special marker for immediates. You just write a number. You can prepend the number with a - to mark it as two's complement negative. You can append the number with a h to mark it as hex.

If you have multiple immediates separated by commas, they become a list.

If you wrap a character with ', then it gets encoded to ASCII. If you wrap a string with ', then it gets encoded to ASCII as a list.

## Directives

Directives are commands to the assembler, not the machine. All directives in this class look like .name.

  • .model: What memory model for the assembler to use. For DOSBOX, we use .model small.
  • .8086: Only use 8086 instructions.
  • .stack: How many bytes for the stack segment to hold. For DOSBOX, we use .stack 256.
    • You could manually change the stack segment register, but that's more complicated.
  • .data: Marks start of data segment. This is where you can define the data as described earlier. Optional.
  • .code: Marks start of code segment. This is where you can define the instructions as described earlier. Technically optional, but why would you not want it?

## Casting

To down-cast numbers, you just throw away the bits. To up-cast unsigned numbers, you just put zeros in front. To up-cast signed numbers, you extend the sign bit.

The hardware doesn't provide a direct instruction for unsigned up-casting because is easy. Since signed up-casting is more difficult, there is an instruction to convert byte to word (cbw), but it only works on ax.

; Signed Up-Casting
+.data
+a db 255
+b db 1
+c dw 0
+.code
+ ; [c] = [a] + [b]
+ mov al, [a]
+ xor ah, ah
+ mov bl, [b]
+ xor bh, bh
+ add ax, bx
+ mov [c], ax
+
; Unsigned Up-Casting
+.data
+a db -1
+b db 2
+c dw 0
+.code
+ ; [c] = [a] + [b]
+ ; Cast [a] to word
+ mov al, [a]
+ cbw ; ax = FF FF
+ ; We shift [a] to bx since cbw only works on ax
+ mov bx, ax
+ ; Cast [b] to word
+ mov al, [b]
+ cbw
+ ; Add them
+ add ax, bx
+ mov [c], ax
+

## Basic Example

The first thing you do (normally) in your assembly program is set the data segment and sometimes the extra segment. The code segment and stack segment are set by the OS.

Identifiers that start with @ are "injected" into the code by the OS loader at load time.

Note: DOS makes 21h a syscall. The identifier for the desired syscall goes in ah and the return is in al.

.data
+a db 10
+b db 55
+c db 0
+
+.code
+start:
+  ; Set up the data segment (DS). We cannot move
+  ; immediates into segment registers per the
+  ; machine design.
+  mov ax, @data
+  mov ds, ax
+
+  ; C = A + B
+  mov al, [a]
+  add al, [b]
+  mov [c], al
+
+exit:
+  ; syscall: ah = service code: al = return code
+  ; 4c = terminate
+  ; 00 = 0 return code
+  mov ax, 4c00h
+  int 21h
+
+; Mark end of source code and give it address
+; of first instruction. This is not an
+; instruction, although it looks like it.
+end start
+

## Indirect Addressing

You can use the following registers as index/pointer registers. All others are invalid because of hardware limitations.

  • si: Source index. In data segment. Program data.
  • di: Destination index. In data segment. Program data.
  • bx: Base register. In data segment. Program data.
  • bp: Base pointer. In stack segment. Subroutine arguments.

Here's a quick example.

.data
+list dw ... ; Values to sum
+
+.code
+; let mut sum = 0;
+; for i in 0..9 { sum += list[i] }
+start:
+ ; set up data segment
+ mov ax, @data
+ mov ds, ax
+
+ xor ax, ax ; ax = 0
+ mov cx, 10 ; cx = 0
+ mov si, offset list  ; si = &list
+calc:
+ add ax, [si] ; ax += *si
+ add si, 2 ; si++ (because dw has a size of 2)
+ loop calc ; do { ... } while (--cx != 0)
+

You must be careful with how you compare indirect addresses with immediates (and anything else) because the assembler cannot tell whether you want to treat the indirect address as pointer to a byte or pointer to a word. (This ambiguity doesn't exist for using direct addresses with things of known size.) To get around this, you prefix the indexing with word ptr or byte ptr. This just tells the assembler what instruction to produce.

## Subroutines

Subroutines encompass procedures, functions, and methods.

Compilers has linkage conventions (or ABI), where they expect subroutines to be called in a certain way and to be set up in a certain way. You must write your subroutines or subroutine calls following these conventions if you want a high level language (HLL) to be able to call the subroutine or for you to be able to call a HLL's subroutines.

Why use subroutines? Subroutines are self-contained and reusable, which is great software development.

Why not use subroutines? Calling subroutines can be more expensive than just in-lining the subroutine and you have to develop conventions, which increases complexity. (Compilers can easily mitigate this.)

There's a few common protocols. They're mostly split up by different concerns that can be combined freely.

  • State Management:
    • Subroutine stores, the called subroutine saves and restores all registers it modifies except for its returns.
    • Caller stores, the caller of the subroutine saves all the registers it cares about and returns them.
    • Efficient but easy to mistake, the caller saves only the live registers that the subroutine modifies.
  • Parameter Passing:
    • Use registers, simple but limited.
    • Share global variables, incredibly hard to track. Do not use.
    • Pass on stack, highly recommended and used by most HLLs.

Since x86 is a CISC, it has a call and ret instructions. call pushes the next instruction's address onto the stack and jumps to the given label. ret pops a word word off of the stack and jumps to that as if it were the address of an instruction. (Normally you use call and then ret.)

Similarly, it has a push instruction which puts a value on the stack and updates the stack pointer (sp). You could do this manually, but it is slower.

### Multiple Files

As you know, programming everything in one file can get really annoying. However, when we have a subroutine defined in a separate file, how can the assembler find it when its assembling our file?

It can't! The trick is we have to say that the subroutine's label is external via extern <LABEL> in the main file and mark the labels as public <LABEL> in the subroutine file. When the assembler sees this, it will generate a symbol table and the linker will make sure that link all the object file's symbol table's together. If it can't find some symbols, it fails, but if it can find all the symbols then it properly links them all together.

; main.asm
+.model small
+.8086
+.stack 256
+
+extrn subroutine
+
+.data
+foo dw 8
+
+.code
+start:
+ mov ax, @data
+ mov ds, ax
+
+ mov cx, 10 ; Some personal data
+ mov ax, 6 ; Arguments
+ push cx ; Save cx
+ call subroutine
+ pop cx ; Recover cx
+
+exit:
+ mov ax, 4c00h
+ int 21h
+
+end start
+
; subroutine.asm
+.model small
+.8086
+; DON'T REDEFINE .stack
+
+public subroutine
+
+subroutine:
+ mov cx, 123 ; Trash cx
+ mov ax, 5 ; Return value
+ ret
+
+end ; NO START ROUTINE
+

### Putting Assembly and HLLs Together

To write assembly for a high level language (or a specific compiler), you have to conform to the language's API. This is because the compiler generates things in a certain way and the assembly needs to look like the compiler expects.

For C, subroutines are called by pushing arguments to the stack (in reverse order) and functions with name <name> become subroutines with name _<name> (i.e. they prefix the name with an underscore). Additionally, the callee is responsible for saving bp, si, di, ss, and ds while the caller is responsible for all others.

Why does C specify that you should push the arguments in reverse? It is because C functions can have variadic arguments.

For the subroutines to get the arguments off the stack, the subroutine has to look back into the stack. This is done by copying the stack pointer to the base pointer and looking up a known offset to the subroutine. If you're not pushing anything in your subroutine, you don't actually need to copy the stack pointer.

; int rc = asmprint('x', 5);
+main:
+  ; Push the arguments onto the stack. C does
+  ; this in the opposite order because it means
+  ; adding arguments
+  mov ax, 5
+  push ax
+  mov al, 120
+  push ax
+  ; Make the call
+  call _asmprint
+  ; Pop the arguments you pushed onto the stack
+  add sp, 4
+  ; Retrieve the return value, returned in ax
+  ; by convention
+  mov [rc], ax
+
+_asmprint:
+  push bp
+  mov bp, sp
+  ; 4 to skip the IP pushed by call
+  mov dl, [bp + 4]
+  ; 4 to skip the IP pushed by call
+  mov cx, [bp + 6]
+  mov ah, 2 ; Plan to read
+asmprint_loop:
+  int 21h
+  loop asmprint_loop
+
+  ; Set return value
+  mov ax, 0
+  pop bp
+  ; We'd have to pop stuff off the stack if we
+  ; had pushed
+  ret
+

Security Note: Whenever you make a call to a subroutine within a subroutine your arguments are visible to the subroutine.

Note: Since 64-bit Intel chips released 8 general purpose registers, C started passing arguments in these registers. It tried to put the first 6 arguments in the double word registers.

## Stack

On the 8086, the stack grows downwards and by units in words. The stack pointer (sp) points to the start of the stack, getting decremented by 2 whenever its pushed and incremented by 2 whenever its pushed.

If we want re-entrant code (i.e. the subroutine can be called as many times as you want concurrently), you aren't allowed to store any values explicitly in the data segment. (Imagine if you made a recursive call to a function that stores values in the data segment.) To get around this, you put local variables in the stack, at a certain offset down from the current stack frame (normally bp).

# Anatomy of Machine Code

Note: Use the table in the course notes for the test.

On the 8086, instructions are variable sized and can be 1 to 6 bytes. Here's the breakdown. Each block is a byte and the numbers within the bytes are bits. You don't need every byte for all instructions.

Anatomy of x86 Instruction

  • Code (1 byte): What is actually being executed. Always needed.
    • opcode: What to execute.
    • d: Data direction (0 = reg rc, 1 = reg dest).
    • w: Data size (0 = byte, 1 = word).
  • Addr (1 byte): Expands opcodes and describes operands. Needed for certain opcodes (see table).
    • mod: Mode.
    • reg: Register or special code.
    • r/m: Register/memory.
  • Disp (2 bytes): Memory offset for variables. Needed if you have a memory operand.
  • Data (2 bytes): Immediate data. Needed if you have an immediate operand. If you have byte immediate memory, only use the low byte.

Note: al is the byte accumulator. ax is the word accumulator.

# Boolean Algebra and Computer Hardware

There are certain bitwise operations that are atomic. That means that they can be used to construct every other operation (e.g. AND, OR, etc.), which can then be used to generate addition, subtraction, and everything! NAND is the standard atomic operation.

x86 has boolean instruction / bitwise operations:

  • not ax
  • and ax, bx
  • or ax, bx
  • xor ax, bx

x86 also has shifts, both left and right and both arithmetic and logical. Arithmetic fills in with the sign bit on the left. Logical always fills with zeros. Both of them shift the bit out into the carry. You should use arithmetic for signed numbers and logical for unsigned numbers.

  • shl ax: Shift logical left. Multiply by 2.
  • shr ax: Shift logical right. Divide by 2.
  • sal ax: Shift arithmetic left. (Actually same as logical left! Just clearer to people)
  • sar ax: Shift arithmetic right.

All shifts always round down, meaning sar -5 yields -3, because -5/2 is -2.5. This means constantly arithmetically shifting right a negative number will yield -1.

Similar to shifts are rotations. They are identical to shifts except that the bit shifted out is the same as the bit shifted in. The carry bits are still set the same. There is no arithmetic vs logical rotating. It's just rotating.

# ARM Assembly

ARM (Advanced RISC Machine) is designed and licensed by a British company ARM Holdings. They don't actually manufacture any chips, just design them and license out the designs.

ARM processors are widely in embedded contexts due to their low power usage. Because embedded systems can vary so widely, there are variants on ARM assembly designed to make certain tasks easier.

## General Design

ARM is a load and store machine. That is, all data processing is done in registers, so to manipulate memory variables you must load them into a register and then store them out once you're done.

All instructions are 32 bits in length and almost all instructions execute in a single cycle.

Instructions can be conditionally executed without jumps. That is, only perform this when this.

Instructions can optionally set the condition codes. It is up the developer / compiler to decide.

## Programming Model

Memory address space is 4 GiB (i.e. 32 bit address space) and there are three data sizes, listed below, that can both either be unsigned or signed two's complement. There are also 16 general purpose registers, 3 of which have special meaning (but can still be manipulated normally). There's an additional status register that stores the flag.

  • Data Sizes:
    • Byte: 8 bits.
    • Halfword: 16 bits.
    • Word: 32 bits.
  • Registers:
    • r0, ..., r12: General purpose.
    • r13 (SP): Stack pointer. (Same as in x86 terms.)
    • r14 (LR): Link register. Where the return address to a subroutine is stored. In x86 all return addresses are on the stack. In ARM return addresses can be put on the stack in software (and often are), but for the machine it has to be in LR.
    • r15 (PC): Program counter. (Instruction pointer in x86 terms.)
    • Status Register: Where execution flags are stored. Here's a brief listing. You can find more on the class website.
      • N: Sign. (0 = positive, 1 = negative)
      • Z: Zero. (0 = zero, 1 = not zero)
      • C: Carry.
        • On addition, this acts the same way as x86, where the carry flag is just the carry out of the addition.
        • On subtraction, this is the opposite of the x86. The borrow flag does not match real subtraction and instead matches the complementary addition.
      • V: Signed overflow. (0 = didn't occur, 1 = did occur)

## Instructions

### Load and Store

Loading and storing is done much differently than in x86, where it was just mov. Here's a list of some of the different operations. rd is the destination, rn is the first source, and rm is the second store. Almost every load has a corresponding store, except for loading constants of course.

Note: We only list ldr and str here. These operate on unsigned words. There are different versions of load and store with different suffixes that operate on halfwords, bytes, signed, etc.

  • Loads: Load a value into rd.
    • ldr rd, =var: Assigns address of variable.
    • ldr rd, =const: Assigns constant.
    • ldr rd, [rn]: Assigns value pointed to by rn.
    • ldr rd, [rn, rm]: Assigns value pointed to by rn + rm (sum of registers).
    • ldr rd, [rn, #n]: Assigns value pointed to by rn + #n (register with offset).
    • ldr rd, [rn], #n: Assigns value pointed to by rn and then post increment rn by #n. (Useful for iteration.)
  • Stores: Store the value of rd into something. The destination is the second operand.
    • str rd, [rn]: Store into memory pointed to by rn.
    • str rd, [rn, rm]: Store into memory pointed to by rn + rm (sum of registers).
    • str rd, [rn, #n]: Store into memory pointed to by rn + #n (register with offset).
    • str rd, [rn], #n: Store into memory pointed to by rn and then post increment rn by #n. (Useful for iteration.)

### Conditional Execution

In ARM, many instructions can be executed conditionally. To make an instruction conditionally executed in assembly, you must prefix your instruction's mnemonic with the conditional flag that you want.

; calc abs(r4)
+mov r0, #0 ; Set r0 to 0. Necessary to negate r4
+cmp r4, #0 ; Test value in r4
+submi r4, r0, r4 ; if neg, r4 = 0 - r4
+

You can look at the class notes to see what specific instructions can be executed conditionally and what the suffixes are for each condition code.

For instructions that can optionally set the condition codes (e.g. add, sub), you must suffix the instruction mnemonic with s if you want to update the condition codes. When you combine this suffix with conditional execution, you put the s after the conditional execution suffix.

Why would you want to do this? It improves performance for pipelined machines. In a pipelined machine, instruction execution is divided into stages where instructions are passed from stage to stage. This allows multiple instructions to be executing in parallel. In pipelined machines, conditional jumps cause "bubbles" in the pipeline, because you can't determine whether you should jump or not until that instruction has gone through the entire pipeline. This can be mitigated using speculative execution, but that still has a cost if you're wrong.

With conditional execution, there is no pipeline draining and much less pipeline "bubbles". Suppose we have a pipeline with 4 stages. If we did a conditional jump, we'd have a bubble of 4 instructions if we used a conditional jump. With conditional execution, we have a bubble of 1 instruction. (Well, really the instruction would just happen to be "wasted". We'd still work on it.) And we have no bubble at all if we actually execute the instruction.

Note: These pipeline bubbles occur when the machine starts the pipeline with something it didn't need and must subsequently "drain" the pipeline if it realizes it was wrong.

### Immediates

Immediates have some weird rules about them in ARM. Since all instructions are 32-bits and some bits are needed for the opcode, destination register, and other things, not all 32 bits of the instruction are available for immediates. In fact, only 12 bits are available.

To extend the range of immediates allowed, ARM splits up the space for immediates into 8 bits for the value and 4 bits the rotation amount. When accessing an immediate, the machine reads in the 8 bit value and then rotates it right (ROR) two times the rotation amount.

This means any 0-255 value can be generated with a rotation amount of 4. Any multiple of 4 less than 4∗255 can be generated using a rotation amount of F (i.e. 30), because rotating a 32 bit field 30 times right is equivalent to rotating left 2 times which is equivalent to multiplying by 4. These rules follow similarly for other rotation amounts. (It's kinda annoying to think about rotating right, so normally we just consider rotating left and convert the value.)

Why did they make it this complicated rule? It vastly extends the range of immediates allowed, means every immediate you want possible to create out of 2 immediates, is really easy to do in hardware, and assemblers and compilers had gotten sophisticated enough at the time of ARM to understand the rules.

Okay, well, how do assemblers handle this? If you do something like ldr r0, =999, the assembler will create a memory variable containing 999 and then convert that instruction into a load from memory. If you do something like add r2, r1, #999, you're just told you can't do that. Why doesn't the assembler handle this case? Because you need an additional instruction to handle this and if the assembler generated additional instructions from each machine instruction then it is no longer a one-to-one mapping, which is valuable for assembly.

### Subroutines

ARM provides several instructions for ergonomically dealing with subroutines. In general, storing the return address is called linking and jumping to different addresses is called branching.

  • bl label: Branch and link to label. Saves the next ip as lr and then sets pc to label.
    • Basically call from x86.
    • This can be conditionally executed.
  • stmdb sp!, {regs..., lr}: Store multiple decrement before use. The ! causes the stack pointer sp to be updated. It stores the registers in brackets on the stack and decrements the stack pointer before it is used.
    • Make sure that the link register lr is the return address.
  • ldmia sp!, {regs..., pc}: Loads multiple increment after use. The ! causes the stack pointer sp to be updated. It loads values off the stack into the registers in brackets and then increments the stack pointer after it is used.
    • Make sure that the program counter pc is the last address so we jump back to the link register.
main:
+  ldr r1, =n  ; r1 points to n
+  ldr r0, [r1]  ; r0 = n
+  bl sqrt  ; call subroutine
+
+sqrt:
+  stmdb sp!, {r1-r3, lr}  ; save r1-r3 and
+  ; link regiter
+
+  ; Trash the registers
+  ldr r1, =27
+  ldr r2, =11
+  ldr r3, =100
+  ; Load the hardcoded result
+  ldr r0, =25
+
+  ; restore r1-r3, load the pc with the original
+  ; link register
+  ldmia sp!, {r1-r3, pc}  ; 
+
+.data
+n: .word 625
+n: .word 0
+

### x86-like Instructions

These instructions have strong parallels to ones in x86, so we won't dedicate an entire section to each of them.

  • Move: Move is much more limited in ARM. It can only deal with registers and (limited) immediates. You'll generally don't want to use these because most assemblers only have the sophisticated immediate resolving for ldr. Also, you should rarely be copying registers around.
    • mov rd, rn: Copy rn into rd.
    • mov rd, #n: Move limited constant #n into rd.
  • Arithmetic: Unlike in x86, the destination doesn't need to be a source. In ARM, we can "save" the variables if we'd like.
    • add rd, rn, rm: rd = rn + rm.
    • add rd, rn, #n: rd = rn + #n.
    • sub rd, rn, rm: rd = rn - rm.
    • sub rd, rn, #n: rd = rn - #n.
    • cmp rd, rn: Calculates rd - rn and sets condition code.
    • cmp rd, #n: Calculates rd - #n and sets condition code.

## Data Format and Labels

Note: These are specifics of ARMSim syntax, but ARMSim syntax is closely related to other assembler's syntax (e.g. GNU Assembler), so this should be closely or direcly applicable.

In ARMSim, data declarations and label declarations both end in a colon. Here is some example data declarations

v1: .skip  4  ; Reserve 4 bytes
+v2: .word  1000  ; 32 bit word
+v3: .word  0x000003e8  ; hex
+v4: .hword 555  ; 16 bit half word
+v5: .byte  10  ; 8 bit byte
+v6: .byte  -10
+v7: .asciz "ABC"  ; Null-terminated ASCII string
+v8: .ascii "DEF"  ; ASCII string
+

Like in MASM, we can define immediate aliases (basically constant numbers) using the following syntax.

.equ SWI_Open, 0x66 ; Open syscall
+

Instead of using the .code directive to show that the instructions / program is starting, you use the .text directive, since code goes in the text section.

# Java Virtual Machine (JVM)

Somewhat surprisingly, people have written assemblers for the JVM, assembling your program to JVM bytecode. One example is Jasmin, although it is very old now. Why? It allows you to more easily test the security and capabilities of the JVM, since you don't have to the securities of the compiler.

Recall that Java was initially created for running on networked embedded devices (e.g. PDAs and VCRs). This is important for understanding the design of the JVM.

How do you execute JVM byte code? There are 4 main ways.

  • Interpreter: Reads the byte code and executes the corresponding machine code.
  • Naive JIT (Just-in-Time) Compiler: Whenever we call a method, compile it to machine code and execute.
  • Monitoring JIT Compiler: Start out interpreting monitor program activity. JIT compile the parts that are executed often or otherwise considered beneficial to compile.
  • Hardware: Some companies (e.g. AJILE) created hardware that actually targets JVM byte code as its machine code.

## Instruction Architecture

The JVM is a stack based architecture. That means only the push and pop operations actually have operands (their data) and everything else implicitly gets its data from popping things off the stack and pushing the results back onto the stack.

What is good about the JVM being a stack machine? It allows for compact instructions. It is agnostic to the registers of the machine. It allows for simpler interpreters.

What is bad about the JVM being a stack machine? It requires more instructions to do basic things. Some operations become more difficult.

The JVM uses variable length instructions.

The JVM is super-optimized for programs with 4 variables, optimized for 256 variables, and bad for up to 65536 variables. Why? The original purpose of Java was to be on embedded devices, which don't have programs with large amounts of data.

Wait, how do these optimizations work? Java stores all variables in a single local variable array, where variables are uniquely identified and referenced by an integer.

## The JVM and History of Caching

If you count what JVM instructions are normally executed, most are pushes and pops. In fact, there are far more pushes than pops because arithmetic operations have implicit 2 pops and 1 push that isn't counted. About 8% of instructions executed are branches/jumps (for variable checks and loops).

Looking at this information, it means a jump occurs about every 12 instructions (1/12≈8), meaning most loops are about 12 instructions. This helped hardware designers know that caches are extremely beneficial because it means programs exhibit strong locality of reference, since programs that loop often execute the same instructions and work with contiguous arrays. This locality of reference means we can get cache hit rations of 90+%, meaning they are extremely valuable.

This should make sense to you as a programmer because most programs follow the pattern where they set up some data, loop for awhile, and then go on to another loop.

## JVM Calling Conventions

Since Java is a stack based architecture, we pass arguments to subroutines/functions on the stack is more difficult. This is because passing them on the stack would mean we can only load the arguments on top of the stack or we would have to pop them all off the stack and load them into local variables, which is inefficient.

To make this more efficient, the caller puts the arguments onto the stack and then the subroutine's local variables array is made to overlap with the arguments in the caller's stack, meaning the subroutine doesn't need to copy any of the arguments and instead gets them for free.

For returning variables, Java guarantees that functions will only return one thing and that it is on top of the stack.

# Microcode

On RISC machines, every instruction maps almost directly to an actual circuit. On CISC machines, many instructions map to a collection of hardwired instructions/circuits. The collection of hardwired instructions/circuits that makes up actual instructions is called microcode. Microcode is like the subroutines of CISC machine code.

Note: RISC designs are generally preferred over microcode currently because RISC instructions are easier to pipeline, avoids the overhead of microcode, and hardwired circuits can often achieve improved performance. Further, most programming is no longer done in assembly, so the ease of use of CISC ISAs is far less important. However, it still is important for implementations of CISC ISAs (e.g. x86) and is neat!

Why is microcode nice? It allows less complicated chips to implement more complicated instructions, that normally would only be possible on more expensive/complicated chips. Likewise, it allows machines to emulate other instruction sets. This capability was used by IBM in its S/360 compatible computer architecture.

Microcode can also enable performance improvements by rewriting code in microcode rather than machine code. How? The machine doesn't have to fetch or decode any machine code, since the microcode is stored in the CPU itself.

Why is microcode bad? Microcode is incredibly hard for a human to use and is incredibly powerful. Also, why bother have microcode when you could just have simpler machine code?

## x86 String Instructions

Text processing was at the time an extremely important use for computers (and still is to this day). Because of this Intel decided to make highly optimized machine code instructions for doing common string operations (compare, move, scan, load, and store). These instructions were written in hand-optimized microcode.

These operations were written generically enough that they also allowed numeric array manipulation.

# Interrupts and I/O

An interrupt is a signal to the CPU that allows it to asynchronous events. Every interrupt that triggers has a unique integer ID. The CPU contains (and the OS manages) an interrupt vector table, which maps from unique integer ID to a list of subroutines to call in response to the interrupt.

In general, a CPU handles an interrupt by preparing for a context switch (storing registers on stack) and then calls every interrupt handler in the interrupt vector table sequentially. When it is done, it goes back to where it was and restores its saved data.

Specific to the 8086, the CPU stores the flags, CS, and IP onto the stack. Then it loads the CS and IP and jumps to the loaded CS and IP, which then executes the interrupt handler. The interrupt handler then saves every register it modifiers, does what it needs to do, restores the registers, and calls iret (for interrupt return).

When an interrupt occurs, the CPU prepares for a context switch (by storing the registers onto the stack) and then goes to the interrupt vector table. It then calls the subroutine to handle the inter

Note: If an entry in the interrupt vector table is empty, then the interrupt triggers a "double fault", which is like the default interrupt handler and also the interrupt-within-an-interrupt handler.

## Security

In the early days of interrupts and interrupt handlers, there were several security vulnerabilities.

Interrupts allowed hackers to corrupt the operating system's code by modifying the stack to point in the middle of the operating system's code (arbitrary changes to SP and SI were allowed) and then trigger an interrupt causing the hardware to overwrite part of the operating system in memory. The operating system and hardware did have ways to stop the user from directly modifying the OS's code, but they had not thought to stop hardware interrupts from modifying it.

This security vulnerability was solved by having the OS have a safe stack space, which users couldn't modify. Hardware then used this safe stack space for context switching.

## I/O

There are there main ways to do input and output:

  • Programmer I/O (PIO): Very restrictive, byte oriented, hardly used anymore.
  • Memory Mapped I/O (MMIO): You reserve part of your address space to communicate with hardware devices. You then can read/write as if this were real memory, even though it is actually being mapped to another devices by the hardware.
    • Devices us a programmable interrupt adapter/controller, which pretends to be memory and triggers interrupts.
    • Example: VGA text buffer.
  • Direct Memory Access (DMA): High performance. Allows you to directly read and write memory on the device.
    • Used for things such as network cards and hard disks where performance is critical.

# Floating Point Numbers

The standard for representing floating point numbers in binary was originally set by IEEE 754-1985 in 1985. The most up to date version of the spec is IEEE 754-2008 from 2008.

Note: There are some complex rules around rounding and how to deal with infinity in the spec. For this class, we'll stick to the basic idea.

The standard specifies 3 precisions of floating point numbers.

  • Single precision: 32 bits.
  • Double precision: 64 bits.
  • Quadruple precision: 128 bits.

Every precision breaks the field into a sign, exponent, and significand as detailed below. Note: You always store the "normalized" form of the number, that is in ±n×10e, 1≤n<2.

  • Sign (1 bit)
  • Exponent: The exponent e in ±n×10e. This is stored biased so that you have to subtract the bias from the value to get the actual exponent e. (The bias is always half of the fields maximum value.) The maximum and minimum exponent is always reserved for special numbers (e.g. infinity).
    • Single Precision: 8 bits and 127 is the bias.
  • Significand: The fractional part of n. We only store the fractional part because we know that the bit before the decimal place will always be 1 because we store the normalized form of the number. (This is called the hidden bit.)

This has some pitfalls though!

We have a limited number of digits so we can have rounding error. In general, Single precision numbers can handle ~7-8 significant figures, with the exact precision depending on the number.

Since we are using binary fractional parts, not all seemingly simple fractions can be represented exactly. For example in binary 1/10 has infinitely many repeating digits. Of course π also has infinitely many repeating digits.

To handle the rounding error and imprecision that is associated with floating point, you establish a constant small value epsilon that represents an acceptable amount of error. Then, when you check for equality, you see if the difference between the numbers is less than epsilon.

Outside of the rounding errors, floating point number have some special numbers that use the reserved exponents.

  • ±0: Everything but sign bit is 0. Sign bit acts normally.
    • Because of the hidden bit, all zeros normally wouldn't actually be zero.
  • ±∞: Exponent is maxed and significand is 0. Sign bit acts normally.
  • NaN: Sign = 1, exponent is maxed, and significand is not zero.
    • All operations on NaN yield NaN.
    • Occurs when you do something invalid, like divide by zero.

Creating a NaN is an example of an exception, but there are others. Examples include overflow and underflow. However, these exceptions have default actions defined in the standard and it is common practice to accept the default action.

## Floating Pointer Coprocessor / Numeric Data Processor (NDP)

Historically, many computers did not have native floating point operations (instead emulating it in software) and those who did shelled out to a completely different chip in the system which would perform the operations. Nowadays, most consumer computers have the floating point coprocessor on the same chip as the main CPU, but it is still acts like a coprocessor.

Communication with the coprocessor is done via the floating point register stack. The top of the stack is called ST or stack top. The processor treats this as a pure stack, limiting you to the following operations.

  • fld dest: Load real. Push a real number onto the stack.
  • fst[bw] dest: Peek at the top of the stack.
  • fstp[bw] dest: Pop a real number off of the stack.
  • fadd: ST(1) + ST.
  • fsub: ST(1) - ST.
  • fmul: ST(1) * ST.
  • fdiv: ST(1) / ST.
  • fwait: Wait for NDP to complete store. Should be done after trying to read from the coprocessor.

The NDP has a status word, which provides information about its current state. Two of the bits, C3 and C0, show the comparison of ST(1) and ST.

  • ST(1) > ST: C3 = 0. C0 = 0.
  • ST(1) < ST: C3 = 0. C0 = 1.
  • ST(1) = ST: C3 = 1. C0 = 0.
  • ST(1) ? ST: C3 = 1. C0 = 1. This occurs when you cannot compare the numbers, for example of one of the numbers is NaN.

Neat! How do we use that? Well, if you move the high byte of the NDP status register into the low byte of the x86 status register, C3 corresponds to ZF and C0 corresponds to CF. This correspondence was done intentionally because then ja, jb, and je have their exact expected meaning.

# Computer Architecture Design

In general, shorter instructions are better (delivered faster and smaller binaries), fixed-length instructions are better (easier to decode), and instructions are all sized in full bytes (easier to address, no 12-bit instructions).

## Explicit vs Implicit Operands

One important decision is the number of explicit vs implicit operands an instruction has.

Consider four machines: M0 has no explicit operands, M1 has one, M2 has two, and M3 has three. Let's see how they calculate C = A + B.

M0 is normally called a stack machine. All operations push and pop things off the stack. Load/push and store/pop are the only exceptions and they have one operand.

push [A]
+push [B]
+add
+pop [C]
+

M1 is normally called accumulator machines because all loads load into the accumulator, all arithmetic uses the accumulator as a source and a destination, and all stores store the accumulator.

load [A]
+add [B]
+store [C]
+

M2 is (close to) what the 8086 is. Load and store have their two expected operands. All arithmetic uses one of the registers as both a source and destination.

mov [C], [A]
+add [C], [B]
+

M3 is (close to) what ARM is. You explicitly list all operands for all instructions.

add [C], [A], [B]
+

The 8086 is close to M2 because there are restrictions on what the operands can be (i.e. no memory to memory). ARM is close to M3 because there are restrictions on what the operands can be (i.e. only registers).

Let's pretend we have a machine with the following specs

  • Cycle Time: 1 us (1 MHz)
  • Memory Rate: 106 bytes/sec
  • Fetch Instruction: 1 us / byte
  • Decode Opcode: 1 us
  • Access Data: 1 us / operand
  • Execute: 2 us
  • Opcode: 1 byte
  • Operand: 2 bytes

This gives us the following table. Note: We leave off M0 because it requires memory addressing for some instructions but not others and thus complicates analysis.
PartM1M2M3
Fetch357
Decode111
Data123
Execute222
1 instr71013
C = A + B212013
instr / sec142,857100,00076,923

Notice something from this analysis. All machines have the exact same clock speed but execute different number of instructions per second. Further, the machine that executes instructions the fastest was the slowest to run our program while the machine that executes instructions the slowest was the fastest to run our program. Answering which machine is the fastest is extremely difficult and will depend on the program!

In general, to compare machines we need to know clock speed, instruction execution rate, capability of each instruction, and a specific task to perform (i.e. benchmark). Then, the time for the instruction is given by the following

time=∑instructionstask∗cyclesinstr∗secondscycle

Note: The benchmark must be fair (i.e. don't use benchmarks that are helped special capabilities) and accurate (i.e. be careful about the compiler being smarter than your synthetic benchmark by doing dead-code elimination, etc.).

## Caching

If we built RAM only using transistors (static RAM), it would be extremely efficient but extremely expensive. Instead we use much cheaper static RAM using transistors and capacitors. To get around the slow performance of dynamic RAM, we use a very small extremely efficient cache. Why does this work? Many programs exhibit locality of reference because of loops and most memory structures are nearby each other (e.g. arrays).

Note: Some page replacement algorithms exhibit Belady's Anomaly, where more cache reduces performance. Algorithms that don't exhibit this are called stack algorithms.

## Pipelining

Often instructions are executed in different independent stages (e.g. fetch, decode, execute). We can improve efficiency by always having an instruction in each of these stages. This is called pipelining.

In general, this is excellent for performance. However, it does have an issue with conditional branching. Namely, if you hit a branch you have to wait to execute the branch to find the next instruction. This is called having a bubble in the pipeline.

This can be mitigated using speculative execution, where you predict that the branch will / won't be executed. If you guess wrong, you have to drain the pipeline and it's just as bad as if you just waited. If you guessed right, then it's like you had no jump.

How do you predict whether or not you'll take the jump? You could use a global prediction from instructions executed. You could provide different instructions / a bit in the opcode that says whether this jump is likely to be taken or not and then have the compiler / programmer pick the appropriate one. You could dynamically keep track of whether that branch tends to be taken, but that incurs additional overhead and complexity.

This can also be mitigated by having hardware that can do the first few stages of the pipeline for the two different possible instructions, until you figure out which one you should have executed. That is, take both paths and clean it up afterwards. This is the best performance always, but it is also expensive.

This can also be mitigated by using a delayed branching architecture. That is, you say you will always execute the instruction immediately after a jump. This ensures that you will never drain the pipeline or guess incorrectly and thus improves performance. The key issue is that you need to find a instruction that will always be executed in both cases that you can insert into the delay slot. I personally am not convinced that this is better than just having "maybe yes" vs "maybe no" jumps, especially because it gets harder the longer your pipeline becomes since you get more and more delay slots. Some examples of programs that use this are MIPS and SPARC.

In general, longer pipelines tend to have a faster steady state (speed once pipeline is saturated) but slower latency (time it takes for pipeline to be saturated). They also tend to take longer to recover from bubbles in the pipeline. Since pipelines are drained reasonably regularly, latency is often important.

# Newer x86

Pentium processors and beyond are actually RISC machines that have a CISC frontend layered on top of them. Basically, they have a RISC microcode that actually does all the work. Then they have a CISC decode, that reads in the complex instructions and converts them into microcode that actually gets executed. Note: Some RISC-like instructions, such as adding two registers, are sent directly to the RISC core.

The Pentium did out-of-order instruction execution, more sophisticated speculative execution using dynamic branch prediction, and did superscalar execution.

Note: The Pentium 4 had a 20-stage pipeline, largely to allow it to pump up its clock rate, since that was (and still is) huge for marketing. This was the main motivation for Intel to have such complex and sophisticated branch prediction.

## Branch Prediction

The original Pentium 1's branch prediction algorithm was accurate on average 75% of the time. It's algorithm was the following pseudo-code.

# The 2 bit number is how many time's
+# we've seen the branch since we took it,
+# with 11 being the max.
+history = 2 bit history of jumps taken
+if branch not in history:
+  if branch goes forward:
+    don't take branch
+  else:
+    # It's probably a loop
+    take branch
+else:
+  if history[branch] != 11:
+    take branch
+  else:
+    don't take branch
+

This is clever because it allows us to be wrong once and still say we should jump again to properly handle nested loops.

## Reduced Operations

Every instruction is broken down into 1-4 reduced operations (ROPS), which specify with painful detail the steps required to perform the operation. If an instruction (e.g. a string instruction) cannot be broken down that far, it is passed to the microcode ROM.

These ROPS additionally have a speculative bit, that says whether the operation is being done speculatively, meaning you may have to trash your work. These ROPS are queued onto their appropriate unit (e.g. they need an integer ALU, floating point ALU, load store module, jxx module, etc.). Sometimes there's even multiple of these units for performance.

These ROPS have additional "scratch" registers which they can work with, which the programmer does not get access to.

Scheduling these ROPS on distinct units allows for out-of-order and parallel operation execution, which is what we want.

# Hardware Description Languages

Nowadays, most hardware is designed using a hardware description language, such as Verilog that produces the actual circuitry from the hardware description. This is advantageous because it means automated testing / verification of hardware correctness can be done and allows much easier and more rapid development of hardware.

Also, if the language is flexible / powerful enough, the programmer should lose little to no control over the design of the hardware and instead is empowered to make more powerful and complex designs.

\ No newline at end of file diff --git a/notes/ncsu/2s/csc236/machine_code_anatomy.png b/notes/ncsu/2s/csc236/machine_code_anatomy.png new file mode 100644 index 0000000..6eef135 Binary files /dev/null and b/notes/ncsu/2s/csc236/machine_code_anatomy.png differ diff --git a/notes/ncsu/2s/csc236/twos_complement.png b/notes/ncsu/2s/csc236/twos_complement.png new file mode 100644 index 0000000..50b4ddc Binary files /dev/null and b/notes/ncsu/2s/csc236/twos_complement.png differ diff --git a/notes/ncsu/2s/csc246/dynamic_linking.png b/notes/ncsu/2s/csc246/dynamic_linking.png new file mode 100644 index 0000000..b33e66f Binary files /dev/null and b/notes/ncsu/2s/csc246/dynamic_linking.png differ diff --git a/notes/ncsu/2s/csc246/dynamic_loading.png b/notes/ncsu/2s/csc246/dynamic_loading.png new file mode 100644 index 0000000..2cc5b10 Binary files /dev/null and b/notes/ncsu/2s/csc246/dynamic_loading.png differ diff --git a/notes/ncsu/2s/csc246/heirarchical_page_table.png b/notes/ncsu/2s/csc246/heirarchical_page_table.png new file mode 100644 index 0000000..9b9ddbc Binary files /dev/null and b/notes/ncsu/2s/csc246/heirarchical_page_table.png differ diff --git a/notes/ncsu/2s/csc246/index.html b/notes/ncsu/2s/csc246/index.html new file mode 100644 index 0000000..4d3d6f4 --- /dev/null +++ b/notes/ncsu/2s/csc246/index.html @@ -0,0 +1,267 @@ +Eli | CSC 246: Operating Systems

CSC 246: Operating Systems

Instructor: Dr. David Sturgil | Semester: Spring 2020

Table of Contents

# Terms

  • Operating System: Creates a layer of separation between hardware and application. A program that helps other programs run.
    • Virtualizes hardware, normally mandatory.
    • Provides system calls (syscalls).
  • Virtualization: Abstraction over underlying hardware, making it easier to use, share, and reason about. For example, UNIX's everything is a file abstraction.
  • System Calls: Requests the operating system to do something. This can be expensive (because of interrupts) and obtuse, so normally you call these through a library.

# Computer Architecture

In this class, we'll consider a simplified model of a computer because they're complex.

We also follow the Von Neumann architecture, which is the processor and memory model, where you put program in memory.

  • CPU: Processor executing your code.
  • CPU Cache: Tiny amount of incredibly fast memory your CPU uses. Amortizes cost of memory accesses.
    • Cache Hit: CPU finds what it wants in the cache.
    • Cache Miss: CPU does not find what it wants in the cache.
  • Memory: Volatile memory containing your working program and data.
  • Device Controllers: Control specific hardware, varies wildly depending on computer.
    • Includes persistent storage, such as disk controllers.

Simple Computer Architecture

## Storage Hierarchy

Sadly, we haven't found any storage device that is faster, cheaper, and larger than every other option. Because of this, we have to make engineering decisions to improve performance.

We usually do this by creating a storage hierarchy of memory going from small and fast to large and slow. We tend to use the smaller, faster memory cache to temporarily store data for the larger, slower memory backing store to try to get the best of both worlds.

## CPU Cache

Programs normally exhibit temporal locality, where they are likely to access things accessed recently, and spatial locality, where they are like to access things nearby things accessed recently.

Since we normally both read and write to the cache, the backing store may become out of date. To resolve this, we need a write-policy to keep them in step.

  • Write-through: The hardware automatically writes to the backing store (RAM) whenever the cache is written to.
  • Write-back: Whenever (a portion of) the cache is cleared / replaced, write it back to the backing store to get updates.

## Device Controllers

Here's a quick breakdown on how programs can access hardware.

  • System call: OS receives requests from application.
  • Command: OS makes requests to hardware.
  • Interrupts: OS is notified when hardware needs service.
  • Upcall: OS can notify application of events of interest.

Overview of Layers

### CPU to Device

Most device controllers have a few registers to communicate with the CPU.

  • Status registers: To check what it’s doing.
  • Data-in registers: To give it some data.
  • Data-out registers: To get some data back.
  • Control registers: To tell it what to do next.

That's cool and all, but how do you tell the CPU to use these? There's two main ways.

  • Port-Mapped I/O: Special CPU instructions for IO. Somewhat common on embedded systems with a set number of devices.
  • Memory-Mapped I/O: Computer hardware reserves a part of address space for devices. The CPU then accesses these as if they were just normal memory, but the hardware redirects the requests.

### Devices to CPU

There are a few ways for the device to tell the CPU about things, like completing a request or something.

  • Polling: The CPU must know to look at the status registers to check out the device. Can be inefficient if you're polling a ton.
  • Interrupts: Hardware supported system. The hardware fires off an interrupt and the CPU will automatically do jump to an interrupt handler.
    • Interrupt Handler: A subroutine that runs whenever an interrupt is fired. Can be arbitrarily long, but should be short to prevent latency spikes.
    • Interrupt Vector: List of addresses of subroutines to run when interrupt fires off.

Note: Interrupts are similar to CPU traps (exceptions) that occur whenever a bad instruction occurs, like divide-by-zero.

### Bulk IO

Some devices need to dump a lot of data into the computer. We normally do this using a direct memory access (DMA), which puts data from a device into the system's memory.

## Hardware Protection

### CPU

It can be dangerous to any program to run every operation provided by the hardware. Therefore, most hardware uses dual-mode operation where there are two modes:

  • Kernel Mode: Can access all instructions and all registers, privileged and unprivileged.
  • User Mode: Can only access unprivileged instructions and registers.

Note: Modern hardware often has more than just these two modes, but we won't talk about that here.

How do we switch modes? Normally, there are special instructions to switch to the appropriate mode. The kernel automatically switches back to user mode whenever it needs to, but how do you switch from user mode to kernel mode? The answer is system calls and interrupts.

Interrupts automatically switch to kernel mode at the start and switch to user mode (or whatever the old mode was) at the end.

System calls trigger a special trap on the CPU which goes into the appropriate system call.

How do we prevent user programs from preventing the OS to run? The normal solution is to have a timer interrupt, which fires at a countdown to allow the OS to take control of the CPU eventually.

### I/O & Device Controllers

If you use port-mapped IO, it's easy to do protection. Just make those special instructions privileged.

If you use memory-mapped IO, you have to use memory protection.

### Memory

Modern memory protection is very sophisticated. Here, we will use a simpler model that considers only a base register and a limit register. The base register stores the start of valid memory addresses. The limit register stores the size of the range. The hardware automatically checks these on all memory accesses.

Note: These registers are privileged registers, meaning only the kernel can change them.

Memory Protection

# OS Architecture

## Microkernel

Microkernels take the position that as little as possible should be put in the kernel / run in kernel mode. This means that parts of the OS that normally run in the kernel (e.g. device drivers and file systems) instead run in userspace as processes.

Why should we do this?

  • Easier to port to new machines (less code).
  • Less likely there will be bugs (less code).
  • Less code in kernel mode.
  • More extensible and modular. (Think about rclone mount and FUSE.)

Why shouldn't we do this?

  • Switching between kernel mode and user mode is expensive (interrupts).

## Monolithic Kernel

Monolithic kernels are the traditional design. It's where the kernel performs basically everything you'd expect an operating system to do.

Why should we do this?

  • It has higher performance because it switches less between kernel and user mode.
  • Kernels grow very naturally.
  • You can work around the disadvantages pretty easily (see next section).

Why shouldn't we do this?

  • Less extensible and modular.
  • Harder to port to new machines.

### Kernel Modules

A class of dynamically loadable parts of the kernel. These can be run in user mode or kernel mode once loaded.

There are often specific types or classes of kernel modules, in a object-oriented manner. Modules implement interfaces specified by these types and that allows the kernel to load them.

In Linux, these are .ko (kernel object) files.

## Boot Up

Operating systems can be huge. This means that they don't fit in a page of memory (basically a section of memory) and can't be trivially loaded by hardware. To mitigate this, we write small programs called bootloaders, which help load your operating system.

Here's a quick overview of the standard steps that occur whenever you turn on your computer. Different systems may have slight modifications, but the general process remains the same.

  1. Start running firmware at known address.
  2. Load bootloader from secondary storage.
  3. Bootloader copies kernel into memory ad begins execution.
  4. Kernel initializes necessary data structures (e.g. interrupt vectors).
  5. Kernel starts running init process (in user mode).

More modern computers can use EFI stubs, which (can) completely replace bootloaders. However, we won't cover that here.

# Inter-Process Communication (IPC)

There are many ways to do IPC. The two standard models involve either direct sharing of memory (or other hardware) or message passing, which is a fancy way to say copying memory or other things.

## Signals

The simplest is signals. They are mostly used to cancel, kill, or do something similar to the process. For example, CTRL-C sends SIGINT (interrupted), which tries to interrupt (and normally terminate) the process which received the signal.

This is hardly inter-process communication.

## Message Passing

This is easier to get right, but (theoretically) less performant.

Processes have independent mailboxes that can hold data. Other processes can copy messages / data into your mailbox by going through the operating system. Only you can read your mailbox. No other process can read or write to your mailbox.

There are two main ways to do this. Direct, where you send directly to a process, or indirect, where you send through a named communication channel (e.g. named pipes).

The kernel may temporarily copy data into its own memory while it waits to deliver. This is called buffering.

### Anonymous Pipes

  • #include <unistd.h>
  • pipe(int fds[2]): Create pipe with read end 0 and write end 1.
    • Use alphabetical order of read and write to remember the numbers. (Or just man pipe(3).)

Pipes are queues of bytes that don't respect message boundaries. You give it a 2-array of ints and it gives you two file descriptors, a read end 0 and write end 1.

Message boundaries? Basically, if you write 2 bytes, 5 bytes, and 3 bytes to a pipe, the other end will see just 10 bytes.

POSIX defines send and recv syscalls that can send and receive messages on pipes. However, you can also use read and write syscalls, and you'll normally want to.

You normally use pipes by calling pipe, forking, and then having one process close one end and the other process close the other end (to prevent the OS from mistakenly thinking that someone is still using the pipe). When all write ends of the pipe is closed, from the child exiting or manually closing the pipe, the read end of the pipe receives an EOF.

Note: If you max out the OS's buffer, the write syscall blocks.

### POSIX Message Queues

  • #include <mqueue.h>
  • mq_open(): Opens message queue. Give it a maximum message size and maximum number of messages to store.
  • mq_send(): Sends message across queue.
  • mq_receive(): Receives message from queue.
  • mq_close(): Stop using the message queue.
  • mq_unlink(): Destroys the message queue.

Message queues are named queues of bytes that respect message boundaries.

Message queues are identifiable by a unique name (starting with /) across completely separate processes on the machine. They have their own completely different syscalls, unlike files and pipes, i.e. you can't use read or write on them.

Message queues can live longer than the process that makes them and can exist without any process making them. To remove them, you must call mq_unlink to destroy the message queue.

If you want to create the message queue, but one already exists, you get an error through errno. If you want to hook up to an existing message queue, but one doesn't exist, you get an error through error through errno.

## Shared Memory

  • #include <sys/shm.h>
  • shmget() (Shared Memory Get): Create a shared memory identifier (int) for a section shared memory. This memory is automatically zeroed.
  • shmat() (Shared Memory Attach): Attach the shared memory to your address space, making it look like just another pointer. You can mark this memory as read-only (SHM_RDONLY), write-only, or read-write.
    • You can specify a memory address to attach to, but you probably shouldn't. shmdt() (Shared Memory Detach): Remove the shared memory at the given pointer from your address space, but don't delete the shared memory.
  • shmctl() (Shared Memory Control): Delete (or otherwise control) the shared memory given by the shared memory identifier (int).

This is hard to get right, but (theoretically) more performant.

There is a block of memory that both processes can read and write to. The operating system does very little control and trusts the programs to get it right.

This is accessed just like any other buffer because the OS maps the shared memory into your program's address space.

## Blocking

Whenever your program asks for something that the OS can't provide immediately, your process will block. (Assuming you're using a blocking system call.) When your process blocks, the OS puts your process into a waiting state, where it is not taking up (m)any resources. The OS will wake up your process when it gets what you asked for.

There are a few main blocking methods for IPC:

  • Blocking Receive.
  • Non-blocking Receive.
  • Blocking Send.
  • Non-blocking Send.
  • Rendezvous: Blocking send and receive, with no buffer.

### Buffering

Buffering is how we let non-blocking send work. The OS temporarily holds the data being shared while the receiver (ideally) catches up. This lets the sender not be slowed down.

### Busy Waiting

Busy waiting is when your program takes as much CPU time as it can to just wait for things. This is terrible. It's basically a poor man's blocking.

# Processes

There are a bunch of ways to handle parallelism / concurrency. We will cover processes right now.

Processes are separate programs identified by a PID (process identifier). They have separate, protected memory and (can) run on separate CPUs. Processes can only interfere with each other in controlled ways (e.g. shared memory, signals, pipes). Processes also have the concept of privilege, which we'll cover later.

## Syscalls

  • fork: Create a child process. Both the child and the parent run the same program with the same variables on the same line. On the parent fork returns the PID of the child. On the child, it returns 0.
  • wait: Wait for a child to terminate. If given a PID, it waits for that specific child. If not given a PID, it just waits for any one child.
    • Child termination forms a queue. Whenever you wait for a child, it pops that child off the queue, blocking if the queue is empty.

## Memory Layout

Processes has multiple sections of memory. They aren't really contiguous, but it's easy to visualize that way.

  • Text: Immutable data, can be shared.
  • Data: Mutable data, should not be shared.
  • Stack: Local variables, return addresses.
  • Heap: Dynamically allocated memory.

Memory Layout

## Process Organization

Process are normally organized into a process table, which is a list of all PCBs on the system. However, this is not very useful for scheduling.

To make scheduling more efficient, we keep scheduling queue(s), which is a list of PCBs for processes waiting. These queues are organized in various ways to make scheduling more efficient. Here's a few common ones.

  • Ready Queue: Ready to run.
  • Device Queue: Waiting on a specific device.

Process Queues

### Time Sharing

Whenever the OS does work, it may not switch back to the process that was previously running. The OS has a scheduler which it uses to determine what process to next run. They are incredibly complicated, so we will cover that later.

Switching between processes requires a context switch. A context switch is where the OS writes out all CPU registers (and other data) into memory and loads another process's saved data. It then executes the process whose data it just loaded.

This is great because it allows for processes to share! However, it is very expensive because processes keep track of a lot, for example:

  • PID.
  • Copies of program counter and other CPU registers.
  • Memory bounds.
  • Accounting information.
  • Resources in use (e.g. open files).
  • Pointers for linking PCBs into various lists.

Where does it store this info? The OS stores the info in a process control block, which is a block of memory that the OS sets aside for process information.

### Process State

This isn't related to the process control block we talked about earlier. Instead this deals with scheduling.

This state indicates how the OS should treat the process during scheduling. The specific design may be different, but this is the standard.

  • New: Created and can't be run yet.
  • Running: Executing instructions on a CPU.
  • Waiting: Process has requested I/O (or something else) and can't run until it's complete.
  • Ready: Process is runnable, but isn't on a CPU right now.
  • Terminated: Process has finished, still has a process ID, but isn't runnable.

Process Scheduling States

### Types of Processes

In terms of scheduling, it is useful to think about what the process spends most of its time doing. To help think about this we use a CPU-IO burst cycle, where programs switch between waiting on IO and using the CPU. CPU bound processes are programs that spend most of their time using the CPU. IO bound processes are programs that spend most of their time waiting for IO.

### Process Tree

POSIX organizes processes as a tree, where processes have a parent and a child. The root is called the init process and is what runs initially and forks off every other process.

There are many models on how parents and children operate. They can share everything or share nothing. POSIX is somewhere in between. The child can be can run the same program as the parent (POSIX fork) or run a completely different program (Windows CreateProcess).

Note: In POSIX, you use the exec* family of syscalls to replace the running process a different program. These system calls (if successful) never return.

What happens if the parent of a process dies? In POSIX the child keeps running normally, but the OS sends you a signal that your parent died. In other systems, there is cascading termination, where the the OS kills the child (and its children).

# Threads

Threads are like processes that are even more cooperative (but less so than coroutines). They share code, data, heap, and OS allocated resources (e.g. files). They have different CPU registers, positions in code, and stack.

Process Address Space Illustration

For performance reasons, we want to keep the per-thread state as little as possible to ensure that we can quickly switch between threads and start additional threads. In other words, we want to keep the thread control block tiny.

## POSIX Threads

  • #include <pthread.h>
  • pthread_create: Creates a new thread with a given start routine. This start routine is the lifetime of the program, like main. This can give the start routine some data.
  • pthread_join: Wait for the given thread to return / exit. This can return data by filling in a pointer.
  • pthread_exit: exit() but for a thread and returning abstract data.

A start routine returns a void * and accepts a single void *. This is used for input and output. Make sure that the argument and return have appropriate lifetimes. You should be very careful about giving/returning data between threads on the stack. In general, you'll want to heap allocate the argument and return.

## Java Threads

java.lang.Thread is how Java represents Threads. There are many different ways to tell Java what to run in the thread. You can subclass Thread and override its run method. Then when you start instances of this subclass, they run your run method. You can pass Thread itself a Runnable (either a subclass or a lambda expression). Then running that instance of Thread will run that Runnable.

Java's threads don't run immediately. Instead you must call start on them for them to start. You can then join on them.

You can also make a Thread a daemon, by calling setDaemon to it. This must be set before you start the thread. This makes it run in the background (and thus run the JVM in the background). Like a daemon!

Java does directly support arguments too threads or returning from threads. Instead, you must subclass Thread to add the arguments via a constructor and return the arguments by having attributes on the thread that you look at at the end.

## User-Level Threads / Coroutines / Green Threads

User-level threads are where you implement threading in userspace either by using a single thread / process or multiple without the kernel being aware that you are running multiple threads.

Using OS provided threads requires syscalls, which can be expensive. It's also not very portable because each OS tends to provide different interfaces. Because of this user-level threads can be quicker and more portable. Theoretically, user level threads can be even more cooperative too.

However, naive user-level threads have one huge issue: blocking. When a single one of your user-level threads makes a blocking syscall, the OS might block your entire thread, preventing all your other user-level threads to execute. There are many different ways to handle this. Go does this by creating a new blocking thread for each blocking syscall, so the kernel blocks that thread and not the one you were using.

## Thread Pools

A common way to get around the issues with context switching and the cost of creating threads is by creating a fixed size thread pool. You then split up your work not by threads but by units of work. Then the thread pool distributes the work among the finite number of threads.

## Thread Cancellation

How do you ask/tell a thread to die? If it dies at the wrong point, it might leave your data (which is shared by many threads) corrupted / inconsistent. There are two main ways.

  • Asynchronous Cancellation: Force a thread to right now.
  • Deferred Cancellation: Create cancellation points, where the thread checks whether it should still be running. Then the thread terminates gracefully.

## Contention

Threads can either run only within their process or run against other processes. Process contention scope is where the thread only competes for time against other threads within its process. System contention scope is the thread competes for time against all other processes on the system.

Note: pthreads let's us specify a thread's scope.

# CPU Scheduling

When does the CPU scheduler run? If your scheduler does the last two, it's called preemptive because it can forcefully interrupt a process.

  • Process terminates.
  • Process voluntarily yields the CPU.
  • Process blocks (syscall).
  • Another process finishes waiting (hardware interrupt). Preemption.
  • Process has had enough CPU time for now (timer interrupt). Preemption.

Once we pick a process, we need to do process dispatch via a dispatcher. This installs saved context, switches modes, and updates memory bounds. The time it takes to do this is called dispatch latency.

A CPU scheduler wants to min-max the following. However, notice that there is no globally optimal solutions for all cases. For example, minimizing response time requires more context switches, causing more context switches and decreased throughput.

  • CPU Utilization: How often is the CPU running a user process.
  • Throughput: How many processes (or CPU bursts) are finished per time unit.
  • Turnaround time: Time from when a job is submitted until its done.
    • Normally not great for benchmarking scheduler performance.
  • Waiting time: Time a process spend in the ready state.
  • Response time: Time from when a job becomes runnable to when it starts producing output.

Note: For measuring effectiveness, we normally measure waiting time, since that is due largely to the decisions of the scheduler.

## First-Come, First-Served (FCFS) Scheduling

This incredibly simple method of scheduling just runs processes in the order they arrive and runs them without preemption.

It is fast, taking constant time for inserting new processes and selecting new processes, and has reduced scheduling overhead by being non-preemptive.

FCFS schedulers exhibit the convoy effect, where you can have many processes that need short CPU bursts piled up behind a few that need a lot time.

## Shortest Job First (SJF) / Shortest Remaining Time First (SRTF) Scheduling

SJF/SRTF is a provably optimal scheduler in terms of waiting time (for non-preemptive and preemptive schedulers respectively). What SJF does is look at the jobs' burst time and schedule the job with the shortest burst time first. What SRTF does is look at the jobs' burst time and schedule the job with the smallest remaining time first; when a new job arrives, it interrupts the currently running one to put the one with the smallest remaining time back in.

They are virtually identical, but SJF is non-preemptive, which SRTF is preemptive.

Even though these are theoretically optimal for average waiting time, in practice they rely on us knowing (approximately) the running time of a process, which is unrealistic, and there's also a risk of starvation.

### Approximations of Running Time

There are several ways to estimate the time a CPU burst needs. Most of them involve statistical techniques using the process's previous CPU burst times.

One way is a simple average of your previous bursts. Another way is an exponential average of your previous bursts (weight the previous ones exponentially less).

The math for exponential average, where τ is the estimate burst time, b is the actual burst time, and α is some arbitrary constant (1 is more reactive, 0 is more smoothing)

τn+1=αb+(1−α)τn

## Priority Scheduling

Priority scheduling gives every process a priority number. We then schedule things with a higher priority first. In pure priority scheduling (what we'll do in this class), we only look the priority of a process, ignoring time.

Priority scheduling is not inherently preemptive or non-preemptive.

Note: In this class, we consider smaller priority numbers to be higher priority to match POSIX.

In Linux, you can change the priority of your process by using the nice command. It ranges from -20 to 19, but regular users can't set negative priorities (which are higher).

## Round Robin (RR) Scheduling

Here, we chunk up time into time quantums (normally between 10-100ms) and then distribute these in a round-robin fashion. You maintain a ready queue of processes. Whenever you start a new time quantum, your program picks the first process of the ready queue. When you end a time quantum, the OS preempts the process, putting it on the back of the ready queue, and taking the next one off the queue. If your program blocks before its time quantum is done, the program just goes to the next time quantum early.

Why is this good? This bounds wait time to (n−1)q. It makes CPU time very predictable, because you always get 1/n time, so it's like you processor is just n times lower. This means turnaround time is longer but response time is quicker.

How do you pick a good quantum? There's a trade-off between response time and overhead. The smaller your time quantum, the faster your response time but the more overhead (from context switches). The larger your time quantum, the slower your response time.

## Real-Time Scheduling

Real-time scheduling is when the scheduling of your program is a critical part of its correctness. As in, your operating system must guarantee that a process can run within say 5ms and let it run for say 10ms. Failure to do so would be a critical failure. These are called hard real time operating systems / schedulers.

Most general purpose operating system's do not meet hard real-time scheduling requirements, but they do try to meet soft real-time scheduling requirements, such as those required for multi-media programs. Soft real-time scheduling is where you're expected to respond quickly and keep vaguely in real time, but the value doesn't drop to zero if you fail to meet them.

This is done by designating processes as real time processes, giving them higher priority.

In Linux, regular users can't make their processes real time. However, to do this, you must use chrt.

## Multilevel Queue Scheduling

The idea of multilevel queue scheduling is that some categories of processes are more important. For example, batch jobs you want to run FCFS to minimize waiting time, but interactive jobs you want to run with RR to response time.

How do you determine which level queue a process should go in? You could have processes tell you, but processes can change and different OSes implement scheduling differently, so it's hard to do cross platform. We normally schedule this using feedback, where a process moves between the queues.

Feedback is based on aging or process behavior.

For example (aging), new processes may go into a RR queue with 8ms. Then going to 16ms RR queue. Then going to a FCFS queue. The idea is you bet that the process won't take much time, giving it a bit more time until it's done. This would give you a good balance of waiting time and response time.

## Multi-Processor CPU

Asymmetric multi-processing is where we treat specific cores differently. This is more common in heterogeneous multi-processor systems, where you have for example a specific core for sound processing. Symmetric multi-processing (SMP) is where we treat all cores equally. This is very common in homogeneous multi-processor systems.

Processes tend to run faster if they are repeatedly put on the same processor because of the cache. Soft processor affinity is where the OS tries to schedule processes on the same processors, but is willing to not. Hard processor affinity is where the OS mandates the processes are on the same processors; this is normally done via request.

## Linux Scheduler

Each CPU core has its own ready queue that it stores in a red-black tree sorted by virtual runtime. It is a work-stealing scheduler, meaning that a CPU can steal work from other cores if it runs out of work.

Virtual run time is the runtime of the program scaled by its niceness. Less nice processes get charged less for their time. More nice processes get charged more.

Per POSIX, Linux has 140 different priorities, with the first 100 for real-time processes.

# Synchronization

A race condition is when the correctness of your program depends on the order of execution of multiple threads/processes. This normally occurs because of non-atomic operations / memory getting changed unexpectedly, especially with shared memory.

Note: Having multiple threads read a piece of memory is okay. However, having one thread read/write a piece of memory and any other thread read (or write) that same memory is incorrect.

## Classic Synchronization Problems

There are a few standard problems that basically all computer scientists learn about.

### Bounded Buffer / Thread-safe Queue

A bounded buffer is a multi-producer, multi-consumer queue of elements. If you want to solve this just using semaphores, it would look something like this

sem emptyCount = BUFFER_SIZE;
+sem fullCount = 0;
+sem lock = 1;
+producer() {
+  while (true) {
+    Item it = makeSomething();
+    acquire(emptyCount); // emptyCount--
+    acquire(lock);
+    buffer[(first + num) % BUFFER_SIZE] = it;
+    num++;
+    release(lock);
+    release(fullCount); // fullCount++
+  }
+}
+consumer() {
+  while (true) {
+    acquire(fullCount); // fullCount--
+    acquire(lock);
+    Item it = buffer[first];
+    first = (first + 1) % BUFFER_SIZE;
+    num--;
+    release(lock);
+    release(emptyCount); // emptyCount++
+    consumeItem(it);
+  }
+}
+

### Dining Philosophers Problem

Imagine you have multiple philosophers sitting at a table. They each have a plate in front of them. Between each plate there is a single chopstick. All philosophers are sitting there thinking, looking up. Whenever they get hungry, they grab the chopstick on their left and then later on their right.

How do you prevent the Philosopher's from deadlocking? They deadlock when they all grab the chopstick on their left and thus no one can grab the on on their right.

Here's a quick list of the solutions, along with comments on them.

  • Keep an extra chopstick around: More resources aren't always available.
  • Only one at a time can eat: Horribly slow.
  • Only pick up a chopstick if you can get both: Might have starvation. Suppose the philosopher to your right starts eating and then the one to your left starts eating, alternating forever. You never get to eat.
  • Break the symmetry, make some pick left first and others right first: Works well and is reusable!

### Readers and Writers Problem

This issue is similar to the critical section problem solved with mutual exclusion. However, solving this problem allows for more concurrency.

Normally, it is safe for multiple threads to read concurrently. However, it is not safe for one thread to write while there is another thread looking/writing the memory. Formally, where nw is the number of writers and nr is the number of readers, it is safe if (nr=0 or nw=0) and nw≤1.

We now implement this using monitor pseudo-code. This implementation has an issue with starvation, where writers may starve because readers can get in if other people are reading but a writer cannot. We could fix it, but we don't here.

monitor ReadersWriters {
+  // Number of readers
+  int nr = 0;
+  // Number of writers
+  int nw = 0;
+
+  // Okay to read?
+  Condition readable;
+  // Okay to write?
+  Condition writable;
+
+  void lockReading() {
+    while (nw > 0) {
+      readable.wait();
+    }
+    nr++;
+    // Other readers waiting should know that
+    // it's safe to read. We do this because our
+    // pseudo-code doesn't use broadcast
+    readable.signal();
+  }
+  void unlockReading() {
+    nr--;
+    if (nr == 0) {
+      // Don't broadcast because we only want to
+      // wake up one writer.
+      writable.signal();
+    }
+  }
+
+  void lockWriting() {
+    while (nr > 0 || nw > 0) {
+      writable.wait();
+    }
+    nw++;
+  }
+  void unlockWriting() {
+    nw--;
+
+    // Wake a reader and a writer and let them
+    // race.
+    writable.signal();
+    // We don't have broadcast >:(
+    readable.signal();
+  }
+}
+

### Priority Inversion

Synchronization mechanisms can interfere with priority issues. Suppose you have some cheap low-priority job that acquires a lock. Then you have a medium-priority job that is very CPU intensive. Normally, the medium-priority job will run a lot more than the low priority job. However, suppose then a high-priority job comes along and tries to get the same lock the low-priority job got. Now the high-priority job is blocked by a low-priority job and will have to wait a long time!

How do we fix this? Normally, RTOS's (and possible normal OS's) will have the option for priority-inheritance, where the low-priority job will be promoted to the same level as the high-priority job while it is blocking that high-priority job.

## Synchronization Mechanisms

Most of the times with memory, you have a critical section problem, where you only have a single section (or a few) interacting with shared memory. To keep this memory safe from corruption, we put up guards around this critical section using various synchronization mechanisms (a.k.a. primitives).

Note: Ideally these critical sections are small and quick.

A good solution to the critical section problem should have the following properties:

  • Mutual Exclusion: We only want one thread in the critical section at a time.
  • Progress: Progress will always be made, you never wait forever.
  • Bounded Waiting: Can't starve a thread.

### Naive Synchronization

This example may look good, but it will allow multiple threads in if they both get past the while loop simultaneously and then set that they are inside.

bool inside[2] = {false, false};
+someThread0() {
+  while(true) {
+    while (inside[1]) {}
+    inside[0] = true;
+    // critical section
+    inside[0] = false;
+    // remainder section
+  }
+}
+someThread1() {
+  while(true) {
+    while (inside[0]) {}
+    inside[1] = true;
+    // critical section
+    inside[1] = false;
+    // remainder section
+  }
+}
+

This example solves the problem, but has the issue of deadlock, where they both say they want in and then wait for the other guy to finish.

bool wantIn[2] = {false, false};
+someThread0() {
+  while(true) {
+    wantIn[0] = true;
+    while (wantIn[1]) {}
+    // critical section
+    wantIn[0] = false;
+    // remainder section
+  }
+}
+someThread1() {
+  while(true) {
+    wantIn[1] = true;
+    while (wantIn[0]) {}
+    // critical section
+    wantIn[1] = false;
+    // remainder section
+  }
+}
+

We could try to resolve it by taking turns (strict alternation) and it works, but its generally a bad idea because its possible for the threads to not want to go through the critical section the same number of times and its also wasteful.

int turn = 0;
+someThread0() {
+  while(true) {
+    while (turn == 1) {}
+    // critical section
+    turn = 1;
+    // remainder section
+  }
+}
+someThread1() {
+  while(true) {
+    while (turn == 0) {}
+    // critical section
+    turn = 0;
+    // remainder section
+  }
+}
+

### Peterson's Algorithm

Combining strict alternation with wantIn. Essentially, it says "I want in, but I'll let you go first if its your turn." Most of the time turn isn't even looked at.

int turn = 0;
+someThread0() {
+  while(true) {
+    wantIn[0] = true;
+    turn = 1; // no, after you
+    while (wantIn[1] && turn == 1) {}
+    // critical section
+    wantIn[0] = false;
+    // remainder section
+  }
+}
+someThread1() {
+  while(true) {
+    wantIn[1] = true;
+    turn = 0; // no, after you
+    while (wantIn[0] && turn == 0) {}
+    // critical section
+    wantIn[1] = false;
+    // remainder section
+  }
+}
+

Note: This may not actually work anymore, since modern processors do not guarantee that memory writes occur in the same order appeared. This is because of performance. Because of this, we have various synchronization primitives.

### Counting Semaphores

Counting semaphores are conceptually counts of the number of threads that can be in the critical section at once. They can be naively implemented the following. However, most of the time semaphores are implemented by the OS and are much more efficient (e.g. they don't busy wait).

acquire(sem s) {
+  while (s <= 0) {}
+  s--;
+}
+release(sem s) {
+  s++;
+}
+

Here's how a semaphore would apply to our previous problem.

sem s = 1;
+someThread0() {
+  while(true) {
+    acquire(s);
+    // critical section
+    release(s);
+    // remainder section
+  }
+}
+someThread1() {
+  while(true) {
+    acquire(s);
+    // critical section
+    release(s);
+    // remainder section
+  }
+}
+

Note: In this class, we'll say you can't start semaphores at negative values. It varies across libraries.

### Binary Semaphore / Mutex

Binary semaphores and mutexes are similar and perform basically the exact same operation. Instead of having a count that gets decremented and incremented by acquire and release, you just have a boolean flag that either locks or unlocks.

They cover the most common pattern of using a counting semaphore, where you just want to have a single thread in a critical section.

### Atomic Operations / Spinlocks

Modern processors provide atomic operations and most libraries provider ways to access these ergonomically. Atomic operations are operations that will always run together and never have any instruction go in-between them and interfere / change things.

Most atomic operations have the mnemonic of test and set, where you do some check and then conditionally change the value.

Atomic operations can be used to implement spin-locks. Spin-locks are essentially good busy waiting, using atomic operations and normally yield after spinning for a bit.

## Monitors

Note: Monitors with condition variables are provably equivalent to semaphores.

Monitors are easy ways to wrap functions in locks. They ensure that anyone that wants to call this function first acquires the appropriate lock and releases it when they're done.

This prevents us from waiting within a monitor. For example, for the bounded buffer problem, we try to add things through the monitor and no one else has called it. How do we show we should also block?

The trick is condition variables. Condition variables are basically events that we can either signal as happening or wait to happen. When you wait on a condition variable, you give up your lock on the monitor and go into a queue of people waiting on that condition variable / event.

Note: Signaling on a condition variable where no one is waiting has no effect.

There are two different policies for how signaling works.

  • Signal and Wait: Whenever you signal, you wait for the thread you signaled to start and finish.
  • Signal and Continue: Whenever you signal, you continue running until you're done with the monitor. The one you woke up gets to run once you're done.
    • Most common!

We use C/Java like syntax for monitors.

monitor Maximizer {
+  // In some languages hasValC and hasVal might
+  // be able to be in the same
+  condition hasValC;
+  bool hasVal = false;
+
+  int largest;
+  void submitValue(int val) {
+    while (!hasVal || val > largest) {
+      largest = val;
+    }
+    // this only wakes a single thread / waiter
+    hasValC.signal();
+    hasVal = true;
+  }
+  int getLargest() {
+    if (!hasVal) {
+      hasValC.wait();
+      // tell anyone else waiting to wake up
+      hasValC.signal();
+    }
+    return largest;
+  }
+}
+
// Synchronized stack
+monitor IntStack {
+  condition nonEmpty;
+  Stack<Integer> stack = new Stack<>();
+  int popInt() {
+    // Must be while because suppose you have
+    // three threads A, B, C. B is waiting for
+    // something to be pushed. A just pushed
+    // something. Then C came in and popped
+    // after A pushed, without blocking. B then,
+    // having been woke up by A, wakes up and
+    // would try to pop from an empty stack
+    // (because C stole its element) if there
+    // was not a while loop.
+    while (stack.size() <= 0) {
+      nonEmpty.wait();
+    }
+    return stack.pop();
+  }
+  void pushInt(int v) {
+    stack.push(v);
+    nonEmpty.signal();
+  }
+}
+

## APIs

### semaphore.h

semaphore.h is the POSIX semaphore library. It doesn't work on Mac sadly, although they do compile, so that's cool. There are both named semaphores sem_open (return sem_t *) and anonymous semaphores sem_init (return sem_t). You must provide them initial values.

  • Type: sem_t.
  • Acquire: sem_wait.
  • Release: sem_post.

### pthread.h

Monitors are not primitives, but you can implement them via structs and functions.

  • Monitor: C has no monitor primitives. Instead you use mutexes.
    • Initialize: pthread_mutex_init(pthread_mutex_t *) or PTHREAD_MUTEX_INITIALIZE.
    • Enter Monitor: pthread_mutext_lock(pthread_mutext_t *).
    • Leave Monitor: pthread_mutext_unlock(pthread_mutext_t *).
  • Condition Variables: Luckily, condition variables are primitives, but they aren't restricted. This uses signal and continue semantics.
    • Initialize: pthread_cond_init(pthread_cond_t *) or PTHREAD_COND_INITIALIZE.
    • Wait: pthread_cond_wait(pthread_cond_t *, pthread_mutex_t *).
    • Signal: pthread_cond_signal(pthread_cond_t *).
    • Signal Everyone: pthread_cond_broadcast(pthread_cond_t *).

### Java's synchronized Keyword

In Java, every object can be used as a lock and any method can be a lock. The threads waiting for a lock on synchronized method is called the entry set and the JVM does not guarantee any order. The threads waiting for an object is called the wait set and the JVM does not guarantee any order.

Note: Even if you treat an object as a lock, other people may not. You should thus prefer using synchronized methods over using synchronized blocks on an individual object instance.

  • Monitor: You just put synchronized in a method's declaration and automatically you acquire the lock before you enter and automatically release the lock before you exit.
    • All synchronized methods on an object exclude each other. Meaning if you have synchronized a() and synchronized b(), you can't call both a and b at the same time.
  • Condition Variables: You call the appropriate methods on any Object. This uses signal and continue semantics.
    • Wait: this.wait(). This gives up the lock on this. This is why you don't want to create other objects just to wait on them, otherwise you wouldn't give up the lock on this.
    • Signal: this.notify(). Just moves someone from the wait set and into the entry set.
    • Signal Everyone: this.notifyAll(). Moves everyone from the wait set and into the entry set. This is more useful, since Java doesn't give us arbitrarily many condition variables. You just use while loops normally.

# Deadlock

A deadlock is a synchronization issue where you are prevented from making process. Formally, deadlock is when you have a set S of processes where every process in S is waiting to acquire a resource where the desired resource is held by another process in S.

We can help ourselves understand the issue using a resource allocation graph, where you use circles for processes and blocks for resources containing dots for an instance of that resource. Request edges are directed arrows from processes to resource blocks show desire (but not ownership) for instance. Assignment edges are directed arrows from resource dots to processes shows ownership.

Processes with request edges are generally blocked by the OS and the OS assigns resources to processes.

There are a few main ways of dealing with deadlock:

  • Prevent: Design for no deadlock.
  • Detect: Watch for deadlocks and do something to recover from deadlocks.
  • Avoid: Regulate process behavior so that they never reach deadlock, even though they theoretically good.
    • Think moves ahead in the game.
  • Ignore: Just hope for the best and let users deal with it! :)
    • What most OSes use! This is to avoid unnecessary overhead.

## Deadlock Prevention

There are four necessary conditions for a deadlock to occur. If you don't have all of these, you can't have a deadlock.

  • Mutual Exclusion: Some resources can only be used by one process at a time.
  • Hold and Wait: Processes can have some resources and ask for more.
  • No Preemption: OS gets a resource back only when a process is done with it.
  • Circular Wait: It's possible to build a cycle of processes.

Which condition can we prevent/remove?

  • Mutual Exclusion: The operating system generally doesn't use mutual exclusion of most resources. However, this isn't universally possible (e.g. for mutexes), so mutual exclusion is impractical to remove.
  • Hold and Wait: We could mandate that every process must request all resources at startup. However, this yields reduced resource utilization and possible starvation (because processes wait on things they hardly need or on things that others hardly need), so it is not very practical globally.
    • Remember the "you must pick up both chopsticks at once" for the dining philosophers problem.
  • Preemption: This actually isn't too bad and is done all over the place (e.g. in the CPU, in memory). The issue is that we have to remember the state where you left, but this isn't always possible because otherwise you might reach an invalid state or waste time.
  • Circular Wait: This is the most practical way to implement deadlock prevention. You do this by imposing a total ordering on all resource types, meaning you must ask for a lower number resource before you ask for a higher number resource. You can do this within your own processes, but it isn't always practical for the OS for the same reason as hold and wait.
    • This let's you choose the priority of the resource!

## Deadlock Detection

Unlike deadlock prevention, this does not prevent limit the ability of programs or limit resource utilization (until deadlock).

The pseudo-code for detecting deadlock is as follows:

While there's some process P where all of P's
+outstanding requests can be satisfied:
+  Remove all request and assignment edges for P
+  (to pretent P finishes without asking for
+  more).
+If any processes remain:
+  You have a deadlock.
+  Find cycle(s); the processes among them are
+  responsible for the deadlock.
+

Now, how do we resolve the deadlock? We have to kill a process. We could kill a resource hog, which frees up a bunch of resources, but potentially wastes a bunch of time; it also means that resource hogs tend to starve. We could kill the youngest process, which means we waste less energy.

Why don't OSes use this? It involves forcible killing of a process, meaning we wasted a bunch of time by killing an unfinished process. Also, this normally causes garbage-collector type pauses on our entire system, which isn't great.

## Deadlock Avoidance

Note: This is mostly safe state detection.

If done right, this doesn't limit the ability of programs, prevents deadlocks entirely, and can only somewhat limit resource utilization.

Often, this requires us to know the future (i.e. what the processes might request). Practically this is done by having the OS mandate that all processes stake claims on certain resources, meaning they may want to acquire them sometime in the future. If a process doesn't have a claim on a resource, it can't get an instance of it. Claims are denoted with dashed arrows on the resource allocation graph. Note: Claims are often denoted with a certain multiplicity.

This requires us define safe states and unsafe states. Safe states are where it is impossible to reach deadlock. Unsafe states are where it is possible to reach deadlock.

When now run a safe state detector whenever a request for a resource is made. This detector ensures that granting the resource keeps us in a safe state. The algorithm for the detector is called the banker's algorithm. It goes like this

  • Pretend like you granted the resource.
  • Turn all claim edges into request edges.
  • Run the deadlock detection algorithm.

# Memory

We will think about memory as a linearly addressable array of words (smallest addressable unit). Recall memory protection!

For simplicity in this class, we pretend as though memory is split into two sections: one for the resident operating system and the other for user programs. We will also pretend as that memory is allocated contiguously we with a base (start of memory) and limit (end of memory) registers.

We want our programs to not be dependent on where specifically they are loaded. How do we do this? We do this with specific address bindings. Address bindings describe how we choose the physical memory space the program will run in. There are a few main ways:

  • Compile Time: The compiler chooses the address when it builds. That is, the compiler generates absolute code.
  • Load Time: The memory address is set when the program starts running. That is, the compiler generates relocatable code.
  • Execution Time: The OS determines where the addresses should be as it starts executing.

## Linking

Linking is the process of taking relocatable code and putting it in a single location and hooking up all libraries. There are two main ways to do this: static linking and dynamic linking.

Static linking is essentially where the linker essentially copies and pastes all the relevant code into the final binary. This is simpler, but does result in larger executable binaries. It also doesn't allow for updates without recompiling your project.

Static Linking

Dynamic linking is essentially where the linker sets up symlinks to all the relevant code into the final binary. This is more complicated but results in smaller executable binaries and allows for updates without recompiling. Note: This doesn't necessarily save space in memory once they're loaded unless you can share copies in memory (especially if you only use the base and limit registers are we are assuming). This can leave you in "DLL hell", where your code suddenly breaks because of silent/undeclared incompatibilities or where you can't tell what version of the library you're getting.

This can be more sophisticated using stubs. Stubs are small little pretend functions that actually properly link whenever they are first called.

Dynamic Linking

## Loading

Loading is where you actually load the library into memory (instead of just putting it into the binary). There are two ways to do this again: static loading and dynamic loading.

Static loading is the most common. When the OS loads your program, it loads your entire program into memory including your libraries.

Dynamic loading is like dynamic linking for loading. In dynamic loading, your stubs not only link to the proper library when they are run but they also actually load/locate the library in memory when it is executed. Likewise, you have dynamically unload libraries when they are used. This can reduce your program's memory footprint significantly, especially if you use some large library only in one place of your program or only occasionally in your program. It can additionally reduce start up time by not loading all of your libraries at first.

Dynamic Loading

## Swapping

Swapping is the process of move your main memory into your backing store (normally disk). You may want to do this if your computer is running out of memory to run all of its processes.

When the OS detects that it will run out of memory, it will take a stopped process and move all of its memory to the backing store. Then, when that process wants to start, it swaps that memory back into main memory, potentially swapping something else to the backing store.

The biggest cost to swapping is transfer time, or the amount of time it takes to copy as process control block (PCB) to/from main memory.

Note: Modern OSes don't always do this for one complete process at a time.

Swapping

## Making Room for Memory

Maintaining memory is difficult, we need to

  • Maintain allocated regions,
  • Maintain unallocated regions,
  • Reclaim unused regions,
  • Efficiently allocate memory to minimize holes, and
  • Be quick.

Note: Maintaining memory is almost impossible for compile-time binding because those programs need to be loaded into an exact location. Load-time binding is much easier because they can fit anywhere as long as its contiguous.

There's a few main methods of figuring out what unused section / hole to allocate memory n words in. They each have strengths and weaknesses.

  • First-Fit: Walk down the list and chose the first hole that's as large as n.
  • Best-Fit: Find the smallest hole that's as large as n.
  • Next-Fit: ADS
    • Maintains good cache locality.
  • Worst-Fit: Find the largest hole.
    • This is good for storing holes in a heap.

As memory is allocated, we get small gaps in the memory between processes, too small to be useful. This is called external fragmentation. If you use first-fit memory allocation, on average about 50% of the memory you give out will be lost to external fragmentation.

Sometimes when processes ask for memory, you may give them more memory than they need. This is because it may be cheaper/simpler to not keep up with the little extra bit of unused memory. This is called internal fragmentation.

What if we have several allocated blocks that are not very tightly packed and we want to make them tightly packed? You can perform compaction by moving them without the process noticing. You have to be very careful with this because all pointers and memory addresses will become invalidated. To resolve this, you need execution time address binding, often with hardware support.

Hardware support? Yes! Instead of the process itself keeping actual addresses, they can keep addresses relative to some base/relocation register. Whenever the process uses an address, it is transparently mapped to an actual address by adding the value of the base/relocation register (or something more complex). Then the OS just needs to copy the memory and update the relocation register. This requires...

  • Logical/Virtual Addresses: What the user program thinks it runs on.
  • Physical Addresses: What address the memory is really at, meaningful to hardware.
  • Address Translation: Runtime conversion from logical to physical address (using relocation register).

Address translation is supported by the memory-management unit (MMU) and normally only applies in user-mode.

## Paged Memory

Our base and limit registers which we've been dealing with up until now have been fairly limited. Let's level them up using paged memory. This is a more sophisticated way of handling address translation. Paged memory isn't contiguous and is instead broken into multiple fixed-size blocks called pages. Process memory is split up into a sequence of pages physical memory is split into a sequence of page-sized frames.

Why differentiate between a page and a frame? Frames are empty places where you "hang" pages.

Paged Memory

Why do this? This virtually eliminates external fragmentation by having hardware make fragmentation "normal".

Pages are organized into frames using a page table. The page table stores frames indexed by page. Whenever the CPU wants to read memory, it looks up the frame using the index of the page and translates uses that to translate the virtual/logical address into a physical address.

Each process has its own page table and it is used by the CPU in user mode.

Here is the algorithm for doing paged memory address translation. Note: For performance reasons, the page size is (almost) always a power of two. That way we just translate the high order bits using a table lookup and keep the low order bits, instead of doing arithmetic.

class Process:
+    def __init__(self, page_size, page_table):
+        self.page_size = page_size
+        self.page_table = page_table
+
+    def translate_address(self, addr):
+        page_number = addr // self.page_size
+        frame = self.page_table[page_number]
+        offset = addr % self.page_size
+        return frame * self.page_size + offset
+

Logical Addresses

### Page Tables

How do we implement and store page tables? How big should they be? How do we tell the hardware where to look for the page table?

Currently, most page sizes are about 4 KiB. Modern hardware can support larger page tables, but this was common for 32 bit systems. That means, you'd have 12 bits for the addresses within a page and 20 bits for the page number. This means you'd have about 1 million entries in the page table, where each entry is at least 20 bits. Since 20 bits is a weird number, we normally give each entry 4 bytes (32 bits) because that makes it much easier to index into the table, so you don't have to multiply by a weird number (e.g. 3). This means the page table would take 4 MiB, with a lot of wasted space.

Note: The above calculations assume you're using a 32 bit system. On a 64 bit system, you'd likely have 8 byte page entries and possibly more bits for a page number.

Note: The size of the page numbers don't need to be the same size as the frame numbers. In other words, the physical address and logical address don't need to be the same size. This will allow you to either overcommit memory (what we do) or undercommit memory.

To help reduce the amount of wasted space, we use the extra space for other things. Here's a list of a few common uses:

  • Valid/Invalid bit: If the bit is valid, the CPU allows you to access the page. Otherwise, you can't.
    • Set by OS.
    • This is useful because it means the OS doesn't have to initialize all the memory you "have" and allows you to grow based off of what you use.
  • Read-Only bit: True if this process can't write it.
    • Set by OS.
  • Modified bit: Whenever a page is written to.
    • Set by hardware.
    • Useful for tracking whether or not we should copy out memory to disk if we're doing that.
  • Reference bit: Set by hardware whenever page is read/written (referenced).
    • Set by hardware.
    • This isn't set when you make an invalid read/write.
  • No-Execute bit: True if process can't execute code on the page. (Your stack is normally not executable.)
    • Set by hardware.
    • Used to help prevent buffer overflow, where people write arbitrary code into the stack and execute it.

We tell hardware what page we're using using the page table base register (PTBR). This can only be modified in kernel mode, as you'd expect. This is normally only switched during context switches by the OS.

### Paged Memory Tricks

Using paged memory allows us to do more clever things than just making memory allocation easier and reducing fragmentation. It allows us to do

  • Sparsely Populated Logical Address Space: We can give processes a way larger logical address space than physical address space, basically preventing the stack and heap to bump into each other.
  • Shared memory: Just given processes pages with shared frames. Useful for mutable shared memory or shared libraries.
  • Copy on write: Only copy things once there are actual changes.
    • Useful for efficient fork implementation! fork only copies the page table and sets the read-only bit on all pages. We set the read-only bit so the OS gets notified whenever the child tries to write to the page. Whenever they write, we actually copy the underlying frame and make both pages in both children writable.

### Page Table Caching

Pages can be incredibly expensive. It doubles the number of memory accesses, since you always need to look at the page table, and requires the additional step of address translation.

This can be mitigated using a translation look-aside buffer (TLB), which is a special cache for each CPU core that caches a subset of the page table. The TLB stores the page table rows using associative memory that allows for parallel search by page number. In other words, it's a hardware dictionary / map.

If you can't find the row you're looking for in the TLB, it is called a TLB miss and we have to look up the frame number in the page table. We then save the just read row into the TLB (sometimes with a few of the surroundings), removing another row (decided by hardware). If you can find what you want, it's called a TLB hit and you don't have to look at the page table.

Paging with TLB

Note: In class we normally treat the TLB as a write-back cache. It's also normally a write-back cache.

To measure the performance of the TLB, we have to consider the TLB Hit Ratio (α). Then, the effective access time is thitα+tmiss(1−α). We can calculate thit and tmiss using the TLB lookup time (ttlb) and memory cycle time (tmemory) doing thit=ttlb+tmemory and tmiss=ttlb+2tmemory.

We want to maximize the TLB hit ratio so we get good performance. How do we do that? Using locality of reference or, in other words, putting everything close together so they fall mostly in the same pages.

Since the page table is different between processes, most OS's throw away the TLB every time there is a context switch, which means that after every context switch you start anew with the cache. This is one reason why context switches are so expensive and in-process context switches are cheap.

Alternatively, some hardware marks every TLB entry with a address-space identifier unique to the process and only allows the process with the correct identifier to access values of the TLB. This let's you preserve the TLB between switches.

### Making the Page Table Manageable

As we discussed earlier, if we naively implemented page tables with 220 entries at 4-bytes each, every process would have a 4MiB page table, which doesn't scale well, especially considering very few processes actually use it all.

#### Variable Page Table Size

Simplest.

Variable page table size just allows processes to have a smaller page table and only access certain possible pages. This is normally implemented using a page table length register (PTLR) that tells the hardware the length of the current page table and then the hardware checks the length on every access. This is saved and restored on context switch.

This makes growing page tables very problematic because you have to both find more memory for the frames and the larger page table.

#### Hierarchical Page Tables

By far most common.

This resolves the problem of finding contiguous memory regions for page tables the same way page tables do. A meta-page table! (Or a hierarchical page table.)

To implement this, we break up the page table into page-sized section. This means we can mark large sections of the page table as invalid and not allocate memory for them by invalidating a page in the outer page table. Then, we can easily grow the page table when we need to by allocating a page in memory for the page table (which then gets pages to fill itself in).

Note: Technically at full load, this takes up more memory than a naive implementation, but that almost never happens.

Note: Really, both the inner and outer page table are in the same frames that normal memory is placed in.

To do address translation, we split up our logical address into three parts (unlike the normal 2). The highest order bits are for the outer page table, the middle order bits are for the inner page table, and the low order bits for the final page offset.

We can actually have more than the 2 levels discussed here! The technique works for arbitrarily many until the top level table fits in a page.

With multi-level page tables, the TLB becomes increasingly important. This is because the TLB goes straight from page number (including outer and lower page number) to the frame number. Thus you can skip each of the levels and go straight to the frame number, saving two memory accesses (one for outer and one for inner page table).

Note: All page tables except for the outermost one are guaranteed to have the same page size because they fit as much as they can in a frame. You'd like it to work out perfectly so that the outermost page table has no wasted space.

#### Hashed Page Tables

Store the sparse mapping from page number to frame number as a hash table. To handle collisions, you use a linked list on every line of the hash table. Then the hardware just hashes the page number looks in the list for a match.

#### Inverted Page Table

Since we only have a limited number of frames that doesn't change between processes, if we build the table backwards, it can be much smaller. This has more complicated page lookup, but can have decreased storage overhead.

The reason this saves so much memory is because there are often fewer physical frames than logical pages and you only have a single shared page table for the entire machine. Because the page table has to be shared, you need to verify the PID of the process.

This would have a huge performance disadvantage if it weren't for the TLB.

#### Software Address Translation

For more complex address translation methods (e.g. hashed page tables), sometimes the hardware doesn't support address translation through anything but the TLB. If it tries to use a page number not in the TLB, it traps the OS and asks it to do the address translation and put the output in the TLB. This makes TLB misses way more complicated, but means you can make the page table more sophisticated.

## Virtual Memory

Previously we talked about swapping entire process's memory to secondary storage. This was extremely disruptive to the process, not very granular, and not particularly efficient, because we had to do so much at one time.

We can make this swapping more granular by only swapping a single page at a time. Here's some terms about that.

  • Page out: Copy a page from main memory to the backing store.
  • Page in: Copy a page from the backing store into main memory.
  • Memory resident: The page is in a frame in main memory.

What are some strategies to do this?

### Demand Paging

We move seldom-used pages to the backing store and bring a page into memory when processes try to access it. This means processes take much less physical memory.

This can be pure demand paging, where we don't even bother loading pages into memory until they're first used. This can save I/O at process startup and allows less physical memory per process, allowing more processes.

How do we know when we should page in a page when it isn't in memory? The trick is we mark the pages that aren't memory resident (on secondary storage) as invalid. Then when the process tries to access one of these pages, the hardware traps to the OS and we can figure out if the page actually exists but just in secondary storage.

While we are paging in the page a process asked for, we block the process on I/O (since paging in can take awhile!). When the OS is done paging in the page, the OS updates the process's page table and wakes up the process.

### Page Fault Efficiency

What if paging in requires we page out another page? In that case, we call it page replacement with a victim, where the victim page is the page that is being forcibly paged out. This means page faults / swapping pages can be really expensive because you have to read-in, write-out, and do other administrative work to do page replacement.

With this knowledge, we can create a formula for our effective access time (EAT), that is how long it takes to access memory on average, where 0≤p≤1.0 is the page fault rate. EAT = (1-p)*memory_access_time + p*(page_fault_overhead + page_out_time + page_in_time + fix_page_table + memory_access_time).

Normally, the amount of time it takes to handle a page fault is at least 5-6 orders of magnitude above the non-page fault memory access time. This means we really don't want to page fault.

We can't pick what memory the process's ask for, so the only thing that we can really control to keep our page fault rate low is who should be the victim. Note: We don't have long to think about this because you're the OS!

There are two main policies for picking the victim. Local page replacement policy means that a process will only ever replace one of its own pages. Global page replacement policy means that any page can be the victim when a process needs to replace a page.

### Page Replacement Algorithms

We test this similar to how we tested process scheduling algorithms. We'll make up a string of pages used by a "program" and see how various algorithms perform. The most thing we measure is the number of page faults.

Belady's anomaly occurs when more memory results in worse performance. It can occur at any level, not just swapping pages. Not all algorithms are subject to Belady's anomaly, but many are.

Algorithms that aren't subject to Belady's anomaly are called stack algorithms. Stack algorithms are algorithms where the set of pages you keep in memory is a subset of the set of pages you would have kept in memory if you had one more page. In other words, more memory always means you'll keep additional pages in memory but never chose to throw out memory that would have remained with fewer pages.

#### First-In-First-Out (FIFO) Page Replacement

Always pick the oldest page as the victim.

  • Pros:
    • Extremely easy and efficient to implement
    • Only requires work when a page fault occurs. (Normal memory access doesn't require updating anything.)
  • Cons:
    • Often we have long running processes that are important.
    • Really sucks when we access memory in repeated sequences.
    • More frames can yield more page faults. Belady's anomaly.

#### Optimal Page Replacement (OPT)

This algorithm is guaranteed to give you the fewest number of page faults for a given reference string.

OPT looks into the future by looking at the references after its current position in the reference string. It then picks the reference that won't be used for the longest time as the victim.

  • Pros:
    • Guaranteed to give you the fewest number of page faults.
  • Cons:
    • Requires you know the order of page requests that will occur in the future to be properly implemented.

To get around the knowing the future, we use heuristics based of previous behavior to predict the future.

#### Least Recently Used (LRU)

This is like a backward-looking approximation looking of OPT. The idea is that pages that have been used recently are likely to be used in the future.

To implement this, you'd probably either keep a timestamp on every memory reference and then replace the page with the oldest timestamp (okay in hot path, bad in cold path.) or you could keep a linked list and move the page to the front of the list (awful in hot path, okay in cold path.) Since this is hard to implement efficiently, we normally approximate it.

One way to approximate this is to use the hardware-set reference bit. The OS clears the bit every once in awhile to see get an idea on pages are being used most often. This leads us into the Second Chance algorithm.

#### Second Chance / Clock Algorithm

We keep a pointer to the next victim page. When we go to page-out / evict the victim, we check its reference bit. (We do this even when evicting uninitialized pages.) If its reference bit is set, we clear the bit and move to the next page. If the reference bit is set, it is your victim.

This is good because it is free in the hot path and cheap in the cold path.

This algorithm performs better under pressure because it is a better approximation to LRU the faster it cycles around. So, if it doesn't cycle around for a really long time, it basically just randomly picks a page to evict after moving the victim pointer around a lot and clearing a bunch of reference bits.

#### Least Frequently Used

This utilizes the reference bit like the second change algorithm does. Every once in awhile the OS goes in and checks the reference bits. If the bit is set, it increments the pages corresponding count and then clears the bit.

Then, when it needs to evict a page, it evicts the page with the smallest count.

This solution generally has a problem with over-valuing pages that are used intensively for a short period of time and then not used for a long period of time. We could however find a way to decrement the counter properly.

Note: Sometimes LRU is absolutely awful, even in fairly common places. Imagine you access pages in the same order, over and over, (e.g. iterating over a large array) and you have almost enough frames to hold them all. This would cause you to page fault over and over and over again. Because of this, some systems implement multiple page replacement algorithms, each with a priority. When a process starts it uses the highest priority one, but if that keeps failing then it switches to the next one, eventually even settling for random page replacement.

#### Additional Reference Bits

This is similar to least frequently used, but it keeps a history of the past few reference bits. To do this, every page has a reference register or reference integer. Periodically the OS goes in and right shifts all reference registers and bitwise ors the current reference bit with the most significant bit in the register. Then, when it's time to pick a register, it picks the one with the smallest count.

Here's an example

0011 1111  # used for awhile but not recently
+1100 0000  # idle for awhile but used recently
+1100 0110  # used recently and in past
+1111 1111  # used all the time
+

This is clever and not incredibly expensive, but it's still fairly expensive because it has to do the upkeep of occasionally checking. Since page faults don't happen that often, the additional upkeep and harder choosing process of this better algorithm normally isn't worthwhile.

### Enhanced Second Chance

This is just second chance except we prefer pages that have not been written to. We want to prefer this because it means paging out is cheaper, since we don't need to write the updated page into its copy in storage. To do this, we look at both the reference bit and the dirty bit.

The following table shows the priority of the enhanced second chance algorithm. It prefers the pages at the top. The reason we prefer dirty pages that haven't been recently used is because we consider the reference bit to say whether we'll need to page something back in in the future. If we page out a clean recently used page, we'll have to page it back in later at a cost of 1. If we page out a dirty not recently used page, it'll have a cost of 1 as well because we'll only need to page it out.
ReferenceDirty
00
01
10
11

How does it make its choice? As it scans forward, it acts like normal second chance but it will only accept clean pages. However, while it is scanning it remembers the state of other pages. If it scans everything and doesn't find a clean, unused page, it goes through its memory to settle for something else.

### Page Fault Tricks

You can do some things to reduce the cost of page faults.

One method is page buffering. To do this, you keep some frames free all the time. When a page fault occurs, you page your desired page into one of the available frames. Then, you later page out an idle page to maintain your buffer / pool of free frames. This is like paying in advance. You basically hope that some pages won't be missed and your disk will sometimes be free.

Page buffering also allows for minor page faults. That occurs when you need a page that hasn't been used since it was paged out onto disk. Since we didn't actually overwrite the contents of the page, we don't need to do any I/O and can just resurrect that old page. (We call "normal" page faults major page faults in this case!) This is kinda like the OS being caught thinking that a page wasn't used anymore.

Minor page faults also allow for smarted shared libraries. When the process first tries to access the shared library that it hasn't loaded into its page table, the OS probably can handle it using a minor page fault if any other process has the bit of the shared library loaded that we want.

### Thrashing

Thrashing occurs when a process doesn't have enough pages to do the work it requires. It starts to page fault a lot and exhibit low CPU utilization and abnormally high I/O utilization, leading to an extreme decrease in overall performance.

How do we tell the difference between many I/O bound processes and thrashing? Normally, you monitor the page fault rate. If page faults are where the majority of I/O is occurring, then you're most likely thrashing.

How do we mitigate thrashing? One way to mitigate thrashing is to implement local page replacement. That way one process's bad behavior (thrashing) doesn't spread to the entire rest of the system.

### Local Page Replacement

The most common way to allocate frames for an individual process is to do proportional allocation, where you give each process a number of frames proportional to its total memory size. However, this has an issue. Process's need a minimum number of frames or else they have the potential to stop making process, since one instruction can potentially require many frames at once if, for example, the instruction spans a frame, the source and destination are in separate frames, etc. Therefore, OSes that do proportional allocation have a minimum number of frames that they allocate to a process. They want to allocate more than this minimum in general though for good performance.

How do we quantify a processes page usage? We consider the process's working set or the pages it is actively using right now. If we want to measure the process's working set, we can count the most recent n references (say 1,000,000). If we can't keep the process's working set in memory, we'll have very poor performance. In general, processes that have a smaller working set will have better performance because they are less likely to page fault; processes that exhibit better locality of reference generally have better performance.

This working set can change though as the program executes, so the operating system should have a way to adjust its frame allocation policy for a process as it executes. We normally do this through heuristics, rather than actually keeping track of the process's working set. A standard heuristic to keep is the page fault rate of the process.

### Page Replacement in Linux 2.4

The kernel maintains the following lists of pages.

  • Active list: Pages that aren't (currently) candidates for replacement.
  • Inactive lists: Pages that would (probably) make good victims.
    • Clean list: Pages that are identical to a copy on the backing store.
    • Dirty list: Pages that are not (or at least might not be).

Every once in awhile, the kernel processes the active list like second change. If the page was referenced since it last checked, it increments the age. If it wasn't referenced and the age isn't 0, it halves the age. Otherwise, it moves the page to the appropriate inactive list.

Occasionally the kernel will clean pages on the dirty list (i.e. write them out to the backing store and move them to the clean list). Pages on the clean list are potential minor page faults and as such are checked before page faulting.

# GPU Programming & CUDA

CUDA is a framework for general purpose GPU programming. CUDA is nice because it helps factor our hardware differences across GPU models and mix CPU and GPU code.

CPUs have a few powerful processing elements that are independently controllable with large caches. GPUs meanwhile have many weak processing elements that are controlled in concert and each doing pretty much the same thing with small caches. That is, GPUs follow the SIMD or single instruction multiple data design.

Note: The cache of GPUs has a different idea of locality, because you want to consider pixels vertically and horizontally adjacent to be "local".

## Jobs on the GPU

In GPU programming, the CPU (or host) is in charge while the GPU (or device) does most of the work. The host executes the serial parts of the program, prepares jobs for the device, and requests and waits for jobs/grids to execute. The device actually does the work.

How do you run jobs on the GPU? You create a block of threads, each contains 10-100s threads, with shared memory and limited synchronization support (e.g. wait for everyone else to catch up). You can still have race conditions with shared memory and such like you would normally.

Because thread blocks have shared memory and synchronization support, there's a limit on how big they can be. To get around this, we organize blocks of threads into grids or jobs, where grids can be multi-dimensional. Each block has an index within its grid and each thread has an index within its block. It uses these indexes to determine what computations it's responsible for.

Why are they organized into grids? It allows us to better model the idea of graphics and images and also take advantage of GPUs different cache locality model. We won't take advantage of that here though.

Note: You want to break your kernel up to be as small as possible, even if you think doing multiple might be better. GPU processing elements are incredibly weak but they are incredibly parallel.

## CUDA Code

CUDA uses an extended version of the C language (.cu), with additional attributes to mark where the function will run, that way it can properly compile the code.

// b needs to be in host memory
+__host__ void someFunction(int a, char *b) {
+  // C code to run on the host (or CPU).
+}
+
+// d needs to be in device memory
+__device__ void otherFunction(int c, double *d)
+{
+  // C code to run on the device (or GPU).
+}
+

Each thread in a grid executes a kernel (no relation to OS kernel). A kernel is a function that runs on the device but can be called from the host.

// Define a kernel that will execute on the
+// device and be called from the host.
+__global__ void myKernel(int a, int *bList) {
+  // C code for the device to execute.
+}
+
+int main() {
+  // Call a kernel from the host, asking the
+  // device to execute. NOTE: bList must be in
+  // device memory
+  myKernel<<<blocksPerGrid, threadsPerBlock>>>
+  (a, bList);
+}
+

To compile CUDA code, you use nvcc. nvcc presents a similar CLI to gcc and clang. Once you compile the CUDA code, you execute it as you normally would.

## Memory

The GPU has memory which the CPU cannot address. Therefore, we cannot use our normal memory techniques (e.g. malloc). Luckily, CUDA provides calls that are similar to standard memory allocation calls.

  • cudaError_t cudaMalloc(void **memp, size_t size): Fill in memp with a pointer to the newly allocated block of size bytes.
    • Don't dereference the memory in the host!
  • cudaError_t cudaFree(void *mem): Free the memory returned by cudaMalloc.
  • cudaError_t cudaMemcpy(void *dest, const void *src, size_t size, enum cudaMemcpyKind dir): Copy memory between the CPU and GPU (either direction, specified by dir).
  • cudaError_t cudaDeviceReset(): Remove all device allocations.

## Things We Missed

CUDA has per-thread registers, per-thread local memory, per-grid global memory, and per-grid constant memory. It also has the __syncthreads() barrier within a block and atomic operations on shared memory.

# Distributed Systems

Benefits of distributed computing:

  • Resource sharing: Only need one machine with a certain resource.
  • Computational speedup: More hosts mean more power.
  • Reliability: Individual nodes can fail, but the system can still operate.
  • Communication: Mostly for humans.
  • Cost effectiveness: Multiple inexpensive devices are cheaper and easier to grow.

Building distributed operating systems are a lot like operating systems. It could transparently provide resources within the network and perform other tasks such as:

  • Data migration: Transparently move data as necessary.
  • Computation migration: Execute computational steps on host with needed resources.
  • Process migration: Move a whole program while it is running. (Load balancing, data access, etc.)

In general, distributed systems need the following properties:

  • Scalability: Gradually add resources.
  • Robustness: Tolerate failure of individual components.
  • Availability: High utilization.
  • Heterogeneity: Different types of hosts can cooperate. Differences can include different computational speeds, byte order, instruction sets, operating system, etc.

There have been a lot of work on distributed computing. Although there is still much work to be done, we have made some progress.

  • Operating systems provide easy access to the network.
  • Some distributed file systems do exist.
  • Map-reduce for distributed high performance computing has been successful.

## Shareable Network Interface

Much like we built a file system to both make using the storage device easier and making it so that multiple processes can use the storage device simultaneously, we build a network interface.

Here's a list of issues this network interface has to handle:

  • Indirect Connections: We aren't always connected directly to the host we want.
  • Unreliable Connections: Messages may be lost or delayed and links may fail.
  • Network Congestion: We're sharing the network with other machines on the network, so we have to be able to route messages even with antagonists / competing applications.
  • Changing Network Topology: Devices come online, offline, and switch networks all the time.

Normally, to handle all these concerns we split the concerns into layers, where each layer handles a particular set of concerns.

### Physical Layer

Decides how we will physically connect machines and how we will encode information (i.e. binary).

Part of Ethernet and part 802.11 (wireless) handles this.

Organizes data into fixed or variable length frames and makes routing decisions for local networks. Corrects errors introduced by physical layer (normally using information stored in message header).

The rest of Ethernet and 802.11 (wireless) handles this. Also modem.

### Network Layer

Organize data (frames) into variable-length packets. Adds additional header information concerning routing data across multiple connections.

The Internet Protocol (IP) handles this.

The Internet Protocol provides a best-effort packet delivery service. Each host is represented with a 32-bit IPv4 address (or 128-bit for IPv6). Each packet is stamped with a source and destination address. Basically, you dump a packet into the network and it tries its best to route it to the destination.

There is no error detection or correction for the payload (only for the headers). There is no attempt to avoid network congestion.

Congestion may cause packets to be dropped (or more rarely errors) or even duplicated. Retransmission to recover from lost packets may reorder packets (or more rarely routing machines).

Individual IP addresses have a structure that allows routers to know who would know more about the packet. They forward the packet to this node and it continues until it reaches the destination.

### Transport Layer

The transport layer provides useful application semantics on top of the network layer. It allows for process-to-process packet delivery (rather than host-to-host). Breaks (large) messages into packets and reassembles them on arrival. Creates the illusion of connections for clients, rather than just spurious packets/messages.

Examples include the Transmission Control Protocol (TCP) or User Datagram Protocol (UDP).

#### UDP

UDP is conceptually a very thin layer. You don't need to establish a connection first and messages may be lost. Conceptually, it is just a message queue that provides error detection within messages and port numbers to dispatch messages to the right process on the host.

Note: Individual messages are called datagrams.

Port numbers are 16-bit integers that uniquely identify processes on a host.

To use UDP, you choose a port number and then create a datagram socket for that port.

Why is UDP set up? UDP is very cheap to set up and because of that fast. For certain services where real-time performance is more important than never missing a message (e.g. streaming video), this trade off is worth it.

##### UDP in Java

You just use java.net.DatagramSocket and java.net.DatagramPacket. You create a DatagramSocket on a particular client. You create DatagramPackets, which have both data and a destination (i.e. IP and port), and have the socket send these packets to the given destination.

#### TCP

Whereas UDP was a message queue, TCP is a pipe. TCP has no message boundaries (instead just sending bytes) and guarantees that no bytes will be lost or received out of order. A connection must be established first and reliability (e.g. packet loss prevention) is achieved by using acknowledgement and a timeout, retransmitting in the case of failure. It also performs congestion control, where it will slow down the sender if the receivers network is congested / we're losing too many packets. It slows the sender down by periodically blocking the sender.

Where in UDP applications where peers, TCP follows a strict client-server model. The server selects a port, sets up a server socket with that port, then starts listening on that socket. A client then sets up a socket and then tries to connect with the server by sending a message to the server on that port. The server sends an acceptance of that request and then the client responds with an acknowledgement. At that point, the server sets up a new socket that is just connected to that client. Now the client's socket and the server's new socket act like a pipe.

The server gets a new socket to allow the server socket to keep listening for new connections.

##### TCP in Java

This requires java.net.ServerSocket and java.net.Socket. The client creates a Socket with the given host and port. The server creates a ServerSocket which is basically a factory for Sockets; the server repeatedly calls ServerSocket.accept to generate Sockets that correspond to individual client sockets.

### Application Layer

This is how your application actually communicates and is what you think about most. It includes things like HTTP, SSH, and DNS.

As the name implies, this is not the job of the OS.

## Remote Procedure Call (RPC)

Often, we don't structure our code as sends and receives. Instead, we think about code in terms of functions. RPC makes this possible. Essentially, you have some framework / library that can transparently send and receive network messages and make them look as though they were executed on the same host like a normal function (hence transparent).

This is normally done by having a server with a thin client-stub that exposes all functions the server can perform. This client-stub could even be auto-generated. Then, whenever you want to do an RPC call, you call the client-stub that makes a request to the server.

RPC could easily be implemented using UDP using one-off requests which should be faster (assuming everything works). However, this is dangerous because you don't know whether the request or the response got lost. In other words, you don't know whether your function was executed or not. To cope with that, we want idempotent functions or functions that don't have any additional affect after being called more than once. Alternatively, we could guarantee that call functions either zero or one times. That is, we don't retransmit requests.

## Structures for Distributed Applications

### Client-Server Model

One of the oldest and most widely used model of distributed applications is client-server. You have one server and many different clients. It is highly centralized.

We normally split up applications into layers. A common split is presentation logic, application logic, database logic, and database management system (DBMS). We can then decide where we put each layer. Where we want to put the layers depends on the structure of our application, but here's a list of some common named splits.

  • Host-based Processing: All layers on the server.
  • Server-based Processing: Presentation logic on client. All others on server.
  • Client-based Processing: Presentation, application, and (some) database logic on client. DBMS done by server.
  • Cooperative Processing: Presentation logic and some application logic on client. Some application logic on server and database logic and DBMS on server.
    • Shared computational load!
    • More complex to design.

### Peer-to-peer

There is no server. Everyone is a "client" and shares in part of the application logic.

Scales very well but often more complicated to design.

### Transactional

Model all application logic in terms of transactions. A users then just makes various transactions with the system and the system guarantees they are executed appropriately.

# Protection

For many computing scenarios we want to enforce a certain policy on how OS resources can be used and by who. For example, maybe we don't want everyone to be able to read certain files or maybe we want to restrict how much a certain group can print.

Normally, when implementing and designing protection solutions, we talk about access rights (rules) to the operations certain users can perform on given objects (resources). Note: Instead of saying users, we normally call the things with the access rights a protection domain because sometimes we deal with groups or programs or other things.

A good permissions system allows for many different types of permission policies and fine grain control.

## Access Rights

Some common access rights are read, write, execute, append, create, delete, list (for directories). There can be access rights specific to various objects, such as printing for a printer. However, this is often handled using the standard file system access rights. (For example, printing to a printer might be write permissions.)

Often we conditionally allow domains to give away access rights to other domains. We may add an additional access right for all normal ones, for example read* (read star). Here the star means that the domain can give that permission to other domains (limited copy) or transfer that star access right to another domain. However, another more often used technique is to consider certain domains the owner of the object. The owner can give away and revoke access rights as it sees fit.

Another trick that is sometimes used is the switch access right to a domain object. This is used to allow certain domains to temporarily switch to another domain and use its access rights. However, this leads to the confinement problem, where domains can switch to another domain which has access to things the original domain shouldn't have access to. Even worse, sometimes this switch right chain can be hard to find, it is even undecidable if you allow creation of domains and objects.

How do we record access rights?

### Access Matrix

One naive / easy way would be to use an access matrix, where every row in a protection domain, every column is an object, and the internal cells are the access rights of that domain.

This is extremely memory inefficient because matrices take a lot of memory and are very sparse. As such, it is very rarely used. However, it is easy to see.

### Access List

  • Easy to know who can use an object.
  • Easy to remove an object or revoke rights.
  • Hard to answer "What can I access?"
  • Most common in general.

Basically, you convert each column in the access matrix into a list. Every list is associated with an object and contains a series of entries, each containing a domain and its access rights. You omit empty spaces which allows for much less wasted space.

Each object keeps track of its individual access list (aka column).

### Capability List

  • Easy to know what a domain can access.
  • Hard to remove an object or revoke rights.
  • Hard to answer "Who can access this?"
  • Who manages the list??

A capability list is a lot like an access list except that it lists the rows. Every list is associated with a domain and contains a series of entries, each containing its object and its access right. You omit empty spaces which allows for much less wasted space.

Each domain keeps track of its individual capability list (aka row).

### Lock and Key

  • Hard to know who can access an object.
  • Hard to know what objects a domain can access.
  • Easy to revoke access rights.
  • Maybe more efficient to represent and give out access rights.

Lock and key is like a mixture of access list and capability list. Every domain contains a list of keys and every object contains a list of locks. Then, to find out what your access rights are, a domain matches its key with an objects lock. We're normally clever, having domains share keys with the same permissions and having objects use the same keys as other objects.

Note: it is permissible for a domain to have multiple keys to the same object with the same access rights. Basically, it's okay if you have multiple reasons for accessing an object.

This is good in general because it enables easier revoking of access rights, by having keys be reasons that a domain can access that resource. Then, you just revoke that key so you don't accidentally take aways a domain's permissions to an object when it had multiple reasons of using it.

Note: There are many different ways to convert an access matrix into a lock and key system.

Note: This is kinda how Unix group ownership works.

## Standard Unix Permissions

Every user has a unique user id. Every user is a member in multiple groups. Every group has a unique group id.

Permissions are associated with each object. Every object has an owner, group, and mode bits. There are three mode bits assigned to each of the three domains. They are read, write, and execute as the permissions mode bits and owner, group, and other as the domains.

For files, read, write, and execute mean exactly what you'd think. For directories, read means you can get a listing, write means you can add / delete files, and execute means you can see file attributes.

Your groups are kinda like a list of keys and the single group for an object is kinda like a single lock for that object. You have to squint a bit though.

There's also some extra bits beyond the mode bits we normally think about. There's the setuid bit which means pretend to be the owner while executing, the setgid bit which means pretend to be the group while executing, and the sticky bit which means keep this program in memory even when it's not running. The sticky bit used to be useful to keep commonly used programs in memory for efficiency, but it's not as important anymore because OS caching has improved and we have faster computers.

### Syscalls for Unix Permissions

  • fchmod(int fd, mode_t mode): Set mode bits of file.
  • fchown(int fd, uid_t owner, gid_t group): Set owner and group of file.
  • fstat(int fd, struct stat *buf): Fill in buf with information about the file.

## Permissions and Programs

Most programs are run with exactly the same permissions as you when running. In other words, the program is you.

Some security techniques such as sandboxing change this by running the program in a limited environment to help prevent trojan horses and other exploits. The principle behind sandboxing is called the principle of least privilege, which says we should only give programs exactly the permissions they need and no more. This helps prevent accidental breakages either from mistakes or malicious programs. You can do this in a Unix-y way using groups, but that is limited in terms of how many groups you can have.

To do this truly well, we'd like programs to have some way of dynamically changing their protection domain. That way, programs could start with as few permissions as possible and assign certain module / subprocesses of the program high permissions to allow them to do just what they want to do. For example, this would allow the init system to have very few permissions but spawn off higher permission processes.

### Permissions and Java

Java actually has an interesting concept of "trusted" code. By default, code from your hard drive is considered code, but it is possible that the JVM downloads code and starts executing it while it is running. In this case, it considers the downloaded code untrusted and doesn't allow it to do certain protected operations (e.g. opening arbitrary files).

This is enforced using stack inspection from the AccessController class. It has a checkPermissions method which introspects the stack to find out if we are allowed to do privileged code. It has the doPrivileged method, which only trusted code can execute and marks the current point in the stack as a point where a privileged operation was allowed.

\ No newline at end of file diff --git a/notes/ncsu/2s/csc246/logical_addresses.png b/notes/ncsu/2s/csc246/logical_addresses.png new file mode 100644 index 0000000..d477651 Binary files /dev/null and b/notes/ncsu/2s/csc246/logical_addresses.png differ diff --git a/notes/ncsu/2s/csc246/memory_protection.png b/notes/ncsu/2s/csc246/memory_protection.png new file mode 100644 index 0000000..d406062 Binary files /dev/null and b/notes/ncsu/2s/csc246/memory_protection.png differ diff --git a/notes/ncsu/2s/csc246/paged_memory.png b/notes/ncsu/2s/csc246/paged_memory.png new file mode 100644 index 0000000..accbdc0 Binary files /dev/null and b/notes/ncsu/2s/csc246/paged_memory.png differ diff --git a/notes/ncsu/2s/csc246/process_memory_layout.png b/notes/ncsu/2s/csc246/process_memory_layout.png new file mode 100644 index 0000000..5364ba2 Binary files /dev/null and b/notes/ncsu/2s/csc246/process_memory_layout.png differ diff --git a/notes/ncsu/2s/csc246/process_queues.png b/notes/ncsu/2s/csc246/process_queues.png new file mode 100644 index 0000000..f3b8cb2 Binary files /dev/null and b/notes/ncsu/2s/csc246/process_queues.png differ diff --git a/notes/ncsu/2s/csc246/process_scheduling_states.png b/notes/ncsu/2s/csc246/process_scheduling_states.png new file mode 100644 index 0000000..581c000 Binary files /dev/null and b/notes/ncsu/2s/csc246/process_scheduling_states.png differ diff --git a/notes/ncsu/2s/csc246/simple_computer_architecture.png b/notes/ncsu/2s/csc246/simple_computer_architecture.png new file mode 100644 index 0000000..777d026 Binary files /dev/null and b/notes/ncsu/2s/csc246/simple_computer_architecture.png differ diff --git a/notes/ncsu/2s/csc246/static_linking.png b/notes/ncsu/2s/csc246/static_linking.png new file mode 100644 index 0000000..40fc4e4 Binary files /dev/null and b/notes/ncsu/2s/csc246/static_linking.png differ diff --git a/notes/ncsu/2s/csc246/swapping.png b/notes/ncsu/2s/csc246/swapping.png new file mode 100644 index 0000000..27c1057 Binary files /dev/null and b/notes/ncsu/2s/csc246/swapping.png differ diff --git a/notes/ncsu/2s/csc246/switching_layers.png b/notes/ncsu/2s/csc246/switching_layers.png new file mode 100644 index 0000000..391a494 Binary files /dev/null and b/notes/ncsu/2s/csc246/switching_layers.png differ diff --git a/notes/ncsu/2s/csc246/thread_stacks.png b/notes/ncsu/2s/csc246/thread_stacks.png new file mode 100644 index 0000000..72f71b0 Binary files /dev/null and b/notes/ncsu/2s/csc246/thread_stacks.png differ diff --git a/notes/ncsu/2s/csc246/tlb.png b/notes/ncsu/2s/csc246/tlb.png new file mode 100644 index 0000000..8e1756a Binary files /dev/null and b/notes/ncsu/2s/csc246/tlb.png differ diff --git a/notes/ncsu/2s/csc333/index.html b/notes/ncsu/2s/csc333/index.html new file mode 100644 index 0000000..61edd43 --- /dev/null +++ b/notes/ncsu/2s/csc333/index.html @@ -0,0 +1 @@ +Eli | CSC 333: Automata, Grammars, and Computability

CSC 333: Automata, Grammars, and Computability

Instructor: Dr. Don Sheehy | Semester: Spring 2020

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/2s/index.html b/notes/ncsu/2s/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/2s/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/ncsu/2s/ma341/index.html b/notes/ncsu/2s/ma341/index.html new file mode 100644 index 0000000..5669e95 --- /dev/null +++ b/notes/ncsu/2s/ma341/index.html @@ -0,0 +1 @@ +Eli | MA 341: Applied Differential Equations I

MA 341: Applied Differential Equations I

Instructor: Mrs. Leslie Kurtz | Semester: Spring 2020

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/2s/ma405/index.html b/notes/ncsu/2s/ma405/index.html new file mode 100644 index 0000000..f53a240 --- /dev/null +++ b/notes/ncsu/2s/ma405/index.html @@ -0,0 +1 @@ +Eli | MA 405: Introduction to Linear Algebra

MA 405: Introduction to Linear Algebra

Instructor: Dr. Alina Duca | Semester: Spring 2020

Table of Contents

# Scanned Notes

Scanned PDF.

# Cheatsheet

Thruout this cheatsheet, I use Householder notation. That is, matrixes are denoted with capital English letters A,B,..., vectors are denoted with lowercase English letters a,b,..., and scalars are denoted with Greek letters α,β,....

## Vector Space Properties

We say a set V over field F with operations addition + and scalar multiplication ∗ is a vector space if and only if the following properties hold for all vectors u,v,w∈V and all scalars α,β∈F.

Note: A field is the scalars that make up vectors in V. Often F is the real numbers R.

  • Addition:
    • Closure: u+v∈V.
    • Commutativity: u+v=v+u.
    • Associativity: (u+v)+w=u+(v+w).
    • Identity: ∃0∈V such that u+0=u.
    • Additive Inverse: ∃−u∈V such that u+(−u)=0.
  • Multiplication:
    • Closure: α∗u∈V.
    • Identity: ∃1∈F such that 1∗u=u.
  • Distributivity:
    • Vector Additive Distributivity: α∗(u+v)=(α∗u)+(α∗v).
    • Scalar Additive Distributivity: (α+β)∗u=(α∗u)+(β∗u).
    • Scalar Multiplicative Distributivity: (αβ)∗u=α∗(β∗u).
\ No newline at end of file diff --git a/notes/ncsu/3f/csc326/burndown_chart.png b/notes/ncsu/3f/csc326/burndown_chart.png new file mode 100644 index 0000000..c25d192 Binary files /dev/null and b/notes/ncsu/3f/csc326/burndown_chart.png differ diff --git a/notes/ncsu/3f/csc326/index.html b/notes/ncsu/3f/csc326/index.html new file mode 100644 index 0000000..41f305a --- /dev/null +++ b/notes/ncsu/3f/csc326/index.html @@ -0,0 +1,284 @@ +Eli | CSC 326: Software Engineering

CSC 326: Software Engineering

Instructor: Dr. Sarah Heckman | Semester: Fall 2020

Table of Contents

# Administrivia

WeightComponentAdditional Info
20%Onboarding (OBP)Aug 13 - Sept 30
40%Team Projects (TP)Sept 30 - Nov 11
40%Weekly QuizzesDuring the week. Can make 3 up.
  • No exams! Just quizzes. :)
  • Notify for absences, especially for lab.
  • Extra Credit: 2 of the following activities. Each activity gives you 1 point on your quiz average.
    • Software Engineering Research Study: In Piazza.
    • CSC Seminars.
  • Quizzes: Moodle.
  • Academic Integrity:
    • As long as you cite your sources for online resources, you're good.
    • Solo quizzes are open book and everything.

# Bugs & Issues

  • Fault: Underlying issue in the code/project. Caused by mistakes normally.
  • Error: Incorrect program state resulting from the execution of a fault. Doesn't necessarily cause failure.
  • Failure: Observable incorrect behavior.

When you run into a failure, you want to create a minimum reproducible example. This is a minimum number of steps / bit of code to reproduce the issue. You should try to generalize the issue as much as possible. That is find out exactly what kind of circumstances the issue occurs under and try to make it as generic as possible.

For our class we need a reproduction, isolation, and generalize section in our bug reports. Probably want to use GitHub template.

# Maven

Maven (mvn) builds projects by reading the project object model (POM) file pom.xml and executing a sequence of steps to reach a specified target. The POM can declare dependencies, custom profiles that apply a group of settings, build plugins that define custom targets and steps, and all that fun stuff!

Maven looks for dependencies in the repositories section of the pom.xml. By default it uses mvnrepository.com.

# CoffeeMaker Tools

To test the frontend, we use Selenium. Selenium is a browser automation tool meant to help test web frontends. It allows you to scrape the HTML DOM to find if elements exist and also manipulate the web browser by clicking on things or doing other normal user interactions programmatically. Selenium is built on top of JUnit so it makes tests easy to set up and run if you already use JUnit.

To do test, we use Cucumber, which uses the Gherkin. It believes that by making tests look closer to natural English makes it easier to write tests, especially for non-developer users.

# Requirements Engineering

  • Requirements: Definition of what the system should do.
  • Types of Requirements: In general, you want more functional requirements that non-functional requirements because they are easier to test and verify.
    • Functional Requirements: Something that the system must explicitly do.
    • Non-functional Requirements: User-visible parts of the system not directly related to what the program does. (e.g. usability, privacy, performance, security)
    • Constraints: Non user-visible constraints that restricts the development process. (e.g. deployment troubles, implementation language)
  • Requirements Elicitation: Process of getting the requirements.
  • Requirements Validation: Process of reviewing requirements with the stakeholder to ensure that they are:
    • Traceable: Ensure that you can see where each requirement comes from.
    • Non-prescriptive: Says nothing about how programmers will solve the problem.
    • Consistent Language
    • Testable
    • Concise
  • Stakeholders: People that care about the software system or want it.
  • Requirements Engineering: The process of having stakeholders and engineers communicate to form a set of requirements / required behaviors.
  • Business Case: The motivation behind the system and its requirements.
  • Language of Requirements, sorted from most important to least important: shall, should, may, shall.

Why do we care? The most common causes of software project failures is communications (requirements!) based. For example, incomplete requirements, lack of user involvement, unrealistic expectations, etc. Cost goes up in fixing/detecting as you go further into the project.

Requirements engineering has two parts: analysis and modeling. Analysis is understand user needs to create a system definition. Modelling is transforming the system's requirements into an actual software system.

## Requirements Elicitation

One of the most important parts of requirements elicitation is understanding why the system needs a certain behavior. It gives context to the requirements. This is called the business case.

In this class we will use a use-case style of requirements, which is a semi-formal way to document requirements. It's more formal than stories but less formal than requests for proposal.

## Use Cases

Use cases are written by the developers.

The way we build use cases is by listening to stories, which is a series of things that a specific user/actor should be able to do. The actor is a representative for a whole class of users. Normally for user stories we just follow the happy path (or the case with no errors). We do this by describing the preconditions and then the main flow of what the user does. There are sub-flows which are slight changes on the main flow or more descriptive descriptions of the flow. Then there are alternative flows which describe error conditions and error handling. The main flow should connect to alternative and sub-flows.

These user stories are collected to create a big picture where we combine all the user stories to understand all the things that the system should be able to do. This allows us to understand the value of the system.

We then can break up the system into slices which we can deliver and build incrementally and adapt as requirements and teams change.

## User-Stories

User-stories are an informal and highly collaborative form of software engineerings. (Agile!) Agile in general tries to embrace that requirements change by regularly delivering and collaborating with the stakeholders. They are written by the stakeholders.

In general user-stories should be of the form like "As an X, I want to do Y, so that I can Z."

Since user stories are so small, teams that use them often also use epics. Epics are larger changes that cannot be made in a single iteration and are broken down into a family of stories.

User stories should follow INVEST:

  • Investigate-able
  • Negotiable
  • Valuable
  • Estimate-able
    • If you cannot estimate due to lack of experience, run a spike where you just do a prototype except with an epic/edgy name.
  • Small: Small enough that it can be done in a single iteration.
  • Testable

There are many ways to organize stories. Kanban boards are a list of in-progress, done, and to-do tasks. You can also break them down differently.

## Traditional Requirements

Traditional requirements are very formal like government contracts.

# Testing

  • Closed / Black Box Tests: Concerned with requirements and validation, regardless of implementation.
  • Open / Glass / White Box Tests: Testing implementation
  • Types of Coverage:
    • Class
    • Method
    • Line
    • Statement
    • Branch: Individual branches in the control flow graph.
    • Clause: Parts of statements.
    • Path: How many unique paths are you taking through the control flow graph.
    • Requirements: No code at all! Just do you have test cases for your requirements.
  • Types of Testing:
    • Unit Testing: Test single bits of code. Normally a single function or component, linked to a very specific bit of the requirements or code.
    • Integration Testing: Test combinations of multiple components. Test multiple functions or classes. Helps catch things like "where will user input be sanitized?" or "where will errors be handled?"
    • Functional/System Tests: Test conducted on the entire system. Can be done manually or automated with tools like Selenium.
    • Acceptance Tests: Formal tests to determine whether the solution satisfies the acceptance criteria. Normally done by the customer (and in this case the teaching staff).
    • Regression Testing: Test things for specific functionality and run old tests on current code. Helps prevent breaking current functionality.
    • Selective Retesting: When you have a tests that take a long time to run, often you only want to run a small selection of them to give developers feedback more quickly.
    • Beta Testing: Unstructured testing by a subset of the users.

We care about test coverage here. Test coverage is a lot like lines of code. It can give you a ballpark idea, but it can't tell you about missing code and many bugs occur because of a single small line in a large function that can easily go untested. Test coverage can help you identify dead code or code that isn't required for your system. For example, why do I need this code?

There are two main approaches of development with testing. There is test driven development (TDD), where you iteratively write failing tests and code to pass said tests. This focuses heavily on unit tests. There is behavior driven development (BDD), where you look at the behavior of the system at a higher level. This is with the hope of having customers write some of the tests. In this class we use Cucumber for this.

To create tests, we consider equivalence classes and boundary values. For equivalence classes you divide up all possible inputs into sets of similar values and pick a semi-random representative from the set. For boundary values, you pick values that are right on the edges of your equivalence classes and test those.

## Control Flow Graphs

Control flow graphs are useful for code analysis, both in testing and compiling. Control flow graphs are composed of nodes, which are statements represented by squares in the visual, and branches, which are things like if, for, and while represented by diamonds in the visual.

We can compress a series of nodes with no branches into a basic block, which a series of statements where executing the first statement in the block ensures that the last one will be executed.

Using the formalism of a control flow graph and graph theory, we can make some assertions about how much testing we need to get branch, statement, or path coverage. In this case, branch coverage is executing all edges and statement coverage is executing all nodes. This is how static analysis tooling works!

# Design

One of software engineering's main goals is to create well designed software. However, unlike many other traditional engineering projects, software normally has no "physical" representation, or at least one that is useful. That means communication is really hard.

In this class we'll use UML because it's easy to grade, even though it's only used by ~30% of surveyed software developers in industry.

## UML Class Diagrams

Attributes are just listed in the class. They're the same as association except they're simpler value types or external types.

Association is where a class has a field of another class in your project. It is represented by a black arrow with an arrow head, labeled in the middle by the field name and on the head by the multiplicity of the field. You should also label the base of the arrow with

Aggregation is where one class contains another class. It's like a stronger version of association. The owned class can exist without the owning class. This is represented the same way as association except with a white diamond head.

Composition is where one class fully owns another class. It's like a super strong version of aggregation, where the owned class doesn't make since without the owning class. Normally this is an inner class. This is represented the same was as aggregation except with a filled black triangle head.

Generalization is how we show inheritance of types. It is show with a white triangle head with a solid line for class inheritance and a dashed line for interface inheritance.

For abstract methods of an interface or abstract base class is italicized.

## UML Sequence Diagrams

UML sequence diagrams let us model the dynamic execution of the program, as opposed to the static layout that class diagrams give you. Every class gets its own line. The flow of control goes down in time and changes lanes whenever we call a method of another class. When we change lanes, we draw a solid arrow labeled by the name of the called method. The line goes from the previously running line to the newly called object. The returns of methods are denoted using a dashed line labeled by both the name of the method returning and the returned value. When we create a new object, it's line appears. When we destroy an object, it's line disappears.

## UML State Diagrams

State Diagrams are a higher level representation of a finite state machine (FSM) where the entire state of the machine is represented by the FSM.

Every state is represented by a box or circle with the name of the state.

State diagrams follow the standard deterministic finite automata rules. There is one initial state but there can be multiple final states. Every state must be reachable from the initial state. Every state must have a path to the final state. States not shown are error states.

Every transition arrow has optionally a trigger, guard clause, and activity. The trigger is what causes the transition. A transition is only taken if the guard clause also holds though. The activity is what the application does on that trigger beyond just transition.

# REST APIs

REST (REpresentation State Transfer) is a way to interact with backend models, controllers, and services in a language agnostic, networked way.

Why use RESTful APIs? REST can work over the network which allows you to keep your proprietary code secret by hiding it behind the network. It's also the easiest way to distribute your application. Most personal computers have web browsers which are essentially giant JavaScript and rendering engines, so if you design your front-end in JavaScript (or WebAssembly!), then your application can be run without installing anything (kinda). However, JavaScript is slow and we often want to interact with some remote data. To get around this, we create a server in any language we want and interact with it over a REST API. Then we have a single server we control and can optimize as we want and share data with clients as they request.

Essentially, REST APIs (with a lot of work) can allow us to achieve the following desireable properties of service (e.g. social networks):

  • Performance: Appropriate component interactions.
  • Scalability: support large numbers of components and interactions among components.
  • Simplicity of interfaces.
  • Modifiability of components.
  • Visibility of communication between components by service agents.
  • Portability of components by moving program code with the data.
  • Reliability when failures within components, connectors, or data

Most REST APIs use HTTP as the transport protocol and serializes/deserializes data using JSON (sometimes XML, Protobuf, MessagePack, etc.).

HTTP requests have verbs (the type of request) and nouns (the resource requested). For example GET /recipes has the verb of GET and the noun of /recipes. It would return a JSON-formatted array of recipes, for example.

Some of the most common types of operations an application needs to make is called CRUD operations (create, read, update, delete). Each standard CRUD operation has its corresponding HTTP verbs.

  • GET: Retrieve record.
  • DELETE: Delete record.
  • POST: Create record.
  • PUT: Update record.

On top of normal HTTP nouns, we can add parameters to provide additional information. This is useful if the noun represents a function call and the parameters are the arguments to the function. For example, GET /dogs?color=red&state=running&location=park has the parameters color=red, state=running, and location=park.

## REST API Designer

REST APIs should never remove or change things without making a major version number change. This is to not break old clients. Since we often want to make breaking changes, it's good to include a major version number in the path (e.g. /api/v1/resource), so you can change the version number and then make breaking changes.

Since you (should) never remove or change things without making a major version number change, what you expose should be very well thought out. If you're not sure how things should be split, try to release or expose only a stable subset as you work on the final design.

As with any API, you should name things clearly and consistently and make sure that the user doesn't have to do checks that you (the server) could do.

In general for performance (and simplicity), REST APIs should be stateless and cacheable, so that you can improve performance with caches more easily and simplify the client server interactions.

If your API holds sensitive data, you should use standard authentication protocols like OAuth.

To make the API more performant, when you have infinite or extremely large data you should either stream partial responses (chunks) of data or provide some pagination where the client requests a certain page. The page doesn't have to be absolute. For example Discord's API for getting messages can get you n messages after the given message ID.

## HTTP Errors

  • 200: Okay.
  • 400: Bad request.
  • 404: Unknown path.
  • 500: Internal server error.

## Frameworks

Frameworks are meant to make creating applications easier by being a collection of opinionated defaults that help you easily set up your application.

Essentially, you are just "filling in the slots" provided by the framework. There's generally two ways to do this: black-box (compose objects) and white-box (inheritance), named such because in black-box you don't need to know how the bits of the framework work (as much) but with white-box you do.

There are several ways frameworks work, but the Spring framework we use extensively uses dependency injection (basically parameter passing). There are 4 main roles in the Spring framework.

  • Service: Any object that can be used.
  • Client: Any object that uses other objects.
  • Interfaces: How a client may use the services. Never treated as concrete, so there's no construction or extension by a client.
  • Injector: Constructs services and injects them into the client, possibly constructing the service as well.

Dependency injection is nice because it makes the code configurable using config files, meaning you can change behavior without having to recompile and helps create an isolated client. The downsides you get an explosion of types, hard to trace code, and complex links between classes.

# Architectural Patterns

Architectural patterns consist of component types that perform some function at runtime, a topological layout of components showing their relationships, and a set of connectors that facilitate communication.

We'll list broad families and individual styles within those architectural families but most systems are hybrid or combinations of different styles.

## Data Centered

Data centered architectures tend to have a centralized data store (that may be distributed) that communicates with many clients. This is good because it allows for easier backups and easier administration for the downside of somewhat harder to track errors.

This data centered architecture is broadly split into the repository model and the blackboard model. Of course, projects often straddle or use both of these models.

In the repository model, the central database is passive and the clients are active. Client's poll the repository for information and the repository. This makes it harder to update/change the repository but potentially reduce load on the repository. It is better for systems where data is less real-time and people request to see things rather than get notified to see things (e.g. YouTube, Google Drive, Spotify, Instagram, Reddit). This does mean that everyone must agree on a data-interchange format and the repository may be a bottleneck.

In the blackboard model, the central database is active and the clients are active. Essentially, it's a PUB/SUB (publish/subscribe) system where clients subscribe to updates and the central database pushes events to the clients. It is better for systems where you need to react immediately to things rather than request to view them (e.g. eBay, Slack, Discord, Weather Service Alerts). This is good for systems that are non-deterministic, but it does require complex infrastructure.

## Call and Return

In call and return you essentially just write a program like you would normally. You organize your code into a series of function calls or similar ideas.

There's the main program and subprogram split, which is literally just procedural code where you call functions to do things. It's easy to write and understand, but can get really messy.

There's the object-oriented design, which we know very well. You design the system using interfaces and each class fulfills the interface. Because of interfaces, you can get easier code reuse and potentially easier to understand code as you separate certain aspects of the code get abstracted away. It can also get really messy and hard to understand like main program and subprogram, but it can make it easier to understand.

There's the layered design, where we split to design into layers where (ideally) every layer can be swapped out for an equivalent layer and every layer communicates with a clean, abstract interface. This is incredibly common, with OS code vs userspace code, the networking stack, and good object oriented code. This is good because it's easy to understand and extend because every layer is independent and well encapsulated. This can be bad because structuring layers can be incredibly difficult, causing leaky abstractions that actually cause more harm than good. Also, performance may suffer because of all the layers.

## Data Flow

In data flow style architectures, you design your system as a pipeline from a data source to a data sink. It is good for systems that need to be distributed or parallelized.

There's pipe and filter where you model your program as a set of inputs and outputs where you do local transformations and filters on the data. This is good because it easily handles infinite data (incrementally) and parallelization. It's limited (intentionally) by not having knowledge of other filters and having no shared state. This is because all filters work at the same time. One example architecture of map-reduce where you represent your problem into an easily parallelizable map function that gets applied to every element and then a reduce section that is both associative and commutative (e.g. sum or union) so that it can also be executed in parallel. If the reduce part of not associative and commutative, then it may have to be done sequentially. This can be harder to write but is easier to parallelize and often more performant.

There's batch sequential where you sequentially transform data but split it into batches to process in parallel. It can be easier to write but harder to parallelize and potentially more buggy.

## Event Systems

For event systems there is explicit invocation where you request things to be executed to change and implicit invocation where something changes on the system and it executes a callback you provided.

# Human Computer Interaction (HCI)

HCI focuses on the human aspect of computer system. It tries to make systems ergonomic and easy to use intuitively.

Why is this important? If you're creating a system for people, it would be good if people can actually use it. If people can't use it or can't use it safely, then you are wasting time and putting lives at risk. Intuitive software also saves money in terms of support and training materials.

For example, Tesla's (early) autopilot systems allowed humans to pay too little attention for too long. This meant that when the system suddenly requested human input, people had to very quickly become re-adjusted to what is happening on the road, leading to overcorrections and crashes.

One of the most important ideas of HCI is the context for use. That is, what is going on around the user when they're using your software. Is it cold? Are they stressed out? In a hurry? etc.

We'll cover three main perspectives physical computing, cognitive computing, and social computing.

Physical computing tries to make things ergonomic with no distractions. So recognize the ambient sound and lighting that will be around the user. Understand where they'll be working. By considering that you can make your project more comfortable to use safely and effectively. Normally you consider anthropometrics, which is the shape, size, strength, etc. of the human body. Anthropometrics help you understand issues with posture and muscle strain.

Cognitive computing tries to understand what is going on in the persons mind. So are they old/young, disabled, stressed, hurried, etc. By understanding what they can understand and know you know how to make things less confusing to them. You normally try to remove cognitive noise. You try to understand people's mental models for how the system works and make the system operate as closely to that mental model or shape their mental model to be as close to the system as possible.

Social computing tries to understand how people communicate and what their prior relationships are. This can make your software less socially awkward and easier to use effectively. It can also help you know when to notify people to do things. How do you facilitate communication between people? If you don't consider this you can have communication difficulties. For example, plane crashes if the pilot and traffic control cannot communicate because of a sudden update.

How do you apply all those principles? Concept design is the process of white boarding or otherwise generating ideas and alternative solutions. We often talk about task flows, where you have three columns (or rows): what the user does, how the system should function, and them some space for notes.
UserSystemConsiderations for Design
1. Gather new contact details
2. Locate contact area in applicationCreate button on home pagePrimary action in the app so button should be front and center of Home page
3. Enter contact detailsText fields to enter contact detailsRequired fields: name, email, phone. Optional fields: address, birthday.
4. Save new contact detailsSave button and way to show user new contact has been created and savedCreation success means info is read only and presented in the UI

You can also create a wireframe of what the user interface should look like at a low-fidelity high level. This is meant to be easier to write than the corresponding code.

# Persistent Data / Databases

In CSC 216 we did simple serialization (e.g. XML, CSV, JSON, Java serialization, Python pickling, etc.). This is good for small data and for human interaction but are slow for edits small with respect to the whole data size.

However, when we want to constantly have out data be persistent and have high performance for small edits, a database can come in handy. They store data on the disk for persistence, but some also uses memory for performance.

The specific types of database we'll be talking about are relational databases.

Relational databases model data essentially like a collection spreadsheets or tables. These tables are managed by the RDBMS, which is a system optimized for inserting, updating, selecting, and deleting data in the database. CRUD operations! (Normally) each table represents a single class, the columns the fields of the class, and the rows the instances of the class. Many RDBMS (e.g. PostgreSQL, MySQL) use the Structured Query Language (SQL), which is a semi-standardized language for describing queries.

Note: In SQL databases, we normally use snake_case for column names.

Why do we use relational databases here? They are commonly used in industry and map nicely to objects. This mapping can be done systematically by an object relational mapping (ORM).

Note: If something can be (easily) calculated from data in the database, you shouldn't store it because that wastes space and allows data in the database to get out of sync. Using linear algebra terms you basically want a linearly independent set of columns (or a basis for the data you want!).

## Hibernate

In this class we'll use the Hibernate object relational mapping, which is an ORM framework that uses annotations and a config file hibernate.cfg.xml to support the connection between Java objects and persistent storage. Here's an annotated and simplified example from CoffeeMaker's hibernate.cfg.xml.

The SHORTENED link is: http://www.hibernate.org/dtd/hibernate‐configuration‐3.0.dtd. It is too large to fit attractively.

<?xml version="1.0" encoding="utf‐8"?>
+<!DOCTYPE hibernate‐configuration SYSTEM
+  "SHORTENED">
+<hibernate‐configuration>
+  <session‐factory>
+    <!--
+    Specifies the Hibernate dialect for the
+    version of MySQL
+    -->
+    <property name="hibernate.dialect">
+      org.hibernate.dialect.MySQL5Dialect
+    </property>
+    <!--
+    Drop and re‐create the database schema on
+    startup, useful because CoffeeMaker is a
+    toy.
+    -->
+    <property name="hibernate.hbm2ddl.auto">
+      create
+    </property>
+    <!--
+    Connection properties, specifies the DB
+    Drive (JDBC) and connection URL.
+    -->
+    <property
+      name="hibernate.connection.driver_class">
+      com.mysql.jdbc.Driver
+    </property>
+    <property name="hibernate.connection.url">
+      jdbc:mysql://localhost/coffeemaker
+    </property>
+
+    <!--
+    Ideally you'd create a user with minimal
+    privileges and a strong password for
+    security.
+    -->
+    <property
+      name="hibernate.connection.username">
+      root
+    </property>
+    <property
+      name="hibernate.connection.password">
+    </property>
+    <!--
+    JDBC connection pool (use the built‐in), and
+    size.
+    -->
+    <property
+      name="hibernate.connection.pool_size">
+      10
+    </property>
+    <!-- Echo all executed SQL to stdout -->
+    <property name="show_sql">true</property>
+
+    <!-- List of persistent classes -->
+    <mapping
+      class="coffee_maker.models.Recipe" />
+    <mapping
+      class="coffee_maker.models.Inventory" />
+  </session‐factory>
+</hibernate‐configuration>
+

Here is an annotated example of a plain Java class that uses Hibernate

@Entity
+@Table(name = "recipes")
+public class Recipe {
+  // The columns in the database. Primitives
+  // don't *need* to be boxed into their Object
+  // form. But `null` means that something
+  // doesn't exist, which is different from the
+  // zero value of the primitive. However, if
+  // you guarantee that the column always have a
+  // value then you can use the primitive.
+
+  @Override
+  @Id
+  @GeneratedValue(generator = "increment")
+  @GenericGenerator(
+    name = "increment",
+    strategy = "increment")
+  private Long id;
+  @NotNull
+  private String name;
+  @Min(0)
+  private Integer price;
+  @Min(0)
+  private Integer coffee;
+  @Min(0)
+  private Integer milk;
+
+  // Mark this as the primary key that is
+  // auto-incremented by 1 with each insert. The
+  // primary key must be unique and is fast to
+  // look up by.
+  public Long getId()
+    return id;
+  }
+
+  // getName, setName, getPrice, setPrice, ...
+}
+

Here is a simple interaction with the database to atomically save the object.

Note: If you open a connection to the database, you have to close the database connection, much like with files. Otherwise you can get denial of service by leaking connections. Sadly, Session does not implement AutoCloseable.

public void save() {
+  final Session session =
+    sessionFactory.openSession();
+  // Wrap the operation(s) in a transaction to
+  // make them atomic. Ideally you'd use a
+  // try-with-resources block, but the example
+  // in class didn't use that.
+  session.beginTransaction();
+  // CRUD operation
+  session.saveOfUpdate(this);
+  // Commit the transaction, actually making the
+  // changes.
+  session.getTransaction().commit();
+  // Close the session!!
+  session.close();
+}
+

## Database Testing

How do we test with databases tho? Good point, they're really complicated. We especially don't want to test on the production database because that could really mess things up.

To get around this, we use a test database and mocking. A test database is just your normal database except without any important data. Normally you wipe the test database at the start of every test run to keep the tests reproducible. We can also create a mock database, which vastly simplifies thing. We basically just hard-code data and create the minimal interface that we actually use. There are libraries that make this easier, like Mockito.

## Structured Query Language (SQL)

SQL is a declarative language, which means we just state what we want.

Most SQL databases are case insensitive. However, some of them are so normally we make keywords all UPPERCASE. SQL strings/characters use single quotes.

SQL supports a fairly large set of built-in data types, although you can extend this in some databases using plugins.

Here's an annotated example of the standard SQL you would run to create a database, make a table in it, and add some rows.

-- Create a database called coffeemaker
+CREATE SCHEMA coffeemaker;
+-- Start "using" the database, basically cd in
+-- it. (This is a MySQL thing.)
+USE coffeemaker;
+
+-- Create a table with the following fields
+CREATE TABLE recipes (
+  id BIGINT NOT NULL AUTO_INCREMENT,
+  -- 20 bytes pseudo-string
+  name VARCHAR(20) NOT NULL,
+  price INT,
+  coffee INT,
+  milk INT,
+  chocolate INT,
+  -- Specify the primary key. This is the thing
+  -- that is fastest to look up by and must be
+  -- unique for each row.
+  PRIMARY KEY (id)
+);
+
+-- Add a row into the 'recipes' table.
+INSERT INTO recipes
+(name, price, coffee, milk, sugar, chocolate)
+VALUES
+('Coffee', 50, 1, 1, 1, 0)
+;
+
+-- Select all the recipes and show them
+SELECT * FROM recipes;
+

Let's look a little more at those SELECT statements. SELECT statements are how you extract data from a database. They have the general form of

SELECT <cols> FROM <tables>
+WHERE <conditions>;
+

Some of the simplest types of queries are where you select multiple columns and filter by different columns. Here's annotated examples.

-- Select every column from the recipes table.
+SELECT * FROM recipes;
+
+-- Select the name column from the recipes
+-- table.
+SELECT name FROM recipes;
+
+-- Select the recipe name with an id of 1.
+SELECT name FROM recipes WHERE id = 1;
+
+-- Select recipes with at least one unit of
+-- coffee and one unit of milk.
+SELECT * FROM recipes
+WHERE coffee > 1 AND milk > 1;
+

As you can see above, * is the wildcard (matches everything). For comparisons, we use >, >=, <, <=, =, != (note one equals for equality). To check for null we use $columns IS NULL.

We can do more advanced queries by doing filtering, sorting, and aggregation.

-- Filter out all non-unique column combinations
+SELECT DISTINCT <columns> FROM <table>;
+
+-- Sort the columns by the <orderby columns>
+SELECT <columns> FROM <table>
+WHERE <conditions>
+ORDER BY <orderby columns>
+;
+
+-- Aggregate all columns by the groupby column
+-- and count the number of matches in that
+-- group.
+SELECT <columns>, COUNT(<groupby column>)
+FROM <table>
+WHERE <conditions>
+GROUP BY <groupby column>
+;
+

## Using Persistent Objects

When we want to reference rows in a table, we need the row's primary key. The primary key is a unique value (normally integer) which is the fastest way to look up something. We can insert this into other tables either as the direct value (gross! It's unchecked) or as a foreign key. When we use a foreign key, the database checks that the foreign key actually is a valid key in the table. It also does neat stuff with cascading deletes and the like. You can think of the foreign key as a reference to the row in the table or a restriction on the raw value.

Concretely, this is used if you want to have one class have a reference to another class. For example, consider the following two classes (sans annotations, IDs, etc.).

class User {
+  String name;
+}
+
+class Transaction {
+  User purchaser;
+  Integer cost;
+}
+

This would result in the following two tables, users and transactions respectively, where purchaser is a foreign key.
idname
1Eli
......
idpurchasercost
.........
2110
.........

Here's how you create a foreign key

CREATE TABLE transactions (
+  id BIGINT NOT NULL AUTO_INCREMENT,
+  purchase BIGINT,
+  paid INT,
+  -- id is OUR primary key
+  PRIMARY KEY (id),
+  -- Create a column called purchase which is a
+  -- foreign key referencing the recipes.id
+  -- column. If this foreign key references the
+  -- same key in multiple different tables we
+  -- can list them out after `REFERENCES`
+  FOREIGN KEY (purchase) REFERENCES recipes(id)
+);
+

As mentioned earlier, cascading deletes means that when we delete a row of a table then all the rows that reference that row get deleted as well.

What if we don't want that? Normally what we do then is we just mark the row as "hidden" or "deleted" but don't actually remove the data. Then the backend knows to just ignore those (e.g. by adding a WHERE clause that filters it).

Sweet! Now we know how to reference a single row in another table. What if we want to make it variadic? That is reference multiple rows in our row.

You can't! Well, kinda. What you do instead is create a join table that provides the many to many relationship. Then you reference a "collection id" on the join table in your referencing row and the join table has multiple rows that use that "collection id", each row mapping to one of the reference rows. That's a mouthful so here's an example.

transactions
idpaid
1175
250
3100
4190

transactions_recipes
transaction_idrecipe_id
11
12
21
33
42
43

recipes
idnamepricecoffeemilksugarchocolate
1Coffee502110
2Mocha752111
3Coffee1005000

As you can see, transaction 1 ordered recipe 1 and 2, transaction 2 recipe 1, transaction 3 recipe 3, transaction 4 recipe 2 and 3.

If we then wanted to join all rows in the tables where the recipe was ordered as part of a transaction, we would run the following query.

Note: This displays multiple rows when transactions have multiple recipes, but the recipe is identical.

SELECT *
+FROM
+  transactions AS t,
+  transactions_recipes AS tr,
+  recipes AS r
+WHERE
+  -- t.id is higher priority for sorting than
+  -- r.id
+  t.id = tr.transaction_id 
+  AND r.id = tr.recipe_id
+ORDER BY t.id, r.id
+;
+

Hibernate (and really JPA) uses many annotations to automate this, @OneToOne, @OneToMany, @ManyToOne, @ManyToMany, and @ElementCollection.

# Web Frontend

Web frontends fundamentally use HTML (Hypertext Markup Language) which is similar to XML (Extensible Markup Language) and CSS (Cascading Style Sheets) as a way for communicating the structure of documents/webpage. Since we want webpages to be able to modify themselves and be web apps (because browser wars and legacy!), the language JavaScript was created, which is a language which is designed to run in the browser and has a standard API for manipulating the DOM (Document Object Model) which is the programmatic representation of HTML documents.

## HTML

HTML tags are called DOM notes. You're probably somewhat familiar with it but here's an example. HTML includes a <head> and <body> sections. The head is where metadata (e.g. CSS, text encoding, page title). The body is the actual document explained.

<!DOCTYPE html>
+<html>
+<head>
+  <!-- Some comment -->
+  <title>Page Title</title>
+
+  <style>
+  /* Inline CSS! */
+  body {
+    background-color: powderblue;
+  }
+  p    {
+    color: red;
+  }
+  .some-class {
+    color: green;
+  }
+  </style>
+  <!-- External CSS! -->
+  <style href="css/styles.css"></style>
+
+  <script>
+  // Inline JavaScript!
+  console.log("Hello from JavaScript!");
+  </script>
+  <!-- External JavaScript! -->
+  <script src="js/foo.js"></script>
+</head>
+<body>
+  <h1 class="some-class">This is a Heading</h1>
+  <p>This is a paragraph.</p>
+</body>
+</html>
+

## CSS

CSS has tags, classes, and ids which are used to classify each DOM element (e.g. HTML tag). Every HTML tag can have a single id and multiple classes.

/* This applies to all divs */
+div {
+  color: red;
+}
+
+/*
+  This applies to any tag with
+  class="class-selector"
+*/
+.class-selector {
+  color: green;
+}
+
+/*
+  This applies to any tag with
+  id="id-selector"
+*/
+#id-selector {
+  color: blue;
+}
+

You might notice that in the above example that all those styles conflict with each other. What if we apply all of them at the same time? The id style would take precedence. Really, every style gets a specificity where a tag selector gets a weight of [0,0,0,1], class [0,0,1,0], id [0,1,0,0], and inline styling [1,0,0,0]. When we have multiple selectors apply, we get the winning style by picking the style with the highest specificity. When multiple tags apply (e.g. div.class-selector) we add them together. If any style has !important then it automatically wins. If multiple things are important then normal specificity rules apply but only for !important elements. For example, in the example below the text is blue because #id-selector wins.

<div id="id-selector" class="class-selector">
+  div text
+</div>
+

CSS is called cascading because in the following example "span text" would be red even though the span isn't directly colored. When things aren't directly styled they inherit from their parent.

<div id="id-selector" class="class-selector">
+  div text <span>span text</span>
+</div>
+

## JavaScript (+ AngularJS)

JavaScript is "the language of the browser". Browsers are essentially JavaScript engines that have a rendering engine that runs on HTML and CSS. This class won't focus on learning JavaScript specifically. It's a standard interpreted, imperative, multi-paradigm language with plenty of resources online, so if you're lost you should be able to easily find some online. Instead, we'll focus on learning AngularJS.

AngularJS (also called Angular version 1) is the deprecated version of the Angular web-frontend JavaScript framework. A framework is an opinionated library (or set of libraries) that helps control and handle the entire lifecycle and structure of a project. It intends to make things easier.

Why do we use the old version of the framework? Well, it was kinda new when this project's tech stack was last updated and Dr. Heckman is really busy. Also, stubbornly staying on old versions even though it makes you do more work is realistic to industry so there's that I guess...

TODO: Finish from the recording.

# Presentations

Presentations are an important part of communicating with management and other developers. As such, this will be our assignment for milestone 6 of the on-boarding project.

The general layout of a presentation is the classic organization that you've probably been taught since elementary school.

  • Introduction: Identify your purpose, thesis, POV / ask / desired action, and audience. Introduce your "story" if applicable.
  • Body: Build supporting points for your thesis.
  • Conclusion: Restate your purpose and POV. Do a short overview. Then conclude with any advice you have.

Visuals and text should be simple, readable, and be a "launch pad for discussion". Most importantly, think about the person who will have the hardest time reading the presentation. For example, "can the person in the back of class see this?" or "can someone watching this on their phone see this?". This includes increasing text size for code and browsers.

For our on-boarding project, we will do live (recorded) demos. For this, make sure to freeze your code (i.e. stop making changes), script your demos, and practice your demos. That way nothing surprising happens! Live demos are filled with peril, so please for the love of god make sure that it won't fail.

# Code Inspections/Review

Code inspection/review is the process of reviewing software artifacts by developers, managers, and/or customers for comment or approval. The purpose is to detect errors, ensure software meets requirements, and that everything is well designed.

There are a few big different types of inspections

  • Desk Check: Offline inspection done independently with findings (optionally) discussed at a meeting or directly with the member.
  • Checklist: A set of standards set by the team that a developer can review.
  • Structured Walkthrough: Done normally during a meeting. The developer walks the entire team through a section of code line by line.
  • Commit Inspection: Basically a desk check but via PRs and diffs and a focus on changed content.

The benefits of reviewing code include the following.

  • Promote Openness: People share knowledge which builds a culture of sharing knowledge and understanding everything.
  • Raises Standard: People expect good code.
  • Propel Teamwork: We have a standard way of communicating and resolving issues.
  • Promote Values: Values make it into checklists and are checked.
  • Frame Social Recognition: Trusted reviewers.

One of the most powerful things with standardization and improvement of processes is checklists (like ARC). They provide a standard list of things to think about and consider, insuring that all knowledge is shared and every requirement is checked every time.

There are several roles for inspection. These don't have to be set in stone but it is helpful to assign people individual work to help make the process smoother.

  • Author: Person who wrote it.
  • Inspectors: Everyone except author.
  • Moderator: Member of quality assurance team.
  • Scribe: Take notes during inspection of issues of interest.
  • Reader: Person who interprets artifact for inspectors.

Michael Fagan invented formal software inspections and as such the standard methodology he introduced is called the Fagan inspection. Fagan inspection is simple. It is there is individual review by all inspectors, where they mark all faults found, following the checklist, and track how much time they spent (less than 2 hours). Meanwhile the author prepares for questions. Then there is a review meeting where all inspectors and the author meet. The moderator calls the meeting and all inspectors go through all defects. The goal is not to correct defects because that takes time, it should be to give a course of action and trust that the author knows how to fix it. If necessary the author can ask questions after inspection. Inspection shouldn't last more than 2 hours and if it needs to then it should be split up.

The feedback should not be framed (either by the inspector or the author) as a personal attack because those are counterproductive. Also, style issues should not be the focus of the inspection. Possibly note it and definitely have an automated formatter.

The preparation component of inspection is incredibly important. At the start of a meeting, you should ask how long everyone spent on the individual portion of inspection. If most people did not do the preparation, you should consider cancelling the meeting.

What are the issues with code review? It's not effective for discovering bugs, the findings are normally too low level and don't find architectural issues, and developers normally don't like it. It's still effecting for knowledge transfer and ensuring requirements are met.

# Software Process Models

A software process model is a standard template with how to do software development.

Plan-driven process models have up-front, stable requirements. The cost of development is minimized by doing all planning up front. This is common for large, safety-critical projects, like aerospace and automotive projects. This allows for specialization.

In general, plan-driven process models encourage predictability, thorough documentation, and clear delineation of tasks. Normally companies even have specific people whose job it is to do process improvement.

Agile process models have changing requirements. Agile process models try to quickly and effectively incorporate changes to reduce the cost of requirements changing during work. This is common for app development

Note: These are loose divides because really everything is a spectrum from planning early to planning late.

## Models

## Plan Driven Process Models

The waterfall model is the classic plan-driven process model. It is extremely predictable in terms of cost and time. However, it doesn't consider risk or effectively adapt to changing requirements.

The spiral model is a modification of the waterfall model. Basically instead of doing planning all up front, you heavily plan and do risk-analysis of smaller prototypes. For example, first you try to get some requirements, do a small prototype, do risk analysis with that prototype. Then you start to plan heavier development, doing risk analysis again, and developing another more detailed prototype.

The personal software process (PSP) is a system of checklists, scripts, and templates to guide people through the "levels" of PSP. Basically you keep track of defects you introduce and how much time you spend on completing tasks to figure out what defects you normally introduce and how much time you spend so you can get better at estimation. This tends to improve quality but people struggle with detailed reporting and many people stop using it after awhile.

The team software process (TSP) is like PSP but extended to larger projects and teams. To do this it adds more scripts, more forms, and more roles. The idea is that by assigning everyone a task/part that they own you can improve accountability and quality.

The rational unified process (RUP) applies ""object-oriented principles"" and uses UML as a notation for some reason. It's extremely flexible and thus hard to define. That's really all we have to say.

## Agile Process Models

The agile processes (as a name) were kicked off by the "Agile Manifesto" which was published in February 2001. Basically it said

Individuals and interactions over process and tools. Working software over comprehensive documentation. Customer collaboration over contract negotiation. Responding to change over following a plan.

And then it listed the following 12 principles.

  • Our highest priority is to satisfy the customer through early and continuous delivery of valuable software.
  • Welcome changing requirements, even late in development. Agile processes harness change for the customer's competitive advantage.
  • Deliver working software frequently, from a couple of weeks to a couple of months, with a preference to the shorter timescale.
  • Business people and developers must work together daily throughout the project.
  • Build projects around motivated individuals. Give them the environment and support they need, and trust them to get the job done.
  • The most efficient and effective method of conveying information to and within a development team is face-to-face conversation.
  • Working software is the primary measure of progress.
  • Agile processes promote sustainable development. The sponsors, developers, and users should be able to maintain a constant pace indefinitely.
  • Continuous attention to technical excellence and good design enhances agility.
  • Simplicity, the art of maximizing the amount of work not done, is essential.
  • The best architectures, requirements, and designs emerge from self-organizing teams.
  • At regular intervals, the team reflects on how to become more effective, then tunes and adjusts its behavior accordingly.

The incremental model you get requirements, do some design, and then implement a feature. You do this iteratively to gradually fulfil more and more requirements. This still allow parallel work by having your design people designing requirements and requirements people getting newer requirements. The idea here is you don't redo any work but instead just keep adding to the project.

The iterative model is the most agile plan-driven model. It is essentially the incremental model except instead of adding on you redo things at the end of each increment. The idea is that this minimizes technical debt, which is just poor design decisions made to meet a deadline.

The LEAN model tries to do the following 9 things

  • Eliminate Waste: Prevent extra features, thrashing, and bureaucracy.
  • Create Knowledge: Do reviews
  • Build Quality In: Write tests and do CI.
  • Defer Commitment: Try to schedule irreversible decisions to the last responsible moment.
  • Deliver Fast: Try to cut down on things in-progress.
  • Respect People: Be accepting and congratulatory. Don't overwork people.
  • Improve the System: Make measurements of quality.

Extreme programming (XP) values pair programming, working together, incremental design, basically everything in agile. Work is organized into epics and stories. Epics are a collection of stories. Stories are informal requirements that say what a specific user wants to be able to do and why. These features/requirements should be able to implemented in a single sprint. A sprint is some measure of time, normally a weak.

TODO: Finish

# Planning & Project Management

Project management goes through three main phases:

  • Planning: Plan for releases, some design, schedule resources, etc.
  • Execution
  • Control: What went well what went less well?

For release planning, you need to understand the themes or high level epics you want to focus on, followed by a goal for you project, and your expected velocity. So if we want to get 240 story points and we get 30 story points done per iteration, it'll take 8 iterations (estimated) to do something.

Generally, when you're planning releases you either think about the release date or the release features. With features you determine the release date by the features included (velocity and story points). With dates you determine the features by the required release date. We'll be doing date focused release planning because, well, the class can only be so long.

A critical piece to planning is understanding your velocity/progress. A good way to track this is with burn-down charts, where you track the number of story points left at the end of every iteration. This lets you easily see your velocity (the slope), your progress (the hight), and whether or not you'll reach the deadline (estimated line).

Burndown Chart Example

There are two types of iterations we consider. A normal iteration and a stabilization iteration. A normal iteration adds features and fixes bugs. A stabilization iteration refactors code, documents code, removes old code, and does all that good stuff. A stabilization iteration earns no story points because fuck you; suffer with bad code; good code isn't Agile.

## Feature Based Roles

Often it is beneficial to split up tasks and their owners by roles. Roles categorize what aspect of the project is being worked on. This helps tasks both be more efficiently assigned and more efficiently worked on. There are a few different types of division:

  • User Role Division: Each developer implements a use case from the perspective of a certain user.
  • Specialization Roles: You specialize on QA, planning, team management, etc.
  • Feature-Based Roles: Split based on part of system, e.g. frontend, backend, and data entry.

Estimation is an important part of software development (and really just doing things in general). Ideal time is the amount of time it takes to do something with no distractions. Elapsed time is the amount of time it takes to do something in practice. Generally, we're pretty good for estimating ideal time but bad at elapsed time. A good rule of thumb is the multiply ideal time by 3-4.

Some teams use story points, which are just a unitless measures of how long it takes to do something. The actual value is meaningless but the relative amount is valuable. It allows you to compare how long tasks will take. A standard way to do things is assign an "average" task 5 points but really it depends on the team.

With story points, how do we assign them? There's a few ways.

  • Expert Opinion: Just use your gut feeling.
  • Planning Poker: You have a moderator read the description and the task. Then everyone silently selects a card for their estimate and present it. Then the person with the highest estimate justifies it and the person with the lowest estimate justifies it. Then everyone re-votes until they converge.
    • This is less about getting an estimate and more about sharing knowledge and coming to a common understand. They can help get a rough idea of how to implement things and design them.

One reason we do story points is to find velocity, which is how many points we do per week. This helps improve estimates for how many tasks a team can complete.

# Security & Privacy

  • Asset: People, property, and info under protection.
  • Threat: Source of attack.
  • Vulnerability: Weakness in protections. Latent, not necessarily exploited.
    • Like Fault.
  • Exploit/Attack: Concrete use of a vulnerability to breach protection.
    • Like Error.
  • Information Security:
    • Confidentiality: Not shared.
    • Integrity: Don't alter or destroy data.
    • Availability: Readily available to authorized users.
  • Authentication: Act of validating entity's identity.
  • Authorization: Act of checking whether the user is allowed to perform certain actions based on who they are.

Security is controlling what users can do and see, in other words it is the ability of the system to perform its function with confidentiality, integrity, or availability losses. Privacy is just controlling what others can see.

When we think about security, we don't just think about normal users making mistakes. We think about intelligent attackers actively trying to exploit your system.

## IEEE Top 10 Secure Design Principles

Below are the 10 principles, but our biggest ones (not listed below) are never trust single points of failure, never trust your user, never trust input, and never trust defaults (especially passwords).

Here are the real IEEE top 10 design principles for secure design.

Earn or give, but never assume trust. Ask how many permissions does this really need? How fine grained can I make permissions? Assume people are trying to exploit your system. Assume your users will make mistakes. Don't assume the server APIs will be called in your expected order. Don't expect the UI will actually restrict what the user sends to the server. (i.e. don't only add business logic on frontend.) Don't store secrets on the client side.

Use tamper‐proof authentication mechanisms. Use two-factor authentication or other systems.

Authorize after you authenticate. Ensure that the user really has the permissions required to do a particular action. This should be done before important actions.

Strict separation. Separate data your system works with and what your code does. Don't evaluate strings. Don't evaluate or do string concatenation with SQL queries. Ideally use prepared queries (see below). Don't provide too much error information (e.g. don't do a stack trace). Don't say whether your password or username was incorrect.

Prepared queries have a series of free variables represented by ?. These queries are compiled to a binary format and optimized by the database engine. This makes it faster to execute future queries using this. These ? variables can then be bound to concrete types. Strings here don't need to be escaped because the binary format ensures that strings and other variables are interpreted appropriately.

-- This query has 2 parameters, one for name and
+-- one for price.
+INSERT INTO products
+(name, price)
+VALUES
+(?, ?);
+

Explicitly validate ALL data. Validate multiple levels and especially whenever data crosses a trust boundary, for example when the user enters information or data comes from the API. You should have a safe list / whitelist and a block list / blacklist

Use cryptography correctly. Don't push your secrets to git repositories. Don't roll your own cryptographic libraries. Ensure you safely share keys and other security things.

Identify and handle sensitive data. Make sure that you trust the servers which you are storing information. Make sure that sensitive data is being encrypted (i.e. don't use plain text). Often we have different levels for the different types of information.

Always consider users. Make sure that your policies are reasonable for the average person to follow. That is, don't be annoying because then users will try to circumvent your policy.

Understand your attack surface. Your attack surface is the sum of all paths for data and commands into and out of the system. The fewer paths you have, the easier it is to secure them all. Close all ports possible. Restrict user privileges as much as possible.

Design flexible systems. Ensure that updates and changes to the system don't break security. For example, don't leak secrets when people change their password, don't leak secrets when components outside your control change, and don't leak secrets when someone updates their system.

## Cross-Site Scripting XSS

Cross site scripting occurs where user input somehow changes the HTML output (for other people) without sufficient cleaning. If this occurs, then a user could inject script tags into the HTML which other users will then load. This allows for basic things like vandalism of websites or even worse injection of JavaScript which can spoof fake input boxes (e.g. credit card number) or load some malware onto the client which just loaded the page. Here is an example of a XSS vulnerability.

page += String.format(
+  "<input name='creditcard' type='TEXT' "
+    + "value='%s'>",
+  request.getParameter("CC"));
+

This could insert.

'><script>
+  document.location='http://attacker.com/'
+<script'
+

## Threat Modeling

In order to secure systems, we need to understand what we need to secure. To help us this we have threat models which semi-formally describe how our system could be insecure.

We can do threat modeling with data flow diagrams which models all the nodes/actors in a system and how the data goes between them (and is validated). Often the graph is segmented by trust boundaries (for example our local server vs an unknown client).

One popular threat model is the STRIDE threat model which is an acronym for the following.

  • Spoofing: pretending to be someone else by using their credentials.
  • Tampering: malicious modification of data.
  • Repudiation: users deny an action because no proof that action happened.
  • Information Disclosure: exposing information to those that shouldn't have it.
  • Denial of Service: valid uses cannot access the system.
  • Elevation of Privilege: user gains privilege they shouldn't have.

The idea with the model is that these are the 6 main ways for security to be compromise. By looking at each one individually and how your system handles each of these kind of exploits, you can determine how you need to secure your system and what vulnerabilities exist. That is, you're finding the abuse cases which is the possible threats in your system. You can model these attacks using attack trees.

Normally when exploits or other security threats are found by cyber-security peoples, attack libraries are published illustrating how the attack works. This helps secure future systems.

Once we've identified these issues, how do we address them? There are 5 main ways.

  • Mitigate: what have similar software packages done to mitigate the threat, and how has that worked for them?
  • Eliminate: what software components are affected in eliminating the threat?
  • Transfer: will you need to transfer data or processes to another part of the system that is more trusted/secure?
  • Accept: outline the "acceptance criteria" that you will use to indicate the threat has been properly addressed.
  • Wait and See: be prepared if an attacker or other malicious user manages to find a way to exploit a vulnerability associated with the threat.

## Risk Management

A risk is a potential future harm. Often risk is unavoidable but it is still undesirable. As such we try to minimize the probability that a risk occurs. A risk is no longer a risk if it has happened.

How do we quantify risks? There are a few main ways: guess, take measurements, reason from first principles, listen to experts, and listen to experience.

Risk management is what we do to identify, address, and eliminate risks before they become significant threats or a major source of expense. We manage risks in two main ways: reactively and proactively. Reactive teams correct or fix the problem rapidly in response to a crisis (e.g. firefighters). Proactive teams try to prevent risks from becoming threats in the first place (e.g. national park service).

In order to mitigate risks, we can take the following actions.

  • Information Buying: Get more information by investing time to handle the risk. For example the risk of using new technology can be handled by using throw-away projects.
  • Contingency Plans: Make sure you know what to do if the risk happens.
  • Risk Reduction: Try to reduce the likelihood of the risk to occur. For example employ inspections to reduce the risk of losing information when someone leaves.
  • Risk Acceptance: Conciously accept that you will live with the risk and potential loss.
  • Risk Avoidance: Simply don't take the risky action. Often a lose-lose strategy because then you're not doing much.
  • Risk Protection: Buy insurance or use redundant systems. For example have more servers than you need.

## Privacy

Privacy is essentially the right to be left alone, so you can have private facts.

Here is the Better Buisiness Bureau's outline of what parts of a privacy policy there are.

  • Policy: what personal information is being collected on the site
  • Choice: what options the customer has about how/whether their data is collected and used
  • Access: how a customer can see what data has been collected and change/correct it if necessary
  • Security: state how any data that is collected is stored/protected
  • Redress: what customer can do if privacy policy is not met
  • Updates: how policy changes will be communicated

The Code of Fair Information Practices (FIPs) is a set of internationally recognized practices of addressing privacy of information about individuals. Essentially it says that you cannot keep secret personal data, a person must be able to find out what information is being stored about them, and a person's information can only be used for what they consent to.

The Children's Online Privacy Protection Act (COPPA) applies only to children under 13. It essentially requires additional protections, parental consent, and provides additional powers to the parent such as a way for parents to review information.

The Health Insurance Portability and Accountability Act (HIPAA) provides a standard for privacy and security of your protected health information (PHI). Further it provides a standardization of electronic data interchange of healthcare information. Protected health information is any information that can be used to identify the patient, including demographic, medical, and financial information in medical records.

EU General Data Protection Regulation (GDPR)

# Maintenance

Maintenance is the "long tail" of development. That is it's what you spend most of your time doing. There are four main types of maintenance we'll discuss.

Corrective maintenance tries to correct active faults. It is extremely difficult because you want to fix the bug without breaking anything else. This is made easier with good tests and clear design.

Perfective maintenance attempts to make the software better even when its not broken. Like looking at what features are used and make the unused features easier to use or otherwise better.

Adaptive maintenance is reactive changes that attempt to make the system still usable on a new environment. This can be because of changes of work policy, laws like the EU's GDPR, or operating system changes. Often adaptive maintenance is in response to bit rot, which is when software starts to break over time because of changes in its environment.

Preventative maintenance is active changes that attempt to make the system still usable in future environments. In essence, it is adaptive maintenance done ahead of time. You refactor things to make them easier to understand and maintain even when they aren't actively broken. Because you're not increasing/improving functionality, this is hard to sell to companies and managers.

What may effect the costs of maintenance? If you have lots of turnover, there is more maintenance effort. If you have contract based software developers, there may be little incentive to make maintenance easy.

How do we convince users to update? It's difficult. We need to balance user input and user annoyance. Updates that require user input are likely to be put off and can be annoying. However, on the flip-side forcibly updating software that causes disruptions to the user can be really annoying, for example Windows update suddenly restarting your computer. It's a balance to make your system as usable as possible.

# Software Engineering Economics

## Cost of Bugs

One of the main focuses of software engineering economics is to identify how expensive bugs/faults are.

In general the later you find and fix a bug the more expensive it is.

However, how do we actually determine what caused a fault? We do this with root cause analysis. Essentially, root cause analysis is where you keep asking "Why?" a fault occurred until you can no longer get a meaningful response. So for example for the fault that a server crashed.

  • Our server crashed. Why?
  • CPU usage spiked immediately before the crash. Why?
  • The program hit an infinite loop. Why?
  • A mistake by a developer. Why?
  • Because they did not sufficiently test their code.

# (Unconscious) Bias

Bias is incredibly important to understand as a member of the work force and especially if you manage other people. It is important because intrinsically we want everyone to be treated equally. If you don't care about people and instead only about profit, diverse teams also tend to perform better. It is also incredibly important because small biases can compound into huge effects, so we need to detect small biases.

First off, everyone is biased and not all bias is bad. For example, snakes being dangerous is a pretty good bias. However, in America white Americans are more likely to get a call back than black Americans, which is clearly a bad bias.

How do we eliminate this bias? We'll in particular be looking at hiring. A good way to do it is to eliminate names from resumes, have a checklist for what qualifications you want, and a script of what questions you will ask.

# Design Patterns

Design patterns are standard ways to structure your program to make it easier to maintain and understand. They also provide a standard language for communicating designs between developers.

  • Creational: How do we make an object?
  • Structural: How do we compose classes statically?
  • Behavioral: How do we manage the interactions within the system?

Here we'll talk about a few specific design patterns for in Java. These design patterns often apply to other languages, maybe with some changes, but some of these design patterns are irrelevant because of language features in other languages. Likewise, some languages need additional design patterns to cover up for features of the Java language.

The abstract factory design pattern is where you have an interface for a set of related objects that you want to create, for example styled GUI elements like scrollbars and window titles. Then you provide a concrete instance of this abstract factory (basically a vtable) to something that needs to create these elements. Then for example you could have a window system take in a factory for window elements. Then you use this factory to generate window elements. This allows you to dynamically change the styling.

The factory method design pattern is where your (super)class calls a method to construct an object satisfying an interface rather than a constructor for a specific implementation. That way your subclasses could override that method to change the object being constructed, which can be useful if they need to hide data into the object.

The visitor pattern is often used for data structures containing a fixed set of types. Basically you have an interface that describes all of the concrete types your data structure contains. Then you pass a concrete instance of this interface (basically a vtable) to your data structure. The data data structure gives you an iterator over something that can "accept" a visitor. Then you iterate over those elements repeatedly having them "accept" your visitor. Why do this? It makes it easy to add new operations. However, it makes it hard to add new classes.

This is useful because it gives you double-dispatch (limited multiple-dispatch) and "exhaustive matching". This is nice you're writing a compiler where you want to describe any action you run on the AST. Compared to an if-else chain this ensures that all instances are covered at compile time.

This is rendered somewhat obsolete if you have sum types and exhaustive matching, like Rust's enum and match, or if you have multiple-dispatch like Julia. Basically you just have an iterator that yields an enum. Then you iterate over that and match on the enum to determine what operation you want to do.

The observer pattern is basically a way to do publish-subscribe computing using object-oriented code. A subject contains a set of observers which it notifies whenever something happens. The observers satisfy a interface, normally called notify which accepts some data. Whenever the subject has an event happen (like a mouse button clicking), it iterates over the set of observers it has to notify them of the event. The subject also has methods for registering and de-registering observers.

# Configuration Management

In general, you should treat configuration of your systems as code, where assets are tracked in a VCS (e.g. git). However, you still need to keep secrets secret. This can be done by either factoring them out and having them manually entered or encrypted.

This is like what ARC does with provisioning!

Some tools that help you with this are Ansible, Puppet, Chef, and even more.

# Continuous Integration / Continuous Deployment

Continuous integration uses many ideas with configuration management. It is the practice of automatically building, testing, and analyzing your software in response to every software change done. This allows you to more easily detect issues quickly and more automatically redeploy and upgrade the software in production.

This builds off of configuration management because to automatically build, test, and deploy your software because you need a way to automatically set up the machine to run.

Most often CI/CD runs in a very dumb way. Basically it doesn't reuse things and just destroys and rebuilds everything every time. There is work being done on incremental builds, reusing artifacts, and caching. It's a hard problem tho.

# Microservices

Microservices are a technique to make applications easier to maintain, upgrade, and scale. They do this by splitting up your single monolithic process into several smaller processes, i.e. microservices.

The main reason you wouldn't want to use microservices is often you don't need the fault-tolerance or scalability of microservices. Also, microservices can make software harder to maintain (e.g. have to maintain an API that could often change) and it makes your software harder to deploy.

# Design Metrics

Design metrics are objective ways to measure the quality of software design. These are heuristics and aren't a "silver bullet". That is some designs are ranked wrongly low and others wrongly high. In general we'll be discussing metrics on Java or Java-like languages but these metrics can be generalized.

One of the most basic metrics is lines of code, where more lines of code means more maintenance. This isn't always correct because sometimes really low lines of code means things are "magic" or needlessly obfuscated. How do you count? People disagree but I generally think you should count comments, braces, and everything else, that is run wc -l on the source code. That's because lines of code isn't a perfect metric and making it simple is nice.

Another metric for Java-like languages is number of classes or for other languages number of modules. In general you want a moderate amount of classes/modules that way each class/module is reasonably well-focused but also not overly segmented. Similarly you can measure the number of methods in the class

You can measure the cyclomatic complexity which is the number of decision points plus 1.

In general you also want high cohesiveness of a class. That is you want each class to do/be a single thing. You can measure this by drawing a graph of methods where each method and field is a node and each method or field a method references gets a directed edge. Then you can see whether you get significant groupings or should otherwise split the class.

On the other hand you generally want low coupling of a class. That is you want your pieces of software to be as orthogonal/independent as possible. You can measure this in a fairly complicated way which I won't show here, but basically there's two types of coupling: afferent coupling, which is the number of classes that depends on this class/package, and efferent coupling, which is the number of classes that this class/package depends on.

# Performance & Monitoring

Performance is how (well) the system performs under load and monitoring is the process of measuring performance while the system is operating.

There are two big things to measure that are somewhat independent: thruput and latency. Thruput is how many requests the system can process per second. Latency is how long it takes to service a request.

Performance testing is the process of running tests explicitly to identify performance regressions and performance improvements. This let's you figure out if the system will be able to handle load in production.

To do good performance testing, you need to figure out the workload your system will undergo. Often the workload depends on the operations or things your software system does. If you can enumerate all possible operations and their frequency of use (i.e. create an operational profile), we can create better (performance) tests and also better determine where to focus your energy for fixing bugs and improving performance. To get these operational profiles, you often need to do monitoring of the system or talking clients / domain experts.

What issues exist with performance testing? One of the biggest is that applications don't run in isolation. There may be other applications or even your operating system that are taking up resources. In the extreme case this can make your tests flakey (which we experience with Jenkins).

How do we collect data from a system? In terms of performance and stability data, we can get temperatures and other data from the hardware; memory usage, swap usage, and other things from the operating system. If we have middleware (e.g. Nginx), you can get log data from that and likewise for the application itself. In terms of user experience (UX) logs, the system can log how users interact with it so like what operations they use, what buttons they click, etc.

One way to understand performance of a system is using a flame graph, which is a graph of stack frames in your system over time. That way you can see what functions take the longest, which helps you determine what functions you need to optimize. In certain cases it can also help you find specific issues in your system. For example maybe there are a bunch of recursive calls which can be seen by extremely tall flames.

Here are some examples of metrics for a specific service, e.g. an e-commerce website.

  • Availability Rate: % of time system is up.
  • Conversion Rate: % of customers that buy something of those who just looked. Can also be done for referrals and anything else similar.
  • Mean Time Between Failures: Average time service is available between failures.
  • Mean Time To Repair: Average time service is down when a repair occurs.
  • Incident Count: How many incidents (e.g. failures) occur per unit of time (e.g. week).
  • Actions Per Second: How often does a given action occur in your system? For example how many purchases, logins, sign-ups, etc, depending on your system.

How do operations manage failures? A good system to have is to have an incident management plan, which is a series of steps which occur whenever a failure is detected.

There's also a green-amber-red light system, where you categorize the state of the system using a 3 light system. Green is everything working. Amber is some non-critical modules are failing. Red is the system has completely failed.

\ No newline at end of file diff --git a/notes/ncsu/3f/csc412/ast_v_dag.png b/notes/ncsu/3f/csc412/ast_v_dag.png new file mode 100644 index 0000000..d631fab Binary files /dev/null and b/notes/ncsu/3f/csc412/ast_v_dag.png differ diff --git a/notes/ncsu/3f/csc412/frontend.png b/notes/ncsu/3f/csc412/frontend.png new file mode 100644 index 0000000..5d01539 Binary files /dev/null and b/notes/ncsu/3f/csc412/frontend.png differ diff --git a/notes/ncsu/3f/csc412/index.html b/notes/ncsu/3f/csc412/index.html new file mode 100644 index 0000000..4564a02 --- /dev/null +++ b/notes/ncsu/3f/csc412/index.html @@ -0,0 +1,475 @@ +Eli | CSC 412: Compiler Construction

CSC 412: Compiler Construction

Instructor: Dr. Xu Liu | Semester: Fall 2020

Table of Contents

# Administrivia

WeightComponentAdditional Info
30%Midterm
50%Project4 Projects (3 C/C++, 1 Python)
20%AssignmentsAll homework written.
  • TA: Abhijeet Krishnan
  • No final
  • Testing done in Virtual Computing Lab (VCL).
  • Projects may be different between 412 and 512.
  • Attendance: Required via Zoom. Need to email ahead of time if will be absent.
  • We do not discuss linking or assembling specifically here.

# Overview of Compilers

  • Compiler: Tool for analyzing and transforming high level programs into some executable form. Compilers often include optimizations to improve performance of the code.
  • Types of Compiler: Compilers are often categorized by similar properties.
    • Traditional: High-level to low-level (machine code, bytecode, hardware FPGA/ASIC).
      • C, C++, Rust
    • Source-to-source/Transpiler: Produce source code for a different similarly high-level language from another language.
      • Typescript, Moonscript.
    • Just-in-Time (JIT): Compiles at runtime often doing tracing or other performance-guided-optimizations.
      • Java (always uses bytecode but will JIT hot code)
    • Decompiler: Low-level to high-level.
    • Cross Compiler: Generate code for a machine different than the host running the compiler.
    • Binary Recompiler: Binary/machine-code to another binary/machine-code. Often useful for introducing tracing or other instructions.
  • Intermediate Representation: A low-level machine-code-like language that is architecture agnostic. Allows for easier optimizations and allows easier support for more languages and hosts.
    • Examples: GIMPLE (gcc's IR), LLVM IR.
  • Interpreter: Program that runs the source code directly. Or at least appears to do so; many interpreters do internal compilation. This is good because they are easy to write.
  • Activation Record: Stack frame.

Compilers normally go through the following steps: (front-end) preprocessing, lexical analysis, parsing, (middle-end) semantic analysis, IR conversion, code optimization, and (back-end) code generation.

One of the hardest parts of compilers is (user-friendly) error propagation. All parts can produce errors and the error chain can be very deep and complex.

## Three-Pass Compiler

Many compilers follow a three-pass system, with a front-end taking in source code and producing IR, middle-end taking in and producing IR, and back-end taking in IR and producing the final output.

The front-end lexes and parses the source code, producing an AST. It then does a bunch of analysis on the AST, such as type-checking. Then it produces IR. This class mostly covers front-end. It is normally O(n) or O(nlog⁡(n))

The middle-end optimizes the IR a bunch. This is normally NPC (NP-Complete). This class does not touch the middle-end.

The back-end produces machine-code (or other output formats) from the IR. This is normally NPC (NP-Complete) because of register allocation. This class does some back-end.

# Front-end

The frontend first scans the code to produce tokens. Then parses the token stream to an AST. Then it does a bunch of analysis on the AST.

## Scanner

A scanner reads the raw text of the file and extracts the interesting tokens from it. This allows the parser to deal with higher-level tokens which makes it easier. It also allows handling error handling/reporting information to be more contained.

A scanner is the easiest part to implement normally and can even be done by a scanner generator. It can be done lazily (doesn't scan tokens until requested) or greedily (produces all tokens as soon as possible). A scanner generator takes descriptions of the tokens normally using regular expressions to generate a scanner.

I won't talk much about the theory here because CSC 333 was pretty extensive. But basically regular expressions are formally equivalent to finite automata (FA). Languages (i.e. sets of strings of symbols) recognized by finite automata are called FA and are closed under union ∪, intersection ∩, and Kleene star/closure ∗ which is 0 or more concatenations of strings from the language. We use ε to denote the empty string.

Note: We often insert a special EOF token at the end of the stream to make sure parsing end successfully.

Normally, reserved words or keywords (e.g. for) match all the rules for identifiers. To handle this, whenever we finish an identifier we see if the identifier is a reserved word / keyword and instead return a token for that keyword rather than a generic identifier token.

### Tokenizing

How do you split a series of characters into tokens? You could use the simple "I need a delimiter" rule (e.g. every token is separated by space), but often people want to write stuff like foo();. Also, sometimes you get code like this which can be surprisingly hard.

intv1=35+v33;
+

In general this is done by greedily finding the current word as long as it's legal. If you end in a legal state, then you just made a token and can return to the start state. If you end in an illegal state, then you have reached an error and report it.

### Types of Scanners

Fundamentally scanners run on DFAs. There are many way to build a DFA/scanner in code.

A table-driven scanner essentially just has a giant lookup table where your row is the current state and your column is the input. At every iteration, you look up in the table using your current state and your input to get the cell in the table which is your next state. This is somewhat memory inefficient (tables can be very big) but easy to code and maintain.

A direct-coded scanner is generally more efficient in terms of memory than the table-driven scanner and somewhat more efficient in terms of runtime. It can be less readable and somewhat harder to maintain though. In practice it's not that hard though. This is the kind of scanner you would make if you made one by hand. You read in a character, switch on the state, and then manually do the comparisons as you want.

### Scanner/DFA Optimization

To improve performance of DFAs (especially important for scanner generators), we normally use the following

  • RE to NFA: Build an NFA for each term, combine them all with ε-moves / ε-edges.
  • NFA to DFA: Build the simulation using subset construction.
  • DFA to Minimal DFA: Use Hopcroft's algorithm to minimize the number of states. Can reduce the number of states a LOT.
  • DFA to RE:
    • Why do this? It can give you a simpler RE.

Thompson's construction works by converting the 4 basic possible regular expression operators into an NFA, as shown below. This works on the AST of the parsed regular expressions.

Thompson's Construction

This however produces an extremely large and inefficient FA. However, it is always correct and we have algorithms to optimize them later.

## Parser

The cheif job of the parser is to product an abstract syntax tree (AST). To do this, the parser uses a formal grammer. Sometimes, finalizing the abstract syntax tree (e.g. in cases of overloading), we need to do context sensitive analysis (e.g. type analysis) that cannot be done by the parser.

### Grammars

Before we understand grammars, we need to understand their representation. We use Backus-Naur form. The Backus-Naur form describes a grammar as a set of productions, where a production is a mapping from a lefthand side to a righthand side with an arrow from left to right. There are non-terminal symbols, represented by a capital letters, called such because a valid string in a language cannot have a non-terminal symbol. There are terminal symbols, represented by lowercase letters, called such because there are a valid symbol in the alphabet.

We use a slightly modified version where we can use non-terminals with multiple letters in their names. To remain unambiguous, our multi-character non-terminals start with uppercase letters and have whitespace around them. Similarly, complex non-terminals (recognized by regular expressions) are wrapped in angle brackets < and >.

Every string s in the language recognized by a grammar has a derivation, that is a series of productions that can be applied, starting at the start symbol, to produce / arrive at s. The discovering of a derivation is called parsing.

For review, A regular grammar is a grammar where every production has at most one righthand non-terminal symbol and arbitrarily many lefthand terminal symbols. There can be no lefthand non-terminals and no righthand terminals.

# Not regular grammar
+S -> AB
+A -> aA | \e
+B -> bB | \e
+
+# Previous grammar rewritten to be regular
+A -> aA | B
+B -> bB | \e
+
+# Different no-variable grammar
+S -> ab | aabb | aaabbb
+

In context-free grammar you have a set of productions from a single non-terminal to a series of non-terminals or terminals. If you had multiple non-terminals and terminals on the left hand side, then it would be a context-sensitive grammar

# Recognizes a^nb^n. This is context-free.
+A -> aAb | \e
+# Recognizes a^nb^n n > 1. Also context-free
+A -> aAb | aabb
+
+# This is context-sensitive.
+AB -> ...
+

Parsers are normally driven by context-free grammars rather than context-sensitive grammars because they are easy to implement, easy for humans to understand, and fairly expressive. Basically they're a happy medium.

Grammars can be ambiguous, how can we formally classify that? We can't just say a grammar that has multiple possible derivations for a string because then if we have multiple non-terminals at a time then it has derivations depending on whether you derive the left or right first. To get around this, we say a grammar is an ambiguous grammar if it has multiple leftmost derivations (or equivalently multiple rightmost derivations), where a leftmost/rightmost derivation is where you always choose the leftmost or rightmost non-terminal symbol to expand respectively.

We do not want the grammars we design to be ambiguous because otherwise people will be surprised by our parser's behavior and there's a good chance that we will introduce bugs by accidentally switching from preferring one ambiguity to the other. Also, we often like to use our parser's grammar to produce an AST that we can then use to help analyze and execute the code. For example, we normally do a post-order walk of binary expressions (e.g. arithmetic) to determine which ones we should do first. Using a post-order walk ensures that expressions lower in the AST get executed first.

TODO: Get image from slide

This ambiguity typically occurs when defining arithmetic operations. A naive grammar for arithmetic would be

Expr -> Expr Op Expr
+Expr -> [id] | [num]
+Op -> + | - | * | /
+

However, this is ambiguous, which is a real problem if we want to embed order of operations in an AST. We can handle this in two main ways. Use some sort of precedence parsing, like Pratt parsing, where we give some numbers to our operators which then changes the parser to be unambiguous and take care of precedence. This can be easier to extend but harder to write initially. Alternatively, we can modify the grammar to take care of precedence. Ultimately it's up to a matter of preference. In this class we will modify the grammar. Here is arithmetic operations rewritten to take care of order of operations. You can give these names without numbers but that makes it harder to understand I think.

# Expr is human-friendly alias for the top level
+Expr -> L2
+L2 -> L2 + L1 | L1 - L1 | L1
+L1 -> L1 * L0 | L1 / L0 | L0
+L0 -> Atom
+# Atom is a human-friendly alias for the bottom
+# level
+Atom -> [id] | [num] | ( Expr )
+

But wait, isn't + and - still ambiguous? Nope! Notice that the left non-terminal side is the same level but the right non-terminal is at a lower level. This can have issues with left recursion, but this can again be trivially rewritten using something like

# Left recursive
+L1 -> L1 * L0
+# Not left recursive, uses {...} repetition.
+# Quoted symbols are not magical. Unquoted are
+# magic.
+L1 -> L0 { "*" L0 }
+

There are two ways of parsing we will discuss. There is top-down parsing, normally done with hand-coded recursive descent parsers. There is also bottom-up parsing, which normally uses a parser generator. There are many types such as LR(1) parsers, PEG parsers, etc.

### Top-Down Parsers

Top down parsers are called such because they first start at the start state and gradually get more and more specific. They start at the root of the parse tree and grow towards the leaves. They do this by picking a production and trying to match the input. However, if they pick the incorrect production, they may need to backtrack. Certain languages/grammars are designed such that it is always possible to pick the correct production. This is called predictive parsing.

We in general discuss recursive descent parsers as the classical top down parser. To create a recursive descent parser, you convert every production into a function that returns the AST node produced by the production. If the part of our production is a non-terminal, we call the production for it. If it is a terminal, check that the next token matches. If we have a repetition, like { expr }, we keep matching expr as much as we can. If we have an alternation, like a | b | c, we try each production in series until we get one that works. (As an optimization, we can match on the first token and switch directly to that production if we have enough data to prodict the correct production.) If we have an optinonal, like [ a ], we try to match a but if we fail we don't do anything.

Here is Rust-like pseudo-code for a recursive descent parser.

// A -> aA | bB
+// B -> bBc | c
+impl Parse for TokenStream {
+  fn A(&self) -> AstNode {
+    let node = AstNode::new();
+    match self.peek() {
+      'a' => {
+        node.push(self.next());
+        node.push(self.A());
+      }
+      'b' => {
+        node.push(self.next());
+        node.push(self.B());
+      }
+      _ => todo!("do real error handling"),
+    }
+    node
+  }
+}
+

Top down parsers have one big weakness. Left recursion. Left recursion is when you have a production like A -> A B. In this case, the leftmost symbol always generates itself and we cannot do any matching, instead just looping forever. To get around this, we "unroll" the left recursion into right recursion using repetition. So A -> A B would become A -> { B }. Basically, you make the non-left-recursive branch be its own thing at the start and make all the left-recursive branches be repetitions (with the left-recursion removed). Here's another annotated example.

# Left recursive!
+Fee -> Fee a | b
+
+# b was the only terminating branch so it
+# becomes the start. Fee a was the
+# non-terminating branch, so we repeat it.
+Fee -> b { a }
+
+# We could do this more formally with this. It's
+# identical to the above.
+Fee -> b Fee'
+Fee' -> a Fee' | \e
+

More formally, what we do is introduce a new non-terminal A′ for every left-recursive non-terminal A. The new A goes to the terminating branch of the old A and the new A′ goes to the A non-terminating old branch or the empty string ε. If that sounds confusing, read the following transformations. Basically, A′ is the formal way to do { ... }.

# Class left-recursive expression grammar
+Expr -> Expr + Term | Expr - Term | Term
+Term -> Term * Atom | Term / Atom | Atom
+
+# Rewritten not left-recursive expression
+# grammar
+Expr -> Term Expr'
+Expr' -> + Term Expr' | - Term | \e
+Term -> Atom Term'
+Term' -> * Atom | / Atom | \e
+

Not all left-recursion is obvious. We can have indirect left-recursion where you have to go through multiple steps initially. See the below example. The same algorithm works.

A -> B a
+B -> C b
+C -> A c | \e
+

Another less important weakness is it is impossible to "look-ahead" at tokens and make decisions based on that. Meaning that grammars like A -> aB | aC are impossible to parse with (formally) recursive descent parsers.

We would like to design grammars that can be parsed with recursive descent parsers. That is, we would like a predictive parser. For this to be possible, our grammar needs to LL(1) property. LL(1) means left-to-right scanning, leftmost derivation, one lookahead.

We define first(α) where α∈T∪NT as the set of symbols that are the first symbols in a string that derives from α. That is, x∈first(α) iff α⟹∗xγ for some γ. We allow α∈T because α⟹∗α.

We define follow(α) where α∈NT as the set of symbols that can occur immediately after α in a valid sequence.

We define first+(α) as first+(α)=first(α)∪follow(α)

A grammar LL(1) property of a grammar means that if we have rules A→α and A→β both in the grammar, we would like first(α)∩first(β)=∅. This would mean that the grammar can look ahead a single token x. If x∈first(α) then pick α, if x∈first(β), then pick β, otherwise error.

Let's look at a non LL(1) grammar.

1. A -> aAb
+2. A -> bB
+3. A -> \e
+4. B -> b
+

Consider the string abbb. When doing recursive descent paring, we could get the following two tables
RuleSentential FormInput
A!abbb
1aAba!bbb
2abBba!bbb
RuleSentential FormInput
A!abbb
1aAba!bbb
3?aba!bbb

We can transform some (not all!) process is called left-factoring. Whenever you have an ambiguous choice, you factor out the first symbol which you have an ambiguous choice to a new common non-terminal. However, given a CFG doesn't meet the LL(1) condition, it is undecidable whether or not an equivalent an LL(1) grammar exists.

Here is an example of a language which has no LL(1) grammar.

L=an0bn∪an1b2n

Here is a CFG to recognize L

S -> A | B
+A -> aAb | a0b
+B -> aBbb | a1bb
+

You need an unbounded number of a characters before you can figure out whether to pick A or B. That is, if you say you only need n, I can give you a string that requires n+1.

Example: Is the following grammar an LL(1) grammar?

G -> M [num] "." [num]
+G -> N
+M -> "-"
+M -> \e
+N -> [num]
+

This is not an LL(1) grammar. first+(M)="-",[num] first+(N)=[num]. Means that first+(M)∩first+(N)≠∅.

We can rewrite this grammar to be LL(1) as such

G -> "-" [num] "." [num]
+G -> [num] "." [num]
+D -> "." [num]
+D -> \e
+

Example: Convert the following grammar into an LL(1) grammar with no left-recursion.

G -> M N
+M -> a b
+M -> \e
+N -> N a
+N -> \e
+
+# Eliminate left recursion
+G -> M N
+M -> a b
+M -> \e
+N -> \e N'
+N' -> a N'
+N' -> \e
+# Simplify
+G -> M N
+G -> N
+M -> a b
+N -> a N
+N -> \e
+
+# Make LL(1)
+# Realize that M and N can both start with a.
+# Factor that out.
+G -> \e
+G -> a G'
+G' -> b N
+G' -> N
+N -> a N
+N -> \e
+
+# We're done!
+

Example: Let's apply our algorithm to show that not all grammars are LL(1). (Well, really to just give you the idea that not all are. We haven't shown our algorithm always works.)

G -> aAb | aBbb
+A -> aAb | 0
+B -> aBbb | 1
+
+# Factor out common a in G
+G -> a G1
+G1 -> Ab
+    | Bbb
+A -> aAb | 0
+B -> aBbb | 1
+# Simpler
+G -> a G1
+G1 -> aAbb
+    | 0b
+    | aBbbbb
+    | 1bb
+A -> aAb | 0
+B -> aBbb | 1
+
+# Factor out common a in G1
+G -> a G1
+G1 -> G2
+    | 0b
+    | 1bb
+G2 -> Abb
+    | Bbbbb
+A -> aAb | 0
+B -> aBbb | 1
+# Simpler
+G -> a G1
+G1 -> G2
+    | 0b
+    | 1bb
+G2 -> aAbbb
+    | 0bb
+    | aBbbbbbb
+    | 1bbbb
+A -> aAb | 0
+B -> aBbb | 1
+
+# Oh no, we have to factor out a common a again.
+# We're stuck in an infinite loop...
+

As we've gone over, here's the rough procedure for converting an LL(1) grammar into a recursive descent parser.

  1. Remove left recursion via intermediate rules / repetitions.
  2. Massage the grammar (removing empty / redundant rules).
  3. Do left-factoring until you get rid of all ambiguous rules. (You may have to massage the grammar to make it more obvious.)

#### Table-Based Recursive Descent Parser

If we're auto-generating a recursive descent parser, one of the easiest ways to do it is to encode your grammar as a giant token-production table because then all you have to do is write a table-driven parser which itself is pretty easy.

The table format is every row is a production to follow and the column is the token received. Then your parser keeps track of its current state/row/production, starting at the start state. It checks what the next token is and determines the next production to check.

class TableParser:
+  """Table driven parser in pseudo-python."""
+
+  def parse(self, tokens):
+    """
+    This is like a recursive descent parser
+    except we use a loop with a stack because,
+    well, that's exactly what recursion does but
+    we have to have generic code so it's easier
+    to loop like this. (Well, at least that's
+    what we say.)
+    """
+    # processing is the current non-terminal or
+    # terminal we're processing
+    processing = Stack()
+    processing.push(EOF)
+    while True:
+      want = processing.peek()
+      got = tokens.peek()
+      if want == EOF and want == EOF:
+        return AST
+      elif instanceof(Terminal, want):
+        if want == got:
+          processing.next()
+          tokens.next()
+        else:
+          raise Error(
+            f"expected {want}, got {got}"
+          )
+      else:
+        # A -> B1 B2 ... Bn
+        new_wants = self.table[want][got]
+        if new_wants is None:
+          raise Error(
+            f"unexpected token for {want}"
+          )
+        else:
+          processing.next()
+          # Push Bn ... B1
+          # This is so B1 is on top
+          for w in reversed(new_wants):
+            processing.push(w)
+

Many high-quality programming languages opt for hand-written parsers because, as you can see above, the error messages are lack-luster and it is hard to give higher quality error messages. Also, the code takes more memory and normally isn't faster.

### Bottom-Up Parsers

Bottom up parsers are called such because they start at the leaves gradually build up the abstract syntax tree. Bottom up parsers big weakness is that they do not have very good error reporting. However, they can parse more languages by their nature and they also require no changes to grammars to handle, for example, left-recursion and right-recursion elegantly.

We will be discussing LR(1) parsers as the class bottom-up parser. They are named similarly to LL(1). LR(1) means left-to-right scanning, rightmost derivation, one lookahead.

TODO: Watch lecture video

## Context Sensitive Analysis

This is where we do type checking and other semantic analysis, like undeclared variable usage.

For example, this is a type argument mismatch. A parser cannot identify this error so we don't call it a syntax error. Instead this is a semantic error.

void foo(int a);
+void main() {
+  foo("Hi");
+}
+

Similarly, this is use of an undeclared variable.

void main() {
+  printf("a %s", a);
+}
+

Why can't the parser detect semantic errors? Semantic errors often require depending on values, non-local information, and computed information.

There are two main approaches to doing semantic analysis: ad-hoc syntax-directed translation and attribute grammars.

### Ad-Hoc Syntax-Directed Translation

To do syntax-directed translation as we discuss here, you associate code with every single production. This code is run while you're parsing, running after every production is taken.

Often, computations require some initialization of data (e.g. allocating data). To do this formally we create a Init variable that derives to \e that does all initialization. For example, with determining the cost of executing a basic block. In practice though, we just add some initialization code at the start element. Something like this

Start -> Init BB
+Init -> \e  # cost = 0
+BB...  # cost += cost(...)
+

This could be done by a parser generator. Here's a concrete example using YACC.

# $$ refers to the attribute on the lhs
+# $n refers to the attribute on the nth element
+# of the rhs
+Assign -> Ident = Expr;  $$ <- COST(store) + $3
+Expr -> Expr + Term;  $$ <- $1 + COST(add) + $3
+

Because you are just associating code with productions, this is incredibly flexible. This does restrict the evaluation order to be whatever order you parse things in.

Often though if you're doing ad-hoc syntax-directed translation, you won't be using a parser generator because that makes it (generally) easier to write. Why would you ever not use a parser generator? Error messages. Error handling. Maintainability.

### Attribute Grammar

Another similar example is attribute grammars.

An attribute with additional semantic analysis code an attribute grammar. An attribute grammar is a normal CFG augmented with a set of rules. Every symbol in a derivation has a set of attributes (e.g. they're structs) and every production has a code snippet that describes how to compute a value for each attribute.

Here is an example using pseudo-code. It comes the decimal value of a signed binary number.

Number -> Sign List {
+  List.pos = 0
+  Number.val = if Sign.neg {
+    -List.val
+  } else {
+    List.val
+  }
+}
+
+Sign -> + { Sign.neg = false }
+Sign -> - { Sign.neg = true }
+
+List0 -> List1 Bit {
+  List1.pos = List0.pos + 1
+  Bit.pos = List0.pos
+  List0.val = List1.val + Bit.val
+}
+List0 -> Bit {
+  Bit.pos = List.pos
+  Bit.val = List.val
+}
+
+Bit -> 0 { Bit.val = 0 }
+Bit -> 1 { Bit.val = 2**Bit.pos }
+

We can make a graph of how the attributes are computed by an AST with a list of each nodes attributes. For every attribute, we draw an arrow from what the value depends on. For example, List1.pos = List0.pos + 1 means that List1.pos depends on List0.pos. This graph must be acyclic for all graphs, otherwise the computation would (possibly) never terminate.

One of the weaknesses(?) of attribute grammars is the lack of global variables.

## Type Checking

Type checking is a form of correctness verification. It helps statically prevent certain errors. Type checking is the process of determining whether type expressions conform to the type system, that is a collection on rules for types, of the language.

Some languages support type inference, which allows the developer to not define the type of a given variable and instead the compiler will infer it from context.

We call a language's type system sound if no runtime checking is necessary to ensure that the program experiences no type errors at runtime.

When we are type checking, we need to determine when two types are equivalent. There are two main ways to define this type equivalence: structural equivalence and name/nominal equivalence. Two types are structurally equivalent if their types have the same "shape". Two types are nominally equivalent if their types are lexically defined the same. In the below example v1 and v3 are structurally equivalent and v1 and v2 are nominally equivalent.

typedef struct { int a; int b; } X;
+typedef struct { int a; int b; } Y;
+X v1, v2;
+Y v3;
+

Some people think such strict type-checking / type-equivalence is annoying or needlessly restrictive. To make this easier certain languages support casts, which explicitly convert two types using essentially built-in conversion mechanisms, or coercions, which are like casts but implicit. If two types are structurally equivalent, the cast has no cost at runtime. If two types are not structurally equivalent, the compiler has to insert simple instructions to for example increase the width of the number. Depending on the languages semantics for casts and coercions, these can cause unexpected bugs or vulnerabilities. For example C will implicitly coerce numbers which may result in integer wraparound which introduces bugs or can even be insecurely optimized by the compiler (since integer wraparound is undefined).

How do we determine the type of expressions? We do this using type synthesis. Basically the compiler has a list of rules which it either has for built-ins (e.g. int + float -> float or int * int -> int) or determines from analyzing the source code. For example given a declaration like this

int write(char *s) {
+  // ...
+}
+

If the compiler would saw an expression like write(a), it would determine that a has type char * and would determine that the entire expression has type int.

### Polymorphism

Polymorphism is a really vague term that basically just means that a function or method or class can work with multiple different type.

One of the classic methods for doing polymorphism is dynamic dispatch with vtables. Java and Go use this with their interfaces and C++ does it with virtual methods. However, these polymorphic method still need to check their type. But this time we aren't just doing simple type equality because we can accept many different types. How do we handle this?

Normally, we use interfaces or abstract classes, or the generic name of subtyping. With interfaces or abstract classes we declare the behaviors that the given type must have to be used in place of those interfaces. Languages like Java and C++ use nominal subtyping, where the type must explicitly says it implements that abstract class, while languages like Go use structural subtyping, where the types must implement all the necessary methods. Then when we try to provide a concrete class to an abstract class our concrete class must be a subtype of the abstract class (in a way stated before). What if we want to assign an abstract class to another abstract class? Then the provided abstract class must be a subtype of the necessary abstract class. This is done using the same mechanisms where the given abstract class must explicitly implement/inherent from the necessary abstract class or must provide the necessary methods.

Note: All types are considered trivial subtypes of themselves.

There is also parametric polymorphism, which is the classic generics. Here you statically provide types to a function. This follows all the same subtyping requirements of inheritance. However, here all the subtyping is done at compile time so the language can guarantee more optimizations by not requiring vtables and dynamic dispatch.

With dynamic dispatch and especially deeply nested inheritance trees, the overhead necessary to call a virtual method can be very expensive as you have to follow many different points.

# Middle-end

Concerned with optimizations of the code. Often do multiple passes using different optimization methods because certain optimizations are more effective after another or benefit from running multiple times. Must not change the meaning of the code.

Core to the middle-end is the intermediate representation (IR) used. There are many IRs that exist that focus on certain things like ease of optimizing, ease of use, level of abstraction, speed of generation, etc. When designing or choosing an IR, you have to carefully design it to optimize it for your use case.

There are three main types of IRs:

  • Structural: Graph/Tree based code.
    • Rust's HIR.
  • Linear: Pseudo-assembly for an abstract machine.
    • LLVM IR.
  • Hybrid: Combination of structural and linear used.
    • Control-flow graph.

## Structural IR

The canonical structural IR is the abstract syntax tree (AST). This is where every node in your program gets a single node. It is the starting point of most other forms and even several optimizations, since it is directly what you get from the source code. It is like the parse tree except simplified to make it easier to use.

Similar to the AST, you can construct a directed acyclic graph (DAG), which is like a tree except branches can go down more than one level and multiple edges (arrows) can point to the same node. This is useful for identifying shared code/expressions, allowing for reducing code motion.

Tree vs DAG for Abstract Syntax

## Linear IR

Linear code tends to be much closer to machine code, often being designed (generally) as more heavily annotated, higher level assembly. They can make low level optimizations (e.g. register allocation) much easier but make analyzing higher level control flow more difficult.

There is stack machine code, which is mostly used for virtual machines because they are easy to implement. Every operation acts on a global stack except for push and pop. push pushes a new value from memory or immediate onto the stack. pop pops the top value from the stack and stores it into memory.

There is three address code which is like assembly except every operation can only have exactly 3 operands. For example r0 = r1 + r2 is a three address code but r0 = r1 + 2 * r2 is not (2 is an immediate and considered an address). This is essentially a generic assembly, because most real hardware have 1-3 operands per instruction, so this maps nicely.

There is static single assignment (SSA) form, which is actually the most popular linear form used in major compilers today. SSA means that every variable/register is written/set exactly once but can be read/used infinitely many times. This makes analyzing code flow and statement dependency very easy.

To make SSA work, we need to do renaming and ϕ functions. Renaming is the process of changing to the name of a variable whenever it is written/mutated. The ϕ function is conceptually like a union. It takes multiple different variables and returns one of them at runtime, meaning you can't determine which at compile time. If you have x2←ϕ(x0,x1), then x2 depends on both x0 and x1.

## Hybrid IR

The control flow graph is a graph of how the code flows. You've probably studied it significantly in earlier classes, it's that graph that shows loops and logical branches like a graph. This is useful for higher level optimizations like combining loops, switching loops, and dead code elimination.

## LLVM Project

The LLVM project is a large project to produce high quality machine code for a wide range of architectures and wide range of languages. The LLVM project is a collection of optimizers on the LLVM IR (bundled into the opt binary), converting low quality IR to high quality IR, and then backends that produce machine code for various architectures (bundled into llc).

Then, new language designers simply need to emit LLVM IR (doesn't even need to be high quality) and suddenly their language will produce high quality machine for a wide variety of architectures. The core part of LLVM is the IR definition and the optimizers.

Since the LLVM project is a common project for academics who experiment with optimizations work on optimizations and has great industry support, it produces incredibly high quality machine code.

### LLVM IR

Here is the LLVM IR assembly language reference: https://llvm.org/docs/LangRef.html

The LLVM project uses static single assignment (SSA) IR called LLVM bitcode. It's call bitcode because normally tools use a binary format for efficiency and simplicity. There is also a human readable version that is kinda like RISC assembly code except with infinite registers, types, structs, an understanding of functions, and tons of instructions and annotations, like phi, align, global, etc. All of this makes LLVM IR easy to analyze and high level enough to be efficiently implemented on many machines.

Here are a bunch of examples of how some C code could compile to LLVM IR. These examples were cleaned up from examples with Clang 10 -emit-llvm -O1. You can play around with this on Godbolt Compiler Explorer.

#### Example 1

##### C
int square(int num) {
+  return num * num;
+}
+
##### LLVM
; %[name] is a register. You can give them any
+; name but compilers tend to produce just
+; incrementing numbers for simplicity. This is C
+; so it's name is mangled like it would be in
+; C++ or Rust.
+define i32 @square(i32 %num) {
+  %1 = alloca i32
+  store i32 %num, i32* %1
+  %2 = load i32* %1
+  %3 = load i32* %1
+  %4 = mul i32 %2, %3
+  ret i32 %4
+}
+

#### Example 2

##### C
int array[100];
+int x
+
+struct list {
+  int x;
+  struct list *next;
+};
+
##### LLVM
%struct.list = type { i32, %struct.list* }
+
+@array =
+  global [100 x i32] zeroinitializer, align 16
+@x = global i32 0, align 4
+

#### Example 3

##### C
int *ptr;
+ptr = ptr + 1;
+
##### LLVM
%ptr = alloca i32*
+%1 = load i32** %ptr
+%2 = getelementptr i32* %1, i64 1 ; add 1 to ptr
+; now %2 is the new pointer
+

#### Example 4

##### C
int max(int *x, int y) {
+  if (x && *x > y) {
+    return *x;
+  } else {
+    return y;
+  }
+}
+
##### LLVM
define i32 @max(i32* readonly %0, i32 %1) {
+; if (x && %4) {
+;   ...
+; } else {
+;   %7
+; }
+  %3 = icmp eq i32* %0, null
+  br i1 %3, label %7, label %4
+
+; if (... *x > y) {
+;   return *x;
+; } else {
+;   %7
+; }
+4:
+  ; t = *x
+  %5 = load i32, i32* %0, align 4
+  ; t > y
+  %6 = icmp sgt i32 %5, %1
+  ; return t or y
+  br il %6, label %8, label %7
+
+; return y
+7:
+  br label %8
+
+8:
+  ; if from 7, return y
+  ; if from 4, return t = *x
+  %9 = phi i32 [ %1, %7 ], [ %5, %4 ]
+  ret i32 %9
+}
+

Some things you can notice is that LLVM IR avoids explicitly representing the stack. This is to more easily support a wider range of machines. It uses alloca instead to represent the stack.

It also organizes code into functions with explicit arguments and return instructions. And then functions are organized into modules (by file). Every module is held in memory in a single large data structure. This allows for optimization on a large amount of the program. However, it is not possible to optimize across module (by the compiler). Instead it is done by the linker at link time, called link time optimization (LTO).

## Optimizations

There are several clever optimizations that people have thought up for compilers. There are way too many for us to go over extensively.

We structure code in basic blocks. If we recognize the connections between these basic blocks in the control flow diagram, we can eliminate dead code, remove unnecessary jump instructions, unlock future optimizations.

TODO: Get from 10/21

Constant propagation is the process of evaluating as much code at compile time as you can. Typically this is done by doing arithmetic on constants to result in a smaller simple constant, potentially removing expensive instructions. In the above example, we could simplify someNum() to just 147.3 which could then be inlined as a constant.

double someNum() {
+  int a = 3;
+  double b = 49.3;
+  return a * b;
+}
+

Strength reduction is the process of replacing expensive instructions with cheaper instructions. For example integer division by 32 can be simplified to a left shift by 5. In fact a lot of multiplications and divisions have extremely clever optimizations like that. If you're iterating over an array using an incrementing index, that can be optimized by a pointer which is just being incremented, replacing an increment, multiplication, and addition with a single addition every loop. Here's an example of a few.

// division replaced with left shift
+void division(int a) {
+  return a / 32;
+}
+void division(int a) {
+  return a >> 5;
+}
+
+// incrementing index replaced with pointer
+void arrayIndex(int arr[], size_t n) {
+  for (size_t i = 0; i < n; i++) {
+    arr[i] = 0;
+  }
+}
+void arrayIndex(int arr[], size_t n) {
+  int *end = arr + n;
+  int *p = arr;
+  // in asm p++ would be ptr += sizeof(*p)
+  for (; p != end; p++) {
+    *p = 0;
+  }
+}
+

Reducing code motion is where you take some identify some expression that is being repeatedly evaluated (e.g. in a loop). If that expression has no side effects and doesn't depend on any values changing in the loop, then you can evaluate that expression once and then store it in a temporary that you repeated reference. Here is an example.

// Calculate the nth prime, very expensive.
+size_t nthPrime(size_t n);
+
+// This technically evaluates nthPrime every
+// time, which is very expensive.
+void codeMotion(size_t n) {
+  for (size_t i = 0; i < nthPrime(n); i++) {
+    printf("%d\n", i);
+  }
+}
+// This code is equivalent and evaluate nthPrime
+// only once.
+void codeMotion(size_t n) {
+  size_t end = nthPrime(n)
+  for (size_t i = 0; i < end; i++) {
+    printf("%d\n", i);
+  }
+}
+

Loop unrolling is where you eliminate some jump instructions at the exchange of code bloat by duplicating the code within the loop multiple times. Below is C code with its unrolled version below. This isn't a great example because you don't really reduce the amount of instructions necessary or unlock auto-vectorization optimizations.

// rolled up loop
+void printNums(size_t n) {
+  for (size_t i = 0; i < n; i++) {
+    printf("%d\n", i);
+  }
+}
+
+// unrolled loop by 4
+void printNums(size_t n) {
+  size_t i = 0;
+  // Handle when n % 4 != 0
+  switch (n % 4) {
+  case 3:
+    printf("%d\n", i++)
+  case 2:
+    printf("%d\n", i++)
+  case 1:
+    printf("%d\n", i++)
+  case 0:
+  }
+  for (; i < n; i += 4) {
+    printf("%d\n", i);
+    printf("%d\n", i + 1);
+    printf("%d\n", i + 2);
+    printf("%d\n", i + 3);
+  }
+}
+

Loop unswitching is the process of extracting branches within a loop to outside of the loop. This changes the number of comparisons necessary to finish the loop from n to 1, which can make the loop way more efficient to run by itself by reducing the number of jumps and (in some cases) improving instruction cache locality. It can also unlock auto-vectorization. Here is an example of a loop and its unswitched version.

// original loop
+void printStuff(size_t n, bool a) {
+  for (size_t i = 0; i < n; i++) {
+    if (a) {
+      printf("a\n");
+    } else {
+      printf("b\n");
+    }
+  }
+}
+
+// unswitched loop
+void printNums(size_t n, bool a) {
+  if (a) {
+    for (size_t i = 0; i < n; i++) {
+      printf("a\n");
+    }
+  } else {
+    for (size_t i = 0; i < n; i++) {
+      printf("b\n");
+    }
+  }
+}
+

### Caches and Optimizations

TODO: Get from 10/21 lecture

False sharing is when two concurrently running processes continuously read and write memory from the same cache line, even when the memory that they're actually using is different. This is especially impactful when the two processes are running on different CPUs. This means that every time one process writes to the memory in the same cache line, it has to load it from the cache and invalidate the other processes memory. This means that when the other process next tries to write to that memory in the same cache line, it has to load it from memory and invalidate the other processes memory. This results in your processes continuously copying the cache line back and forth, thrashing memory and wasting a ton of time.

This example below results in false sharing (taken from Wikipedia), where sum_x needs to continually re-read x from main memory (instead of cache) even though inc_y's concurrent modification of y is irrelevant.

struct foo {
+  int x;
+  int y;
+};
+
+static struct foo f;
+
+// The two following functions are running
+// concurrently
+int sum_x(void) {
+  int s = 0;
+  for (int i = 0; i < 1000000; ++i) {
+    s += f.x;
+  }
+  return s;
+}
+
+void inc_y(void) {
+  for (int i = 0; i < 1000000; ++i) {
+    ++f.y;
+  }
+}
+

# Back-end

The back-end primarily has three responsibilities: instruction selection, instruction scheduling, and register allocation. Optimal register allocation is an NPC problem, so often we just use heuristics to ensure near-optimal solutions. This is similar to what we do for other optimizations.

As time goes on, hardware becomes more and more complex because they are no longer designed to be understood primarily by humans and instead to be primarily understood by compilers/computers. This can allow us to have higher performance computers for cheaper. Because of this, ISAs are getting increasingly complex. The compiler must understand this and produce high quality code, hiding these complexities from the programmer.

## Memory and Compilers

Compilers need to understand the memory layout of the machine they're running on. That way they can efficiently map the abstract memory model of the high level language to the hardware's memory.

A traditional C-like memory model (which is what most languages use) has a read-only code segment, a read-write static segment, a heap, and a stack. The code segment and static segment have a known size at compile time, but the heap and stack are growable and only known at runtime.

Normally, we put the read-only code segment at the lowest addresses. Immediately after that we have mutable memory in a static segment. These have a known size at compile time so we can put them directly next to each other. Then, to prevent the heap and stack from running into each other, we put the heap immediately after the static segment, having it grow to higher addresses, and we have the stack be at the highest addresses, having it grown down to lower addresses.

Having the stack and the heap really far apart used to be relevant when we didn't have paged memory and virtual addresses, so we really needed to ensure that the heap and the stack don't run into each other. Even as we have paged memory this is still useful so we can pretend that memory is a single flat address space without worrying about addresses collide.

## Procedure Abstraction

Functions are an incredibly common abstraction across languages and even in assembly. How do we efficiently implement this on a machine which doesn't have native support for procedures? First, to be able to call functions at all you need a calling convention. You could use the standard C calling convention, you could specify your own, or you could make your calling convention unspecified.

In general, to implement a procedure you have to perform the following steps:

  1. The callers stores program state before it calls the procedure. For example it pushes the instruction pointer to a known place and also stores the registers it cares about onto the stack.
  2. The caller jumps jumps to the address of the procedure it's calling.
  3. The called procedure stores all registers it uses that the calling convention tells it to store.
  4. The procedure does its work.
  5. The procedure reverts the registers it stored.
  6. The procedure jumps to the known instruction pointer location.
  7. The caller restores all the registers it stored onto the stack.

As you can see, this is fairly expensive but also incredibly common. As such many machines provide hardware interfaces to more efficiently call procedures.

In order to more easily organize the information and data local to each procedure, we create something call activation records (AR) or stack frames. These are application binary interface (ABI) dependent (i.e. machine dependent) information about each procedure call. It's exact structure depends on language and machine but often they contain the parameters for the function, the return address, and all the local data.

Stack Frame / Activation Record

Most languages put activation records on the stack (hence the name stack frame) because they are only used during the execution of the function. For some languages (like ML) put activation records on the heap because activation records may be used after the heap.

### Calling Conventions

To maintain activation records, the caller must go through a pre-call sequence and a post-return sequence. Likewise the callee needs to go through a standard prolog and a standard epilog

This standard sequence is calling the calling convention. It determines what registers need to be saved by the caller, what registers need to be saved by the callee, where arguments are stored, where return values are stored, where return addresses are stored, and all that fun stuff.

Here is some more information about the System V ABI for the Intel386 architecture. That is the C ABI for the Intel architectures. http://sco.com/developers/devspecs/abi386-4.pdf

## Instruction Selection

Instruction selection along with instruction scheduling and register allocation is one of the most important backend choices. For most machines, there are many different ways to perform a computation where the cost depends on the context. A classic example is that mov rax, 0 is the same as xor rax, rax.

Generally, the backend does this using a code generator with a set of rewrite rules. These rewrite rules describe all the ways the IR can be converted to a specific (series of) instructions. You normally do this by doing a post-order traversal / bottom-up walk of the tree to convert expressions into instructions. However, there are many matches for these rewrite rules for every expression, each with different costs. How do we do we find the lowest-cost match for each subtree?

One easy way is to compute all possible matches and choose the cheapest one. This can be absurdly expensive as your list of operations increases. There is also methods using dynamic programming.

## Instruction Scheduling

Instruction scheduling is the process of reordering instructions for optimal execution. This is necessary when / because instructions can take different number of cycles to complete and thus have different latencies. By reordering instructions you "hide" the latencies. Essentially you want to do as much as you can before you hit an instruction which depends on a previous instruction. You can also potentially reduce the number of necessary registers.

This may be unintuitive but consider the following example.

// W <- w * 2 * x * y * z
+
+// Schedule 1
+loadAl  r0, @w => r1        // 1
+add     r1, r1 => r1        // 4
+loadAl  r0, @x => r2        // 5
+mult    r1, r2 => r1        // 8
+loadAl  r0, @y => r2        // 9
+mult    r1, r2 => r1        // 12
+loadAl  r0, @z => r2        // 13
+add     r1, r2 => r1        // 16
+storeAl r1     => r0, @w    // 18
+// 21
+
+// Schedule 2
+loadAl  r0, @w => r1        // 1
+loadAl  r0, @x => r2        // 2
+loadAl  r0, @y => r3        // 3
+add     r1, r1 => r1        // 4
+add     r1, r2 => r1        // 5
+loadAl  r0, @z => r2        // 6
+mult    r1, r3 => r1        // 7
+mult    r1, r2 => r1        // 9
+storeAl r1     => r0, @w    // 11
+// 14
+

As you can see the schedule 2 took fewer cycles because it moved instructions that depends on previous instructions farther apart. This allows the machine to make more progress while the other instruction(s) it depends on are in flight.

Note that schedule 2 also uses more registers. In some cases thus it would be worse if it requires more cycles to spill the registers than it saves.

To help determine what instructions depend on each other, we build a dependence graph, which is a directed graph. Each node in the graph is an operation and every instruction's node has an arrow pointing directly to the instruction which depend on it / must occur after it. Often each node is annotated with the latency of the nodes plus all of its dependents.

There is a strategy to scheduling instructions called local list instruction scheduling. It is done as follows.

  1. Build a dependence graph G.
  2. Compute a priority function over the nodes in G. (The priority function determines the latency of the instruction.)

What are the weaknesses of this technique? We can't determine what branch will be taken, even which branch will be taken most of the time. We can't determine where a load or store will occur in memory, for example will most of the loads and stores of this variable be cache misses or cache hits? Those can hugely effect the latency of the instruction.

## Register Allocation

Register allocation is the process of deciding what data goes where in the machine.

A critical part of doing register allocation is determining the liveness of a variable. A variable is live between its definition and its last use, the range of these instructions / blocks is called its live range. Analysis of live ranges is way easier if you use static single assignment (SSA) form.

If you have more variables alive at some time than your machine has registers, then you won't be able to hold all of the values in registers and will have to spill some. A register spill is just when you store the contents of the variable into memory (e.g. on the stack).

We can transform register allocation into a graph coloring problem by using an interference graph. To create an interference graph, create a node for every variable (in SSA form). Whenever two variables are alive at the same time, connect them with an edge. Now we can transform register allocation into graph coloring by assigning each register a color and trying to minimize the number of colors k necessary to color the graph. If k is less than or equal to the number registers in your machine, then you're good. If k is greater than the number of registers in your machine, you need to find the optimal way to make the graph color-able using the number of registers in your machine. You modify the graph by introducing loads and stores, called register spills. You need to minimize the number of necessary spills as well.

Both of these problems (k-color-ability and minimizing the number of spills) is NP-Complete, essentially meaning they are extremely difficult. (Formally, there is no known way to solve the problems in polynomial time, and they are "as hard" as all other NP problems.)

One heuristic algorithm to perform register allocation is Chaitin's algorithm. It was actually the first register allocation algorithm that used graph coloring!

# Theoretical Stuff

## Chomsky's Hierarchy

Chomsky's hierarchy of languages/grammars is a way of categorizing grammars. A grammar G=(N,Σ,P,S) is a set of non-terminal symbols N, terminal symbols Σ, and productions P. One non-terminal S∈N is considered the start symbol. Productions α→β∈P are rules that allow you to go from a sequence of lefthand side symbols $\alpha \in (N \cup \Sigmap)^totoasequenceofrighthandsymbols\beta \in (N \cup \Sigmap)^$. We can categorize grammars by the amount of restrictions placed on them. This allows us to categorize their computability.

  • Regular Grammar: A grammar where every production has at most one righthand non-terminal symbol and arbitrarily many lefthand terminal symbols. There can be no lefthand non-terminals and no righthand terminals. This is called a righthand grammar, but if we switch the left and right rules we get a lefthand grammar.
  • Context Free Grammar: A grammar where the lefthand side of productions is a single non-terminal and the righthand side is an arbitrary combination of terminals and non-terminals.
  • Context Sensitive Grammar: A grammar where the lefthand side of productions is an arbitrary combination of non-terminals but no terminals and the righthand side is an arbitrary combination of terminals and non-terminals.
  • Unrestricted Grammar: A grammar where the lefthand side of productions can have any arbitrary combination of terminal and non-terminals and the righthand side of productions can have again any arbitrary combinations.

Note: Technically these grammars are supersets of each other, but normally when we say a grammar is "context free" we mean that it is the minimal encompassing classification, that is it is not regular. Even though all regular grammars and context free grammars.

A regular grammar is guaranteed to be able to be parsed/validated in O(n) linear time by a finite automata (e.g. NFA). A context free grammar (CFG) can be computed in linear time by a pushdown automated (PDA).

Example: The following is a regular language recognized by the regular grammar below. L=an:n∈N

A -> aA | a
+

Example: The following is a context free language recognized by the context free grammar below. L=anbn:n∈N

A -> aAb | ab
+

Example: The following is a context sensitive language. L=anbncn:n∈N

# Performance Analysis

This stuff is research which the professor is working on. It's not incredibly relevant to constructing compilers but understanding performance and how to debug it is good for optimizations.

## DrCCTProf

CCT stands for calling context tree. DrCCTProf is developed by the professor's research group and examples and docs can be found in the slides.

In this class we will use DrCCTProf which is a binary analyzer that tracks instructions (operator and operands), registers (SIMD and general purpose), memory location, and storage locations of variable (register or memory). It is designed to efficiently allow for call path analysis, with ~2x overhead compared to the 100-1000x overhead of Valgrind.

It is built on DynamoRIO. DynamoRIO does dynamic binary instrumentation and is maintained by Google and is programmable using DynamoRIO clients, which are programmed by registering event handlers. It allows you to do things such as count the number of basic blocks executed during execution.

Compared to DynamoRIO, DrCCTProf provides a (slightly) nicer (undocumented) API for analyzing call path. It automatically builds a calling context tree and interns symbols (optionally). It builds the calling context tree to enable constant time querying of the call path because you just look up something from a tree instead of unwinding the stack.

### DrCCTProf Usage

The general usage is initialization, instrumentation, analysis, storage, and output.

  • Initialization: Open files and call into DynamoRIO to initialize.
  • Instrumentation: Instruct DrCCTProf about what things it should look at and what it should do when sees a certain thing (e.g. basic-block, instruction, etc.).
  • Analysis: Run the program with the instrumentation.
  • Storage: The instrumentation needs to efficiently store the memory either in DrCCTProf's Map<uint64_t, uint64_t> or shadow memory.
  • Output: Collect/aggregate all of the stored information and create output.

DrCCTProf outputs data in a format which is compatible to HPCToolkin, a Java GUI used to visualize the information more easily than the raw text output.

### Call Path Importance

To detect issues with generated code performance, we often need to know how the code was reached. That way we can detect redundant/inefficient code. For example, this basic block appeared twice in my execution trace, is that redundant code in code generation or am I duplicating work? Without the call path this is hard to determine.

It also allows detection of:

  • Memory Safety Issues: data races, out of bounds array access.
  • Performance Issues: False sharing detection (cache issues), etc.

### Data-centric DrCCTProf

By enabling data-centric detection in DrCCTProf, you keep track of every memory access and where it is allocated. That is, what call to malloc, is it on the stack, etc.

## DeadSpy

DeadSpy is a tool which can help analyze dead stores. Dead stores are memory writes with no intervening reads, so there are no effects of the write. The earlier write that does nothing is called the dead write and write that replaces that write is called the killing write.

DeadSpy, like DrCCTProf, analyzes machine code rather than the source code. This means it is a general purpose tool that works on many different languages (that compile to machine code).

Dead stores are most often caused by poor data structure choice, lack of design for performance (no restrict, dead writes in source code, etc.), overly aggressive compile optimizations, and TODO.

What we care the most about here is understanding why poor machine code generation occurs. We can detect when we're being too aggressive with compiler optimizations (sometimes compiler optimizations introduce issues if they are applied in unexpected ways) or if we're being too conservative.

\ No newline at end of file diff --git a/notes/ncsu/3f/csc412/stack_frame.png b/notes/ncsu/3f/csc412/stack_frame.png new file mode 100644 index 0000000..6d733f2 Binary files /dev/null and b/notes/ncsu/3f/csc412/stack_frame.png differ diff --git a/notes/ncsu/3f/csc412/thompsons_construction.png b/notes/ncsu/3f/csc412/thompsons_construction.png new file mode 100644 index 0000000..ed28b6e Binary files /dev/null and b/notes/ncsu/3f/csc412/thompsons_construction.png differ diff --git a/notes/ncsu/3f/index.html b/notes/ncsu/3f/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/3f/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/ncsu/3f/ma407/index.html b/notes/ncsu/3f/ma407/index.html new file mode 100644 index 0000000..975b5d7 --- /dev/null +++ b/notes/ncsu/3f/ma407/index.html @@ -0,0 +1 @@ +Eli | MA 407: Introduction to Modern Algebra

MA 407: Introduction to Modern Algebra

Instructor: Dr. Jo-Ann Cohen | Semester: Fall 2020

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/3f/ma520/index.html b/notes/ncsu/3f/ma520/index.html new file mode 100644 index 0000000..3dfcaa5 --- /dev/null +++ b/notes/ncsu/3f/ma520/index.html @@ -0,0 +1 @@ +Eli | MA 520: Linear Algebra

MA 520: Linear Algebra

Instructor: Dr. Bojko Bakalov | Semester: Fall 2020

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/3f/st421/index.html b/notes/ncsu/3f/st421/index.html new file mode 100644 index 0000000..056ef90 --- /dev/null +++ b/notes/ncsu/3f/st421/index.html @@ -0,0 +1 @@ +Eli | ST 421: Introduction to Mathematical Statistics

ST 421: Introduction to Mathematical Statistics

Instructor: Dr. Jonathan Duggins | Semester: Fall 2020

TODO: Include cheatsheet.

\ No newline at end of file diff --git a/notes/ncsu/3s/csc416/index.html b/notes/ncsu/3s/csc416/index.html new file mode 100644 index 0000000..6741cc0 --- /dev/null +++ b/notes/ncsu/3s/csc416/index.html @@ -0,0 +1 @@ +Eli | CSC 416: Introduction to Combinatorics

CSC 416: Introduction to Combinatorics

Instructor: Dr. Ernest Stitzinger | Semester: Spring 2021

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/3s/csc591/index.html b/notes/ncsu/3s/csc591/index.html new file mode 100644 index 0000000..b1630e5 --- /dev/null +++ b/notes/ncsu/3s/csc591/index.html @@ -0,0 +1 @@ +Eli | CSC 591: Special Topics in Computer Science: Computational Geometry

CSC 591: Special Topics in Computer Science: Computational Geometry

Instructor: Dr. Donald Sheehy | Semester: Spring 2021

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/3s/index.html b/notes/ncsu/3s/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/3s/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/ncsu/3s/ma402/index.html b/notes/ncsu/3s/ma402/index.html new file mode 100644 index 0000000..df75e52 --- /dev/null +++ b/notes/ncsu/3s/ma402/index.html @@ -0,0 +1 @@ +Eli | MA 402: Mathematics of Scientific Computing

MA 402: Mathematics of Scientific Computing

Instructor: Dr. Eric Hallman | Semester: Spring 2021

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/3s/ma425/index.html b/notes/ncsu/3s/ma425/index.html new file mode 100644 index 0000000..c3bee97 --- /dev/null +++ b/notes/ncsu/3s/ma425/index.html @@ -0,0 +1 @@ +Eli | MA 425: Mathematical Analysis I

MA 425: Mathematical Analysis I

Instructor: Dr. Stepan Paul | Semester: Spring 2021

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/4f/csc379/index.html b/notes/ncsu/4f/csc379/index.html new file mode 100644 index 0000000..16406cc --- /dev/null +++ b/notes/ncsu/4f/csc379/index.html @@ -0,0 +1 @@ +Eli | CSC 379: Ethics in Computing

CSC 379: Ethics in Computing

Instructor: Dr. David Wright | Semester: Fall 2021

Table of Contents

# Basics

Ethical theories are split into three general areas: meta-ethics, normative ethics, and applied ethics.

  • Ethical Principles
    • Beneficence: Do good to someone or a group.
    • Least Harm: Do not harm people.
    • Respect for Autonomy: Let people make their own choices.
    • Justice: People receive what they deserve in a sense.
  • Ethical Theories:
    • Deontological: Uses a set of rules to distinguish right from wrong. For example, "Don't lie. Don't steal. Don't cheat".
    • Utilitarian: Has the concept of a utility function, which may depend on the situation. Your goal is to maximize the utility function.
    • Rights: List of rights people have universally. You judge the ethics of a situation based on whether it respects or infringes on these rights.
    • Virtues: You think about about what a virtuous person would do.

Here are some frameworks for making decisions:

  • Consequentialist: Consider future effects.
  • Duty: Duties and obligations of situation.
  • Virtue: Consider character traits that motivate us.
\ No newline at end of file diff --git a/notes/ncsu/4f/csc461/index.html b/notes/ncsu/4f/csc461/index.html new file mode 100644 index 0000000..ca2dcb3 --- /dev/null +++ b/notes/ncsu/4f/csc461/index.html @@ -0,0 +1,6 @@ +Eli | CSC 461: Computer Graphics

CSC 461: Computer Graphics

Instructor: Dr. Ben Watson | Semester: Fall 2021

Table of Contents

# Administrivia

# History

  • Brunelleschi (1425): First to invent/define linear perspective.
  • Issac Newton (~1675): Discovered white light is a combo of light of all color. Created color wheel.
  • Thomas Young, Herman von Helmholtz, James Maxwell (1800s): Improved color theory and created first color photograph/display.
  • Ewald Hering (1800s): Theorized that human vision perception resulted in Newton's color wheel and opposing colors.
  • Leo Horwich & Dorothea Jameson (1950s): Found evidence for Haring's theory in the brain.
  • Pierre Bézier (1950s): Found an elegant mathematical way to describe arbitrary curves.
  • Jack Bresenham (1960s): Efficiently solved problem of representing sloped lines on rasterized 2D displays. That is, he used only integer addition and subtraction.
  • David Evans: Founded computer science department at University of Utah and hired Ivan Sutherland. Created early rasterization pipeline.
  • Ivan Sutherland (1960s): Developed first drawing program while grad student at MIT. Had undo and rubber-banding. Developed first head-mounted (augmented reality) display. Made famous computer graphics lab and University of Utah.
    • Many of the people below were in Sutherland's lab!
  • Henri Gouraud (1960s): Invented method of shading (Gouraud Shading) to make polygonal models appear smoother.
  • Ed Catmull (1900s): Invented z-buffering, texture mapping (to polygons), and new kind of surface.
  • Bui Tong Phong: Improved upon Gouraud shading by tweaking the algorithm to run on every pixel (now called Phong Shading). This was not feasible for high-performance use cases until recently.
  • Jim Blinn: Improved Phong shading (now called Blinn-Phong shading). Developed bump mapping and environment mapping.
  • Turner Whitted: NCSU student! Invented/improved ray tracing/casting, including handling of shadows, reflection, and refraction.
  • Jim Clarke (1980s): Developed methods of describing surface patches. Founded silicon graphics (hardware graphics company) and co-founded Netscape.

The Utah teapot is a teapot that was modeled by Martin Newell. It was the first realistic, somewhat complex model to see widespread use for testing objects. It's good because it casts shadows on itself, is immediately recognizable, and it doesn't need to be textured to look good. However, it's also not so complex as to be difficult to render or massive in size. It also got squished at some point!

# Ray Casting/Tracing

## History

Arthur Apple invented ray casting in 1968, that is following the light backwards by moving rays from the camera to other places.

A camera obscura, also known as a pinhole camera, is camera formed by allowing light to enter through a small pinhole in the surface. This requires there to be a large difference in brightness from the inside of the camera to the outside. Pinhole cameras are theorized to have first come up from pinhole cameras being naturally formed by tree foliage.

## Terms

Here are some terms for camera movement:

  • Dolly: Move forward/backward
  • Pedestal: Move up/down.
  • Truck: Move left/right.
  • Pitch: Look up/down.
  • Pan: Look left/right.
  • Roll: Rotate left/right.

Ray casting is a way of creating images from a specific perspective in a scene.

Any camera has the following properties:

  • Position: Point in 3D space where the camera sits.
  • Look-at Vector: Vector which points in the direction where the camera is looking. This defines pitch and pan.
  • Look-up Vector: Vector which points directly up relative to the camera. This defines roll.
  • Field of View (FOV): Number of degrees by which the sight vectors can deviate from the look-at vector. There can be a vertical and a horizontal FOV which changes the aspect ratio and corresponding camera's frustum.
  • Aspect Ratio (W:H): Ratio of the width of the viewable area to the height.

The camera's goal is determine what each pixel should be on the viewport. The viewport is a fictional surface some short distance away from the camera that fits within the frustum. This viewport has pixels and to fill in those pixels we cast rays from the camera to the pixel. Using those rays we fill in the color of the pixel.

We often have a near-clip plane which is some distance away from the camera before we starting casting rays and a far-clip plane which is where we stop casting rays (almost like they've hit fog). Inside these two planes we have a frustum which is like a 3D trapezoid.

Simple ray casters only don't deal with illumination because they only cast a single ray and don't consider how it may bounce off the surface. That is, they hit the surface and register that point.

For that you'd have to do ray tracing. Ray tracing logically continues the ray by allowing it to bounce off surfaces and only stop if it either goes too far or hits a light source. It further considers how the surfaces would impact the color or quality of the light. That is if you hit a white surface and then bounce off and hit a green light, the pixel will appear slightly green. This enables high quality shadows, reflection, and refraction.

A Cornell box is a standard test scene for computer graphics. You have a block with two different color walls on the left and right, a white background wall and ceiling, a ceiling with a hole in it to let light thru, and a colored object filling up most of the scene. This is particularly useful to test color bleeding, where colors reflect onto nearby objects and seem to "bleed" onto them.

## Math

When doing ray casting, you need to know what objects you're dealing with so you can do the correct math.

Often when doing computer graphics, we want to do bilinear interpolation (bi-lerp). That is, suppose you have a rectangle with some important properties at each corner (UL, UR, LL, LR). Bilinear interpolation gives you a way to calculate/interpolate the value of those properties at any point within the rectangle.

def bilerp(x, y):
+    # This assumes x and y are normalized from 0 to 1
+    above = x*UL + (1-x)*UR
+    below = x*LL + (1-x)*LR
+    return y*above + (1-y)*LR
+

### Finding Ray

To find the ray for a specific pixel, we need the location of the eye E and the projection window coordinates UL, UR, LL, and LR. (These stand for upper-left, upper-right, lower-left, and lower-right respectively.)

To find the coordinates of the pixel P, you do bilinear interpolation of the coordinates of UL, UR, LL, and LR using the pixel's x and y within screen space.

To define the ray's position at any time t, you use the position of the eye E and that of the pixel P, giving you R(t)=E+t(P−E)=E+tD where D is the direction vector of the ray.

### Ellipsoid Collisions

Let S be a point. We say the point is on the surface of the ellipse if the following is true: |S−CA|2=1. That is, S is the surface of the ellipse.

Now if you plug-in the equation of the ray into the ellipse equation and solve for t. That is you use this equation |R(t)−CA|2=1 and solve for t you get the following at2+bt+c=0 where a=|DA|2, b=2(DA⋅E−CA), c=|E−CA|2−1.

Since this is just a quadratic, we can use the quadratic formula! t=−b±b2−4ac2a

If we get one value of t, then we have just "grazed" the ellipse. If we have two values of t, then we've intersected it fully. If we have no values of t, then we've missed it entirely. You can just check the discriminant (b2−4ac). If it's positive, you've intersected (two solutions). If it's zero, you've grazed (one solution). If it's negative, you've missed (no solutions).

Now once you've found solution(s) for t, you pick the smaller t and plug it in to the ray equation R(t)=E+tD to find the intersection point.

### Triangle Collisions

A triangle is defined by three points A, B, and C. Our goal is to determine if the intersection point I exits and find it if it does.

To do this, we need to find the normal (vector) of triangle ABC N by doing N=BA→×CA→ where BA→ and CA→ are vectors from B to A and C to A.

This vector N gives us a definition of the plane of triangle ABC: Nxx+Nyy+Nzz=d.

This gives us a test function for whether a point is on the surface of the triangle. That is, for all points S, we know N⋅S=d.

However, there's an issue! We don't know what d is. To find d, we take a known point on the triangle (one of the vertexes) and solve for d. Let's use the first vertex A. We find which we can write in vector form as d=N⋅A.

Now again like we did with ellipsoids, if you plug in the ray at time t R(t) as S into the previous equation and solve for t, you find the time at which the ray intersects the triangle. N⋅R(t)=d.

Solving for T gives us the following equation t=d−N⋅EN⋅D. Notice that if N⋅D=0, then the ray and the plane are parallel and there is no intersection. (Even if there are infinite intersections, we don't render them because that complicates the equation and we treat the triangle as infinitely thin.)

Now, to find I we plug in the solved for t (if it exists) into R(t).

Now that we have I, we need to determine if I is inside or outside the triangle. An easy way to do this is you know the point is on the inside of the triangle if and only if the point is on the same side of each edge. The way you know which side is by doing the following sign(N⋅(I−Vi×Vi+1−Vi)).

### Picking the Right Collisions

Now once you have all your collisions with all objects, you need to pick the first intersection you care about. You do this by picking the one with the smallest t which is greater than 1. We pick 1 because t=1 is when the ray intersects the view plane.

## Local Illumination

Local illumination is a method for determining the color a given ray should result in. We'll be discussing Phong shading and then Blinn-Phong shading.

Bui Tong Phong's illumination algorithm cares about 5 vectors when a ray hits the surface:

  • V (view): Vector from point to eye.
  • L (light): Vector from point to light.
  • N (normal): Vector normal to surface.
  • R (reflection): L reflected across the normal N.
    • We find R by finding the components of L which are parallel Lp and non-parallel Ln to N. We then define R=Lp−Ln.
  • H (half): Vector halfway between V and L (just take the average).

Note that we expect all these vectors to be unit vectors (i.e. normalized).

There are three terms of Phong's model:

  • Ambient Cambient (color): Shadows. Approximates indirect light. Light that lights up everything including shadows.
  • Diffuse Cdiffuse (directional): Matte lighting. Follows Lambert's Law. Simulates how brightness of light on a surface depends on angle between the surface and light source. This emulate how light "grazing" the surface doesn't light it up much (low density of photons) but light directly hitting a surface is brighter (high density of photons)
  • Specular Cspecular (highlights): Bright spot. Depends on angle between eye and light source. This emulates mirror-like reflections.

You add all these terms together to get the color: C=Cambient+Cdiffuse+Cspecular.

To find the ambient lighting Cambient, you need 2 (arbitrary) variables Ka and La. Ka is the percentage of light that you see comes from ambient light (normally 5-10%). La is the color of the light source. This gives us the equation Cambient=KaLa.

Note that this simulation of a single ambient light source is crude because the ambient light comes from somewhere so it's color will be affected.

To find the diffuse lighting Cdiffuse, you need the vectors N and L and 2 arbitrary variables Kd and Ld. Again Kd is the percentage of light you see which comes from diffuse light and La is the color of the diffuse light. This gives us the equation Cdiffuse=KdLdmax(N⋅L,0).

To find the specular lighting Cspecular, you need the vectors V and R along with an arbitrary integer n. As n get larger, the spot gets smaller as the light gets more focused. We know the light is a function of the angle between V and R, V⋅R, which has a bell-curve / bump shape. Phong ended up using this function (V⋅R)n. This function is arbitrary but works pretty well. We again have Ks as the percentage of light which comes from specular light and Ls which is the color of that light. This gives us the equation Cspecular=KsLs(N⋅L)n.

Combining all these lights we get C=Cambient+Cdiffuse+Cspecular =KaLa+KdLdmax(N⋅L,0)+KsLs(N⋅L)n.

James Blinn improved the specular lighting part of the Phong shading model, making it the Blinn-Phong shading model. He observed that specular lighting really occurs more when N and H are close together. That is because real life surfaces are rough and have tons of little micro-bumps/facets and H describes where they point on average with what we can see. Therefore, when N and H are close the micro-bumps/facets will almost perfectly reflect the specular light to our eyes. That is instead of the light being a function of the angle between V and R, it is the angle between N and h, that is N⋅H. This gives us a new equation for the specular color as Cspecular=KsLs(N⋅H)n.

Now in Blinn-Phong shading we get C=Cambient+Cdiffuse+Cspecular =KaLa+KdLdmax(N⋅L,0)+KsLs(N⋅H)n.

## Ray Tracing

We will incrementally build ray tracing up from ray casting.

The first step is to consider shadows. To determine if a point is in shadow, whenever you find a collision cast a ray from it to the light source(s). If that ray collides with anything, then don't include the diffuse or specular light from the Blinn-Phong model.

Note: The following math might not be right.

Now for reflections, you have to find the reflection ray Rreflection. We find R by finding the components of V (the vector from collision to the eye) which are parallel Vp and non-parallel −Vn to N and then define Rreflection=Vp−Vn. This simplifies to the following where R, N, and V are normalized to unit vectors. Rreflection=2(N⋅V)N−V

Now, to handle the reflections we have a new coefficient Kreflection and find Creflection by recursively finding the color of the reflected ray. We keep track of how many bounces we've done for each level of recursion and stop after some set number of maximum reflections Mreflection.

We handle refraction similarly to reflections except we do different math to find the refraction ray Rrefraction. The math here comes from Snell's Law, which we won't cover in this class. This again introducing another color and coefficient Krefraction and Crefraction like with reflection (and all other colors). We similarly keep track of each level of recursion and stop after some set number of maximum refractions Mrefraction.

One issue with ray tracing is it only considers specular reflections. That is when you have a crisp clear reflection. It doesn't consider diffuse reflections, that is "color bleeding" style reflections.

Also, ray tracing is computationally intensive. One way to improve performance is the split the world into cubes recursively. Before we check for collisions of objects in the box, we determine if the ray collides with the box at all. We have the boxes recursively so we can hone in on the collided box(es) similar to how binary search works.

# Rasterization

Rasterization is an alternative method of rendering objects to ray casting. It is (especially was) the most common method of rendering 3D objects because of how cheap and hardware friendly it is. Sadly, rasterization is more complicated to understand and harder to add shadows, reflections, and refractions.

One important difference of rasterization is that you will be doing full shading on every single object in the model because, when we're doing shading, we don't know yet which object is closest. This gets worse the more triangles/objects you have stacked up. That is the depth complexity of the scene.

So why is rasterization faster? It's (relatively) easy to cut out unnecessary pixels for each object's pass which can save huge amounts of work because most objects only show up in a tiny number of pixels.

We can also do deferred shading, where our first pass is just to solve occlusion (i.e. figure out which objects are in front), saving a bunch of information, and then we do shading with this information.

Given a pixel in a triangle, how do you interpolate the values at the coordinates? You first find out how far along you are along two of the edges. Once you have that, you can do bilerp as normal. Find the value on the edge of your point to your left and right. Then you find where you are between your left and right points and do the weighted sum again.

The naive way to do this, using world coordinates, is called affine bilinear interpolation and results in morphing and skewed textures. We can resolve this using perspective interpolation

For perspective interpolation, you need to

  1. Perform perspective divide to go to 3d: [s/wt/w].
  2. Append the denominator: [s/wt/w1/w].
  3. Perform bilerp to point p including the denominator: [s/wpt/wp1/wp].
  4. Undo the divide: [sptp].

Note: OpenGL/WebGL automatically does this for us.

## Rasterization in OpenGL/WebGL

Instead of logically looping over pixels and then objects (image-order), you iterate over all objects and then pixels (object-order). However, most graphics APIs (e.g. OpenGL) handle this iteration for you.

A vertex shader takes all the objects in your scene (whose vertexes are 3D points) and outputs coordinates those vertexes should appear on the screen. In OpenGL, this is programmable and must produce output into gl_Position.

With these now projected vertexes and an index array describing the triangles, the rasterizer chops the triangles into pieces called fragments. These fragments are the pixels which intersect with the triangle. In OpenGL, this is not programmable.

Now, the fragment shader must color the fragments produced by the rasterizer. In OpenGL, this is programmable and must produce output into gl_FragColor.

Now, the compositor combines these fragments. In OpenGL, this is not programmable but is configurable. For example, the compositor may do hidden surface removal by ignore/removing pixels behind the frontmost one. There may also be transparency where you instead take averages.

# OpenGL/WebGL

Khronos is the group which maintains OpenGL and WebGL. WebGL is an web-based implementation of OpenGL.

OpenGL was born as Iris GL, which was a proprietary API owned by Silicon Graphics. In the 90s however, they decided to make it an open specification.

WebGL 1.0 was a descendant of OpenGL ES 2.0. WebGL 2.0 was released in 2018 and is a descendant of OpenGL ES 3.0.

For OpenGL, you need to know GLSL (Graphics Language Shader Language). GLSL code is compiled and executed by the GPU.

Vulkan, aka OpenGL Next 5.0, is a lower-level rework of a lot of OpenGL for the purpose of being more cross-platform and having better performance.

Metal is a MacOS based API similar to Vulkan. It was developed before Vulkan. Mantle is that for AMD. Direct3D is that for Windows.

## Usage

The process for rendering in WebGL is

  • Set up WebGl.
  • Load model.
  • Process model.
  • Render result.

See these rendering primitives in WeblGL: https://developer.mozilla.org/en-US/docs/Web/API/WebGL_API/Constants#rendering_primitives

The vertex shader (programmed in GLSL) takes in attributes, per-vertex info like position and color; and uniforms, such as ambient light and perspective. It produces varyings, per-vertex values to be interpreted by fragment shader; gl_Position, the position of the vertex in clipping space; and gl_PointSize, the size of the point sprite.

The fragment shader takes in the varyings from the vertex shader and the same uniforms the vertex shader got. Then it outputs gl_FragColor, the color of the fragment which is used when only one render target is used; and gl_FragData[], fragment colors when multiple render targets are used.

How do we debug shaders? Keep them simple and correct, visualize debug values, possibly implement them in JavaScript. There's also some tools in the console. There's also an extension called WebGL insight.

OpenGL 2.0 removed matrix math. There's a useful library called glMatrix which re-implements the removed matrix code.

Here's a cheatsheet for WebGL 2.0: https://www.khronos.org/files/webgl20-reference-guide.pdf

# 3D Models

In this class, we prefer convex polygons because it makes it more simple to determine if we are inside the polygon or not.

We additional prefer to deal with triangles because they always define a plane. You can convert every polygon to triangles (i.e. triangulate the polygon) however.

If we have a complex surface, to convert it to a polygon we sample the surface at several points (at regular intervals) to define vertexes of the surface. We then connect the appropriate vertexes with edges to create the triangles.

After this, we have a minimally described 3D model. We often go further and add attributes to the model to describe its material(s) and how they reflect light.

We can also define vertex normals, which are normals pointing out from vertexes. These are included in attributes and are often used to shade the surface in a way to hide its facets / polygons.

# Transforms

We describe transforms of coordinates using matrixes. You can intuitively see how this works for rotation and scaling but it's not immediately clear how this works for translations.

The trick to make it work for translation is that we add an additional element to every vector, so we deal with vectors in R4 then our matrixes exist in R4×4 accordingly. These are called homogeneous coordinates.

A transformation matrix on homogeneous coordinates (R4×4) can intuitively be seen by a transformation matrix T with an offset vector o.

[⋮To⋮0001]

## Translation, Scaling, & Rotation

Let h be a homogeneous coordinate and define p to be the ordinary coordinate. This is specific to 3D ordinary coordinates, but a similar idea works in general. h=[xyzw]⟺p=[xwywzw]

Here's an example of a translation

[100X010Y001Z0001][xyz1]=[x+X⋅1y+Y⋅1z+Z⋅11]

Here's an example of a (one-dimensional) scaling [Sx0000Sy0000Sz00001][xyz1]=[x⋅Sxy⋅Syz⋅Sz1]

Here's an example of a rotation (around the x-axis) [10000cos⁡θ−sin⁡θ00sin⁡θcos⁡θ00001][xyz1]=[xcos⁡θ⋅y−sin⁡θ⋅zsin⁡θ⋅y+cos⁡θ⋅z1]

To compose transformations, we multiply their matrixes together. The rightmost one is applied first. The leftmost one is applied last.

All transformations are done relative to the origin. While this doesn't matter for translation, it does matter for rotation and scaling. To account for this, apply a translation to move one vertex to the origin, do your operation, and then apply the inverse translation to move that vertex back.

Composite rotations are confusing because earlier rotations changes the axis of rotation for future rotation. We can sidestep this issue by defining a rotation fully. That is, instead of composite rotations we define change of basis from one orthonormal basis to another. Intuitively, this is like applying a (complex) rotation to all 3 axes in unison.

To define a rotation around an axis, we change the basis of the current system so that the new y-axis is aligned with the rotation, then we apply a regular rotation about the y-axis, and finally apply the inverse change of basis, returning us to the original coordinate system.

Note: You can actually interpret all transformations as either changing the coordinate system or moving the object. It doesn't matter.

## Types of Transforms

  • Rigid Body: Translation or rotation. Preserves angles and lengths.
  • Affine: Rigid body or scale. Preserves parallelism.
  • Perspective: Does not preserve parallelism.

## Transforms & Normal Vectors

Just applying the transformations you make to a model's vectors to its normal vectors doesn't necessarily make sense. This works for uniform transformations, that is transformations which don't change the shape of the model. However, if you have something like a skew which modifies the shape of the object, then the normal vectors will be affected in weird ways.

Consider a rectangle which is made into a parallelogram by pushing the top to the right, that is the left and right side are skewed but the top and bottom remain parallel. If we were to apply this transformation to the normal vectors naively, then the normal vector of the top would become slanted but the normal vector of the right would remain unaffected. However, this is exactly what we don't want.

Suppose we have some model M with normals N and we want to apply transformation T to the model to get model M′ and normals N′. The math to do this is M′=TM N′=(TT)−1N.

This (TT)−1 is how we handle the issue of normals changing in unintuitive ways.

# Projections

Using the standard viewing coordinates of an eye at the origin looking towards positive z, the projection of a point p=[x,y,z] is

p=[xyz] phomogeneous=[xyz1] Tproj=[1000010000100010] proj(phomogeneous)=Tprojphomogeneous=[xyzz] proj(p)=[x/zy/z1]

Notice that we are dividing by z in proj(p). This is the essence of projection. Farther away objects become smaller.

The way we do projection is we take our arbitrary viewing setup / eye, described by a set of 3 (orthogonal basis) x, y, and z vectors and a position/offset o. This gives us a viewing transform V, which transforms our viewing setup to the origin and converts the basis vectors into the standard normal basis.

V=[⋮⋮⋮⋮xyzo⋮⋮⋮⋮0001]

In WebGL this is mat4.lookAt(...).

Then we have our standard projection matrix P.

P=[1000010000100010]

In WebGL this is mat4.perspective(...) or mat4.frustrum(...).

Thus we get our complete projection transformation T that takes our viewing setup and converts any world coordinates into projection coordinates T=PV.

We're almost done but not quite. Our window is currently from -1 to 1 in both xand y. To fix this, we have to apply the following transformation

[w/20ox1h/2oy001]

In WebGL this is gl.viewport(...).

Note: Every model is defined with its own arbitrary origin. So to not have all of these models overlap, we have to first transform the model coordinates to world coordinates using that model's specific offset. These are done in WebGL using the using the standard mat4.{translate,scale,rotate}(...).

This gives us a final pipeline of:

  1. Model Coordinates
  • Modeling Transform
  1. World Coordinates
  • Viewing Transform
  1. Viewing Coordinates
  • Projection Transform
  1. Normalized Device Coordinates
  • Viewport Transform
  1. Device Coordinates

## Parallel vs Perspective Projections

For certain aesthetic or functional reasons, you might need to choose between parallel and perspective projections.

In parallel/orthographic projections, the eye is a plane and all view vectors are parallel. In perpsective projections, the eye is a point and no view vectors are parallel.

Perspective projection approaches perspective projection as you get farther and farther away.

# Hardware & The Graphics Pipeline

In OpenGL 3, there were two programmable shaders: the vertex shader and fragment shader. They are run in that order.

In OpenGL 3, they added a geometry shader between the vertex and fragment shader. And they were run in that order. The geometry shader is often unused because it forced a specific ordering on your fragments which slows down performance. Although WebGL is based off of OpenGL 3, it does not have the geometry shader.

In OpenGL 4, a tessellation shader was added. It takes high level surface specifications (e.g. spline patches) and then convert them to triangles. This is used to reduce the number of data passed in.

One reason that GPUs are fast is because of pipeline parallelism. That is they split the many steps needed to do rendering into steps and then do those steps on different things at the same time, instead of waiting for one shape to make it through the entire pipeline before starting the new one.

One disadvantage of pipelining is that it is almost impossible to balance loads, there is significant bandwidth use from transferring data from piece to piece, and likewise there is significant start-up and shut-down costs. It also cannot do cull optimization, where we skip certain steps if we discover they're unnecessary.

There is another optimization called SIMD parallelism. It applies a Single operation/Instruction to Multiple pieces of Data without moving the data. It is good because you don't have to transfer data from place to place like in a pipeline. You also don't have to balance loads because there is only a single place doing the work. However, it fails if you have one piece of data that has to do different operation (e.g. one vertex has to be clipped but not all). It also struggles to broadcast data to every piece of data it's acting on.

NIMD parallelism is what happens when you use both.

There is another part of GPUs called the compute shader. They allow the GPU to be used for general purpose computing, that is things that are not specifically graphics, for example machine learning.

# Shading

Shading is the process of determining the color of a piece of a polygon, called a fragment (triangle).

For shockingly long, we had no hardware support for dealing with fragments and their shading. There was only vertex transformations, and eventually some support for vertex lighting.

There are many different shading methods.

The simplest shading method is called flat (i.e. per-triangle) shading. Each triangle has its own normal and that normal is used for every fragment's pixel in the fragment shader. This results in sharp facets/edges between triangles, which we don't want in general.

There's another method called Gouraud (i.e. per-vertex) shading. The idea is you calculate the shading at each vertex using the vertex normals and then interpolate colors. This results in smoother colors but with the facets/edges still somewhat visible.

How do we get the vertex normal? If we're tessellating a patch we might be lucky enough to be able to directly calculate the normals. Otherwise, we can take the average of all the surrounding face normals.

Yet another method is called Phong (i.e. per-fragment) shading. The idea is you use the normal vectors at the vertex and interpolate the 3 vertex normals of the triangle your in, at your position. This results in much smoother shading with no obvious facets/edges, much better than even Gouraud shading. This was the first shading technique where specular highlights really looked good. Note that you must always re-normalize your interpolated normal vector in order to ensure it is always a unit vector, otherwise they might end up too short and result in weird/dim lighting because of that.

Note: Unlike Gouraud shading, Phong shading wasn't possible to do interactively until decades after his death once hardware caught up. This should make sense because with Gouraud shading, you're calculating very few colors and just doing basic interpolation to get the colors of every fragment. However, with Phong you're not only performing all the normal calculations but also interpolating vectors and normalizing them.

Note: In practice, you only want either Phong shading, because it's so smooth, or flat shading, for the aesthetic. Gouraud shading is just a less smooth smooth shading algorithm than Phong shading.

## Smooth Objects vs Non-smooth Objects

Sometimes, the smooth shading models of Gouraud and Phong shading look terrible, for example with sharply angled shapes or shapes that are not supposed to be smooth. Since these models try to smooth out edges, they can look wrong or with sharply angled shapes, very weird. For example, with a cube those shading models will shade the cube almost as if it were a super low-poly sphere.

# Texturing / Texture Mapping

Texture mapping is the process of adding colors to models. In its simplest form, you are just wrapping some 2D image around a surface.

This process can be extended with alpha which allows parts of the model to be partially or fully transparent. Likewise it can be extended with bump mapping, which allows texture mapping affect lighting calculations. There are also the techniques of shadow mapping and relief mapping.

What makes texture mapping possible is having a mathematically well-defined coordinate system for the surface of a model.

For clarity, we call the pixels in the texture texels and use u-v coordinates rather than x-y coordinates. Then, each vertex on a model gets a set of u-v coordinates describing what part of the texture should be mapped to it. Then, in the fragment shader, you get the interpolated u-v coordinate of your triangle's vertexes.

## Getting u-v Coordinates

Where do we get these u-v coordinates? If you're using spline patches, you get those "for free" by just defining the u-v coordinates for the corners of your patch.

If you aren't doing that, we can do a 2-stage approach. First, you map the texture to a simple shape logically containing that object in its center. Then, you map that simple shapes texture onto the object. You want the simple shape to as closely match the object's shape as possible.

If your object or texture is more complicated such that a 2-stage approach won't work, you have to manually build up the texture mapping. There are tools and techniques to make this easier. For example, you can break the object's surface into chunks and texture the chunks. These chunks' textures may then be stored separately or packed into a single image.

## Applying Textures

Given a u-v coordinate, how do we look up the color? This seems simple but is surprisingly difficult because your coordinates are unlikely to line up perfectly with a texel. Additionally, in screen space we are looking at simple pixels (i.e. squares), but due to perspective projection these might actually be notably skewed in texture space.

There's broadly two ways this can arise: magnification and minification. Magnification is when the pixel is smaller than the texel and you have to expand the texture. Minification is when the pixel spans multiple texels.

### Magnification: Nearest Neighbor vs Linear Interpolation

The two common ways to handle magnification, that is when your pixel falls within a texel, is either using nearest neighbor or linear interpolation. For nearest neighbor, you just pick the closest texel and use it exactly. This tends to be very fast but often looks bad with sharp lines and aliasing. Linear interpolation means you interpolate the color of the pixel from the neighboring texels. This is slower but often yields smoother, more attractive textures. Note: For certain styles, like pixel-art or pixelated styles, you want to use nearest neighbor to get sharp colors.

In OpenGL, you can pick between these two methods with glTexParameteri(...) by choosing either GL_NEAREST or GL_LINEAR.

Note: Generally, magnification is somewhat unsolved. That is we can't zoom in infinitely. We're limited by the quality of our imagery / textures.

### Minification: Mipmapping

Note: It feels like minification might only happen at a distance where the objects themselves seem very small so of course the pixels cover many texels. However, it's important to realize that minification also occurs when looking at things side-long / almost tangent to the surface because then again

For minification, we have the opposite issue where we have several texels within a single pixel. This has the issue of sharp edges tend to either get lost or even worse become spotty, as only some of the pixels pick the edge texel or none of them pick it strongly. This can be fixed with mipmapping. MIP is short for multum in parvo (i.e. many in a small place).

Logically, mipmapping is the process of averaging the values of all the texels within the pixel. However, this is difficult to do in real time, so instead mipmapping has pre-computed scaled down versions of the texture (normally two times scaling at each level). Each of these scales has a d value which describes how much of the texture a single texel takes up. So it is 1/642 for a 64 by 64 texture.

Then, at runtime you determine your pixels size in texture space d as a proportion of the texture, pick the appropriate texture scale, and then use that texture as normal. (You don't need to exactly know your pixel size, just an approximation.)

How do you pick the appropriate texture scale? You want to match the size of your texels to that of your pixels. So if your pixel takes up 1/322 of the pixel, you want to use the 32 by 32 version of the texture.

Of course you almost never line up exactly with a given scale, so you have to do something to figure that out. For trilinear mipmapping, you need to look at the two values of d you're straddling. Then, you find the color of your pixel in those two levels and do linear interpolation of those colors using your value of d and the two levels values of d. This results in a much smoother image with severe aliasing. It does result in things fading at a distance.

You can still have smoother images with less aliasing without things fading by using anisotropic filtering. This means you don't average over as much of the texture which leads to images still being sharp far away. Basically, this is just a better approximation of the size of the pixel in texture space.

## Wrapping

What happens if our texture coordinates exit the 0 to 1 range? There are three main ways: repeating, mirroring, and clamping. These should hopefully be intuitive by name. For repeating, you do mod and cycle the texture. For mirroring you start going down in coordinates. For clamping you just take either 0 or 1 if you're outside of the range.

Normally you won't really want to use clamping if you're expecting the texture coordinates to go far beyond the range. However, repeating and mirroring often times look very repetitive or plain.

## Lighting & Multi-texturing

Normally we'll want to either modulate or replace the color. For modulate, we use the Blinn-Phong illumination using the color of the texture as the material. Or alternatively, multiply the color from the texture by the color of the fragment after illumination. For replace, we simply set the color to be that of the texture.

Note: We multiply the color rather than averaging. This results in a much more intuitive and attractive combination.

You can also overlay textures (often pre-computed light textures) to improve the quality. You do the same strategy here as you would for modulating the color using the Blinn-Phong lighting model, just the lighting gotten from a pre-computed texture. This is called light mapping.

# Hidden Surface Removal

With rasterization, you don't get occlusion for free. That is, by default with rasterization you render and display all objects no matter if something is blocking them or not and the "winning" object (i.e. the one actually displayed) is just the one rendered last. Hidden surface removal is the process of hiding or not displaying the parts of the image you cannot see.

## Back-face Culling

One way to do partial hidden surface removal is back-face culling. For this, you simply don't render triangles which are occluded. This has the benefit on cutting down on the number of objects rendered.

How do we determine if a triangle is back-facing, that is should be culled? The simplest way is to take the dot product of the view vector (from collision to eye) and the normal vector of the collision. If it's negative, then the triangle is back-facing.

How do we know the normal vector of the triangle? The model could tell us. Alternatively, we could choose a convention so that we can tell the facing by the order of the triangle's vertexes. Typically, we say a triangle is facing you if the vertexes are winding counterclockwise and is facing away from you if they're clockwise.

Back-face culling is not a full solution to hidden surface however. For one, this does assume that we never want to see the back faces of a model. This is true for closed models but not for open ones. Additionally, this does not work if we have have occluded front-faces. For example consider looking at a torus/donut from the side, both the inside and outside of the donut are facing us but we only want to see the outside.

## Painters Algorithm

The painters algorithm renders objects in order of depth, from farthest to closet by sorting all the triangles by view depth (i.e. distance from eye) first before rendering. This naturally means that the farthest objects will be overwritten/occluded by the closest objects as desired.

This has a problem for intersecting polygons or polygons where neither one is clearly in front of the others, for example with cyclic relationships, like with the lid on a cardboard box. Also, sorting every single frame is somewhat slow.

Then if you try to sort by pixel it's even harder.

## Z-buffering

The most common technique to do this is called z-buffering. This is mostly implemented in hardware at this point, which is why it's so fast and common.

Logically, every single fragment has a z value and those with the closest z value (past the near clipping plane) are picked as the winning fragment to be rendered.

Implementation wise, you add a depth buffer or z-buffer, alongside the frame buffer, which is initialized with max z. Then, for every fragment you take their z value zfrag and compare it to the current value in the z-buffer. If it is lower/closer (and past the near clipping plane), you put that fragment's color to the frame buffer and update the z buffer with your zfrag

Pros: Z-buffering is really fast (linear) and you can render triangles in any order.

Cons: You have issues if the depth is identical where the winning object will be chosen arbitrarily, called z-fighting (a modelling issue, easy to avoid). This is especially bad if you have low-resolution depth information (e.g. with very far away objects). It's also inefficient with high depth complexity because you're gonna spend a lot of time rendering objects that will never be shown. Z-buffering also doesn't work well with transparency (naively).

## Binary Space Partition (BSP) Tree Depth Sort

Logically, a BSP is a data structure that allows us to efficiently (O(n)) traverse in either far to near order (for hidden surface removal that respects alpha) or near to far order (to limit overdraw). We will show a method of constructing a BSP which is O(nlog⁡(n)). Note that a BSP is completely re-usable for any eye location in the set of objects.

To construct a binary space partition, choose an arbitrary polygon and make it the root. Then split the space into polygons in front of the root and those behind the root. If a polygon is on both sides then it must be split. The front is one side of the tree and the back is the other. Then you recurse to those subtrees.

Note: We can have heuristics that help us choose the root polygon to more evenly split the space to be more efficient. Tho sometimes bad partitions are inevitable. Consider for example a convex shape like a dodecahedron. No matter what face you choose, all of the faces are on the other side.

Also, notice that this doesn't work in the naive way of repeating cubes. This way is more efficient by respecting the geometry of the triangles.

To traverse a BSP, compare the eye to the root of the tree. Recurse towards the side nearer (or farther) the eye, output the current root polygon, and then recurse towards the side farther (or nearer) the eye.

Pros: Fast (O(n)) to traverse. Helps transparency and overdraw.

Cons: Slow (O(nlog⁡(n))) to construct tree. Doesn't work well with dynamic scenes. Also, poor choices of roots (e.g. creates lots of splits, doesn't evenly split the area) yield poor performance.

# Displays

A vector display has no pixels. Instead, you have a stateful drawing head which you move (either drawing or not) using vectors. These are also called random displays since you can draw the display in any order. These predate raster displays. A modern example of vector displays are EKGs, pen plotters, and CNC routers.

A raster display has a regular scan that go over a regular array of pixels. Although modern displays don't actually require a physical scan over their pixels, we still do it for backwards compatibility reasons. Raster displays have become the most common kind of display. Let's go over their pros and cons.

Pros:

  • Raster displays allow the display update speed to be different than the image update speed (i.e. refresh rate != frame rate). This means your display won't flicker when drawing complex things.
  • Raster displays are significantly faster than vector displays.
  • Raster displays can fill in shapes easily, while vector displays can really only draw wireframes.
  • Raster displays can have much more complex colors more easily. Vector displays struggle significantly to do color.

Cons:

  • Raster displays have significant aliasing, especially with large pixels.

However, there are alternatives to both vector and raster displays. Most alternatives focus on having lower latency than current displays, driven primarily by video conferencing and virtual reality.

Plasma displays were invented in the 60s and most popular in the 80s and 90s. Their main benefit is they allow for partial updates, where you can update only the parts of the screen that have updated, rather than having to stream all the pixels all the time. They can do this because the display itself "remembers" what was displayed. They fell out of favor because they suffered from severe burn in, were expensive, and were generally outclassed by cheaper LCD screens or higher quality OLED screens.

High dynamic range (HDR) displays are displays with a significantly larger range of brightness, normally 5e−4 to 1e5 cd/m2 instead of 5e−2 to 1e3 cd/m2 (i.e. 4 more orders of magnitude). These are becoming commercially available today.

Near-eye light field displays are displays which are meant to be comfortable up close. Currently, virtual reality displays are fairly bulky in part due to the large lenses that must go in front of the display for them to be comfortable to look at. However, with near-eye light field displays, you can have a display roughly 1cm thick right against your eye that is still comfortable to look at. Nvidia has been doing research on this in particular. These work by having a micro-lense array that cover a traditional OLED array that presents several views of an image from slightly different angles. When close to your eye, we perceive this as a single image.

Since the same image must be rendered from several different views, this complicates rendering and makes rasterization in particular difficult. It also significantly reduces the perceived spatial resolution because you're essentially getting a smaller screen to render onto.

However, this does solve the vergence-accommodation conflict issue that affects current VR. Vergence is about stereoscopy and accommodation is about having one object (of your choice) in focus. So the conflict is where we have stereoscopic information but cannot independently focus on objects in the scene. This messes with our brain's depth sensing machinery and can cause nausea or headaches in users of VR as well as inaccurate depth perception.

# Images

## Transparency

Normally, to describe colors we use red-green-blue (RGB). However, this can be enhanced with transparency into red-green-blue-alpha (RGBA).

Suppose you have some fragment in front of an already colored buffer. To find the new color given some transparency α, you do $$\text{color}\text{new} = \alpha\text{color}\text{new} + (1-\alpha)\text{color}_\text{buf}$$

Notice that with this formulation, order matters! This is good because it's also what we'd naturally want.

Suppose you have a blue buffer b with a red r and green g fragment both with α=0.5. If you put red first Cr, then you get a redder color. If you put green first Cg, then you get a greener color. Cr=0.5r+0.5(0.5g+0.5b)=0.5r+0.25g+0.25b Cg=0.5g+0.5(0.5r+0.5b)=0.5g+0.25r+0.25b

This complicates rasterization because then we must sort by depth. That is, first you render all the opaque triangles with z-buffering. Then, render the transparent triangles from back to front. While rendering the triangles, turn off z-write and render the frontmost triangles (i.e. not occluded) without updating the z-buffer values.

## Frame Buffer

Raster displays have a frame buffer which is the raw image data of the image on the display. (This normally exists on the GPU.) To put images onto the display, you have to write the image data to the frame buffer. The display then displays out the content of the frame buffer while it is scanning.

This is part of what enables raster displays to separate display refresh rate from frame (update) rate.

However, this has a flaw: screen tearing. When the frame buffer updates in the middle of a display refresh, there are multiple frames being displayed at the same time. This is unattractive, so we want some way to synchronize display updates with frame buffer updates.

### Double Buffering / Vsync

The simplest way to do this through something called double buffering or vsync. Here, you have two buffers: the front buffer and the back buffer. The display only reads from the front buffer while the GPU reads from the back buffer. Then, we do a buffer swap when the is done displaying the front buffer (a so called vertical sync or vsync), we swap the buffers.

This method has one main issue: delay / latency. Your GPU has to wait for the display to finish displaying the frame (a vsync) before rendering the next frame.

We can mitigate this by triple buffering. In fact, you could go on and on forever to attempt to reduce tearing! This results in smoother motion at expense of increased latency.

### G-Sync / FreeSync

Another newer way to solve this issue is by flipping the relationship. That is, the GPU tells the monitor when to do another scan rather than the monitor telling the GPU when to render another frame. This results in no screen tearing and also less latency than double-buffering.

This was initially developed by Nvidia under the name G-Sync but there is an open alternative called FreeSync which was initially developed by AMD.

## Stenciling

Stenciling is a technique of clipping renders to only be inside a certain area or stencil. This is most often useful for reflections in rasterization.

Suppose you are looking at an object over a large reflective disk. A common way to render the reflection is by reflecting your viewport across the reflection plane and rendering the object again.

However, naively this would result in the object being visible outside of just the reflective disk. If we add a stencil of the shape of the reflective disk in our eyesight and only render the reflection within that stencil, then we see the reflection as desired.

This works by having a stencil buffer that you write into and check before outputting/rendering the color.

\ No newline at end of file diff --git a/notes/ncsu/4f/csc492/index.html b/notes/ncsu/4f/csc492/index.html new file mode 100644 index 0000000..81eb52d --- /dev/null +++ b/notes/ncsu/4f/csc492/index.html @@ -0,0 +1 @@ +Eli | CSC 492: Senior Design

CSC 492: Senior Design

Instructor: Ms. Margaret Heil | Semester: Fall 2021

Table of Contents

# Testing

Your project is expected to include a test plan which is documented with your written reports and updated with your oral reports.

They expect the reports to have two types of testing: unit testing and acceptance testing. Unit tests are small and automated. Acceptance tests test the whole system so you compare against the requirements. They are often complex enough that they're difficult or not worth it to automate, but that's not always the case.

It is beneficial to draft your test plan when you're doing your requirements.

Make sure your acceptance test plan is specific, you should fully describe everything and make it so it's impossible for someone to reasonably do something other than you intend. Make sure you create a test data set for your acceptance tests to you use. Your test data should be (relatively) small and understandable.

In OPR 1 we should report on test plan, test design.

\ No newline at end of file diff --git a/notes/ncsu/4f/index.html b/notes/ncsu/4f/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/4f/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/ncsu/4f/ma426/index.html b/notes/ncsu/4f/ma426/index.html new file mode 100644 index 0000000..19d2b40 --- /dev/null +++ b/notes/ncsu/4f/ma426/index.html @@ -0,0 +1 @@ +Eli | MA 426: Mathematical Analysis II \ No newline at end of file diff --git a/notes/ncsu/4f/ma450/index.html b/notes/ncsu/4f/ma450/index.html new file mode 100644 index 0000000..5a4e85c --- /dev/null +++ b/notes/ncsu/4f/ma450/index.html @@ -0,0 +1 @@ +Eli | MA 450: Methods of Applied Mathematics I

MA 450: Methods of Applied Mathematics I

Instructor: Dr. Mansoor Haider | Semester: Fall 2021

Scanned PDF.

\ No newline at end of file diff --git a/notes/ncsu/index.html b/notes/ncsu/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/ncsu/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/talks/grad-apps/index.html b/notes/talks/grad-apps/index.html new file mode 100644 index 0000000..5d1b137 --- /dev/null +++ b/notes/talks/grad-apps/index.html @@ -0,0 +1 @@ +Eli | Preparing for Graduate School Applications

Preparing for Graduate School Applications

Speaker: Georgia Tech, Michigan, Northwestern, Ohio State, and Purdue | Date: 2021-10-14

Around January-March/April, try to visit campus!

Many universities normally have the final acceptance date as April 15th.

Do the leg work for finding teaching assistantships and research assistantships. It's not enough to just check the boxes.

Statement of purpose should vary based on the university. Talk about specific research that they are doing and perhaps even a specific professor. Talk about what you bring to the table. Speak about time as software team lead at aerial robotics club.

If you email a professor before you have an application or before you have even been accepted, you might be wasting your time. It's good to know the professors you want and do your research for your application because it looks good in your essays but a lot of professors don't really want to respond when someone hasn't even been accepted yet.

Give recommenders a "package". That is, tell them some information about what insight you want them to provide, what your goal is to do in grad school, and possibly even your resume or CV.

\ No newline at end of file diff --git a/notes/talks/index.html b/notes/talks/index.html new file mode 100644 index 0000000..1c7fbef --- /dev/null +++ b/notes/talks/index.html @@ -0,0 +1 @@ +Zola

Welcome to Zola!

You're seeing this page because we couldn't find a template to render.

To modify this page, create a section.html file in the templates directory or install a theme.
You can find what variables are available in this template in the documentation.

\ No newline at end of file diff --git a/notes/talks/notetaking/index.html b/notes/talks/notetaking/index.html new file mode 100644 index 0000000..dec4922 --- /dev/null +++ b/notes/talks/notetaking/index.html @@ -0,0 +1 @@ +Eli | Note-taking For the Things You Want to Remember Forever

Note-taking For the Things You Want to Remember Forever

Speaker: Dr. Sheehy | Date: 2021-09-24

Table of Contents

This lecture does not discuss class notes, paper notes, journaling. Instead, we're talking about notes for creating things and improving creativity.

The big picture is thinking about notetaking; the habits which inform the use of our notes; and the principles which inform our structure.

Here are names and misc things mentioned.

  • Tiago Forte's "Second Brain": System for taking notes.
  • Zettelkasten: Inspiration for Tiago Forte's "Second Brain". This was a physical system of notecards and links with notecards.
    • Andy Matuschak: English source for Zettelkasten.
    • Sönke Ahrens: Another writer.
  • Notational Velocity: Note taking app.
  • Atom Notes: Notational velocity for Atom.
  • Vim Notes: https://github.com/alok/notational-fzf-vim

Thinking About Notetaking

Think of brain as data structure where ...

  • Input: Reading, lectures.
  • Preprocessing: Note system.
  • Queries: Recall.
  • Application: Make something.

Think of yourself as three selfs: past self, current self, and future self.

You should think of future self in two ways: as a stranger and as yourself. As a stranger, you want to build the tools and take the notes to help a future you which has forgotten things. As yourself, you want to help yourself.

Aside: I enjoy writing notes like I'm talking to someone else because of this.

You can waste time even if you're doing something productive. For example, if you read something incredibly deep or learn a lot but don't take any notes. When you later forget that, your past self wasted your current self's time.

Habits

  • Atomic Notes: Every note should be small, focused, and standalone.
  • Start from Abundance: Takes lots of notes. Don't try to do a "heavy lift" where you do all the work at once. If you take lots of small notes, you can slowly build up to something large.
  • CODE: (From Tiago Forte)
    • C: Capture / Collect good ideas.
    • O: Organize information. We'll emphasize links of information.
    • D: Distill ideas. Think of as refactoring.
    • E: Express. Make stuff.
  • Play: Get comfortable exploring your notes and "having conversations with your past self".

Principles

  • Text files
  • Full text search
  • Easy to make and follow links
  • Fast note creation

A good bonus is having executable code.

\ No newline at end of file diff --git a/notes/talks/storing-sequences-in-searchable-form/index.html b/notes/talks/storing-sequences-in-searchable-form/index.html new file mode 100644 index 0000000..6866a81 --- /dev/null +++ b/notes/talks/storing-sequences-in-searchable-form/index.html @@ -0,0 +1 @@ +Eli | How to store massive sequence collections in a searchable form

How to store massive sequence collections in a searchable form

Speaker: Dominik Kempa | Date: 2020-03-11

Our goal is to compress sequential data in an (efficiently) searchable form.

The motivation is the Human Genome Project. It has produced 75 TiB of raw information but ~99% of all of that information is identical. Therefore traditional compression algorithms work extremely well, for example we can compress the raw data to about ~0.7 GiB with just zip. This form is not searchable.

There are other compression algorithms which are searchable however. You create an index and then compress that. This gives you a small searchable index.

Note: The compression indexes we'll be talking about only support full matches. Work is done on supporting any regular expression.

Index have the following properties:

  • Size: is how large the compressed algorithm is. Normally compressed indexes have size of O(c) or O(clog⁡n) where c is the compressed size.
  • Functionality: is what kind of searches the index can support. Normally either plain access (weak) or full search (powerful).
  • Query Time: is how long the search takes. Normally the runtime for these "fast" indexes are O(log⁡n) or O(log2⁡n).

There are two main approaches for building these kind of indexes. There is offline, which constructs some query-able data structure to disk. This takes a lot of CPU and time but supports faster querying in general. There is online which queries more directly.

There are three main lossless compression types:

  • Statistical coding
  • Lempel-Ziv
  • Burrows-Wheeler transform

We are the least interested in statistical coding because it lacks an interesting property (that I didn't write down).

Interesting, Lempel-Ziv and Burrows-Wheeler compression types are equivalent up to O(log⁡n) runtime scaling.

\ No newline at end of file diff --git a/projects/asteroids-3d/index.html b/projects/asteroids-3d/index.html new file mode 100644 index 0000000..dfdf408 --- /dev/null +++ b/projects/asteroids-3d/index.html @@ -0,0 +1 @@ +Eli | 3D Asteroids \ No newline at end of file diff --git a/projects/codie/example_discord.png b/projects/codie/example_discord.png new file mode 100644 index 0000000..1e1080b Binary files /dev/null and b/projects/codie/example_discord.png differ diff --git a/projects/codie/index.html b/projects/codie/index.html new file mode 100644 index 0000000..df603db --- /dev/null +++ b/projects/codie/index.html @@ -0,0 +1,11 @@ +Eli | Codie the Code Runner

Codie the Code Runner

Codie is a Discord bot I created for personal use within my friend groups to make sharing code-snippets with their output much easier to facilitate better conversations around code.

Why did I create Codie?

Before I made Codie, I often saw my friends and I sending snippets of code along with a screenshot or a copy of that code's output. This was frustrating both as someone sending code snippets because it involved opening separate apps and copy-pasting stuff and as someone reading code snippets because the snippets would be inconsistently formatted, sometimes as an image, sometimes as a code block, and sometimes as raw text.

So my idea was that if someone sends a message containing a normal fenced code block with a language annotation (Discord uses CommonMark-style language annotations) prefixed with some command (I used #!run), Codie would automatically run the code and reply with output of the program including stdout, stderr, and the exit status.

How does Codie work?

When you send a message for Codie to run, it looks something like this.

I can't believe this sorting algorithm works! #!run version=3.7 ```py
+def weirdsort(a):
+  for i in range(len(a)):
+    for j in range(len(a)):
+      if a[i] < a[j]:
+        a[i], a[j] = a[j], a[i]
+  return a
+
+print(weirdsort([5, 2, 3, 1, 4]))
+```
+

Aside: Check out Is this the simplest (and most surprising) sorting algorithm ever? for this sorting algorithm!

The first thing Codie does upon receiving a message like this (or really any message) is check if there is a #!run request, potentially with some options, followed by a fenced code block. And if there is, she extracts the language and the content from the code block and parses the options provided.

Without getting too deep into it, this is done using a regex to capture all the input from #!run to the code block, followed by a custom options subparser written with nom. We can get away with a regex to extract the code blocks because Discord only supports code blocks with exactly 3 backticks unlike CommonMark.

Once Codie has ensured the user has actually provided a valid run request with a language she recognizes and options she recognizes for that language, she matches this language and option pair with a Docker image, which she lazily builds if necessary.

The reason Codie uses Docker, beyond it being easy an easy way to set-up a wide variety of different language toolchains with different configurations, is for security.

Aside: Yes, I'm well aware that Docker isn't the most secure. See future work.

Codie tries her best to run all code she's given securely. This means code snippets should never be able to gain control, shutdown, or otherwise control the server that Codie is running on. But it also means that code snippets shouldn't be able to abuse the server's resources by running forever, slamming the server's network or CPU, or using resources in any other way that interferes with keeping the server online and healthy.

As such, the Docker containers Codie runs are locked down with no network access, a small amount of CPU time, a small amount of memory, and all code is run as the permission-less "nobody" user. Containers are also run with a 30 second timeout after which point they will be forcibly terminated and their resources cleaned up.

After the container finishes running or is terminated, Codie collects the stdout, stderr, and exit status of the code snippet using Docker logs and reports that to the user via a reply.

All put together, this is what sending the example message I used at the top actually looks like.

Actually Using Codie

Aside: You might have noticed both my message and Codie's message have been edited. Yes! Codie does support editing and re-running messages so you can fix typos or make other corrections.

Future Work

Currently, Codie is a private Discord bot that I only run on servers with my friends who I trust. In the future, I plan to make her publicly available. However, I am not confident in the security provided by Docker alone to run this publicly and will migrate to something like Firecracker before I make Codie publicly available.

\ No newline at end of file diff --git a/projects/dirbuf/graph1.svg b/projects/dirbuf/graph1.svg new file mode 100755 index 0000000..ef42e48 --- /dev/null +++ b/projects/dirbuf/graph1.svg @@ -0,0 +1,61 @@ + + +simple + + + +#3 + +#3 + + + +c + +c + + + +#3->c + + + + + +foo + +foo + + + +#3->foo + + + + + +#2 + +#2 + + + +b + +b + + + +#2->b + + + + + +#1 + +#1 + + + \ No newline at end of file diff --git a/projects/dirbuf/graph1a.svg b/projects/dirbuf/graph1a.svg new file mode 100755 index 0000000..d72192e --- /dev/null +++ b/projects/dirbuf/graph1a.svg @@ -0,0 +1,37 @@ + + +simple + + + +cₛ + +cₛ + + + +foo + +foo + + + +cₛ->foo + + + + + +bₛ + +bₛ + + + +a + +a + + + \ No newline at end of file diff --git a/projects/dirbuf/index.html b/projects/dirbuf/index.html new file mode 100644 index 0000000..37b98f1 --- /dev/null +++ b/projects/dirbuf/index.html @@ -0,0 +1,13 @@ +Eli | dirbuf.nvim

dirbuf.nvim

dirbuf.nvim is a file manager I created for Neovim. It was created with the idea of making creating, deleting, and moving files as easy as it is for text.

Why did I create dirbuf.nvim?

In 2020, every file manager plugin I could find used what I call a "command-style" of editing. That is if you want to create, copy, or delete a file, you have to press some specific keystroke, run a special command, or click a certain button to do that. In fact, every file manager I've seen uses this method except for vidir.

Side Note: I didn't actually learn about vidir until I had already implemented most of dirbuf.nvim and was researching dependency-resolution algorithms.

This method works and is fairly simple to implement, but I've encountered a number of issues with it: every plugin has a different set of mappings that often only loosely match default Vim keybindings, meaning you have to memorize more keybindings and remapping keys becomes more painful; input prompts often appear far from your cursor and the file your manipulating which results in a bumpier user experience; and you get a second-class editing experience where you can't use dot-repeating, macros, or other plugins to help you automate your change.

So my idea was that by creating a textual representation of a directory and handing that directly to the user to edit, you could get a for more native and intuitive experience. So creating a new line for a file would actually create a new file, renaming a directory on its line would actually rename the directory, and deleting a file's line would actually delete the file.

With this, you'd automatically work with whatever keybindings the users has, completely support any current and future text-editing plugins, and get one of the best batch renaming tools in the world with the full on-the-fly power of Neovim at your disposal.

How does dirbuf.nvim work?

From a user's perspective, dirbuf.nvim appears fairly simple. When you want to use dirbuf.nvim to make some changes, here's the sequence of events from your user-level perspective.

  1. You open a directory and get a text buffer containing a list of files, directories, symlinks, etc. in that directory.
  2. You make whatever edits you like to the directory buffer. Maybe you rename a few lines by editing their text, copy some others by copying their lines, delete a few few by deleting their lines, and make some new ones by creating new lines.
  3. You save the directory buffer to make your changes and then close the buffer.

By design, dirbuf.nvim is only active in steps 1 and 3. This is important because it means step 2, where all the edits happen, is a completely open box where the user can do whatever they want in any way they want, giving them the full power of Neovim and any plugins they have installed.

However, this means that whenever dirbuf.nvim wants to sync a directory buffer with the filesystem, it has to somehow figure out what changed between step 1 and step 3. So let's break down how dirbuf.nvim does this.

Step 1: Snapshotting & Displaying

In step 1, dirbuf.nvim scans the directory for filesystem entries. This gives us a list of what we call FStates, which are tables with a path, fname (the tail of the path), and an ftype ("file", "directory", "symlink", etc.).

dirbuf.nvim generates a unique id for each FState It then stores these FStates by their ID in a map. We use a map so we can easily lookup FStates in step 3. It then writes these FStates out to the directory buffer so the user can edit them.

So for example, given a file directory like this

.
+├── a
+├── b
+├── c
+└── d/
+

You get a directory buffer like this.

#00000001	a
+#00000002	b
+#00000003	c
+

Step 2: User Edits

Using our example from above, after several edits, the user ends up with the following directory buffer.

#00000002	b
+#00000003	c
+#00000003	foo
+bar/
+

We can see, after whatever edits the user did, the result is they deleted a, copied c to foo, deleted d/, and created bar.

Satisfied with these changes, they save the directory buffer or call :DirbufSync.

Step 3: Syncing

Now that the user has saved the directory buffer, dirbuf.nvim parses every line in the buffer into a FState. Any line with an ID is associated with the corresponding FState in the snapshot. Any line without an ID is considered a new entry.

This association or "linking" of parsed FStates with snapshotted FStates is a generalization of moving, copying, and deleting filesystem entries which allows dirbuf.nvim to figure out what the user "meant" by a series of changes. So if a snapshotted FState has no associated parsed FState, it's been deleted. If it has one linked FState, it's either been moved or left unchanged. And if it has multiple links, it's been either copied or copied and moved.

We can visualize these associations in the following diagram, using the earlier example with snapshotted FStates displayed by their ID. Note that we are intentionally leaving off the new entry of bar/.

Example FState Association Diagram

Dirbuf internally uses a data structure very similar to this FState association diagram called a change map. It makes a few tweaks to the FState association diagram to make it easier to convert to an efficient series of actions in future steps.

Namely, it doesn't store self-links, that is where we would associate an FState with itself, and instead sets stays flag to true, denoted here by subscript s. This prevents self-copies and allows us to easily identify cases where we can convert a copy to a move. The change map also identifies old entries by their filename rather than their ID, which makes dependent changes easier to identify.

Example Change Map

TODO: Discuss dependency resolution algorithm and future work

\ No newline at end of file diff --git a/projects/goofyglyphs/index.html b/projects/goofyglyphs/index.html new file mode 100644 index 0000000..e422f34 --- /dev/null +++ b/projects/goofyglyphs/index.html @@ -0,0 +1 @@ +Eli | Goofyglyphs (📜▶🤪)

Goofyglyphs (📜▶🤪)

Structure

Every clause in the emoji language follows the strict "Subject - Verb - Object/Destination" structure. Each part must be one emoji and all must be present for clause to be complete. Within a message, the same emoji refers to the same object/event; use identifiers to have multiple similar objects/events.

Example: I know you = "👈🧠👉".

You can also have exclamations, which are just a single emoji indicating the exclamation.

Example: It's raining = "🌧️".

Emoji Descriptors

Every emoji can have a description phrase associated with it. These phrases are placed after the emoji they describe and start with a single, special emoji indicating what kind descriptor it is.

  • ▶ (... ◀): Adjective phrase. This phrase contains a list of adjective-type emojis, followed by a ◀ to indicate the end of the adjective phrase. If you only have one adjective-type emoji, ◀ does not need to be specified.
    • Example: My dog ate a big round chicken = "🐕▶👈🍴🐔▶🆙⚪◀".
  • ⏩: Descriptive clause. Begins a new subject-verb-object clause which specifically describes the affected emoji.
    • Example: The dog, which I bought, makes me happy = "🐕⏩👈💳🐕😊👈"
  • 🚫: Negator. Negates emoji immediately following. This does not have any emojis in its descriptor phrase. "Not".
  • 0️⃣1️⃣2️⃣3️⃣4️⃣5️⃣6️⃣7️⃣8️⃣9️⃣🔟: Identifiers. Since emojis tend to refer to the same object/event, you can use identifiers to differentiate between similar objects/events.

The Substantive Emoji

The 🔼 emoji introduces a new subject-verb-object clause which itself acts where the 🔼 is placed.

  • Example: I wonder if fish swim like to sailboats (I'm thinking about whether fish swim similarly to boats) = "👈🤔🔼🏊▶🐟↔️❓🏊▶⛵"

Verb Modifiers

Verbs in particular can have modifiers. These modifiers are placed after the verb they affect, just like emoji descriptors.

  • ❓: Interrogator. Marks the verb-clause as a true-false question.
    • Example: "👉"
  • Tense Modifiers: These indicate the tense of the verb. If unspecified, then verbs are roughly present tense.
    • 🕘: Past. Something which did occur and has now finished.
      • Example: I used to want a meal = "👈🙏🕘🍽️"
    • 🕛: Present. Something which recently began occurring and is still occurring and will continue occurring.
      • Example: I currently want a meal = "👈🙏🕛🍽️"
    • 🕒: Future. Something which has not yet occurred but will later.
      • Example: I will want a meal = "👈🙏🕒🍽️"

Conjunctions

Conjunctions introduce new subject-verb-object clauses with a specific relation to the previous one.

  • ➕: Additional. The following clause exists in addition to the previous one. "And" or "But".
  • ➖: Optional. Either the following clause or the preceding clause are true, but not both. "Or" or "Either... Or".
  • ✖️: Causal. The following clause caused or motivated the earlier clause. "Because" or "Since".
  • ➗: Concessional. The following clause occurred in spite of the earlier one, explaining a reason the earlier one shouldn't have happened, can not follow a descriptive clause. "Although".

Vocabulary

Pronouns

  • 👈: 1st person.
  • 👉: 2nd person.
  • 👐: 3rd person.
  • 👇: Demonstrative pronoun (often followed by a descriptive clause), essentially can be used like a placeholder for a noun. This is essentially an unspecified object/event.

Common Vocabulary

  • ➡️: to be.
  • 🙏: to want/need/hope for; prayer.
  • ✊: to own/have; fist.
  • ✴️: to happen/occur; explosion.
  • 🗣️: to say/write/communicate; speaking/speech.
  • 🧠: to know/remember; knowledge/memory.

Changelog

  • 2022-04-05:
    • Changed ❓ from a clause modifier to a verb modifier. Removed clause modifier section.
    • Changed 👐 to from 1st person plural to 3rd person.
    • Add substantive emoji 🔼.
    • Change adjective phrase emoji from ➰ and ➿ to ▶️ and ◀️.
    • Change descriptive phrase emoji from 〰️ to ⏩.
  • 2021-12-26:
    • Changed descriptive clause emoji from 🔎 to 〰️.
    • Add adjective phrase ➰ (... ➿).
    • Classify descriptive clause emoji as emoji descriptor instead of a conjunction.
    • Remove integrator 🔗.
    • Add more examples and explain overall grammar more.
  • 2017: Initial version. History has since been lost since it was a Google Keep note on my phone for ~4 years.
\ No newline at end of file diff --git a/projects/index.html b/projects/index.html new file mode 100644 index 0000000..a400122 --- /dev/null +++ b/projects/index.html @@ -0,0 +1 @@ +Eli | Projects \ No newline at end of file diff --git a/projects/the-merp-experiment/index.html b/projects/the-merp-experiment/index.html new file mode 100644 index 0000000..b70919c --- /dev/null +++ b/projects/the-merp-experiment/index.html @@ -0,0 +1 @@ +Eli | The Merp Experiment \ No newline at end of file diff --git a/robots.txt b/robots.txt new file mode 100644 index 0000000..570de08 --- /dev/null +++ b/robots.txt @@ -0,0 +1,3 @@ +User-agent: * +Allow: / +Sitemap: https://elihunter173.com/sitemap.xml diff --git a/sitemap.xml b/sitemap.xml new file mode 100644 index 0000000..a5979e5 --- /dev/null +++ b/sitemap.xml @@ -0,0 +1,170 @@ + + + + https://elihunter173.com/ + + + https://elihunter173.com/blog/ + + + https://elihunter173.com/blog/interviewees-t-test/ + 2024-10-17 + + + https://elihunter173.com/blog/toothpaste-reviews-2020/ + 2020-09-07 + + + https://elihunter173.com/notes/ + + + https://elihunter173.com/notes/nand2tetris/ + + + https://elihunter173.com/notes/ncsu/ + + + https://elihunter173.com/notes/ncsu/1f/ + + + https://elihunter173.com/notes/ncsu/1f/csc116/ + + + https://elihunter173.com/notes/ncsu/1s/ + + + https://elihunter173.com/notes/ncsu/1s/csc216/ + + + https://elihunter173.com/notes/ncsu/1s/e102/ + + + https://elihunter173.com/notes/ncsu/1s/ma225/ + + + https://elihunter173.com/notes/ncsu/1s/ma242/ + + + https://elihunter173.com/notes/ncsu/1s/py205/ + + + https://elihunter173.com/notes/ncsu/2f/ + + + https://elihunter173.com/notes/ncsu/2f/csc230/ + + + https://elihunter173.com/notes/ncsu/2f/csc316/ + + + https://elihunter173.com/notes/ncsu/2f/py208/ + + + https://elihunter173.com/notes/ncsu/2f/soc202/ + + + https://elihunter173.com/notes/ncsu/2f/st370/ + + + https://elihunter173.com/notes/ncsu/2s/ + + + https://elihunter173.com/notes/ncsu/2s/csc236/ + + + https://elihunter173.com/notes/ncsu/2s/csc246/ + + + https://elihunter173.com/notes/ncsu/2s/csc333/ + + + https://elihunter173.com/notes/ncsu/2s/ma341/ + + + https://elihunter173.com/notes/ncsu/2s/ma405/ + + + https://elihunter173.com/notes/ncsu/3f/ + + + https://elihunter173.com/notes/ncsu/3f/csc326/ + + + https://elihunter173.com/notes/ncsu/3f/csc412/ + + + https://elihunter173.com/notes/ncsu/3f/ma407/ + + + https://elihunter173.com/notes/ncsu/3f/ma520/ + + + https://elihunter173.com/notes/ncsu/3f/st421/ + + + https://elihunter173.com/notes/ncsu/3s/ + + + https://elihunter173.com/notes/ncsu/3s/csc416/ + + + https://elihunter173.com/notes/ncsu/3s/csc591/ + + + https://elihunter173.com/notes/ncsu/3s/ma402/ + + + https://elihunter173.com/notes/ncsu/3s/ma425/ + + + https://elihunter173.com/notes/ncsu/4f/ + + + https://elihunter173.com/notes/ncsu/4f/csc379/ + + + https://elihunter173.com/notes/ncsu/4f/csc461/ + + + https://elihunter173.com/notes/ncsu/4f/csc492/ + + + https://elihunter173.com/notes/ncsu/4f/ma426/ + + + https://elihunter173.com/notes/ncsu/4f/ma450/ + + + https://elihunter173.com/notes/talks/ + + + https://elihunter173.com/notes/talks/grad-apps/ + 2021-10-14 + + + https://elihunter173.com/notes/talks/notetaking/ + 2021-09-24 + + + https://elihunter173.com/notes/talks/storing-sequences-in-searchable-form/ + 2020-03-11 + + + https://elihunter173.com/projects/ + + + https://elihunter173.com/projects/asteroids-3d/ + + + https://elihunter173.com/projects/codie/ + + + https://elihunter173.com/projects/dirbuf/ + + + https://elihunter173.com/projects/goofyglyphs/ + + + https://elihunter173.com/projects/the-merp-experiment/ + + diff --git a/styles.css b/styles.css new file mode 100644 index 0000000..8c734c3 --- /dev/null +++ b/styles.css @@ -0,0 +1 @@ +@import url("syntax-dark.css") (prefers-color-scheme: dark);@import url("syntax-light.css") (prefers-color-scheme: light);body{font-family:sans-serif;max-width:50rem;margin:0 auto 6rem;padding:0 1rem}img{max-width:100%}@media (prefers-color-scheme: dark){body{background-color:#121212;color:#fff}a{color:#58a6ff}a:visited{color:#cc76a4}a:active{color:#ff0000}}h1.title{font-size:2rem;margin-top:0.25rem;margin-bottom:0.5rem}pre{padding:0.5rem;outline:0.15rem solid;overflow-x:auto}code:not(pre *){padding:0.15em 0.3em;border-radius:4px}@media (prefers-color-scheme: light){code:not(pre *){background-color:rgba(175,184,193,0.2)}}@media (prefers-color-scheme: dark){code:not(pre *){background-color:rgba(94,100,110,0.4)}}table{display:block;max-width:100%;overflow-x:auto}table{border-collapse:collapse}th,td{border:1px solid;padding:0.25em}figure{text-align:center;margin:auto 0}figure figcaption{font-size:1.15rem;font-weight:bold}mjx-container[display="true"]{display:inline-grid;max-width:100%;overflow-x:auto;overflow-y:visible}nav{display:flex;align-items:baseline}nav ul{margin-left:auto;list-style:none}nav ul li{display:inline;margin-left:0.75em}video{width:100%} diff --git a/syntax-dark.css b/syntax-dark.css new file mode 100644 index 0000000..79f7045 --- /dev/null +++ b/syntax-dark.css @@ -0,0 +1,188 @@ +/* + * theme "gruvbox" generated by syntect + */ + +.z-code { + color: #fdf4c1; + background-color: #282828; +} + +.z-punctuation.z-definition.z-tag { + color: #83a598; +} +.z-punctuation.z-definition.z-entity { + color: #d3869b; +} +.z-constant { + color: #d3869b; +} +.z-constant.z-character.z-escape { + color: #b8bb26; +} +.z-constant.z-other { + color: #fdf4c1; +} +.z-entity { + color: #8ec07c; +} +.z-keyword.z-operator.z-comparison, .z-keyword.z-operator, .z-keyword.z-operator.z-symbolic, .z-keyword.z-operator.z-string, .z-keyword.z-operator.z-assignment, .z-keyword.z-operator.z-arithmetic, .z-keyword.z-operator.z-class, .z-keyword.z-operator.z-key, .z-keyword.z-operator.z-logical { + color: #fe8019; +} +.z-keyword, .z-keyword.z-operator.z-new, .z-keyword.z-other, .z-keyword.z-control { + color: #fa5c4b; +} +.z-storage { + color: #fa5c4b; +} +.z-string, .z-string.z-unquoted.z-heredoc .z-string { + color: #b8bb26; +} +.z-comment { + color: #928374; +font-style: italic; +} +.z-string.z-regexp .z-constant.z-character.z-escape { + color: #b8bb26; +} +.z-support { + color: #fabd2f; +} +.z-variable { + color: #fdf4c1; +} +.z-variable.z-language { + color: #fdf4c1; +} +.z-meta.z-function-call { + color: #fdf4c1; +} +.z-invalid { + color: #fdf4c1; + background-color: #932b1e; +} +.z-text .z-source, .z-string.z-unquoted.z-heredoc, .z-source .z-source { + color: #fdf4c1; +} +.z-string.z-quoted .z-source { + color: #b8bb26; +} +.z-string { + color: #b8bb26; +} +.z-support.z-constant { + color: #fabd2f; +} +.z-support.z-class { + color: #8ec07c; +} +.z-entity.z-name.z-tag { + color: #8ec07c; +font-weight: bold; +} +.z-meta.z-tag, .z-meta.z-tag .z-entity { + color: #8ec07c; +} +.z-constant.z-other.z-color.z-rgb-value { + color: #83a598; +} +.z-meta.z-selector.z-css .z-entity.z-name.z-tag { + color: #fa5c4b; +} +.z-meta.z-selector.z-css, .z-entity.z-other.z-attribute-name.z-id { + color: #b8bb26; +} +.z-meta.z-selector.z-css .z-entity.z-other.z-attribute-name.z-class { + color: #b8bb26; +} +.z-support.z-type.z-property-name.z-css { + color: #8ec07c; +} +.z-meta.z-preprocessor.z-at-rule .z-keyword.z-control.z-at-rule { + color: #fabd2f; +} +.z-meta.z-property-value .z-constant { + color: #fabd2f; +} +.z-meta.z-property-value .z-support.z-constant.z-named-color.z-css { + color: #fe8019; +} +.z-meta.z-constructor.z-argument.z-css { + color: #fabd2f; +} +.z-meta.z-diff, .z-meta.z-diff.z-header { + color: #83a598; +} +.z-markup.z-deleted { + color: #fa5c4b; +} +.z-markup.z-changed { + color: #fabd2f; +} +.z-markup.z-inserted { + color: #8ec07c; +} +.z-markup.z-bold { +font-weight: bold; +} +.z-markup.z-italic { +font-style: italic; +} +.z-markup.z-heading { + color: #8ec07c; +font-weight: bold; +} +.z-entity.z-name.z-type.z-class.z-php { + color: #8ec07c; +} +.z-keyword.z-other.z-phpdoc { + color: #928374; +} +.z-constant.z-numeric.z-css, .z-keyword.z-other.z-unit.z-css { + color: #d3869b; +} +.z-punctuation.z-definition.z-entity.z-css { + color: #b8bb26; +} +.z-variable.z-language.z-js { + color: #fabd2f; +} +.z-string.z-unquoted.z-label.z-js { + color: #fdf4c1; +} +.z-constant.z-other.z-table-name.z-sql { + color: #b8bb26; +} +.z-constant.z-other.z-database-name.z-sql { + color: #b8bb26; +} +.z-storage.z-type.z-dired.z-item.z-directory, .z-dired.z-item.z-directory { + color: #8ec07c; +} +.z-orgmode.z-link { + color: #fabd2f; +font-style: underline; +} +.z-orgmode.z-page { + color: #b8bb26; +} +.z-orgmode.z-break { + color: #d3869b; +} +.z-orgmode.z-headline { + color: #8ec07c; +} +.z-orgmode.z-tack { + color: #fabd2f; +} +.z-orgmode.z-follow_up { + color: #fabd2f; +} +.z-orgmode.z-checkbox { + color: #fabd2f; +} +.z-orgmode.z-checkbox.z-summary { + color: #fabd2f; +} +.z-orgmode.z-tags { + color: #fa5c4b; +} diff --git a/syntax-light.css b/syntax-light.css new file mode 100644 index 0000000..dfd37a8 --- /dev/null +++ b/syntax-light.css @@ -0,0 +1,192 @@ +/* + * theme "gruvbox" generated by syntect + */ + +.z-code { + color: #282828; + background-color: #fcf0ca; +} + +.z-punctuation.z-definition.z-tag { + color: #076678; +} +.z-punctuation.z-definition.z-entity { + color: #8f3f71; +} +.z-constant { + color: #8f3f71; +} +.z-constant.z-character.z-escape { + color: #79740e; +} +.z-constant.z-other { + color: #282828; +} +.z-entity { + color: #407959; +} +.z-keyword.z-operator.z-comparison, .z-keyword.z-operator, .z-keyword.z-operator.z-symbolic, .z-keyword.z-operator.z-string, .z-keyword.z-operator.z-assignment, .z-keyword.z-operator.z-arithmetic, .z-keyword.z-operator.z-class, .z-keyword.z-operator.z-key, .z-keyword.z-operator.z-logical { + color: #b23c15; +} +.z-keyword, .z-keyword.z-operator.z-new, .z-keyword.z-other, .z-keyword.z-control { + color: #9d0006; +} +.z-storage { + color: #9d0006; +} +.z-string, .z-string.z-unquoted.z-heredoc .z-string { + color: #79740e; +} +.z-comment { + color: #928374; +font-style: italic; +} +.z-string.z-regexp .z-constant.z-character.z-escape { + color: #79740e; +} +.z-support { + color: #b57614; +} +.z-variable { + color: #282828; +} +.z-variable.z-language { + color: #282828; +} +.z-meta.z-function-call { + color: #282828; +} +.z-invalid { + color: #282828; + background-color: #932b1e; +} +.z-text .z-source, .z-string.z-unquoted.z-heredoc, .z-source .z-source { + color: #282828; +} +.z-string.z-quoted .z-source { + color: #79740e; +} +.z-string { + color: #79740e; +} +.z-support.z-constant { + color: #b57614; +} +.z-support.z-class { + color: #407959; +} +.z-entity.z-name.z-tag { + color: #407959; +font-weight: bold; +} +.z-meta.z-tag, .z-meta.z-tag .z-entity { + color: #407959; +} +.z-constant.z-other.z-color.z-rgb-value { + color: #076678; +} +.z-meta.z-selector.z-css .z-entity.z-name.z-tag { + color: #9d0006; +} +.z-meta.z-selector.z-css, .z-entity.z-other.z-attribute-name.z-id { + color: #79740e; +} +.z-meta.z-selector.z-css .z-entity.z-other.z-attribute-name.z-class { + color: #79740e; +} +.z-support.z-type.z-property-name.z-css { + color: #407959; +} +.z-meta.z-preprocessor.z-at-rule .z-keyword.z-control.z-at-rule { + color: #b57614; +} +.z-meta.z-property-value .z-constant { + color: #b57614; +} +.z-meta.z-property-value .z-support.z-constant.z-named-color.z-css { + color: #b23c15; +} +.z-meta.z-constructor.z-argument.z-css { + color: #b57614; +} +.z-meta.z-diff, .z-meta.z-diff.z-header { + color: #282828; + background-color: #076678; +} +.z-markup.z-deleted { + color: #282828; + background-color: #9d0006; +} +.z-markup.z-changed { + color: #282828; + background-color: #b57614; +} +.z-markup.z-inserted { + color: #282828; + background-color: #407959; +} +.z-markup.z-bold { +font-weight: bold; +} +.z-markup.z-italic { +font-style: italic; +} +.z-markup.z-heading { + color: #407959; +font-weight: bold; +} +.z-entity.z-name.z-type.z-class.z-php { + color: #407959; +} +.z-keyword.z-other.z-phpdoc { + color: #928374; +} +.z-constant.z-numeric.z-css, .z-keyword.z-other.z-unit.z-css { + color: #8f3f71; +} +.z-punctuation.z-definition.z-entity.z-css { + color: #79740e; +} +.z-variable.z-language.z-js { + color: #b57614; +} +.z-string.z-unquoted.z-label.z-js { + color: #282828; +} +.z-constant.z-other.z-table-name.z-sql { + color: #79740e; +} +.z-constant.z-other.z-database-name.z-sql { + color: #79740e; +} +.z-storage.z-type.z-dired.z-item.z-directory, .z-dired.z-item.z-directory { + color: #407959; +} +.z-orgmode.z-link { + color: #b57614; +font-style: underline; +} +.z-orgmode.z-page { + color: #79740e; +} +.z-orgmode.z-break { + color: #8f3f71; +} +.z-orgmode.z-headline { + color: #407959; +} +.z-orgmode.z-tack { + color: #b57614; +} +.z-orgmode.z-follow_up { + color: #b57614; +} +.z-orgmode.z-checkbox { + color: #b57614; +} +.z-orgmode.z-checkbox.z-summary { + color: #b57614; +} +.z-orgmode.z-tags { + color: #9d0006; +} diff --git a/the-merp-experiment/assets/buildzone.png b/the-merp-experiment/assets/buildzone.png new file mode 100644 index 0000000..b70b773 Binary files /dev/null and b/the-merp-experiment/assets/buildzone.png differ diff --git a/the-merp-experiment/assets/factory.png b/the-merp-experiment/assets/factory.png new file mode 100644 index 0000000..62d54d3 Binary files /dev/null and b/the-merp-experiment/assets/factory.png differ diff --git a/the-merp-experiment/assets/gym.png b/the-merp-experiment/assets/gym.png new file mode 100644 index 0000000..1af64ef Binary files /dev/null and b/the-merp-experiment/assets/gym.png differ diff --git a/the-merp-experiment/assets/house.png b/the-merp-experiment/assets/house.png new file mode 100644 index 0000000..95d23a7 Binary files /dev/null and b/the-merp-experiment/assets/house.png differ diff --git a/the-merp-experiment/assets/merp.png b/the-merp-experiment/assets/merp.png new file mode 100644 index 0000000..2322cb0 Binary files /dev/null and b/the-merp-experiment/assets/merp.png differ diff --git a/the-merp-experiment/assets/pile.png b/the-merp-experiment/assets/pile.png new file mode 100644 index 0000000..728f389 Binary files /dev/null and b/the-merp-experiment/assets/pile.png differ diff --git a/the-merp-experiment/assets/road.png b/the-merp-experiment/assets/road.png new file mode 100644 index 0000000..b215ef7 Binary files /dev/null and b/the-merp-experiment/assets/road.png differ diff --git a/the-merp-experiment/assets/road_2way_atlas.png b/the-merp-experiment/assets/road_2way_atlas.png new file mode 100644 index 0000000..0b9494c Binary files /dev/null and b/the-merp-experiment/assets/road_2way_atlas.png differ diff --git a/the-merp-experiment/assets/road_one_way.png b/the-merp-experiment/assets/road_one_way.png new file mode 100644 index 0000000..0f99145 Binary files /dev/null and b/the-merp-experiment/assets/road_one_way.png differ diff --git a/the-merp-experiment/game.js b/the-merp-experiment/game.js new file mode 100644 index 0000000..28491fd --- /dev/null +++ b/the-merp-experiment/game.js @@ -0,0 +1,1941 @@ +const lAudioContext = (typeof AudioContext !== 'undefined' ? AudioContext : (typeof webkitAudioContext !== 'undefined' ? webkitAudioContext : undefined)); +let wasm; + +const heap = new Array(128).fill(undefined); + +heap.push(undefined, null, true, false); + +function getObject(idx) { return heap[idx]; } + +let heap_next = heap.length; + +function dropObject(idx) { + if (idx < 132) return; + heap[idx] = heap_next; + heap_next = idx; +} + +function takeObject(idx) { + const ret = getObject(idx); + dropObject(idx); + return ret; +} + +function addHeapObject(obj) { + if (heap_next === heap.length) heap.push(heap.length + 1); + const idx = heap_next; + heap_next = heap[idx]; + + heap[idx] = obj; + return idx; +} + +const cachedTextDecoder = (typeof TextDecoder !== 'undefined' ? new TextDecoder('utf-8', { ignoreBOM: true, fatal: true }) : { decode: () => { throw Error('TextDecoder not available') } } ); + +if (typeof TextDecoder !== 'undefined') { cachedTextDecoder.decode(); }; + +let cachedUint8Memory0 = null; + +function getUint8Memory0() { + if (cachedUint8Memory0 === null || cachedUint8Memory0.byteLength === 0) { + cachedUint8Memory0 = new Uint8Array(wasm.memory.buffer); + } + return cachedUint8Memory0; +} + +function getStringFromWasm0(ptr, len) { + ptr = ptr >>> 0; + return cachedTextDecoder.decode(getUint8Memory0().subarray(ptr, ptr + len)); +} + +function isLikeNone(x) { + return x === undefined || x === null; +} + +let cachedFloat64Memory0 = null; + +function getFloat64Memory0() { + if (cachedFloat64Memory0 === null || cachedFloat64Memory0.byteLength === 0) { + cachedFloat64Memory0 = new Float64Array(wasm.memory.buffer); + } + return cachedFloat64Memory0; +} + +let cachedInt32Memory0 = null; + +function getInt32Memory0() { + if (cachedInt32Memory0 === null || cachedInt32Memory0.byteLength === 0) { + cachedInt32Memory0 = new Int32Array(wasm.memory.buffer); + } + return cachedInt32Memory0; +} + +let WASM_VECTOR_LEN = 0; + +const cachedTextEncoder = (typeof TextEncoder !== 'undefined' ? new TextEncoder('utf-8') : { encode: () => { throw Error('TextEncoder not available') } } ); + +const encodeString = (typeof cachedTextEncoder.encodeInto === 'function' + ? function (arg, view) { + return cachedTextEncoder.encodeInto(arg, view); +} + : function (arg, view) { + const buf = cachedTextEncoder.encode(arg); + view.set(buf); + return { + read: arg.length, + written: buf.length + }; +}); + +function passStringToWasm0(arg, malloc, realloc) { + + if (realloc === undefined) { + const buf = cachedTextEncoder.encode(arg); + const ptr = malloc(buf.length, 1) >>> 0; + getUint8Memory0().subarray(ptr, ptr + buf.length).set(buf); + WASM_VECTOR_LEN = buf.length; + return ptr; + } + + let len = arg.length; + let ptr = malloc(len, 1) >>> 0; + + const mem = getUint8Memory0(); + + let offset = 0; + + for (; offset < len; offset++) { + const code = arg.charCodeAt(offset); + if (code > 0x7F) break; + mem[ptr + offset] = code; + } + + if (offset !== len) { + if (offset !== 0) { + arg = arg.slice(offset); + } + ptr = realloc(ptr, len, len = offset + arg.length * 3, 1) >>> 0; + const view = getUint8Memory0().subarray(ptr + offset, ptr + len); + const ret = encodeString(arg, view); + + offset += ret.written; + } + + WASM_VECTOR_LEN = offset; + return ptr; +} + +function debugString(val) { + // primitive types + const type = typeof val; + if (type == 'number' || type == 'boolean' || val == null) { + return `${val}`; + } + if (type == 'string') { + return `"${val}"`; + } + if (type == 'symbol') { + const description = val.description; + if (description == null) { + return 'Symbol'; + } else { + return `Symbol(${description})`; + } + } + if (type == 'function') { + const name = val.name; + if (typeof name == 'string' && name.length > 0) { + return `Function(${name})`; + } else { + return 'Function'; + } + } + // objects + if (Array.isArray(val)) { + const length = val.length; + let debug = '['; + if (length > 0) { + debug += debugString(val[0]); + } + for(let i = 1; i < length; i++) { + debug += ', ' + debugString(val[i]); + } + debug += ']'; + return debug; + } + // Test for built-in + const builtInMatches = /\[object ([^\]]+)\]/.exec(toString.call(val)); + let className; + if (builtInMatches.length > 1) { + className = builtInMatches[1]; + } else { + // Failed to match the standard '[object ClassName]' + return toString.call(val); + } + if (className == 'Object') { + // we're a user defined class or Object + // JSON.stringify avoids problems with cycles, and is generally much + // easier than looping through ownProperties of `val`. + try { + return 'Object(' + JSON.stringify(val) + ')'; + } catch (_) { + return 'Object'; + } + } + // errors + if (val instanceof Error) { + return `${val.name}: ${val.message}\n${val.stack}`; + } + // TODO we could test for more things here, like `Set`s and `Map`s. + return className; +} + +function makeMutClosure(arg0, arg1, dtor, f) { + const state = { a: arg0, b: arg1, cnt: 1, dtor }; + const real = (...args) => { + // First up with a closure we increment the internal reference + // count. This ensures that the Rust closure environment won't + // be deallocated while we're invoking it. + state.cnt++; + const a = state.a; + state.a = 0; + try { + return f(a, state.b, ...args); + } finally { + if (--state.cnt === 0) { + wasm.__wbindgen_export_2.get(state.dtor)(a, state.b); + + } else { + state.a = a; + } + } + }; + real.original = state; + + return real; +} +function __wbg_adapter_34(arg0, arg1) { + wasm._dyn_core__ops__function__FnMut_____Output___R_as_wasm_bindgen__closure__WasmClosure___describe__invoke__h574b8bde9eb27d24(arg0, arg1); +} + +function __wbg_adapter_37(arg0, arg1, arg2) { + wasm._dyn_core__ops__function__FnMut__A____Output___R_as_wasm_bindgen__closure__WasmClosure___describe__invoke__h355f9fc06797d336(arg0, arg1, addHeapObject(arg2)); +} + +function __wbg_adapter_52(arg0, arg1) { + wasm._dyn_core__ops__function__FnMut_____Output___R_as_wasm_bindgen__closure__WasmClosure___describe__invoke__h444aca3444dce197(arg0, arg1); +} + +function __wbg_adapter_55(arg0, arg1, arg2) { + wasm._dyn_core__ops__function__FnMut__A____Output___R_as_wasm_bindgen__closure__WasmClosure___describe__invoke__h9eebc0e84eded97e(arg0, arg1, addHeapObject(arg2)); +} + +function __wbg_adapter_58(arg0, arg1, arg2) { + wasm._dyn_core__ops__function__FnMut__A____Output___R_as_wasm_bindgen__closure__WasmClosure___describe__invoke__h84b111d3460d60c9(arg0, arg1, addHeapObject(arg2)); +} + +function handleError(f, args) { + try { + return f.apply(this, args); + } catch (e) { + wasm.__wbindgen_exn_store(addHeapObject(e)); + } +} + +let cachedFloat32Memory0 = null; + +function getFloat32Memory0() { + if (cachedFloat32Memory0 === null || cachedFloat32Memory0.byteLength === 0) { + cachedFloat32Memory0 = new Float32Array(wasm.memory.buffer); + } + return cachedFloat32Memory0; +} + +function getArrayF32FromWasm0(ptr, len) { + ptr = ptr >>> 0; + return getFloat32Memory0().subarray(ptr / 4, ptr / 4 + len); +} + +function getArrayI32FromWasm0(ptr, len) { + ptr = ptr >>> 0; + return getInt32Memory0().subarray(ptr / 4, ptr / 4 + len); +} + +let cachedUint32Memory0 = null; + +function getUint32Memory0() { + if (cachedUint32Memory0 === null || cachedUint32Memory0.byteLength === 0) { + cachedUint32Memory0 = new Uint32Array(wasm.memory.buffer); + } + return cachedUint32Memory0; +} + +function getArrayU32FromWasm0(ptr, len) { + ptr = ptr >>> 0; + return getUint32Memory0().subarray(ptr / 4, ptr / 4 + len); +} + +async function __wbg_load(module, imports) { + if (typeof Response === 'function' && module instanceof Response) { + if (typeof WebAssembly.instantiateStreaming === 'function') { + try { + return await WebAssembly.instantiateStreaming(module, imports); + + } catch (e) { + if (module.headers.get('Content-Type') != 'application/wasm') { + console.warn("`WebAssembly.instantiateStreaming` failed because your server does not serve wasm with `application/wasm` MIME type. Falling back to `WebAssembly.instantiate` which is slower. Original error:\n", e); + + } else { + throw e; + } + } + } + + const bytes = await module.arrayBuffer(); + return await WebAssembly.instantiate(bytes, imports); + + } else { + const instance = await WebAssembly.instantiate(module, imports); + + if (instance instanceof WebAssembly.Instance) { + return { instance, module }; + + } else { + return instance; + } + } +} + +function __wbg_get_imports() { + const imports = {}; + imports.wbg = {}; + imports.wbg.__wbindgen_cb_drop = function(arg0) { + const obj = takeObject(arg0).original; + if (obj.cnt-- == 1) { + obj.a = 0; + return true; + } + const ret = false; + return ret; + }; + imports.wbg.__wbindgen_object_drop_ref = function(arg0) { + takeObject(arg0); + }; + imports.wbg.__wbg_stringify_e1b19966d964d242 = function() { return handleError(function (arg0) { + const ret = JSON.stringify(getObject(arg0)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_fetch_1f9eb1a6c5433fb7 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).fetch(getStringFromWasm0(arg1, arg2)); + return addHeapObject(ret); + }; + imports.wbg.__wbg_instanceof_Response_4c3b1446206114d1 = function(arg0) { + let result; + try { + result = getObject(arg0) instanceof Response; + } catch (_) { + result = false; + } + const ret = result; + return ret; + }; + imports.wbg.__wbg_status_d6d47ad2837621eb = function(arg0) { + const ret = getObject(arg0).status; + return ret; + }; + imports.wbg.__wbg_arrayBuffer_5b2688e3dd873fed = function() { return handleError(function (arg0) { + const ret = getObject(arg0).arrayBuffer(); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_new_8f67e318f15d7254 = function(arg0) { + const ret = new Uint8Array(getObject(arg0)); + return addHeapObject(ret); + }; + imports.wbg.__wbg_mark_40e050a77cc39fea = function(arg0, arg1) { + performance.mark(getStringFromWasm0(arg0, arg1)); + }; + imports.wbg.__wbg_log_c9486ca5d8e2cbe8 = function(arg0, arg1) { + let deferred0_0; + let deferred0_1; + try { + deferred0_0 = arg0; + deferred0_1 = arg1; + console.log(getStringFromWasm0(arg0, arg1)); + } finally { + wasm.__wbindgen_free(deferred0_0, deferred0_1, 1); + } + }; + imports.wbg.__wbg_log_aba5996d9bde071f = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7) { + let deferred0_0; + let deferred0_1; + try { + deferred0_0 = arg0; + deferred0_1 = arg1; + console.log(getStringFromWasm0(arg0, arg1), getStringFromWasm0(arg2, arg3), getStringFromWasm0(arg4, arg5), getStringFromWasm0(arg6, arg7)); + } finally { + wasm.__wbindgen_free(deferred0_0, deferred0_1, 1); + } + }; + imports.wbg.__wbg_width_cfc58d9656d60465 = function(arg0) { + const ret = getObject(arg0).width; + return ret; + }; + imports.wbg.__wbg_height_1ba9072bd4001d19 = function(arg0) { + const ret = getObject(arg0).height; + return ret; + }; + imports.wbg.__wbg_matchMedia_7fbd33cb577fe4ad = function() { return handleError(function (arg0, arg1, arg2) { + const ret = getObject(arg0).matchMedia(getStringFromWasm0(arg1, arg2)); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_matches_4cc0ff05af669dc3 = function(arg0) { + const ret = getObject(arg0).matches; + return ret; + }; + imports.wbg.__wbg_document_d609202d16c38224 = function(arg0) { + const ret = getObject(arg0).document; + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_querySelector_c72dce5ac4b6bc3e = function() { return handleError(function (arg0, arg1, arg2) { + const ret = getObject(arg0).querySelector(getStringFromWasm0(arg1, arg2)); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_instanceof_HtmlCanvasElement_fba0ac991170cc00 = function(arg0) { + let result; + try { + result = getObject(arg0) instanceof HTMLCanvasElement; + } catch (_) { + result = false; + } + const ret = result; + return ret; + }; + imports.wbg.__wbg_body_64abc9aba1891e91 = function(arg0) { + const ret = getObject(arg0).body; + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_appendChild_d30e6b83791d04c0 = function() { return handleError(function (arg0, arg1) { + const ret = getObject(arg0).appendChild(getObject(arg1)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_addEventListener_9bf60ea8a362e5e4 = function() { return handleError(function (arg0, arg1, arg2, arg3) { + getObject(arg0).addEventListener(getStringFromWasm0(arg1, arg2), getObject(arg3)); + }, arguments) }; + imports.wbg.__wbg_parentElement_72e144c2e8d9e0b5 = function(arg0) { + const ret = getObject(arg0).parentElement; + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_getBoundingClientRect_4167ccfa40cf88fc = function(arg0) { + const ret = getObject(arg0).getBoundingClientRect(); + return addHeapObject(ret); + }; + imports.wbg.__wbg_width_1ccae8ab185a4192 = function(arg0) { + const ret = getObject(arg0).width; + return ret; + }; + imports.wbg.__wbg_height_415b4e67932f43c9 = function(arg0) { + const ret = getObject(arg0).height; + return ret; + }; + imports.wbg.__wbg_requestAnimationFrame_74309aadebde12fa = function() { return handleError(function (arg0, arg1) { + const ret = getObject(arg0).requestAnimationFrame(getObject(arg1)); + return ret; + }, arguments) }; + imports.wbg.__wbg_setTimeout_06458eba2b40711c = function() { return handleError(function (arg0, arg1, arg2) { + const ret = getObject(arg0).setTimeout(getObject(arg1), arg2); + return ret; + }, arguments) }; + imports.wbg.__wbg_stopPropagation_b7a931152e09c2ab = function(arg0) { + getObject(arg0).stopPropagation(); + }; + imports.wbg.__wbg_cancelBubble_976cfdf7ac449a6c = function(arg0) { + const ret = getObject(arg0).cancelBubble; + return ret; + }; + imports.wbg.__wbg_matches_9502c0f8ac0be969 = function(arg0) { + const ret = getObject(arg0).matches; + return ret; + }; + imports.wbg.__wbg_preventDefault_7f821f72e7c6b5d4 = function(arg0) { + getObject(arg0).preventDefault(); + }; + imports.wbg.__wbindgen_object_clone_ref = function(arg0) { + const ret = getObject(arg0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_new_9fb8d994e1c0aaac = function() { + const ret = new Object(); + return addHeapObject(ret); + }; + imports.wbg.__wbg_target_52ddf6955f636bf5 = function(arg0) { + const ret = getObject(arg0).target; + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_is_ff7acd231c75c0e4 = function(arg0, arg1) { + const ret = Object.is(getObject(arg0), getObject(arg1)); + return ret; + }; + imports.wbg.__wbg_offsetX_e8c2e5379a90ae29 = function(arg0) { + const ret = getObject(arg0).offsetX; + return ret; + }; + imports.wbg.__wbg_offsetY_b8587366f6d36a25 = function(arg0) { + const ret = getObject(arg0).offsetY; + return ret; + }; + imports.wbg.__wbg_movementX_0a37286f5ab0f3d1 = function(arg0) { + const ret = getObject(arg0).movementX; + return ret; + }; + imports.wbg.__wbg_movementY_e32c630fded47131 = function(arg0) { + const ret = getObject(arg0).movementY; + return ret; + }; + imports.wbg.__wbg_requestFullscreen_3c582ffcaaffe1fd = function() { return handleError(function (arg0) { + getObject(arg0).requestFullscreen(); + }, arguments) }; + imports.wbg.__wbg_buttons_45faa2de9fb9d23b = function(arg0) { + const ret = getObject(arg0).buttons; + return ret; + }; + imports.wbg.__wbg_keyCode_48fe24f81bbcf215 = function(arg0) { + const ret = getObject(arg0).keyCode; + return ret; + }; + imports.wbg.__wbg_charCode_702eeeb047f6dad2 = function(arg0) { + const ret = getObject(arg0).charCode; + return ret; + }; + imports.wbg.__wbg_pointerType_07ad77393049c448 = function(arg0, arg1) { + const ret = getObject(arg1).pointerType; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_pointerId_32f8345c9e0f0ed8 = function(arg0) { + const ret = getObject(arg0).pointerId; + return ret; + }; + imports.wbg.__wbg_key_cf8022c18f47869e = function(arg0, arg1) { + const ret = getObject(arg1).key; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_ctrlKey_977280484bcead08 = function(arg0) { + const ret = getObject(arg0).ctrlKey; + return ret; + }; + imports.wbg.__wbg_altKey_bf16cace6fb79198 = function(arg0) { + const ret = getObject(arg0).altKey; + return ret; + }; + imports.wbg.__wbg_getModifierState_bdeffc8dda44d6dd = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getModifierState(getStringFromWasm0(arg1, arg2)); + return ret; + }; + imports.wbg.__wbg_clientX_1a01963cb1caa614 = function(arg0) { + const ret = getObject(arg0).clientX; + return ret; + }; + imports.wbg.__wbg_clientY_c370190d4150fba9 = function(arg0) { + const ret = getObject(arg0).clientY; + return ret; + }; + imports.wbg.__wbg_pressure_b9f7c7decc59eb11 = function(arg0) { + const ret = getObject(arg0).pressure; + return ret; + }; + imports.wbg.__wbg_setPointerCapture_ba1b525b85454761 = function() { return handleError(function (arg0, arg1) { + getObject(arg0).setPointerCapture(arg1); + }, arguments) }; + imports.wbg.__wbg_removeEventListener_70ee8cc1640c97d7 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).removeEventListener(getStringFromWasm0(arg1, arg2), getObject(arg3), getObject(arg4)); + }, arguments) }; + imports.wbg.__wbindgen_string_new = function(arg0, arg1) { + const ret = getStringFromWasm0(arg0, arg1); + return addHeapObject(ret); + }; + imports.wbg.__wbg_error_cd2ee9c1f33e07e2 = function(arg0, arg1) { + console.error(getObject(arg0), getObject(arg1)); + }; + imports.wbg.__wbg_addEventListener_374cbfd2bbc19ccf = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).addEventListener(getStringFromWasm0(arg1, arg2), getObject(arg3), getObject(arg4)); + }, arguments) }; + imports.wbg.__wbg_new_abda76e883ba8a5f = function() { + const ret = new Error(); + return addHeapObject(ret); + }; + imports.wbg.__wbg_stack_658279fe44541cf6 = function(arg0, arg1) { + const ret = getObject(arg1).stack; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_error_f851667af71bcfc6 = function(arg0, arg1) { + let deferred0_0; + let deferred0_1; + try { + deferred0_0 = arg0; + deferred0_1 = arg1; + console.error(getStringFromWasm0(arg0, arg1)); + } finally { + wasm.__wbindgen_free(deferred0_0, deferred0_1, 1); + } + }; + imports.wbg.__wbg_resume_61e2f63e5d5444cd = function() { return handleError(function (arg0) { + const ret = getObject(arg0).resume(); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_close_b87bff143de234d5 = function() { return handleError(function (arg0) { + const ret = getObject(arg0).close(); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_eval_0b93354704a20351 = function() { return handleError(function (arg0, arg1) { + const ret = eval(getStringFromWasm0(arg0, arg1)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbindgen_boolean_get = function(arg0) { + const v = getObject(arg0); + const ret = typeof(v) === 'boolean' ? (v ? 1 : 0) : 2; + return ret; + }; + imports.wbg.__wbg_crypto_58f13aa23ffcb166 = function(arg0) { + const ret = getObject(arg0).crypto; + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_is_object = function(arg0) { + const val = getObject(arg0); + const ret = typeof(val) === 'object' && val !== null; + return ret; + }; + imports.wbg.__wbg_process_5b786e71d465a513 = function(arg0) { + const ret = getObject(arg0).process; + return addHeapObject(ret); + }; + imports.wbg.__wbg_versions_c2ab80650590b6a2 = function(arg0) { + const ret = getObject(arg0).versions; + return addHeapObject(ret); + }; + imports.wbg.__wbg_node_523d7bd03ef69fba = function(arg0) { + const ret = getObject(arg0).node; + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_is_string = function(arg0) { + const ret = typeof(getObject(arg0)) === 'string'; + return ret; + }; + imports.wbg.__wbg_require_2784e593a4674877 = function() { return handleError(function () { + const ret = module.require; + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbindgen_is_function = function(arg0) { + const ret = typeof(getObject(arg0)) === 'function'; + return ret; + }; + imports.wbg.__wbg_call_5da1969d7cd31ccd = function() { return handleError(function (arg0, arg1, arg2) { + const ret = getObject(arg0).call(getObject(arg1), getObject(arg2)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_msCrypto_abcb1295e768d1f2 = function(arg0) { + const ret = getObject(arg0).msCrypto; + return addHeapObject(ret); + }; + imports.wbg.__wbg_newwithlength_6c2df9e2f3028c43 = function(arg0) { + const ret = new Uint8Array(arg0 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_subarray_2e940e41c0f5a1d9 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).subarray(arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_getRandomValues_504510b5564925af = function() { return handleError(function (arg0, arg1) { + getObject(arg0).getRandomValues(getObject(arg1)); + }, arguments) }; + imports.wbg.__wbg_randomFillSync_a0d98aa11c81fe89 = function() { return handleError(function (arg0, arg1) { + getObject(arg0).randomFillSync(takeObject(arg1)); + }, arguments) }; + imports.wbg.__wbg_now_096aa89623f72d50 = function() { + const ret = Date.now(); + return ret; + }; + imports.wbg.__wbg_connected_b7635f1ca65b9aed = function(arg0) { + const ret = getObject(arg0).connected; + return ret; + }; + imports.wbg.__wbg_instanceof_DomException_b6a266bb8c76af9e = function(arg0) { + let result; + try { + result = getObject(arg0) instanceof DOMException; + } catch (_) { + result = false; + } + const ret = result; + return ret; + }; + imports.wbg.__wbindgen_number_get = function(arg0, arg1) { + const obj = getObject(arg1); + const ret = typeof(obj) === 'number' ? obj : undefined; + getFloat64Memory0()[arg0 / 8 + 1] = isLikeNone(ret) ? 0 : ret; + getInt32Memory0()[arg0 / 4 + 0] = !isLikeNone(ret); + }; + imports.wbg.__wbg_pressed_e69db502a61fa2d8 = function(arg0) { + const ret = getObject(arg0).pressed; + return ret; + }; + imports.wbg.__wbg_value_06cba5b7a5b72e36 = function(arg0) { + const ret = getObject(arg0).value; + return ret; + }; + imports.wbg.__wbindgen_is_null = function(arg0) { + const ret = getObject(arg0) === null; + return ret; + }; + imports.wbg.__wbg_id_5dc2c54ac7e4e03d = function(arg0, arg1) { + const ret = getObject(arg1).id; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_buttons_db34e12152ea40cb = function(arg0) { + const ret = getObject(arg0).buttons; + return addHeapObject(ret); + }; + imports.wbg.__wbg_length_1009b1af0c481d7b = function(arg0) { + const ret = getObject(arg0).length; + return ret; + }; + imports.wbg.__wbg_axes_d0d77b474ee9ca9b = function(arg0) { + const ret = getObject(arg0).axes; + return addHeapObject(ret); + }; + imports.wbg.__wbg_mapping_f5c841b5e4d3469b = function(arg0) { + const ret = getObject(arg0).mapping; + return addHeapObject(ret); + }; + imports.wbg.__wbg_get_f01601b5a68d10e3 = function(arg0, arg1) { + const ret = getObject(arg0)[arg1 >>> 0]; + return addHeapObject(ret); + }; + imports.wbg.__wbg_isSecureContext_4d5c40709f7f7559 = function(arg0) { + const ret = getObject(arg0).isSecureContext; + return ret; + }; + imports.wbg.__wbg_navigator_96ba491902f8f083 = function(arg0) { + const ret = getObject(arg0).navigator; + return addHeapObject(ret); + }; + imports.wbg.__wbg_getGamepads_d4130931a826d504 = function() { return handleError(function (arg0) { + const ret = getObject(arg0).getGamepads(); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_index_6b2865fd145fa48d = function(arg0) { + const ret = getObject(arg0).index; + return ret; + }; + imports.wbg.__wbg_message_3915f683795a43d9 = function(arg0, arg1) { + const ret = getObject(arg1).message; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_getExtension_b32d1f4b44a2464b = function() { return handleError(function (arg0, arg1, arg2) { + const ret = getObject(arg0).getExtension(getStringFromWasm0(arg1, arg2)); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_getSupportedExtensions_24ca3063e6cb52dc = function(arg0) { + const ret = getObject(arg0).getSupportedExtensions(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_getParameter_92e1c06daec0a5db = function() { return handleError(function (arg0, arg1) { + const ret = getObject(arg0).getParameter(arg1 >>> 0); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbindgen_string_get = function(arg0, arg1) { + const obj = getObject(arg1); + const ret = typeof(obj) === 'string' ? obj : undefined; + var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + var len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_texSubImage2D_009f28c178ac0ef3 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).texSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, arg8 >>> 0, getObject(arg9)); + }, arguments) }; + imports.wbg.__wbg_texSubImage2D_09f65ee13c9715c2 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).texSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, arg8 >>> 0, getObject(arg9)); + }, arguments) }; + imports.wbg.__wbg_texSubImage2D_586bd03abd8b9645 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).texSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, arg8 >>> 0, getObject(arg9)); + }, arguments) }; + imports.wbg.__wbg_texSubImage3D_b3b3c1e1aaaa99a9 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10, arg11) { + getObject(arg0).texSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, arg10 >>> 0, getObject(arg11)); + }, arguments) }; + imports.wbg.__wbg_texSubImage3D_1629275aaeddba7f = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10, arg11) { + getObject(arg0).texSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, arg10 >>> 0, getObject(arg11)); + }, arguments) }; + imports.wbg.__wbg_texSubImage3D_55f32eefc1c80c07 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10, arg11) { + getObject(arg0).texSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, arg10 >>> 0, getObject(arg11)); + }, arguments) }; + imports.wbg.__wbg_framebufferTextureMultiviewOVR_6ec7a85f3367d20e = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6) { + getObject(arg0).framebufferTextureMultiviewOVR(arg1 >>> 0, arg2 >>> 0, getObject(arg3), arg4, arg5, arg6); + }; + imports.wbg.__wbg_bindFramebuffer_33174ee82d938627 = function(arg0, arg1, arg2) { + getObject(arg0).bindFramebuffer(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_bindFramebuffer_80ab0501951cc2c3 = function(arg0, arg1, arg2) { + getObject(arg0).bindFramebuffer(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_getSupportedProfiles_25ed88a41293cb71 = function(arg0) { + const ret = getObject(arg0).getSupportedProfiles(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_new_ffc6d4d085022169 = function() { + const ret = new Array(); + return addHeapObject(ret); + }; + imports.wbg.__wbg_includes_cafdff20dd66763c = function(arg0, arg1, arg2) { + const ret = getObject(arg0).includes(getObject(arg1), arg2); + return ret; + }; + imports.wbg.__wbg_createFramebuffer_1b0ce659f44b2562 = function(arg0) { + const ret = getObject(arg0).createFramebuffer(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createFramebuffer_66918f52f84fb0a9 = function(arg0) { + const ret = getObject(arg0).createFramebuffer(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createQuery_3a315cf1eec44e3d = function(arg0) { + const ret = getObject(arg0).createQuery(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createRenderbuffer_cd7b8379638f7c64 = function(arg0) { + const ret = getObject(arg0).createRenderbuffer(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createRenderbuffer_6d6e37cbb502ca33 = function(arg0) { + const ret = getObject(arg0).createRenderbuffer(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createSampler_3a2ddaedd95dc2c5 = function(arg0) { + const ret = getObject(arg0).createSampler(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createShader_25391a4dceb30291 = function(arg0, arg1) { + const ret = getObject(arg0).createShader(arg1 >>> 0); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createShader_a56f470ffa1c92a5 = function(arg0, arg1) { + const ret = getObject(arg0).createShader(arg1 >>> 0); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createTexture_fc71efc6d11fdbcb = function(arg0) { + const ret = getObject(arg0).createTexture(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createTexture_0a5d95233724c9fb = function(arg0) { + const ret = getObject(arg0).createTexture(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_deleteShader_c10a3e2a689f8115 = function(arg0, arg1) { + getObject(arg0).deleteShader(getObject(arg1)); + }; + imports.wbg.__wbg_deleteShader_40389978f329df9f = function(arg0, arg1) { + getObject(arg0).deleteShader(getObject(arg1)); + }; + imports.wbg.__wbg_shaderSource_8581035b723a56a7 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).shaderSource(getObject(arg1), getStringFromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_shaderSource_f58b7f19ccf7f292 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).shaderSource(getObject(arg1), getStringFromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_compileShader_df38c9b4d109df2c = function(arg0, arg1) { + getObject(arg0).compileShader(getObject(arg1)); + }; + imports.wbg.__wbg_compileShader_710b082356f5014b = function(arg0, arg1) { + getObject(arg0).compileShader(getObject(arg1)); + }; + imports.wbg.__wbg_getShaderParameter_d5af258ca8110f13 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getShaderParameter(getObject(arg1), arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_getShaderParameter_033044aa2910ba65 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getShaderParameter(getObject(arg1), arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_createProgram_76ddcf5596a96a1a = function(arg0) { + const ret = getObject(arg0).createProgram(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createProgram_36349c11c5d787f1 = function(arg0) { + const ret = getObject(arg0).createProgram(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_deleteProgram_ffe51c2159e56aeb = function(arg0, arg1) { + getObject(arg0).deleteProgram(getObject(arg1)); + }; + imports.wbg.__wbg_deleteProgram_100d1c04b7f0f6ee = function(arg0, arg1) { + getObject(arg0).deleteProgram(getObject(arg1)); + }; + imports.wbg.__wbg_attachShader_289e2f1d24149257 = function(arg0, arg1, arg2) { + getObject(arg0).attachShader(getObject(arg1), getObject(arg2)); + }; + imports.wbg.__wbg_attachShader_184a61d345c20d42 = function(arg0, arg1, arg2) { + getObject(arg0).attachShader(getObject(arg1), getObject(arg2)); + }; + imports.wbg.__wbg_linkProgram_1ab5d0990c565f87 = function(arg0, arg1) { + getObject(arg0).linkProgram(getObject(arg1)); + }; + imports.wbg.__wbg_linkProgram_79a9e7719a86a93e = function(arg0, arg1) { + getObject(arg0).linkProgram(getObject(arg1)); + }; + imports.wbg.__wbg_getProgramParameter_ac16a850d3f251f3 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getProgramParameter(getObject(arg1), arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_getProgramParameter_69a29687a127f713 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getProgramParameter(getObject(arg1), arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_getActiveUniform_f9072bcc7895dac1 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getActiveUniform(getObject(arg1), arg2 >>> 0); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_size_5818c0d8de7ee6ea = function(arg0) { + const ret = getObject(arg0).size; + return ret; + }; + imports.wbg.__wbg_type_a25c4f950b3b3797 = function(arg0) { + const ret = getObject(arg0).type; + return ret; + }; + imports.wbg.__wbg_name_89f5e0e88ec3b968 = function(arg0, arg1) { + const ret = getObject(arg1).name; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_getActiveUniform_4f96fab0067ee961 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getActiveUniform(getObject(arg1), arg2 >>> 0); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_useProgram_45855699f032d49a = function(arg0, arg1) { + getObject(arg0).useProgram(getObject(arg1)); + }; + imports.wbg.__wbg_useProgram_667ebfb0fb0de4c0 = function(arg0, arg1) { + getObject(arg0).useProgram(getObject(arg1)); + }; + imports.wbg.__wbg_createBuffer_993ecd2e92aabe3c = function(arg0) { + const ret = getObject(arg0).createBuffer(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createBuffer_210de590ff501232 = function(arg0) { + const ret = getObject(arg0).createBuffer(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_bindBuffer_a0055fe364603e72 = function(arg0, arg1, arg2) { + getObject(arg0).bindBuffer(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_bindBuffer_c71ed62c7c21bed0 = function(arg0, arg1, arg2) { + getObject(arg0).bindBuffer(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_bindBufferRange_d9f0a9fc3adda248 = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).bindBufferRange(arg1 >>> 0, arg2 >>> 0, getObject(arg3), arg4, arg5); + }; + imports.wbg.__wbg_bindRenderbuffer_248119e9b6532f19 = function(arg0, arg1, arg2) { + getObject(arg0).bindRenderbuffer(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_bindRenderbuffer_0c7738e79a575fdb = function(arg0, arg1, arg2) { + getObject(arg0).bindRenderbuffer(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_blitFramebuffer_df3bca038546840e = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10) { + getObject(arg0).blitFramebuffer(arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, arg10 >>> 0); + }; + imports.wbg.__wbg_createVertexArrayOES_528c4cd10c985d11 = function(arg0) { + const ret = getObject(arg0).createVertexArrayOES(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createVertexArray_7466a685c3b93a65 = function(arg0) { + const ret = getObject(arg0).createVertexArray(); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_deleteVertexArray_56114a4faffe5e22 = function(arg0, arg1) { + getObject(arg0).deleteVertexArray(getObject(arg1)); + }; + imports.wbg.__wbg_deleteVertexArrayOES_09c67a658698d158 = function(arg0, arg1) { + getObject(arg0).deleteVertexArrayOES(getObject(arg1)); + }; + imports.wbg.__wbg_bindVertexArray_7b37e9d04dfd27d9 = function(arg0, arg1) { + getObject(arg0).bindVertexArray(getObject(arg1)); + }; + imports.wbg.__wbg_bindVertexArrayOES_d0c90ddc7c6360d2 = function(arg0, arg1) { + getObject(arg0).bindVertexArrayOES(getObject(arg1)); + }; + imports.wbg.__wbg_pixelStorei_48bb580e625ac760 = function(arg0, arg1, arg2) { + getObject(arg0).pixelStorei(arg1 >>> 0, arg2); + }; + imports.wbg.__wbg_pixelStorei_b4b6c5d89e9b5f96 = function(arg0, arg1, arg2) { + getObject(arg0).pixelStorei(arg1 >>> 0, arg2); + }; + imports.wbg.__wbg_bufferData_9f6454cde4211a84 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).bufferData(arg1 >>> 0, arg2, arg3 >>> 0); + }; + imports.wbg.__wbg_bufferData_7afee98828aad464 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).bufferData(arg1 >>> 0, arg2, arg3 >>> 0); + }; + imports.wbg.__wbg_bufferData_11f5ff31cb447750 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).bufferData(arg1 >>> 0, getObject(arg2), arg3 >>> 0); + }; + imports.wbg.__wbg_bufferData_a05a44a5492e757f = function(arg0, arg1, arg2, arg3) { + getObject(arg0).bufferData(arg1 >>> 0, getObject(arg2), arg3 >>> 0); + }; + imports.wbg.__wbg_bufferSubData_361bebad2e19dbcf = function(arg0, arg1, arg2, arg3) { + getObject(arg0).bufferSubData(arg1 >>> 0, arg2, getObject(arg3)); + }; + imports.wbg.__wbg_bufferSubData_07b03f17d75b6db7 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).bufferSubData(arg1 >>> 0, arg2, getObject(arg3)); + }; + imports.wbg.__wbg_getBufferSubData_3d5a446fc6edc0d6 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).getBufferSubData(arg1 >>> 0, arg2, getObject(arg3)); + }; + imports.wbg.__wbg_clearBufferiv_e26fb1758242f7f4 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).clearBufferiv(arg1 >>> 0, arg2, getArrayI32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_clearBufferuiv_75891c672ddef82a = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).clearBufferuiv(arg1 >>> 0, arg2, getArrayU32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_clearBufferfv_ddf1d2c0a5f293c5 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).clearBufferfv(arg1 >>> 0, arg2, getArrayF32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_clearBufferfi_d57bee264d59476a = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).clearBufferfi(arg1 >>> 0, arg2, arg3, arg4); + }; + imports.wbg.__wbg_clientWaitSync_31956a1ff24ab2d7 = function(arg0, arg1, arg2, arg3) { + const ret = getObject(arg0).clientWaitSync(getObject(arg1), arg2 >>> 0, arg3 >>> 0); + return ret; + }; + imports.wbg.__wbg_copyBufferSubData_926f5ccd6e693b1f = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).copyBufferSubData(arg1 >>> 0, arg2 >>> 0, arg3, arg4, arg5); + }; + imports.wbg.__wbg_copyTexSubImage2D_66766abee23288ff = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) { + getObject(arg0).copyTexSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8); + }; + imports.wbg.__wbg_copyTexSubImage2D_bc4fe74768b6add0 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) { + getObject(arg0).copyTexSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8); + }; + imports.wbg.__wbg_copyTexSubImage3D_d694f427199991b8 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).copyTexSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9); + }; + imports.wbg.__wbg_deleteBuffer_f4994a64cdd473a3 = function(arg0, arg1) { + getObject(arg0).deleteBuffer(getObject(arg1)); + }; + imports.wbg.__wbg_deleteBuffer_3129e4f30c465a14 = function(arg0, arg1) { + getObject(arg0).deleteBuffer(getObject(arg1)); + }; + imports.wbg.__wbg_deleteFramebuffer_2cc015c1b281e8a1 = function(arg0, arg1) { + getObject(arg0).deleteFramebuffer(getObject(arg1)); + }; + imports.wbg.__wbg_deleteFramebuffer_33112863fa4f3eb0 = function(arg0, arg1) { + getObject(arg0).deleteFramebuffer(getObject(arg1)); + }; + imports.wbg.__wbg_deleteQuery_d51a96512c6c3f3f = function(arg0, arg1) { + getObject(arg0).deleteQuery(getObject(arg1)); + }; + imports.wbg.__wbg_deleteRenderbuffer_80239f946eea133d = function(arg0, arg1) { + getObject(arg0).deleteRenderbuffer(getObject(arg1)); + }; + imports.wbg.__wbg_deleteRenderbuffer_5229b7175bb0b009 = function(arg0, arg1) { + getObject(arg0).deleteRenderbuffer(getObject(arg1)); + }; + imports.wbg.__wbg_deleteSampler_e33ef80c17eb0896 = function(arg0, arg1) { + getObject(arg0).deleteSampler(getObject(arg1)); + }; + imports.wbg.__wbg_deleteSync_3e63862ea7783216 = function(arg0, arg1) { + getObject(arg0).deleteSync(getObject(arg1)); + }; + imports.wbg.__wbg_deleteTexture_b8458a96b71a0a04 = function(arg0, arg1) { + getObject(arg0).deleteTexture(getObject(arg1)); + }; + imports.wbg.__wbg_deleteTexture_ad998c535ddaaf67 = function(arg0, arg1) { + getObject(arg0).deleteTexture(getObject(arg1)); + }; + imports.wbg.__wbg_disable_8938e1da156fa7d9 = function(arg0, arg1) { + getObject(arg0).disable(arg1 >>> 0); + }; + imports.wbg.__wbg_disable_483aff0769a6f791 = function(arg0, arg1) { + getObject(arg0).disable(arg1 >>> 0); + }; + imports.wbg.__wbg_disableVertexAttribArray_b196e82af1f9e794 = function(arg0, arg1) { + getObject(arg0).disableVertexAttribArray(arg1 >>> 0); + }; + imports.wbg.__wbg_disableVertexAttribArray_0c9e77abfba9ee15 = function(arg0, arg1) { + getObject(arg0).disableVertexAttribArray(arg1 >>> 0); + }; + imports.wbg.__wbg_drawArrays_4ae5359a7c3c5279 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).drawArrays(arg1 >>> 0, arg2, arg3); + }; + imports.wbg.__wbg_drawArrays_ac75b6b4a565dfde = function(arg0, arg1, arg2, arg3) { + getObject(arg0).drawArrays(arg1 >>> 0, arg2, arg3); + }; + imports.wbg.__wbg_drawArraysInstancedANGLE_efcd706fccb1a8f0 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).drawArraysInstancedANGLE(arg1 >>> 0, arg2, arg3, arg4); + }; + imports.wbg.__wbg_drawArraysInstanced_f7080bf0ad1d976e = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).drawArraysInstanced(arg1 >>> 0, arg2, arg3, arg4); + }; + imports.wbg.__wbindgen_number_new = function(arg0) { + const ret = arg0; + return addHeapObject(ret); + }; + imports.wbg.__wbg_push_901f3914205d44de = function(arg0, arg1) { + const ret = getObject(arg0).push(getObject(arg1)); + return ret; + }; + imports.wbg.__wbg_of_c36972ad824ef061 = function(arg0) { + const ret = Array.of(getObject(arg0)); + return addHeapObject(ret); + }; + imports.wbg.__wbg_drawBuffersWEBGL_7b1f12f2ee6598f5 = function(arg0, arg1) { + getObject(arg0).drawBuffersWEBGL(getObject(arg1)); + }; + imports.wbg.__wbg_drawBuffers_770b4e7949774930 = function(arg0, arg1) { + getObject(arg0).drawBuffers(getObject(arg1)); + }; + imports.wbg.__wbg_drawElementsInstancedANGLE_924b2ff704a740e7 = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).drawElementsInstancedANGLE(arg1 >>> 0, arg2, arg3 >>> 0, arg4, arg5); + }; + imports.wbg.__wbg_drawElementsInstanced_1f828577186777cb = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).drawElementsInstanced(arg1 >>> 0, arg2, arg3 >>> 0, arg4, arg5); + }; + imports.wbg.__wbg_enable_e39f53a946b9e3a0 = function(arg0, arg1) { + getObject(arg0).enable(arg1 >>> 0); + }; + imports.wbg.__wbg_enable_c5caba1636ec3c96 = function(arg0, arg1) { + getObject(arg0).enable(arg1 >>> 0); + }; + imports.wbg.__wbg_enableVertexAttribArray_f8678d164c294659 = function(arg0, arg1) { + getObject(arg0).enableVertexAttribArray(arg1 >>> 0); + }; + imports.wbg.__wbg_enableVertexAttribArray_0424d3842911d8b6 = function(arg0, arg1) { + getObject(arg0).enableVertexAttribArray(arg1 >>> 0); + }; + imports.wbg.__wbg_framebufferRenderbuffer_6b4d1a1c53ccc57d = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).framebufferRenderbuffer(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, getObject(arg4)); + }; + imports.wbg.__wbg_framebufferRenderbuffer_09dddaeb9b013985 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).framebufferRenderbuffer(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, getObject(arg4)); + }; + imports.wbg.__wbg_framebufferTexture2D_f8b0567baae853d2 = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).framebufferTexture2D(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, getObject(arg4), arg5); + }; + imports.wbg.__wbg_framebufferTexture2D_8d99f62eee2d1757 = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).framebufferTexture2D(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, getObject(arg4), arg5); + }; + imports.wbg.__wbg_framebufferTextureLayer_3776751a08a004cd = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).framebufferTextureLayer(arg1 >>> 0, arg2 >>> 0, getObject(arg3), arg4, arg5); + }; + imports.wbg.__wbg_frontFace_70a1886745b75bc9 = function(arg0, arg1) { + getObject(arg0).frontFace(arg1 >>> 0); + }; + imports.wbg.__wbg_frontFace_a08d3e57a0667c73 = function(arg0, arg1) { + getObject(arg0).frontFace(arg1 >>> 0); + }; + imports.wbg.__wbg_getParameter_fedfba9017d5fbcd = function() { return handleError(function (arg0, arg1) { + const ret = getObject(arg0).getParameter(arg1 >>> 0); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_getIndexedParameter_498208e84138d6d0 = function() { return handleError(function (arg0, arg1, arg2) { + const ret = getObject(arg0).getIndexedParameter(arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_getUniformLocation_29cc1018d110f9f0 = function(arg0, arg1, arg2, arg3) { + const ret = getObject(arg0).getUniformLocation(getObject(arg1), getStringFromWasm0(arg2, arg3)); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_getUniformLocation_50b6838495678a49 = function(arg0, arg1, arg2, arg3) { + const ret = getObject(arg0).getUniformLocation(getObject(arg1), getStringFromWasm0(arg2, arg3)); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_getSyncParameter_268f427e8d9f123e = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getSyncParameter(getObject(arg1), arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_renderbufferStorage_fcb8aee479a5dd50 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).renderbufferStorage(arg1 >>> 0, arg2 >>> 0, arg3, arg4); + }; + imports.wbg.__wbg_renderbufferStorage_14a5ac06c7f68729 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).renderbufferStorage(arg1 >>> 0, arg2 >>> 0, arg3, arg4); + }; + imports.wbg.__wbg_renderbufferStorageMultisample_77d1555e1b4be5d5 = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).renderbufferStorageMultisample(arg1 >>> 0, arg2, arg3 >>> 0, arg4, arg5); + }; + imports.wbg.__wbg_samplerParameterf_726502cef2fc6dff = function(arg0, arg1, arg2, arg3) { + getObject(arg0).samplerParameterf(getObject(arg1), arg2 >>> 0, arg3); + }; + imports.wbg.__wbg_samplerParameteri_d0f51895de24bcbb = function(arg0, arg1, arg2, arg3) { + getObject(arg0).samplerParameteri(getObject(arg1), arg2 >>> 0, arg3); + }; + imports.wbg.__wbg_texStorage2D_612a56ff2dc6ac9e = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).texStorage2D(arg1 >>> 0, arg2, arg3 >>> 0, arg4, arg5); + }; + imports.wbg.__wbg_texStorage3D_102ea8c301d9573e = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6) { + getObject(arg0).texStorage3D(arg1 >>> 0, arg2, arg3 >>> 0, arg4, arg5, arg6); + }; + imports.wbg.__wbg_uniform1i_59bbe75ef84036ac = function(arg0, arg1, arg2) { + getObject(arg0).uniform1i(getObject(arg1), arg2); + }; + imports.wbg.__wbg_uniform1i_a949331c579124f5 = function(arg0, arg1, arg2) { + getObject(arg0).uniform1i(getObject(arg1), arg2); + }; + imports.wbg.__wbg_uniform2iv_5a9f8821b3d44adb = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform2iv(getObject(arg1), getArrayI32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform2iv_c44d289b86e7b9c0 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform2iv(getObject(arg1), getArrayI32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform3iv_482ad890ad013578 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform3iv(getObject(arg1), getArrayI32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform3iv_d92618b7fac63d5f = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform3iv(getObject(arg1), getArrayI32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform4iv_6b5d31657261615b = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform4iv(getObject(arg1), getArrayI32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform4iv_7b54b6a063120eb2 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform4iv(getObject(arg1), getArrayI32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform1f_97c947ddb8aeacf8 = function(arg0, arg1, arg2) { + getObject(arg0).uniform1f(getObject(arg1), arg2); + }; + imports.wbg.__wbg_uniform1f_0c8a4e0444282098 = function(arg0, arg1, arg2) { + getObject(arg0).uniform1f(getObject(arg1), arg2); + }; + imports.wbg.__wbg_uniform4f_83cd1c05881edfde = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).uniform4f(getObject(arg1), arg2, arg3, arg4, arg5); + }; + imports.wbg.__wbg_uniform4f_998813a169b13f40 = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).uniform4f(getObject(arg1), arg2, arg3, arg4, arg5); + }; + imports.wbg.__wbg_uniform2fv_dee4625f08f7518e = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform2fv(getObject(arg1), getArrayF32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform2fv_c9bafe596aaa6f96 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform2fv(getObject(arg1), getArrayF32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform3fv_38d48a2561b89815 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform3fv(getObject(arg1), getArrayF32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform3fv_7c6cc849b0150aaa = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform3fv(getObject(arg1), getArrayF32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform4fv_85d4d7ef22366b93 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform4fv(getObject(arg1), getArrayF32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniform4fv_4aa6ac4f94369a8f = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniform4fv(getObject(arg1), getArrayF32FromWasm0(arg2, arg3)); + }; + imports.wbg.__wbg_uniformMatrix2fv_0ec0bb00ca04ae0f = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).uniformMatrix2fv(getObject(arg1), arg2 !== 0, getArrayF32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_uniformMatrix2fv_aaecec3c7496646f = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).uniformMatrix2fv(getObject(arg1), arg2 !== 0, getArrayF32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_uniformMatrix3fv_6c6cf9285fa50932 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).uniformMatrix3fv(getObject(arg1), arg2 !== 0, getArrayF32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_uniformMatrix3fv_8ebebb0a689c27ea = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).uniformMatrix3fv(getObject(arg1), arg2 !== 0, getArrayF32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_uniformMatrix4fv_47822ae94c519f11 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).uniformMatrix4fv(getObject(arg1), arg2 !== 0, getArrayF32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_uniformMatrix4fv_674d03cda2d50ccc = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).uniformMatrix4fv(getObject(arg1), arg2 !== 0, getArrayF32FromWasm0(arg3, arg4)); + }; + imports.wbg.__wbg_cullFace_f7631a823163010d = function(arg0, arg1) { + getObject(arg0).cullFace(arg1 >>> 0); + }; + imports.wbg.__wbg_cullFace_d2f78f39007f1d5d = function(arg0, arg1) { + getObject(arg0).cullFace(arg1 >>> 0); + }; + imports.wbg.__wbg_colorMask_ee95cb90b5399c1d = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).colorMask(arg1 !== 0, arg2 !== 0, arg3 !== 0, arg4 !== 0); + }; + imports.wbg.__wbg_colorMask_048d9f7d86363300 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).colorMask(arg1 !== 0, arg2 !== 0, arg3 !== 0, arg4 !== 0); + }; + imports.wbg.__wbg_depthMask_b520fa172dc50fdd = function(arg0, arg1) { + getObject(arg0).depthMask(arg1 !== 0); + }; + imports.wbg.__wbg_depthMask_03551bf1079ca4f3 = function(arg0, arg1) { + getObject(arg0).depthMask(arg1 !== 0); + }; + imports.wbg.__wbg_blendColor_bf0aca4480ec191b = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).blendColor(arg1, arg2, arg3, arg4); + }; + imports.wbg.__wbg_blendColor_bd7597cf4f926625 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).blendColor(arg1, arg2, arg3, arg4); + }; + imports.wbg.__wbg_invalidateFramebuffer_233280f8e97054a6 = function() { return handleError(function (arg0, arg1, arg2) { + getObject(arg0).invalidateFramebuffer(arg1 >>> 0, getObject(arg2)); + }, arguments) }; + imports.wbg.__wbg_polygonOffset_784d0bd354450685 = function(arg0, arg1, arg2) { + getObject(arg0).polygonOffset(arg1, arg2); + }; + imports.wbg.__wbg_polygonOffset_f7ac1393deab0d93 = function(arg0, arg1, arg2) { + getObject(arg0).polygonOffset(arg1, arg2); + }; + imports.wbg.__wbg_bindTexture_ba764bb08be120f7 = function(arg0, arg1, arg2) { + getObject(arg0).bindTexture(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_bindTexture_df13ba7e7ee5d984 = function(arg0, arg1, arg2) { + getObject(arg0).bindTexture(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_bindSampler_d6c4782741c69639 = function(arg0, arg1, arg2) { + getObject(arg0).bindSampler(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_activeTexture_123afbbc8970fe31 = function(arg0, arg1) { + getObject(arg0).activeTexture(arg1 >>> 0); + }; + imports.wbg.__wbg_activeTexture_713ce7d3e753740f = function(arg0, arg1) { + getObject(arg0).activeTexture(arg1 >>> 0); + }; + imports.wbg.__wbg_fenceSync_88242349a578d268 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).fenceSync(arg1 >>> 0, arg2 >>> 0); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_texParameteri_fba016345d388fd9 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).texParameteri(arg1 >>> 0, arg2 >>> 0, arg3); + }; + imports.wbg.__wbg_texParameteri_31d32c2b86548f8e = function(arg0, arg1, arg2, arg3) { + getObject(arg0).texParameteri(arg1 >>> 0, arg2 >>> 0, arg3); + }; + imports.wbg.__wbg_texSubImage2D_1b4def2ea95bfb31 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).texSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, arg8 >>> 0, getObject(arg9)); + }, arguments) }; + imports.wbg.__wbg_texSubImage2D_be9f61a79f57b819 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).texSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, arg8 >>> 0, getObject(arg9)); + }, arguments) }; + imports.wbg.__wbg_texSubImage2D_8694c2fdf6ffae77 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).texSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, arg8 >>> 0, arg9); + }, arguments) }; + imports.wbg.__wbg_compressedTexSubImage2D_6ab7ed818e5e4070 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) { + getObject(arg0).compressedTexSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, getObject(arg8)); + }; + imports.wbg.__wbg_compressedTexSubImage2D_bc2325e36c328ef3 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9) { + getObject(arg0).compressedTexSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, arg8, arg9); + }; + imports.wbg.__wbg_compressedTexSubImage2D_b9e80ce57234bf68 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8) { + getObject(arg0).compressedTexSubImage2D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7 >>> 0, getObject(arg8)); + }; + imports.wbg.__wbg_texSubImage3D_c81838d3b14e2574 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10, arg11) { + getObject(arg0).texSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, arg10 >>> 0, arg11); + }, arguments) }; + imports.wbg.__wbg_texSubImage3D_4491b14dacde659b = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10, arg11) { + getObject(arg0).texSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, arg10 >>> 0, getObject(arg11)); + }, arguments) }; + imports.wbg.__wbg_compressedTexSubImage3D_e237c5dd8b328f82 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10, arg11) { + getObject(arg0).compressedTexSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, arg10, arg11); + }; + imports.wbg.__wbg_compressedTexSubImage3D_fa81691b7cb3b7e4 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9, arg10) { + getObject(arg0).compressedTexSubImage3D(arg1 >>> 0, arg2, arg3, arg4, arg5, arg6, arg7, arg8, arg9 >>> 0, getObject(arg10)); + }; + imports.wbg.__wbg_depthFunc_4706c33c9966db3b = function(arg0, arg1) { + getObject(arg0).depthFunc(arg1 >>> 0); + }; + imports.wbg.__wbg_depthFunc_aa8fdb5bf66ce5dc = function(arg0, arg1) { + getObject(arg0).depthFunc(arg1 >>> 0); + }; + imports.wbg.__wbg_depthRange_2d0d6f020c3d5566 = function(arg0, arg1, arg2) { + getObject(arg0).depthRange(arg1, arg2); + }; + imports.wbg.__wbg_depthRange_ded9f852ad909448 = function(arg0, arg1, arg2) { + getObject(arg0).depthRange(arg1, arg2); + }; + imports.wbg.__wbg_scissor_6691dacd4ecb8e80 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).scissor(arg1, arg2, arg3, arg4); + }; + imports.wbg.__wbg_scissor_c1bf95c48721deac = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).scissor(arg1, arg2, arg3, arg4); + }; + imports.wbg.__wbg_vertexAttribDivisorANGLE_c01f8657d1933822 = function(arg0, arg1, arg2) { + getObject(arg0).vertexAttribDivisorANGLE(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_vertexAttribDivisor_938fb64827607dbe = function(arg0, arg1, arg2) { + getObject(arg0).vertexAttribDivisor(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_vertexAttribPointer_1241d48b9272fc9d = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6) { + getObject(arg0).vertexAttribPointer(arg1 >>> 0, arg2, arg3 >>> 0, arg4 !== 0, arg5, arg6); + }; + imports.wbg.__wbg_vertexAttribPointer_7be57c972fbee1d0 = function(arg0, arg1, arg2, arg3, arg4, arg5, arg6) { + getObject(arg0).vertexAttribPointer(arg1 >>> 0, arg2, arg3 >>> 0, arg4 !== 0, arg5, arg6); + }; + imports.wbg.__wbg_vertexAttribIPointer_12bfde6cf8b7b821 = function(arg0, arg1, arg2, arg3, arg4, arg5) { + getObject(arg0).vertexAttribIPointer(arg1 >>> 0, arg2, arg3 >>> 0, arg4, arg5); + }; + imports.wbg.__wbg_viewport_2464c396536924a3 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).viewport(arg1, arg2, arg3, arg4); + }; + imports.wbg.__wbg_viewport_146f8499414eebc9 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).viewport(arg1, arg2, arg3, arg4); + }; + imports.wbg.__wbg_blendFunc_3edf09b56fbb3ffd = function(arg0, arg1, arg2) { + getObject(arg0).blendFunc(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_blendFunc_f148dd374b130586 = function(arg0, arg1, arg2) { + getObject(arg0).blendFunc(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_blendFuncSeparate_c3c9b0213697920c = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).blendFuncSeparate(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, arg4 >>> 0); + }; + imports.wbg.__wbg_blendFuncSeparate_285a70ec8276ccab = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).blendFuncSeparate(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, arg4 >>> 0); + }; + imports.wbg.__wbg_blendEquation_b53426d0d37db246 = function(arg0, arg1) { + getObject(arg0).blendEquation(arg1 >>> 0); + }; + imports.wbg.__wbg_blendEquation_e933afa2d360ea3b = function(arg0, arg1) { + getObject(arg0).blendEquation(arg1 >>> 0); + }; + imports.wbg.__wbg_blendEquationSeparate_68fd537772dc05eb = function(arg0, arg1, arg2) { + getObject(arg0).blendEquationSeparate(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_blendEquationSeparate_821c15a65234ac9e = function(arg0, arg1, arg2) { + getObject(arg0).blendEquationSeparate(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_stencilFuncSeparate_3b5e111c83147417 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).stencilFuncSeparate(arg1 >>> 0, arg2 >>> 0, arg3, arg4 >>> 0); + }; + imports.wbg.__wbg_stencilFuncSeparate_639e870ff536309e = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).stencilFuncSeparate(arg1 >>> 0, arg2 >>> 0, arg3, arg4 >>> 0); + }; + imports.wbg.__wbg_stencilMask_3d9c0a4e72ab96ea = function(arg0, arg1) { + getObject(arg0).stencilMask(arg1 >>> 0); + }; + imports.wbg.__wbg_stencilMask_9a8f03321c1dea66 = function(arg0, arg1) { + getObject(arg0).stencilMask(arg1 >>> 0); + }; + imports.wbg.__wbg_stencilMaskSeparate_ef23e92802d8f995 = function(arg0, arg1, arg2) { + getObject(arg0).stencilMaskSeparate(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_stencilMaskSeparate_a5a7c370cd12a043 = function(arg0, arg1, arg2) { + getObject(arg0).stencilMaskSeparate(arg1 >>> 0, arg2 >>> 0); + }; + imports.wbg.__wbg_stencilOpSeparate_62ee06a95a1f36a4 = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).stencilOpSeparate(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, arg4 >>> 0); + }; + imports.wbg.__wbg_stencilOpSeparate_497a2305c23d697a = function(arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).stencilOpSeparate(arg1 >>> 0, arg2 >>> 0, arg3 >>> 0, arg4 >>> 0); + }; + imports.wbg.__wbg_getUniformBlockIndex_bdf0666cfd18218e = function(arg0, arg1, arg2, arg3) { + const ret = getObject(arg0).getUniformBlockIndex(getObject(arg1), getStringFromWasm0(arg2, arg3)); + return ret; + }; + imports.wbg.__wbg_uniformBlockBinding_efdd3c56716c6289 = function(arg0, arg1, arg2, arg3) { + getObject(arg0).uniformBlockBinding(getObject(arg1), arg2 >>> 0, arg3 >>> 0); + }; + imports.wbg.__wbg_readBuffer_908a6eccf79eb471 = function(arg0, arg1) { + getObject(arg0).readBuffer(arg1 >>> 0); + }; + imports.wbg.__wbg_readPixels_d3c0e1ee54deb785 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7) { + getObject(arg0).readPixels(arg1, arg2, arg3, arg4, arg5 >>> 0, arg6 >>> 0, arg7); + }, arguments) }; + imports.wbg.__wbg_readPixels_1324fe35287c6abc = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7) { + getObject(arg0).readPixels(arg1, arg2, arg3, arg4, arg5 >>> 0, arg6 >>> 0, getObject(arg7)); + }, arguments) }; + imports.wbg.__wbg_readPixels_070533492e105754 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4, arg5, arg6, arg7) { + getObject(arg0).readPixels(arg1, arg2, arg3, arg4, arg5 >>> 0, arg6 >>> 0, getObject(arg7)); + }, arguments) }; + imports.wbg.__wbg_beginQuery_91a71d14184dc3b1 = function(arg0, arg1, arg2) { + getObject(arg0).beginQuery(arg1 >>> 0, getObject(arg2)); + }; + imports.wbg.__wbg_endQuery_7f4678342575164a = function(arg0, arg1) { + getObject(arg0).endQuery(arg1 >>> 0); + }; + imports.wbg.__wbg_getQueryParameter_55ea7685196c2812 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).getQueryParameter(getObject(arg1), arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_get_7b48513de5dc5ea4 = function() { return handleError(function (arg0, arg1) { + const ret = Reflect.get(getObject(arg0), getObject(arg1)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_now_b724952e890dc703 = function(arg0) { + const ret = getObject(arg0).now(); + return ret; + }; + imports.wbg.__wbg_self_f0e34d89f33b99fd = function() { return handleError(function () { + const ret = self.self; + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_window_d3b084224f4774d7 = function() { return handleError(function () { + const ret = window.window; + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_globalThis_9caa27ff917c6860 = function() { return handleError(function () { + const ret = globalThis.globalThis; + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_global_35dfdd59a4da3e74 = function() { return handleError(function () { + const ret = global.global; + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbindgen_is_undefined = function(arg0) { + const ret = getObject(arg0) === undefined; + return ret; + }; + imports.wbg.__wbg_newnoargs_c62ea9419c21fbac = function(arg0, arg1) { + const ret = new Function(getStringFromWasm0(arg0, arg1)); + return addHeapObject(ret); + }; + imports.wbg.__wbg_call_90c26b09837aba1c = function() { return handleError(function (arg0, arg1) { + const ret = getObject(arg0).call(getObject(arg1)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_resolve_6e1c6553a82f85b7 = function(arg0) { + const ret = Promise.resolve(getObject(arg0)); + return addHeapObject(ret); + }; + imports.wbg.__wbg_then_3ab08cd4fbb91ae9 = function(arg0, arg1) { + const ret = getObject(arg0).then(getObject(arg1)); + return addHeapObject(ret); + }; + imports.wbg.__wbg_then_8371cc12cfedc5a2 = function(arg0, arg1, arg2) { + const ret = getObject(arg0).then(getObject(arg1), getObject(arg2)); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_memory = function() { + const ret = wasm.memory; + return addHeapObject(ret); + }; + imports.wbg.__wbg_buffer_a448f833075b71ba = function(arg0) { + const ret = getObject(arg0).buffer; + return addHeapObject(ret); + }; + imports.wbg.__wbg_newwithbyteoffsetandlength_b2f5b737836be06b = function(arg0, arg1, arg2) { + const ret = new Int8Array(getObject(arg0), arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_newwithbyteoffsetandlength_c370f7b5f8986669 = function(arg0, arg1, arg2) { + const ret = new Int16Array(getObject(arg0), arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_newwithbyteoffsetandlength_be0a0b31d480f4b2 = function(arg0, arg1, arg2) { + const ret = new Int32Array(getObject(arg0), arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_newwithbyteoffsetandlength_d0482f893617af71 = function(arg0, arg1, arg2) { + const ret = new Uint8Array(getObject(arg0), arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_set_2357bf09366ee480 = function(arg0, arg1, arg2) { + getObject(arg0).set(getObject(arg1), arg2 >>> 0); + }; + imports.wbg.__wbg_length_1d25fa9e4ac21ce7 = function(arg0) { + const ret = getObject(arg0).length; + return ret; + }; + imports.wbg.__wbg_newwithbyteoffsetandlength_099217381c451830 = function(arg0, arg1, arg2) { + const ret = new Uint16Array(getObject(arg0), arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_newwithbyteoffsetandlength_7a23ee7b263abe07 = function(arg0, arg1, arg2) { + const ret = new Uint32Array(getObject(arg0), arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_newwithbyteoffsetandlength_fa811509d2a67254 = function(arg0, arg1, arg2) { + const ret = new Float32Array(getObject(arg0), arg1 >>> 0, arg2 >>> 0); + return addHeapObject(ret); + }; + imports.wbg.__wbg_set_759f75cd92b612d2 = function() { return handleError(function (arg0, arg1, arg2) { + const ret = Reflect.set(getObject(arg0), getObject(arg1), getObject(arg2)); + return ret; + }, arguments) }; + imports.wbg.__wbg_newwithcontextoptions_b8f7091a3a364b0f = function() { return handleError(function (arg0) { + const ret = new lAudioContext(getObject(arg0)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_destination_4d44007f7d08d71b = function(arg0) { + const ret = getObject(arg0).destination; + return addHeapObject(ret); + }; + imports.wbg.__wbg_maxChannelCount_652279e4d267be9f = function(arg0) { + const ret = getObject(arg0).maxChannelCount; + return ret; + }; + imports.wbg.__wbg_setchannelCount_12bf2f57feba3188 = function(arg0, arg1) { + getObject(arg0).channelCount = arg1 >>> 0; + }; + imports.wbg.__wbg_createBuffer_444ba95ef8d4d0ff = function() { return handleError(function (arg0, arg1, arg2, arg3) { + const ret = getObject(arg0).createBuffer(arg1 >>> 0, arg2 >>> 0, arg3); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_currentTime_d2be936586614ff4 = function(arg0) { + const ret = getObject(arg0).currentTime; + return ret; + }; + imports.wbg.__wbg_createBufferSource_2900236a9a0ed333 = function() { return handleError(function (arg0) { + const ret = getObject(arg0).createBufferSource(); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_setbuffer_fcb9ea4265b72e7f = function(arg0, arg1) { + getObject(arg0).buffer = getObject(arg1); + }; + imports.wbg.__wbg_connect_7374783233c39eda = function() { return handleError(function (arg0, arg1) { + const ret = getObject(arg0).connect(getObject(arg1)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_setonended_7d1552abbde0045d = function(arg0, arg1) { + getObject(arg0).onended = getObject(arg1); + }; + imports.wbg.__wbg_start_88b66d1c6c29149b = function() { return handleError(function (arg0, arg1) { + getObject(arg0).start(arg1); + }, arguments) }; + imports.wbg.__wbg_copyToChannel_f1e42af1b32c01bb = function() { return handleError(function (arg0, arg1, arg2, arg3) { + getObject(arg0).copyToChannel(getArrayF32FromWasm0(arg1, arg2), arg3); + }, arguments) }; + imports.wbg.__wbg_measure_aa7a73f17813f708 = function() { return handleError(function (arg0, arg1, arg2, arg3) { + let deferred0_0; + let deferred0_1; + let deferred1_0; + let deferred1_1; + try { + deferred0_0 = arg0; + deferred0_1 = arg1; + deferred1_0 = arg2; + deferred1_1 = arg3; + performance.measure(getStringFromWasm0(arg0, arg1), getStringFromWasm0(arg2, arg3)); + } finally { + wasm.__wbindgen_free(deferred0_0, deferred0_1, 1); + wasm.__wbindgen_free(deferred1_0, deferred1_1, 1); + } + }, arguments) }; + imports.wbg.__wbindgen_debug_string = function(arg0, arg1) { + const ret = debugString(getObject(arg1)); + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbindgen_throw = function(arg0, arg1) { + throw new Error(getStringFromWasm0(arg0, arg1)); + }; + imports.wbg.__wbg_queueMicrotask_adae4bc085237231 = function(arg0) { + const ret = getObject(arg0).queueMicrotask; + return addHeapObject(ret); + }; + imports.wbg.__wbg_queueMicrotask_4d890031a6a5a50c = function(arg0) { + queueMicrotask(getObject(arg0)); + }; + imports.wbg.__wbg_instanceof_WebGl2RenderingContext_2a0a9b7be3acc66a = function(arg0) { + let result; + try { + result = getObject(arg0) instanceof WebGL2RenderingContext; + } catch (_) { + result = false; + } + const ret = result; + return ret; + }; + imports.wbg.__wbg_getProgramInfoLog_5caeb981d27a790c = function(arg0, arg1, arg2) { + const ret = getObject(arg1).getProgramInfoLog(getObject(arg2)); + var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + var len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_getShaderInfoLog_e78ccbd4507b9d0c = function(arg0, arg1, arg2) { + const ret = getObject(arg1).getShaderInfoLog(getObject(arg2)); + var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + var len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_instanceof_Window_3e5cd1f48c152d01 = function(arg0) { + let result; + try { + result = getObject(arg0) instanceof Window; + } catch (_) { + result = false; + } + const ret = result; + return ret; + }; + imports.wbg.__wbg_innerWidth_e5d865919c14bdf9 = function() { return handleError(function (arg0) { + const ret = getObject(arg0).innerWidth; + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_innerHeight_5e414ce6ae3fd139 = function() { return handleError(function (arg0) { + const ret = getObject(arg0).innerHeight; + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_devicePixelRatio_964a528c661f5575 = function(arg0) { + const ret = getObject(arg0).devicePixelRatio; + return ret; + }; + imports.wbg.__wbg_open_1526872b77d837c5 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4) { + const ret = getObject(arg0).open(getStringFromWasm0(arg1, arg2), getStringFromWasm0(arg3, arg4)); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_get_644791d4d61a5f69 = function(arg0, arg1, arg2) { + const ret = getObject(arg0)[getStringFromWasm0(arg1, arg2)]; + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_cancelAnimationFrame_cb9c6f65eaa83d76 = function() { return handleError(function (arg0, arg1) { + getObject(arg0).cancelAnimationFrame(arg1); + }, arguments) }; + imports.wbg.__wbg_clearTimeout_0f534a4b1fb4773d = function(arg0, arg1) { + getObject(arg0).clearTimeout(arg1); + }; + imports.wbg.__wbg_fullscreenElement_ebc349686c5a66a1 = function(arg0) { + const ret = getObject(arg0).fullscreenElement; + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }; + imports.wbg.__wbg_createElement_fdd5c113cb84539e = function() { return handleError(function (arg0, arg1, arg2) { + const ret = getObject(arg0).createElement(getStringFromWasm0(arg1, arg2)); + return addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_exitFullscreen_b5d53ae882b17a5c = function(arg0) { + getObject(arg0).exitFullscreen(); + }; + imports.wbg.__wbg_exitPointerLock_7fdf96663e773b31 = function(arg0) { + getObject(arg0).exitPointerLock(); + }; + imports.wbg.__wbg_requestPointerLock_1a4ef1990ed6cc1b = function(arg0) { + getObject(arg0).requestPointerLock(); + }; + imports.wbg.__wbg_setAttribute_e7b72a5e7cfcb5a3 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).setAttribute(getStringFromWasm0(arg1, arg2), getStringFromWasm0(arg3, arg4)); + }, arguments) }; + imports.wbg.__wbg_getProgramInfoLog_99334d62bea10332 = function(arg0, arg1, arg2) { + const ret = getObject(arg1).getProgramInfoLog(getObject(arg2)); + var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + var len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_getShaderInfoLog_207d91c9201acffa = function(arg0, arg1, arg2) { + const ret = getObject(arg1).getShaderInfoLog(getObject(arg2)); + var ptr1 = isLikeNone(ret) ? 0 : passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + var len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_style_97c680a5cbdf49cd = function(arg0) { + const ret = getObject(arg0).style; + return addHeapObject(ret); + }; + imports.wbg.__wbg_setProperty_ecf331459a4d3891 = function() { return handleError(function (arg0, arg1, arg2, arg3, arg4) { + getObject(arg0).setProperty(getStringFromWasm0(arg1, arg2), getStringFromWasm0(arg3, arg4)); + }, arguments) }; + imports.wbg.__wbg_width_87fb7beca76ecb6a = function(arg0) { + const ret = getObject(arg0).width; + return ret; + }; + imports.wbg.__wbg_setwidth_a04b04d18cb81715 = function(arg0, arg1) { + getObject(arg0).width = arg1 >>> 0; + }; + imports.wbg.__wbg_height_0fb9764a1a78e3f6 = function(arg0) { + const ret = getObject(arg0).height; + return ret; + }; + imports.wbg.__wbg_setheight_ae3c51b7555bd27d = function(arg0, arg1) { + getObject(arg0).height = arg1 >>> 0; + }; + imports.wbg.__wbg_x_dedc0183b8cf9e44 = function(arg0) { + const ret = getObject(arg0).x; + return ret; + }; + imports.wbg.__wbg_y_07982b620f686fbd = function(arg0) { + const ret = getObject(arg0).y; + return ret; + }; + imports.wbg.__wbg_width_eb7805903efd7fd3 = function(arg0) { + const ret = getObject(arg0).width; + return ret; + }; + imports.wbg.__wbg_height_aac6bd5616201da3 = function(arg0) { + const ret = getObject(arg0).height; + return ret; + }; + imports.wbg.__wbg_addListener_265dcc33d68a7574 = function() { return handleError(function (arg0, arg1) { + getObject(arg0).addListener(getObject(arg1)); + }, arguments) }; + imports.wbg.__wbg_removeListener_03d5c1013266db90 = function() { return handleError(function (arg0, arg1) { + getObject(arg0).removeListener(getObject(arg1)); + }, arguments) }; + imports.wbg.__wbg_ctrlKey_643b17aaac67db50 = function(arg0) { + const ret = getObject(arg0).ctrlKey; + return ret; + }; + imports.wbg.__wbg_shiftKey_8fb7301f56e7e01c = function(arg0) { + const ret = getObject(arg0).shiftKey; + return ret; + }; + imports.wbg.__wbg_altKey_c6c2a7e797d9a669 = function(arg0) { + const ret = getObject(arg0).altKey; + return ret; + }; + imports.wbg.__wbg_metaKey_2a8dbd51a3f59e9c = function(arg0) { + const ret = getObject(arg0).metaKey; + return ret; + }; + imports.wbg.__wbg_button_cd87b6dabbde9631 = function(arg0) { + const ret = getObject(arg0).button; + return ret; + }; + imports.wbg.__wbg_setwidth_7591ce24118fd14a = function(arg0, arg1) { + getObject(arg0).width = arg1 >>> 0; + }; + imports.wbg.__wbg_setheight_f7ae862183d88bd5 = function(arg0, arg1) { + getObject(arg0).height = arg1 >>> 0; + }; + imports.wbg.__wbg_getContext_52cc019050c5f7bd = function() { return handleError(function (arg0, arg1, arg2, arg3) { + const ret = getObject(arg0).getContext(getStringFromWasm0(arg1, arg2), getObject(arg3)); + return isLikeNone(ret) ? 0 : addHeapObject(ret); + }, arguments) }; + imports.wbg.__wbg_videoWidth_ca6d86a1026278ad = function(arg0) { + const ret = getObject(arg0).videoWidth; + return ret; + }; + imports.wbg.__wbg_videoHeight_55466ec3a1cae41c = function(arg0) { + const ret = getObject(arg0).videoHeight; + return ret; + }; + imports.wbg.__wbg_shiftKey_55894418ec38c771 = function(arg0) { + const ret = getObject(arg0).shiftKey; + return ret; + }; + imports.wbg.__wbg_metaKey_16606958d932a374 = function(arg0) { + const ret = getObject(arg0).metaKey; + return ret; + }; + imports.wbg.__wbg_code_878e76a4ddb70157 = function(arg0, arg1) { + const ret = getObject(arg1).code; + const ptr1 = passStringToWasm0(ret, wasm.__wbindgen_malloc, wasm.__wbindgen_realloc); + const len1 = WASM_VECTOR_LEN; + getInt32Memory0()[arg0 / 4 + 1] = len1; + getInt32Memory0()[arg0 / 4 + 0] = ptr1; + }; + imports.wbg.__wbg_deltaX_03d8f6dcd2e14b63 = function(arg0) { + const ret = getObject(arg0).deltaX; + return ret; + }; + imports.wbg.__wbg_deltaY_7d9a7eb25f83e193 = function(arg0) { + const ret = getObject(arg0).deltaY; + return ret; + }; + imports.wbg.__wbg_deltaMode_5f43eb63f3077df7 = function(arg0) { + const ret = getObject(arg0).deltaMode; + return ret; + }; + imports.wbg.__wbindgen_closure_wrapper4600 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 3641, __wbg_adapter_34); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper67219 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 50750, __wbg_adapter_37); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper67221 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 50750, __wbg_adapter_37); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper67223 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 50751, __wbg_adapter_37); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper67225 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 50750, __wbg_adapter_37); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper67227 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 50750, __wbg_adapter_37); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper67229 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 50750, __wbg_adapter_37); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper67231 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 50750, __wbg_adapter_37); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper78009 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 53839, __wbg_adapter_52); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper79563 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 54125, __wbg_adapter_55); + return addHeapObject(ret); + }; + imports.wbg.__wbindgen_closure_wrapper83612 = function(arg0, arg1, arg2) { + const ret = makeMutClosure(arg0, arg1, 55165, __wbg_adapter_58); + return addHeapObject(ret); + }; + + return imports; +} + +function __wbg_init_memory(imports, maybe_memory) { + +} + +function __wbg_finalize_init(instance, module) { + wasm = instance.exports; + __wbg_init.__wbindgen_wasm_module = module; + cachedFloat32Memory0 = null; + cachedFloat64Memory0 = null; + cachedInt32Memory0 = null; + cachedUint32Memory0 = null; + cachedUint8Memory0 = null; + + wasm.__wbindgen_start(); + return wasm; +} + +function initSync(module) { + if (wasm !== undefined) return wasm; + + const imports = __wbg_get_imports(); + + __wbg_init_memory(imports); + + if (!(module instanceof WebAssembly.Module)) { + module = new WebAssembly.Module(module); + } + + const instance = new WebAssembly.Instance(module, imports); + + return __wbg_finalize_init(instance, module); +} + +async function __wbg_init(input) { + if (wasm !== undefined) return wasm; + + if (typeof input === 'undefined') { + input = new URL('game_bg.wasm', import.meta.url); + } + const imports = __wbg_get_imports(); + + if (typeof input === 'string' || (typeof Request === 'function' && input instanceof Request) || (typeof URL === 'function' && input instanceof URL)) { + input = fetch(input); + } + + __wbg_init_memory(imports); + + const { instance, module } = await __wbg_load(await input, imports); + + return __wbg_finalize_init(instance, module); +} + +export { initSync } +export default __wbg_init; diff --git a/the-merp-experiment/game_bg.wasm b/the-merp-experiment/game_bg.wasm new file mode 100644 index 0000000..95b9b56 Binary files /dev/null and b/the-merp-experiment/game_bg.wasm differ diff --git a/the-merp-experiment/index.html b/the-merp-experiment/index.html new file mode 100644 index 0000000..7e3481a --- /dev/null +++ b/the-merp-experiment/index.html @@ -0,0 +1,6 @@ + \ No newline at end of file