I hereby claim:
- I am cdrnet on github.
- I am cdrnet (https://keybase.io/cdrnet) on keybase.
- I have a public key whose fingerprint is 41C6 ACE0 ACD1 FD51 D565 2884 B33F 7C2A D58B 2816
To claim this, I am signing this object:
Languages
16,049,609 gist results
16,049,609 gist results
This file contains hidden or 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
| /** | |
| Implement regular expression matching with support for '.' and '*'. | |
| '.' Matches any single character. | |
| '*' Matches zero or more of the preceding element. | |
| The matching should cover the entire input string (not partial). | |
| The function prototype should be: |
This file contains hidden or 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
| //Getting Page name | |
| var pagetitle = document.getElementsByTagName("title")[0].innerHTML.substr(11); | |
| console.log('You are about to SCRAPE the ' + pagetitle); | |
| //Function for getting UIDS | |
| function getAllLink(){ | |
| var class1 = document.getElementsByClassName('fwb fcg'); | |
| var array1 = []; | |
| for(i=0;i<class1.length;i++){ | |
| var str = class1[i].getElementsByTagName('a')[0].href; | |
| var partres = str.split("?"); |
Boot-Error
/ Pyramid
Created
February 8, 2015 17:39
This generates a pyramid of numbers.. using python.
This file contains hidden or 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
| # Maximum Limit | |
| limit = 20 | |
| # generates the series as a list | |
| pyramid = [a[0:-1]+a[::-1] for a in ["".join([str(k) for k in range(1, i+1)]) for i in range(1, limit+1)]] | |
| # pretty print | |
| for num in pyramid: | |
| print num.center(len(pyramid[-1])) |
mattdee123
/ gist:ea9188e859bc30a49678
Created
February 8, 2015 17:02
This file contains hidden or 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
| ## arrow up | |
| "\e[A":history-search-backward | |
| ## arrow down | |
| "\e[B":history-search-forward |
andy-esch
/ index.html
Last active
August 29, 2015 14:15
Use bounding box to calculate values to populate a chart
This file contains hidden or 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
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <title>Custom infowindow example | CartoDB.js</title> | |
| <meta name="viewport" content="initial-scale=1.0, user-scalable=no" /> | |
| <meta http-equiv="content-type" content="text/html; charset=UTF-8"/> | |
| <link rel="shortcut icon" href="http://cartodb.com/assets/favicon.ico" /> | |
| <style> | |
| html, body { | |
| height: 100%; |
ElninoFong
/ Word Break II.java
Created
February 8, 2015 06:43
This file contains hidden or 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
| public class Solution { | |
| public List<String> wordBreak(String s, Set<String> dict) { | |
| List<String> result = new ArrayList<String>(); | |
| if (s == null || dict == null) { | |
| return result; | |
| } | |
| int len = s.length(); | |
| boolean[] dp = new boolean[len + 1]; | |
| dp[0] = true; |
This file contains hidden or 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
| --- libhttpd.c 2014-12-10 12:53:07.000000000 -0800 | |
| +++ libhttpd.c.patched 2015-02-07 22:44:59.183663432 -0800 | |
| @@ -2231,6 +2231,12 @@ | |
| if ( strcasecmp( cp, "keep-alive" ) == 0 ) | |
| hc->keep_alive = 1; | |
| } | |
| + else if ( strncasecmp( buf, "X-Forwarded-For:", 16 ) == 0 ) | |
| + { // Use real IP if available | |
| + cp = &buf[16]; | |
| + cp += strspn( cp, " \t" ); |
This file contains hidden or 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
| require 'open-uri' | |
| require 'rexml/document' | |
| data = open("http://feeds.feedburner.com/hatena/b/hotentry").read | |
| doc = REXML::Document.new(data) | |
| doc.each_element("//item/") do |item| | |
| puts item.elements["title"].text | |
| puts item.elements["link"].text | |
| end |
This file contains hidden or 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
| # Function to download OSF file: | |
| getOSFfile <- function( | |
| code, #Either "https://osf.io/XXXXX/" or just the code | |
| dir = getwd(), # Output location | |
| method = c("downloader","httr","curl") # First one is chosen | |
| ){ | |
| # Check if input is code: | |
| if (!grepl("osf\\.io",code)){ | |
| URL <- sprintf("https://osf.io/%s/",code) | |
| } else URL <- code |