diff --git a/.Rbuildignore b/.Rbuildignore
index a1f1e82..c6882b9 100644
--- a/.Rbuildignore
+++ b/.Rbuildignore
@@ -1,8 +1,9 @@
 ^\.github$
 ^\.gitignore
 ^\.lintr
-^\.*\.Rproj$
+\.Rproj$
 ^\.Rproj\.user$
 ^\.devcontainer$
 README.md
+^NEWS\.[0-9]+$
 ^codecov\.yml$
diff --git a/R/cache.R b/R/cache.R
index 142960a..41a3464 100644
--- a/R/cache.R
+++ b/R/cache.R
@@ -161,9 +161,9 @@ print.cache<- function(x, all.names=FALSE, pattern, ...){
 #' @param ... passed to [hashmap()]
 #'
 #' @details
-#' The result of relative expensive operations [hashmap()], [ramsort()],
-#'   [ramsortorder()], and [ramorder()] can be stored in a cache in order to
-#'   avoid multiple excutions. Unless in very specific situations, the
+#' The result of relative expensive operations [hashmap()], [bit::ramsort()],
+#'   [bit::ramsortorder()], and [bit::ramorder()] can be stored in a cache in
+#'   order to avoid multiple excutions. Unless in very specific situations, the
 #'   recommended method is `hashsortorder` only.
 #'
 #' @note
diff --git a/man/hashcache.Rd b/man/hashcache.Rd
index 964161d..41ae9d8 100644
--- a/man/hashcache.Rd
+++ b/man/hashcache.Rd
@@ -42,9 +42,9 @@ and previously cached results.
 Functions to create cache that accelerates many operations
 }
 \details{
-The result of relative expensive operations \code{\link[=hashmap]{hashmap()}}, \code{\link[=ramsort]{ramsort()}},
-\code{\link[=ramsortorder]{ramsortorder()}}, and \code{\link[=ramorder]{ramorder()}} can be stored in a cache in order to
-avoid multiple excutions. Unless in very specific situations, the
+The result of relative expensive operations \code{\link[=hashmap]{hashmap()}}, \code{\link[bit:Sorting]{bit::ramsort()}},
+\code{\link[bit:Sorting]{bit::ramsortorder()}}, and \code{\link[bit:Sorting]{bit::ramorder()}} can be stored in a cache in
+order to avoid multiple excutions. Unless in very specific situations, the
 recommended method is \code{hashsortorder} only.
 }
 \note{