# Key considerations for algorithm "RSA" ≥ 2048-bit
openssl genrsa -out server.key 2048
# Key considerations for algorithm "ECDSA" ≥ secp384r1
# List ECDSA the supported curves (openssl ecparam -list_curves)
| (function (ko, handlers, unwrap, extend) { | |
| "use strict"; | |
| extend(handlers, { | |
| href: { | |
| update: function (element, valueAccessor) { | |
| handlers.attr.update(element, function () { | |
| return { href: valueAccessor() }; | |
| }); | |
| } | |
| }, |
| PS1="\w \`if [ \$? = 0 ]; then echo -e '\[\e[01;32m\]\n^_^'; else echo -e '\[\e[01;31m\]\n>_<'; fi\` \[\e]0;\w\a\] \[\e[32m\]\u@\h \[\e[33m\]\w\[\e[0m\]\\$\n" |
| // Just before switching jobs: | |
| // Add one of these. | |
| // Preferably into the same commit where you do a large merge. | |
| // | |
| // This started as a tweet with a joke of "C++ pro-tip: #define private public", | |
| // and then it quickly escalated into more and more evil suggestions. | |
| // I've tried to capture interesting suggestions here. | |
| // | |
| // Contributors: @r2d2rigo, @joeldevahl, @msinilo, @_Humus_, | |
| // @YuriyODonnell, @rygorous, @cmuratori, @mike_acton, @grumpygiant, |
| #!/usr/bin/env python3 | |
| ''' | |
| This program will first analyze the maze and fill out a two dimensional list with elements | |
| contained within the input file, making note of the start point | |
| The program will then explore neighboring cells from the start location starting with the right cell | |
| by passing the location to a method which will process the cell, and mark it as explored, or maze solved. | |
| The program will make note if there is more than one exploratory juxtaposing cell, and store the cell | |
| location into a list ordered latest found to earliest found, then note cells explored after this into |
