vladshablinsky

Work on source modified time support. List of pull requests:

Add SubversionDownloadStrategy#source_modified_time

Override VCSDownloadStrategy#source_modified_time

download_strategy: use svn info --xml

download_strategy: cvs source_modified_time

karpathy

""" Trains an agent with (stochastic) Policy Gradients on Pong. Uses OpenAI Gym. """
import numpy as np
import cPickle as pickle
import gym

# hyperparameters
H = 200 # number of hidden layer neurons
batch_size = 10 # every how many episodes to do a param update?
learning_rate = 1e-4
gamma = 0.99 # discount factor for reward

steinwaywhw

• Use curl to get the JSON response for the latest release
• Use grep to find the line containing file URL
• Use cut and tr to extract the URL
• Use wget to download it

curl -s https://api.github.com/repos/jgm/pandoc/releases/latest \
| grep "browser_download_url.*deb" \
| cut -d : -f 2,3 \
| tr -d \" \

dufferzafar

rupl

// Load fonts async by default
// Load sync from SW cache when available.
//
// Snippet assumes your Service Worker caches fonts as part of installation, so that
// an 'activated' Service Worker means the fonts are cached with 100% confidence.
if (
  'serviceWorker' in navigator &&
  navigator.serviceWorker.controller !== null &&
  navigator.serviceWorker.controller.state === 'activated'
) {

Shekharrajak

from sympy import *

# https://www.rose-hulman.edu/~finn/CCLI/Notes/day09.pdf

a0, a1, a2, a3, t = symbols('a0 a1 a2 a3 t')

polynomial = a0 + a1*t + a2*t**2 + a3*t**3
polynomial_d = diff(polynomial, t)

p0, v0, p1, v1 = symbols('p0 v0 p1 v1')

Shekharrajak

SVG circular progress: CSS animated & Angle gradient

SVG Circular Progress CSS Animated Angle Gradient

By Pouya Saadeghi

Forked from Pouya Saadeghi (پویا صادقی)'s Pen SVG circular progress: CSS animated & Angle gradient .

ivycheung1208

/* Implement a directed graph using adjacency list representation
 * Depth First Traversal for a Graph: http://www.geeksforgeeks.org/depth-first-traversal-for-a-graph/
 * Breadth First Traversal for a Graph http://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/
 * Connectivity in a directed graph: http://www.geeksforgeeks.org/connectivity-in-a-directed-graph/
 */

#ifndef GRAPH_H
#define GRAPH_H

#include <iostream>

mycodeschool

#include<iostream>
#include<cstdlib>
#include<set>
using namespace std;

struct Node {
    int data;
    struct Node *next;
};
int length(struct Node *head) {

mycodeschool

/* Deleting a node from Binary search tree */
#include<iostream>
using namespace std;
struct Node {
	int data;
	struct Node *left;
	struct Node *right;
};
//Function to find minimum in a tree. 
Node* FindMin(Node* root)