anchor.diff:  (defun hash-create (pairs &key (test #'equal))
     "Create a hash table with limited syntax:
   
  -    (hash `((\"name\" \"andrew\") (\"city\" \"santa cruz\")))
  -  
  -  which would otherwise be:
  -  
  -    (let ((hash (make-hash-table :test #'equal)))
  -      (setf (gethash \"name\" hash) \"andrew\")
  -      (setf (gethash \"city\" hash) \"santa cruz\")
  -      hash)
  -  
  -  yuck city."
  +     (hash `((\"name\" \"andrew\") (\"city\" \"santa cruz\")))
  +
  +   which would otherwise be:
  +
  +     (let ((hash (make-hash-table :test #'equal)))
  +       (setf (gethash \"name\" hash) \"andrew\")
  +       (setf (gethash \"city\" hash) \"santa cruz\")
  +       hash)
  +
  +   yuck city."
     (let ((hash (make-hash-table :test test)))
       (dolist (pair pairs)
         (setf (gethash (car pair) hash) (cadr pair)))
  
positive.code:   (let ((new-hash (make-hash-table :test test :size (hash-table-count hash))))
      (loop for k being the hash-keys of hash
            for v being the hash-values of hash do
            (setf (hash-get new-hash (list k)) (hash-get hash (list k))))
      new-hash))
  
  
negative.code:   "Extends hash-create syntax to make it nicer."
    `(hash-create (list ,@(loop for pair in pairs collect (list 'list (car pair) (cadr pair))))))
  
  (defun hget (obj path)
    "Allows you to specify a path to get values out of a hash/list object. For
     instance, if you did:
  
       (let ((myhash (hash '(\"lol\" '(3 4 5)))))
         (hget myhash '(\"lol\" 1)))
  
     which would return 4 (1st index of list stored under key 'lol of the hash
     table). Simplifies traversing responses from decoded JSON objects by about a
     trillion times."
    (let ((placeholder obj))
      (dolist (entry path)
        (setf placeholder (if (numberp entry)
  