Scott Pierce ddrscott

Vim: pushing built-in features beyond their limits

The situation

Searching can be an efficient way to navigate the current buffer.

The first search commands we learn are usually / and ?. These are seriously cool, especially with the incsearch option enabled which lets us keep typing to refine our search pattern. / and ? really shine when all we want is to jump to something we already have our eyeballs on but they are not fit for every situation:

when we want to search something that's not directly there, those two commands can make us lose context very quickly,
when we need to compare the matches.

SSH Tunneling

Problem

You want to query a DB and get a result set, but you don't have access to that DB directly from your localhost.

Bad solution A: Cry
Bad solution B: Ask someone who does have access to run your query for you
Bad solution C: ssh into a box that has access, then psql into the DB

	# Modify this file accordingly for your specific requirement.
	# http://www.thegeekstuff.com
	# 1. Delete all existing rules
	iptables -F

	# 2. Set default chain policies
	iptables -P INPUT DROP
	iptables -P FORWARD DROP
	iptables -P OUTPUT DROP

	<!doctype html>
	<html ng-app="Demo" ng-controller="AppController">
	<head>
	<meta charset="utf-8" />

	<title>
	Lazy Loading Images With AngularJS
	</title>

	<style type="text/css">

	'use strict';

	if (!document.elementsFromPoint) {
	document.elementsFromPoint = elementsFromPoint;
	}

	function elementsFromPoint(x, y) {
	var parents = [];
	var parent = void 0;
	do {

	# Load this file in your `.pryrc`
	#
	# load 'path/to/pry_sql.rb'
	#
	# See how to use this by running: `psql --help`
	# Originally created for Rails 3.
	# Updated to Rails 6
	module Rails
	class DBConsole
	APP_PATH = Rails.root.join('config', 'application')

	alias λ lambda

	sadd = λ {\|ns, a\| [*ns, a].sort }
	hsort = λ {\|h\| Hash[h.sort] }
	hadd = λ {\|h, n, g\| h.merge(g => sadd.(h[g], n)) }
	school = λ {\|gs\| School.new(gs) }

	School = Struct.new(:gs) do
	define_method :add, λ {\|n, g\| (school . (hsort . (hadd . (to_hash, n, g)))) }
	define_method :to_hash, λ {\| \| gs \|\| {} }

	hardstatus alwayslastline
	hardstatus string '%{= kG}[ %{G}%H %{g}][%= %{= kw}%?%-Lw%?%{r}(%{W}%n*%f%t%?(%u)%?%{r})%{w}%?%+Lw%?%?%= %{g}][%{B} %m-%d %{W}%c %{g}]'