Corrected misplaced docstrings and type hints (found by eastwood).

src/loom/alg.clj

@@ -545,9 +545,10 @@ can use these functions."
                            nbrs)]
               (recur g src target heur q explored)))))
 
-(defn astar-dist [g src target heur]
+(defn astar-dist
   "Return the length of the shortest path between src and target using
     the A* algorithm"
+  [g src target heur]
   (let [path (astar-path g src target heur)
         dist (reduce (fn [c [u v]]
                        (if (nil? v)

src/loom/alg_generic.clj

@@ -404,17 +404,19 @@
 
 (def ^Long bits-per-long (long (Long/SIZE)))
 
-(defn ^Long bm-longs [bits]
+(defn ^Long bm-longs
   "Return the number of longs required to store bits count bits in a bitmap."
+  [bits]
   (long (Math/ceil (/ bits bits-per-long))))
 
-(defn ^longs bm-new []
+(defn bm-new
   "Create new empty bitmap."
+  ^longs []
   (long-array 1))
 
-(defn ^longs bm-set
-  [^longs bitmap idx]
+(defn bm-set
   "Set boolean state of bit in 'bitmap at 'idx to true."
+  ^longs [^longs bitmap idx]
   (let [size (max (count bitmap) (bm-longs (inc idx)))
         new-bitmap (Arrays/copyOf bitmap ^Long size)
         chunk (quot idx bits-per-long)
@@ -436,9 +438,9 @@
           masked-value (bit-and value mask)]
       (not (zero? masked-value)))))
 
-(defn ^longs bm-or
+(defn bm-or
   "Logically OR 'bitmaps together."
-  [& bitmaps]
+  ^longs [& bitmaps]
   (if (empty? bitmaps)
     (bm-new)
     (let [size (apply max (map count bitmaps))