Orthodox C++ (sometimes referred as C+) is minimal subset of C++ that improves C, but avoids all unnecessary things from so called Modern C++. It's exactly opposite of what Modern C++ suppose to be.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/bin/bash | |
# Dependency: node and npm must be installed on the jupyter(lab) instance. This could probably also be hacked around using nvm (node version manager) | |
cd | |
npm i ijavascript | |
npx ijsinstall | |
sed -i 's/ijskernel/node", "\/home\/jovyan\/node_modules\/ijavascript\/lib\/kernel\.js/g' .local/share/jupyter/kernels/javascript/kernel.json | |
echo "Try to refresh the page (F5). JavaScript notebook and console should be available then." |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
name: Security audit | |
on: | |
schedule: | |
- cron: '0 0 * * *' | |
push: | |
paths: | |
- '**/Cargo.toml' | |
- '**/Cargo.lock' | |
jobs: | |
security_audit: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
for (var arrScripts = document.getElementsByTagName('script'), i = 0; i < arrScripts.length; i++) { | |
if (arrScripts[i].textContent.indexOf('externalId') != -1) { | |
var channelId = arrScripts[i].textContent.match(/\"externalId\"\s*\:\s*\"(.*?)\"/)[1]; | |
var channelRss = 'https://www.youtube.com/feeds/videos.xml?channel_id=' + channelId; | |
var channelTitle = document.title.match(/\(?\d*\)?\s?(.*?)\s\-\sYouTube/)[1]; | |
console.log('The rss feed of the channel \'' + channelTitle + '\' is:\n' + channelRss); | |
break; | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
Implementation of the Gaussian Elimination Algorithm for finding the row-reduced echelon form of a given matrix. | |
No pivoting is done. | |
Requires Python 3 due to the different behaviour of the division operation in earlier versions of Python. | |
Released under the Public Domain (if you want it - you probably don't) | |
""" | |
def like_a_gauss(mat): | |
""" | |
Changes mat into Reduced Row-Echelon Form. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<div id="container"> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
Gaussian Elimination with Partial Pivoting. | |
This module contains 5 functions which procedurally solve | |
the linear system Ax = b, A is an nxn matrix and b is a | |
column vector with n rows. | |
""" | |
import numpy | |
import math |