| set nocompatible | |
| filetype off | |
| set shell=bash | |
| set rtp+=~/.vim/bundle/vundle | |
| call vundle#rc() | |
| Bundle 'gmarik/vundle' | |
| Bundle 'kien/ctrlp.vim' | |
| Bundle 'alfredodeza/khuno.vim' | |
| Bundle 'tpope/vim-commentary' | |
| Bundle 'tpope/vim-surround' |
| import numpy as np | |
| arr = np.arange(1, 26).reshape((5, 5)) | |
| arr2 = np.arange(1, 26).reshape((5, 5)) | |
| def rot90(arr): | |
| for circle in range(len(arr) // 2): | |
| for item in range(0, len(arr) - 1 - 2 * circle): |
| int equi ( int[] arr ) { | |
| long left = 0; | |
| long right = 0; | |
| /* sumamos todos a la izquierda */ | |
| for(int i : arr) { | |
| left += i; | |
| } | |
| /* vamos comprobando y restando a la izquierda y sumando a la dcha */ |
| set nocompatible | |
| filetype off | |
| set rtp+=~/.vim/bundle/vundle | |
| call vundle#rc() | |
| Bundle 'gmarik/vundle' | |
| Bundle 'tpope/vim-fugitive' | |
| Bundle 'kevinw/pyflakes' | |
| Bundle 'kevinw/pyflakes-vim' | |
| Bundle 'nvie/vim-flake8' | |
| Bundle 'kien/ctrlp.vim' |
| # 23 8-18 * * 1-5 curl -L tenwar.com/watching | ruby >/dev/null 2>&1 | |
| require('Open3') | |
| if rand(1...10) > 9 | |
| osa_script = <<'End' | |
| activate application "Safari" | |
| delay 2 |
| curl "http://www.ardemagazine.com/arde/wp-content/uploads/2014/04/1sNE1eX.jpg" > ~/Downloads/caged.jpg | |
| osascript -e "tell application \"System Events\" to set picture of every desktop to \"~/Downloads/caged.jpg\"" |
| (defn create-power | |
| "Takes a positive power-of implementation and returns a function that uses | |
| it plus the logic for y==0 and y<0" | |
| [implementation] | |
| (fn [x y] | |
| (cond | |
| (> y 0) (implementation x y) | |
| (< y 0) (/ 1 (implementation x (Math/abs y))) | |
| :else 1))) |
Subject: CS books Date: Tue, 25 Feb 2014 14:19:21 -0500
Here's a random list of books I've read, that I believe will give you an edge and will fill some CS gaps.
| # -*- coding: utf-8 -*- | |
| # <nbformat>3.0</nbformat> | |
| # <rawcell> | |
| # How to filter Python dictionaries, the right way. | |
| # | |
| # Expected output: | |
| # Original list lookup => 100 loops, best of 3: 9.82 ms per loop | |
| # Dict trick lookup => 1000 loops, best of 3: 315 us per loop |
| a_range = range(12) | |
| a_range[-2:] = range(10,20) | |
| assert a_range == range(20) | |
| a_range[10:11] = range(10)[::-1] | |
| a_range[20:] = [] | |
| assert a_range == range(10) + range(10)[::-1] | |
| keywords = "apple, pear, banana, lemon and orange" | |
| keywords = keywords.split(', ') |