refactor: {lifecycle} instead of current deprecations

NAMESPACE

@@ -935,7 +935,6 @@ importFrom(utils,capture.output)
 importFrom(utils,edit)
 importFrom(utils,head)
 importFrom(utils,packageDescription)
-importFrom(utils,packageName)
 importFrom(utils,read.table)
 importFrom(utils,setTxtProgressBar)
 importFrom(utils,tail)

R/adjacency.R

@@ -1,4 +1,19 @@
 
+#' Create graphs from adjacency matrices
+#'
+#' @description
+#' `r lifecycle::badge("deprecated")`
+#'
+#' `graph.adjacency()` was renamed to `graph_from_adjacency_matrix()` to create a more
+#' consistent API.
+#' @inheritParams graph_from_adjacency_matrix
+#' @keywords internal
+#' @export
+graph.adjacency <- function(adjmatrix , mode = c("directed","undirected","max","min","upper","lower","plus") , weighted = NULL , diag = TRUE , add.colnames = NULL , add.rownames = NA) { # nocov start
+   lifecycle::deprecate_soft("1.6.0", "graph.adjacency()", "graph_from_adjacency_matrix()")
+   graph_from_adjacency_matrix(adjmatrix = adjmatrix, mode = mode, weighted = weighted, diag = diag, add.colnames = add.colnames, add.rownames = add.rownames)
+} # nocov end
+
 ## ----------------------------------------------------------------
 ##
 ##   IGraph R package
@@ -276,7 +291,6 @@ graph.adjacency.sparse <- function(adjmatrix, mode, weighted = NULL, diag = TRUE
 #' undirected graph will be created, `A(i,j)+A(j,i)` gives the edge
 #' weights.} }
 #'
-#' @aliases graph.adjacency
 #' @param adjmatrix A square adjacency matrix. From igraph version 0.5.1 this
 #'   can be a sparse matrix created with the `Matrix` package.
 #' @param mode Character scalar, specifies how igraph should interpret the
@@ -455,3 +469,4 @@ is_symmetric <- function(x) {
 #' @family adjacency
 #' @export
 from_adjacency <- function(...) constructor_spec(graph_from_adjacency_matrix, ...)
+#' @export graph.adjacency

R/assortativity.R

@@ -1,4 +1,34 @@
 
+#' Assortativity coefficient
+#'
+#' @description
+#' `r lifecycle::badge("deprecated")`
+#'
+#' `assortativity.nominal()` was renamed to `assortativity_nominal()` to create a more
+#' consistent API.
+#' @inheritParams assortativity_nominal
+#' @keywords internal
+#' @export
+assortativity.nominal <- function(graph , types , directed = TRUE) { # nocov start
+   lifecycle::deprecate_soft("1.6.0", "assortativity.nominal()", "assortativity_nominal()")
+   assortativity_nominal(graph = graph, types = types, directed = directed)
+} # nocov end
+
+#' Assortativity coefficient
+#'
+#' @description
+#' `r lifecycle::badge("deprecated")`
+#'
+#' `assortativity.degree()` was renamed to `assortativity_degree()` to create a more
+#' consistent API.
+#' @inheritParams assortativity_degree
+#' @keywords internal
+#' @export
+assortativity.degree <- function(graph , directed = TRUE) { # nocov start
+   lifecycle::deprecate_soft("1.6.0", "assortativity.degree()", "assortativity_degree()")
+   assortativity_degree(graph = graph, directed = directed)
+} # nocov end
+
 ## -----------------------------------------------------------------------
 ##
 ##   IGraph R package
@@ -68,7 +98,7 @@
 #' `assortativity_degree()` uses vertex degree (minus one) as vertex values
 #' and calls `assortativity()`.
 #'
-#' @aliases assortativity assortativity.degree assortativity.nominal
+#' @aliases assortativity
 #' @param graph The input graph, it can be directed or undirected.
 #' @param values The vertex values, these can be arbitrary numeric values.
 #' @inheritParams rlang::args_dots_empty
@@ -170,3 +200,4 @@ assortativity_nominal <- assortativity_nominal_impl
 #' @rdname assortativity
 #' @export
 assortativity_degree <- assortativity_degree_impl
+#' @export assortativity.degree