Daniel Pradilla danielpradilla

## pentaho-delete-home-folders.js
/*
Execute this from the javascript console in the browser, after you log in pentaho.
Get the listing of children of :home
Go through the list and send a put to deletepermanent with the id of the node.
*/

$.getJSON("http://<server_url>:8080/pentaho/api/repo/files/:home/children", function(data){
    $.each(data, function(i, nodes){
        nodes.forEach(function(node){
            console.log(node.path,node.id);

## s3-upload-aws4.sh
#!/bin/sh -u

# To the extent possible under law, Viktor Szakats (vszakats.net)
# has waived all copyright and related or neighboring rights to this
# script.
# CC0 - https://creativecommons.org/publicdomain/zero/1.0/

# Upload a file to Amazon AWS S3 using Signature Version 4
#
# docs:

## index.html
<!DOCTYPE html>
<html>
  <head>
    <title>title</title>
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <link rel="stylesheet" href="bower_components/bootstrap/dist/css/bootstrap.min.css">
  </head>
  <body>
    <h1>Hello, world</h1>
    <script src="http://code.jquery.com/jquery.js"></script>

## s3-download-aws4.sh
#!/bin/sh -u

fileLocal="${1:-example-local-file.ext}"
bucket="${2:-example-bucket}"
remotePath="${3:-remote-path}"
region="${4:-}"
awsAccess="${5:-YOUR_AWS_ACCESS_KEY}"
awsSecret="${6:-YOUR_AWS_SECRET_KEY}"

m_openssl() {

## neuralnet-square-root.R
if (!require(neuralnet)) {install.packages("neuralnet")}

library(neuralnet)

#nn for learning how to calculate a square root

set.seed(1)
train.x <- sample(1:100, 50, replace = T)
head(train.x)

## gitignore_global
# Compiled source #
###################
*.com
*.class
*.dll
*.exe
*.o
*.so

# Packages #

## transpose.js
/**
 * http://www.codesuck.com/2012/02/transpose-javascript-array-in-one-line.html
 */
function transpose(a) {
    return Object.keys(a[0]).map(function (c) {
        return a.map(function (r) {
            return r[c];
        });
    });
}

## sieve_of_eratosthenes.js
/*jshint esnext: true */

/*
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
1. Create a list of consecutive integers from 2 through n: (2, 3, 4, ..., n).

2. Initially, let p equal 2, the smallest prime number.

3. Enumerate the multiples of p by counting to n from 2p in increments of p, and mark them in the list (these will be 2p, 3p, 4p, ...; the p itself should not be marked).

## introrx.md

      
              7 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                danielpradilla
                / introrx.md
            
            
              Created
              February 10, 2016 16:54
                — forked from staltz/introrx.md
            
              
                The introduction to Reactive Programming you've been missing
              
          
    The introduction to Reactive Programming you've been missing

(by @andrestaltz)

This tutorial as a series of videos

If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.


## table.html
<style>
table{
    width:100%;
}
table tr {display:inline}
table tr:nth-child(1){
    position:relative;
}
table tr:nth-child(1) td{
    position:absolute;
	#!/bin/sh -u

	# To the extent possible under law, Viktor Szakats (vszakats.net)
	# has waived all copyright and related or neighboring rights to this
	# script.
	# CC0 - https://creativecommons.org/publicdomain/zero/1.0/

	# Upload a file to Amazon AWS S3 using Signature Version 4
	#
	# docs:
	<!DOCTYPE html>
	<html>
	<head>
	<title>title</title>
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<link rel="stylesheet" href="bower_components/bootstrap/dist/css/bootstrap.min.css">
	</head>
	<body>
	<h1>Hello, world</h1>
	<script src="http://code.jquery.com/jquery.js"></script>
	#!/bin/sh -u

	fileLocal="${1:-example-local-file.ext}"
	bucket="${2:-example-bucket}"
	remotePath="${3:-remote-path}"
	region="${4:-}"
	awsAccess="${5:-YOUR_AWS_ACCESS_KEY}"
	awsSecret="${6:-YOUR_AWS_SECRET_KEY}"

	m_openssl() {
	if (!require(neuralnet)) {install.packages("neuralnet")}

	library(neuralnet)

	#nn for learning how to calculate a square root

	set.seed(1)
	train.x <- sample(1:100, 50, replace = T)
	head(train.x)
	# Compiled source #
	###################
	*.com
	*.class
	*.dll
	*.exe
	*.o
	*.so

	# Packages #
	/**
	* http://www.codesuck.com/2012/02/transpose-javascript-array-in-one-line.html
	*/
	function transpose(a) {
	return Object.keys(a[0]).map(function (c) {
	return a.map(function (r) {
	return r[c];
	});
	});
	}
	/jshint esnext: true /

	/*
	https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
	1. Create a list of consecutive integers from 2 through n: (2, 3, 4, ..., n).

	2. Initially, let p equal 2, the smallest prime number.

	3. Enumerate the multiples of p by counting to n from 2p in increments of p, and mark them in the list (these will be 2p, 3p, 4p, ...; the p itself should not be marked).
	<style>
	table{
	width:100%;
	}
	table tr {display:inline}
	table tr:nth-child(1){
	position:relative;
	}
	table tr:nth-child(1) td{
	position:absolute;