Skip to content

Commit 161613c

Browse files
schochasticsschochastics
committed
removed unnecessary export
1 parent cb09599 commit 161613c

File tree

3 files changed

+0
-126
lines changed

3 files changed

+0
-126
lines changed

‎R/RcppExports.R

Lines changed: 0 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -48,34 +48,6 @@ dendrogram_spread <- function(graph, starts, y, leaf, repel, pad, ratio) {
4848
.Call('_ggraph_dendrogram_spread', PACKAGE = 'ggraph', graph, starts, y, leaf, repel, pad, ratio)
4949
}
5050

51-
euclidean_distance <- function(P, Q) {
52-
.Call('_ggraph_euclidean_distance', PACKAGE = 'ggraph', P, Q)
53-
}
54-
55-
angle_compatibility <- function(P, Q) {
56-
.Call('_ggraph_angle_compatibility', PACKAGE = 'ggraph', P, Q)
57-
}
58-
59-
scale_compatibility <- function(P, Q) {
60-
.Call('_ggraph_scale_compatibility', PACKAGE = 'ggraph', P, Q)
61-
}
62-
63-
position_compatibility <- function(P, Q) {
64-
.Call('_ggraph_position_compatibility', PACKAGE = 'ggraph', P, Q)
65-
}
66-
67-
visibility_compatibility <- function(P, Q) {
68-
.Call('_ggraph_visibility_compatibility', PACKAGE = 'ggraph', P, Q)
69-
}
70-
71-
compatibility_score <- function(P, Q) {
72-
.Call('_ggraph_compatibility_score', PACKAGE = 'ggraph', P, Q)
73-
}
74-
75-
compute_compatibility_lists <- function(edges_xy, compatibility_threshold) {
76-
.Call('_ggraph_compute_compatibility_lists', PACKAGE = 'ggraph', edges_xy, compatibility_threshold)
77-
}
78-
7951
force_bundle_iter <- function(edges_xy, elist, K, C, P, P_rate, S, I, I_rate, compatibility_threshold, eps) {
8052
.Call('_ggraph_force_bundle_iter', PACKAGE = 'ggraph', edges_xy, elist, K, C, P, P_rate, S, I, I_rate, compatibility_threshold, eps)
8153
}

‎src/RcppExports.cpp

