Skip to content

Instantly share code, notes, and snippets.

<!-- Google Tag Manager (noscript) -->
<noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5D6RKKP"
height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>
<!-- End Google Tag Manager (noscript) -->
<script>
// Set up dataLayer with data if provided
window.dataLayer = window.dataLayer || [{ gaPropertyId: 'UA-55446531-20' }];
=1173002295&_v=j83&z=1887421163
2020-06-21T20:41:02.409Z proxied: stats.g.doubleclick.net/r/collect?v=1&aip=1&t=dc&_r=3&tid=UA-55446531-20&cid=9257118.1592772062&jid=779824401&_gid=218034169.1592772062&gjid=52807921&_v=j83&z=1610133504
2020-06-21T20:41:03.025Z proxied: www.googletagmanager.com/gtag/js?id=UA-55446531-20
2020-06-21T20:41:03.096Z proxied: www.googletagmanager.com/gtag/js?id=UA-55446531-20
2020-06-21T20:41:03.184Z proxied: www.googletagmanager.com/gtag/js?id=UA-55446531-20
2020-06-21T20:41:03.425Z proxied: www.google-analytics.com/r/collect?v=1&_v=j83&a=1390828066&t=pageview&_s=1&dl=https%3A%2F%2Fwww.freecodecamp.org%2Fnews%2Fhow-to-delete-a-git-branch-both-locally-and-remotely%2F&dr=https%3A%2F%2Fwww.google.com%2F&ul=en-us&de=UTF-8&dt=How%20to%20Delete%20a%20Git%20Branch%20Both%20Locally%20and%20Remotely&sd=30-bit&sr=1680x1050&vp=918x948&je=0&_u=AACAAUAB~&jid=953499377&gjid=1340825163&cid=1651878937.1592524654&tid=UA-55446531-20&_gid=1139165038.1592753739&_r=1&gtm=2ou6a0&z=1634154742&uip=108.26.
influxdb_1 | ts=2020-05-02T20:09:16.463610Z lvl=info msg="Executing query" log_id=0Lyf2wv0000 service=query query="SHOW DATABASES"
influxdb_1 | [httpd] 172.18.0.6 - - [02/May/2020:20:09:16 +0000] "GET /query?q=SHOW+DATABASES HTTP/1.1" 200 122 "-" "GuzzleHttp/6.5.1 curl/7.58.0 PHP/7.4.4" ccb2f37d-8cb0-11ea-a5a1-000000000000 588
web_1 | [2020-05-02T05:41:32.418675+00:00] AzuraCast.INFO: Running Now Playing sync task [] []
web_1 | [2020-05-02T05:41:47.419444+00:00] AzuraCast.INFO: Running Now Playing sync task [] []
stations_1 | 2020-04-13 09:12:30,652 INFO spawned: 'tmpreaper' with pid 11062
stations_1 | 2020-04-13 09:12:32,516 INFO success: tmpreaper entered RUNNING state, process has stayed up for > than 1 seconds (startsecs)
web_1 | [2020-05-02T05:42:02.285054+00:00] AzuraCast.INFO: Running Now Playing sync task [] []
web_1 | [2020-05-02T05:42:02.343174+00:00] AzuraCast.INFO: Running 1-minute sync task [] []
influxdb_1 | [httpd] 172.18.0.6 - - [02/May/2020:20:09:16 +0000] "POST /
render() {
const { amount, duration, planId } = this.state;
const isOneTimePayment = duration === "onetime";
if (!isOneTimePayment) {
return (
<PayPalButton
createSubscription={(data, actions) => {
return actions.subscription.create({
plan_id: planId
@ahmaxed
ahmaxed / createMap.js
Last active September 25, 2017 14:26
a take of on the random walk algorithm
//helper function to make a two dimentional array that takes a number and the dimentions of the array
createArray(num, dimensions) {
var array = [];
for (var i = 0; i < dimensions; i++) {
array.push([]);
for (var j = 0; j < dimensions; j++) {
array[i].push(num);
}
}
return array;
This file has been truncated, but you can view the full file.
{"type":"FeatureCollection","features":[
{"type":"Feature","geometry":{"type":"Polygon","coordinates":[[[179.99921875,-16.168554687500006],[179.84824218750003,-16.30166015625001],[179.79384765625002,-16.37031250000001],[179.74814453125003,-16.4462890625],[179.619140625,-16.52773437500001],[179.56416015625,-16.63691406250001],[179.56816406250005,-16.74746093750001],[179.69707031250005,-16.631933593750006],[179.841015625,-16.53750000000001],[179.8849609375,-16.51845703125001],[179.93037109375,-16.51943359375001],[179.92656250000005,-16.55166015625001],[179.90595703125,-16.583593750000006],[179.89003906250002,-16.6669921875],[179.9279296875,-16.744433593750003],[179.82080078125,-16.736914062500006],[179.71474609375002,-16.74355468750001],[179.58896484375003,-16.78701171875001],[179.46542968750003,-16.80605468750001],[179.41933593750002,-16.80654296875001],[179.375,-16.7919921875],[179.34599609375005,-16.76972656250001],[179.32333984375003,-16.718066406250003],[179.30048828125,-16.71035156250001],[179.20234375,-1
// if it is the computer's turn loop over the moves and choose the move with the highest score
var bestMove;
if(player === aiPlayer){
var bestScore = -10000;
for(var i = 0; i < moves.length; i++){
if(moves[i].score > bestScore){
bestScore = moves[i].score;
bestMove = i;
}
}
@ahmaxed
ahmaxed / minimax4.js
Last active September 28, 2018 21:16
// an array to collect all the objects
var moves = [];
// loop through available spots
for (var i = 0; i < availSpots.length; i++){
//create an object for each and store the index of that spot
var move = {};
move.index = newBoard[availSpots[i]];
// set the empty spot to the current player
// checks for the terminal states such as win, lose, and tie
//and returning a value accordingly
if (winning(newBoard, huPlayer)){
return {score:-10};
}
else if (winning(newBoard, aiPlayer)){
return {score:10};
}
else if (availSpots.length === 0){
return {score:0};
// the main minimax function
function minimax(newBoard, player){
//available spots
var availSpots = emptyIndexies(newBoard);