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
import json | |
import urllib.request | |
import datetime | |
import time | |
import pandas as pd | |
comienzo = time.time() | |
def hacer_request(tid): | |
url = "https://localbitcoins.com/bitcoincharts/VEF/trades.json?since=" |
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
#include <stdio.h> | |
#include <stdbool.h> | |
// Maybe | |
typedef struct MaybeInt { | |
int just; | |
bool nothing; | |
} MaybeInt; |
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
// Mixin like functionality | |
const textInput = props => ` | |
color: ${props.error ? color.white : color.base}; | |
background-color: ${props.error ? color.alert : color.white}; | |
`; | |
export const Input = styled.input` | |
${textInput} | |
`; |
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
'use strict'; | |
(function() { | |
angular.module('app.services').service('platformService', [ | |
function() { | |
var IONIC_APP_ID = 'xxx00xxx'; | |
this.isIonicWebView = function() { | |
return window.location.href.indexOf('com.ionic.viewapp') > -1 || window.location.href.indexOf(IONIC_APP_ID) > -1; |
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
" quick replace occurences | |
let g:should_inject_replace_occurences = 0 | |
function! MoveToNext() | |
if g:should_inject_replace_occurences | |
call feedkeys("n") | |
call repeat#set("\<Plug>ReplaceOccurences") | |
endif | |
let g:should_inject_replace_occurences = 0 | |
endfunction |
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
The MIT License (MIT) | |
Copyright (c) 2014 NPR | |
Permission is hereby granted, free of charge, to any person obtaining a copy | |
of this software and associated documentation files (the "Software"), to deal | |
in the Software without restriction, including without limitation the rights | |
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell | |
copies of the Software, and to permit persons to whom the Software is | |
furnished to do so, subject to the following conditions: |
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
[general] | |
fontname=Terminus 9 | |
selchars=-A-Za-z0-9,./?%&#:_ | |
scrollback=0 | |
bgcolor=#00002b2b3636 | |
bgalpha=65535 | |
fgcolor=#65657b7b8383 | |
disallowbold=false | |
cursorblinks=false | |
cursorunderline=false |
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
def quicksort(datos, primero, ultimo): | |
i = primero | |
j = ultimo | |
pivote = (datos[primero] + datos[ultimo]) / 2 | |
while i < j: | |
while datos[i] < pivote: | |
i+=1 | |
while datos[j] > pivote: | |
j-=1 |