6e5ee11ca95cd971984038cf65bae00d9c898707
galt
  Wed Jun 4 15:40:02 2014 -0700
Since we have git, it is easy to rename errabort.c to errAbort.c without losing any history.
diff --git src/jkOwnLib/fuzzyFind.c src/jkOwnLib/fuzzyFind.c
index 69a23c2..904446f 100644
--- src/jkOwnLib/fuzzyFind.c
+++ src/jkOwnLib/fuzzyFind.c
@@ -32,31 +32,31 @@
  * fruitless.  
  * 
  * The inexact extension is perhaps the trickiest part of the
  * algorithm.  It's implemented in expandLeft and expandRight.
  * In these the extension is first taken as far as it can go
  * exactly.  Then if four of the next five bases match it's
  * taken five bases further. Then a break is generated, and the
  * next significant match between the needle and haystack is
  * scanned for.
  */
 
 
 #include "common.h"
 #include "dnautil.h"
 #include "localmem.h"
-#include "errabort.h"
+#include "errAbort.h"
 #include "fuzzyFind.h"
 #include "obscure.h"
 
 /* ffMemory routines - 
  *    FuzzyFinder allocates memory internally from the
  *    following routines, which allocate blocks from the
  *    main allocator and then dole them out.
  *
  *    At the end of fuzzy-finding, the actual alignment
  *    is copied to more permanent memory, and all the
  *    blocks freed.  This saves from having to remember
  *    to free every little thing, and also is faster.
  *
  *    If memory can't be allocated this will throw
  *    back to the root of the fuzzy-finder system.