mdunsmuir

#                                                                                                                                                             
# This subclass of Hash is designed to search for the values associated                                                                                       
# with the two nearest Numeric keys to a given "key" argument *not*                                                                                           
# a member of the FindNeighborsHash, or the *single* value associated with                                                                                    
# an *existing* key.                                                                                                                                          
#                                                                                                                                                             
class FindNeighborsHash < Hash
  def []=(key, val)
    raise ArgumentE

mdunsmuir

filetype indent on " automatically indent
set expandtab      " tabs are spaces
set shiftwidth=2   " two space indent
set tabstop=2

set ruler " display line number and position

"This unsets the "last search pattern" register by hitting return
nnoremap <CR> :noh<CR><CR>