Update package documentation in subpackages

Bitarray, hashmap, threadsafe, and avl.

Author: alexandercampbell-wk

bitarray/interface.go

@@ -22,7 +22,6 @@ be done in a single clock cycle (not counting the time it takes to convert)
 the resultant array back into integers).  When Go implements a command
 to get trailing zeroes, the reconversion back into integers should be much faster.
 */
-
 package bitarray
 
 // BitArray represents a structure that can be used to

hashmap/fastinteger/hashmap.go

@@ -18,7 +18,6 @@
 //
 // This performance could be further enhanced by using a
 // better probing technique.
-
 package fastinteger
 
 const ratio = .75 // ratio sets the capacity the hashmap has to be at before it expands

threadsafe/err/error.go

@@ -20,7 +20,6 @@ I found myself needing a lock to protect writing to a common error interface
 from multiple go routines (channels are great but slow).  This just makes
 that process more convenient.
 */
-
 package err
 
 import "sync"

tree/avl/avl.go

@@ -15,9 +15,11 @@ limitations under the License.
 */
 
 /*
-The immutable AVL tree can be used as the foundation for many functional
-data types.  Combined with a B+ tree, you can make an immutable index which
-serves as the backbone for many different kinds of key/value stores.
+Package avl includes an immutable AVL tree.
+
+AVL trees can be used as the foundation for many functional data types.
+Combined with a B+ tree, you can make an immutable index which serves as the
+backbone for many different kinds of key/value stores.
 
 Time complexities:
 Space: O(n)