- Create a new directory;
mkdir Apple\ Enterprise
cd Apple\ Enterprise
- Generate a certificate signing request
openssl req -nodes -newkey rsa:2048 -keyout ios_enterprise.key -out CertificateSigningRequest.certSigningRequest
/* | |
* Created by C.J. Kimberlin | |
* | |
* The MIT License (MIT) | |
* | |
* Copyright (c) 2019 | |
* | |
* Permission is hereby granted, free of charge, to any person obtaining a copy | |
* of this software and associated documentation files (the "Software"), to deal | |
* in the Software without restriction, including without limitation the rights |
function inception(f) { | |
try { | |
return 'recursion puts the "' + f.name + '" in "' + f(f) + '"'; | |
} catch (e) { | |
return ''; | |
} | |
} |
<!-- A script to get max call stack size in browser | |
In my Macbook pro | |
Firefox 28: | |
maxStackSize = 350801 (dynamic, but always above 300000) | |
error: InternalError: too much recursion | |
Safari 7.0.2 | |
maxStackSize = 58034 | |
error: RangeError: Maximum call stack size exceeded. | |
Chrome 33: |
mkdir Apple\ Enterprise
cd Apple\ Enterprise
openssl req -nodes -newkey rsa:2048 -keyout ios_enterprise.key -out CertificateSigningRequest.certSigningRequest
This is the resource repositry for my memory managment lecture / workshop series at Breda University of applied sciences - Games. It is mainly targeted for game developers
Please consider using http://lygia.xyz instead of copy/pasting this functions. It expand suport for voronoi, voronoise, fbm, noise, worley, noise, derivatives and much more, through simple file dependencies. Take a look to https://github.com/patriciogonzalezvivo/lygia/tree/main/generative
float rand(float n){return fract(sin(n) * 43758.5453123);}
float noise(float p){
float fl = floor(p);
float fc = fract(p);
' Disables Vanguard from starting when you boot your computer | |
Call CreateObject("Shell.Application").ShellExecute("cmd.exe", "/c ""sc config vgc start= disabled & sc config vgk start= disabled""", "", "runas") |
// bezier curve with 2 control points | |
// A is the starting point, B, C are the control points, D is the destination | |
// t from 0 ~ 1 | |
vec3 bezier(vec3 A, vec3 B, vec3 C, vec3 D, float t) { | |
vec3 E = mix(A, B, t); | |
vec3 F = mix(B, C, t); | |
vec3 G = mix(C, D, t); | |
vec3 H = mix(E, F, t); | |
vec3 I = mix(F, G, t); |
# [filter size, stride, padding] | |
#Assume the two dimensions are the same | |
#Each kernel requires the following parameters: | |
# - k_i: kernel size | |
# - s_i: stride | |
# - p_i: padding (if padding is uneven, right padding will higher than left padding; "SAME" option in tensorflow) | |
# | |
#Each layer i requires the following parameters to be fully represented: | |
# - n_i: number of feature (data layer has n_1 = imagesize ) | |
# - j_i: distance (projected to image pixel distance) between center of two adjacent features |
Code is clean if it can be understood easily – by everyone on the team. Clean code can be read and enhanced by a developer other than its original author. With understandability comes readability, changeability, extensibility and maintainability.