Lines changed: 0 additions & 91 deletions
Original file line numberDiff line numberDiff line change
@@ -50,90 +50,6 @@ BEGIN_RCPP
5050
return rcpp_result_gen;
5151
END_RCPP
5252
}
53-
// euclidean_distance
54-
double euclidean_distance(NumericVector P, NumericVector Q);
55-
RcppExport SEXP _ggraph_euclidean_distance(SEXP PSEXP, SEXP QSEXP) {
56-
BEGIN_RCPP
57-
Rcpp::RObject rcpp_result_gen;
58-
Rcpp::RNGScope rcpp_rngScope_gen;
59-
Rcpp::traits::input_parameter< NumericVector >::type P(PSEXP);
60-
Rcpp::traits::input_parameter< NumericVector >::type Q(QSEXP);
61-
rcpp_result_gen = Rcpp::wrap(euclidean_distance(P, Q));
62-
return rcpp_result_gen;
63-
END_RCPP
64-
}
65-
// angle_compatibility
66-
double angle_compatibility(NumericVector P, NumericVector Q);
67-
RcppExport SEXP _ggraph_angle_compatibility(SEXP PSEXP, SEXP QSEXP) {
68-
BEGIN_RCPP
69-
Rcpp::RObject rcpp_result_gen;
70-
Rcpp::RNGScope rcpp_rngScope_gen;
71-
Rcpp::traits::input_parameter< NumericVector >::type P(PSEXP);
72-
Rcpp::traits::input_parameter< NumericVector >::type Q(QSEXP);
73-
rcpp_result_gen = Rcpp::wrap(angle_compatibility(P, Q));
74-
return rcpp_result_gen;
75-
END_RCPP
76-
}
77-
// scale_compatibility
78-
double scale_compatibility(NumericVector P, NumericVector Q);
79-
RcppExport SEXP _ggraph_scale_compatibility(SEXP PSEXP, SEXP QSEXP) {
80-
BEGIN_RCPP
81-
Rcpp::RObject rcpp_result_gen;
82-
Rcpp::RNGScope rcpp_rngScope_gen;
83-
Rcpp::traits::input_parameter< NumericVector >::type P(PSEXP);
84-
Rcpp::traits::input_parameter< NumericVector >::type Q(QSEXP);
85-
rcpp_result_gen = Rcpp::wrap(scale_compatibility(P, Q));
86-
return rcpp_result_gen;
87-
END_RCPP
88-
}
89-
// position_compatibility
90-
double position_compatibility(NumericVector P, NumericVector Q);
91-
RcppExport SEXP _ggraph_position_compatibility(SEXP PSEXP, SEXP QSEXP) {
92-
BEGIN_RCPP
93-
Rcpp::RObject rcpp_result_gen;
94-
Rcpp::RNGScope rcpp_rngScope_gen;
95-
Rcpp::traits::input_parameter< NumericVector >::type P(PSEXP);
96-
Rcpp::traits::input_parameter< NumericVector >::type Q(QSEXP);
97-
rcpp_result_gen = Rcpp::wrap(position_compatibility(P, Q));
98-
return rcpp_result_gen;
99-
END_RCPP
100-
}
101-
// visibility_compatibility
102-
double visibility_compatibility(NumericVector P, NumericVector Q);
103-
RcppExport SEXP _ggraph_visibility_compatibility(SEXP PSEXP, SEXP QSEXP) {
104-
BEGIN_RCPP
105-
Rcpp::RObject rcpp_result_gen;
106-
Rcpp::RNGScope rcpp_rngScope_gen;
107-
Rcpp::traits::input_parameter< NumericVector >::type P(PSEXP);
108-
Rcpp::traits::input_parameter< NumericVector >::type Q(QSEXP);
109-
rcpp_result_gen = Rcpp::wrap(visibility_compatibility(P, Q));
110-
return rcpp_result_gen;
111-
END_RCPP
112-
}
113-
// compatibility_score
114-
double compatibility_score(NumericVector P, NumericVector Q);
115-
RcppExport SEXP _ggraph_compatibility_score(SEXP PSEXP, SEXP QSEXP) {
116-
BEGIN_RCPP
117-
Rcpp::RObject rcpp_result_gen;
118-
Rcpp::RNGScope rcpp_rngScope_gen;
119-
Rcpp::traits::input_parameter< NumericVector >::type P(PSEXP);
120-
Rcpp::traits::input_parameter< NumericVector >::type Q(QSEXP);
121-
rcpp_result_gen = Rcpp::wrap(compatibility_score(P, Q));
122-
return rcpp_result_gen;
123-
END_RCPP
124-
}
125-
// compute_compatibility_lists
126-
List compute_compatibility_lists(NumericMatrix edges_xy, double compatibility_threshold);
127-
RcppExport SEXP _ggraph_compute_compatibility_lists(SEXP edges_xySEXP, SEXP compatibility_thresholdSEXP) {
128-
BEGIN_RCPP
129-
Rcpp::RObject rcpp_result_gen;
130-
Rcpp::RNGScope rcpp_rngScope_gen;
131-
Rcpp::traits::input_parameter< NumericMatrix >::type edges_xy(edges_xySEXP);
132-
Rcpp::traits::input_parameter< double >::type compatibility_threshold(compatibility_thresholdSEXP);
133-
rcpp_result_gen = Rcpp::wrap(compute_compatibility_lists(edges_xy, compatibility_threshold));
134-
return rcpp_result_gen;
135-
END_RCPP
136-
}
13753
// force_bundle_iter
13854
List force_bundle_iter(NumericMatrix edges_xy, List elist, double K, int C, int P, int P_rate, double S, int I, double I_rate, double compatibility_threshold, double eps);
13955
RcppExport SEXP _ggraph_force_bundle_iter(SEXP edges_xySEXP, SEXP elistSEXP, SEXP KSEXP, SEXP CSEXP, SEXP PSEXP, SEXP P_rateSEXP, SEXP SSEXP, SEXP ISEXP, SEXP I_rateSEXP, SEXP compatibility_thresholdSEXP, SEXP epsSEXP) {
@@ -237,13 +153,6 @@ static const R_CallMethodDef CallEntries[] = {
237153
{"_ggraph_pack", (DL_FUNC) &_ggraph_pack, 1},
238154
{"_ggraph_circlePackLayout", (DL_FUNC) &_ggraph_circlePackLayout, 2},
239155
{"_ggraph_dendrogram_spread", (DL_FUNC) &_ggraph_dendrogram_spread, 7},
240-
{"_ggraph_euclidean_distance", (DL_FUNC) &_ggraph_euclidean_distance, 2},
241-
{"_ggraph_angle_compatibility", (DL_FUNC) &_ggraph_angle_compatibility, 2},
242-
{"_ggraph_scale_compatibility", (DL_FUNC) &_ggraph_scale_compatibility, 2},
243-
{"_ggraph_position_compatibility", (DL_FUNC) &_ggraph_position_compatibility, 2},
244-
{"_ggraph_visibility_compatibility", (DL_FUNC) &_ggraph_visibility_compatibility, 2},
245-
{"_ggraph_compatibility_score", (DL_FUNC) &_ggraph_compatibility_score, 2},
246-
{"_ggraph_compute_compatibility_lists", (DL_FUNC) &_ggraph_compute_compatibility_lists, 2},
247156
{"_ggraph_force_bundle_iter", (DL_FUNC) &_ggraph_force_bundle_iter, 11},
248157
{"_ggraph_partitionTree", (DL_FUNC) &_ggraph_partitionTree, 4},
249158
{"_ggraph_cut_lines", (DL_FUNC) &_ggraph_cut_lines, 9},

‎src/forceBundle.cpp

Lines changed: 0 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,6 @@
55
#include <Rcpp.h>
66
using namespace Rcpp;
77

8-
// [[Rcpp::export]]
98
double euclidean_distance(NumericVector P, NumericVector Q) {
109
return sqrt((P[0] - Q[0]) * (P[0] - Q[0]) + (P[1] - Q[1]) * (P[1] - Q[1]));
1110
}
@@ -124,7 +123,6 @@ List update_edge_divisions(List elist, int P) {
124123
return elist;
125124
}
126125

127-
// [[Rcpp::export]]
128126
double angle_compatibility(NumericVector P, NumericVector Q) {
129127
NumericVector P_source = {P[0], P[1]};
130128
NumericVector P_target = {P[2], P[3]};
@@ -138,7 +136,6 @@ double angle_compatibility(NumericVector P, NumericVector Q) {
138136
return std::abs(frac_PQ);
139137
}
140138

141-
// [[Rcpp::export]]
142139
double scale_compatibility(NumericVector P, NumericVector Q) {
143140
NumericVector P_source = {P[0], P[1]};
144141
NumericVector P_target = {P[2], P[3]};
@@ -152,7 +149,6 @@ double scale_compatibility(NumericVector P, NumericVector Q) {
152149
return 2.0 / (lavg / std::min(euc_P, euc_Q) + std::max(euc_P, euc_Q) / lavg);
153150
}
154151

155-
// [[Rcpp::export]]
156152
double position_compatibility(NumericVector P, NumericVector Q) {
157153
NumericVector P_source = {P[0], P[1]};
158154
NumericVector P_target = {P[2], P[3]};
@@ -174,12 +170,10 @@ double position_compatibility(NumericVector P, NumericVector Q) {
174170
return lavg / (lavg + euc_mid);
175171
}
176172

177-
// [[Rcpp::export]]
178173
double visibility_compatibility(NumericVector P, NumericVector Q) {
179174
return std::min(edge_visibility(P, Q), edge_visibility(Q, P));
180175
}
181176

182-
// [[Rcpp::export]]
183177
double compatibility_score(NumericVector P, NumericVector Q) {
184178
return angle_compatibility(P, Q) * scale_compatibility(P, Q) *
185179
position_compatibility(P, Q) * visibility_compatibility(P, Q);
@@ -190,7 +184,6 @@ bool are_compatible(NumericVector P, NumericVector Q,
190184
return compatibility_score(P, Q) >= compatibility_threshold;
191185
}
192186

193-
// [[Rcpp::export]]
194187
List compute_compatibility_lists(NumericMatrix edges_xy,
195188
double compatibility_threshold) {
196189
int m = edges_xy.rows();

0 commit comments

Comments
 (0)