refactor: make_empty_graph() is now fully auto-generated

Author: szhorvat

R/make.R

@@ -698,25 +698,7 @@ undirected_graph <- function(...) constructor_spec(make_undirected_graph, ...)
 #' @examples
 #' make_empty_graph(n = 10)
 #' make_empty_graph(n = 5, directed = FALSE)
-make_empty_graph <- function(n = 0, directed = TRUE) {
-  # Argument checks
-  if (is.null(n)) {
-    stop("number of vertices must be an integer")
-  }
-
-  n <- suppressWarnings(as.numeric(n))
-  if (is.na(n)) {
-    stop("number of vertices must be an integer")
-  }
-
-  directed <- as.logical(directed)
-
-  on.exit(.Call(R_igraph_finalizer))
-  # Function call
-  res <- .Call(R_igraph_empty, n, directed)
-
-  res
-}
+make_empty_graph <- empty_impl
 
 #' @rdname make_empty_graph
 #' @param ... Passed to `make_graph_empty`.

src/rinterface.c

@@ -162,37 +162,6 @@ SEXP R_igraph_vcount(SEXP graph) {
   return(r_result);
 }
 
-/*-------------------------------------------/
-/ igraph_empty_attrs                         /
-/-------------------------------------------*/
-SEXP R_igraph_empty_attrs(SEXP n, SEXP directed) {
-                                        /* Declarations */
-  igraph_t c_graph;
-  igraph_integer_t c_n;
-  igraph_bool_t c_directed;
-
-  SEXP graph;
-
-  SEXP r_result;
-                                        /* Convert input */
-  IGRAPH_R_CHECK_INT(n);
-  c_n = (igraph_integer_t) REAL(n)[0];
-  IGRAPH_R_CHECK_BOOL(directed);
-  c_directed = LOGICAL(directed)[0];
-                                        /* Call igraph */
-  IGRAPH_R_CHECK(igraph_empty_attrs(&c_graph, c_n, c_directed, 0));
-
-                                        /* Convert output */
-  IGRAPH_FINALLY(igraph_destroy, &c_graph);
-  PROTECT(graph=R_igraph_to_SEXP(&c_graph));
-  IGRAPH_I_DESTROY(&c_graph);
-  IGRAPH_FINALLY_CLEAN(1);
-  r_result = graph;
-
-  UNPROTECT(1);
-  return(r_result);
-}
-
 /*-------------------------------------------/
 / igraph_get_all_eids_between                /
 /-------------------------------------------*/