Home
last modified time | relevance | path

Searched refs:edges_added (Results 1 – 20 of 20) sorted by relevance

/dports/graphics/R-cran-DiagrammeR/DiagrammeR/R/
H A Dadd_reverse_edges_ws.R133 edges_added <- edges_graph_2 - edges_graph_1 functionVar
140 if (nrow(edge_aes_tbl) < edges_added) {
142 edge_aes$index__ <- 1:edges_added
161 if (nrow(edge_data_tbl) < edges_added) {
163 edge_data$index__ <- 1:edges_added
182 graph$edges_df[1:(nrow(graph$edges_df) - edges_added), ],
184 graph$edges_df[(nrow(graph$edges_df) - edges_added + 1):nrow(graph$edges_df), ],
193 graph$edges_df[1:(nrow(graph$edges_df) - edges_added), ],
195 graph$edges_df[(nrow(graph$edges_df) - edges_added + 1):nrow(graph$edges_df), ],
209 d_e = edges_added)
H A Dadd_n_nodes_ws.R235 edges_added <- edges_graph_2 - edges_graph_1 functionVar
243 utils::tail(edges_added) %>%
302 if (nrow(edge_aes_tbl) < edges_added) {
304 edge_aes$index__ <- 1:edges_added
323 if (nrow(edge_data_tbl) < edges_added) {
325 edge_data$index__ <- 1:edges_added
434 d_e = edges_added)
H A Dadd_node.R307 edges_added <- edges_in_graph_2 - edges_in_graph functionVar
313 graph$last_edge <- graph$last_edge + edges_added
452 edges_added <- edges_in_graph_2 - edges_in_graph
458 graph$last_edge <- graph$last_edge + edges_added
614 edges_added <- edges_in_graph_2 - edges_in_graph
620 graph$last_edge <- graph$last_edge + edges_added
H A Dadd_full_graph.R420 edges_added <- edges_graph_2 - edges_graph_1 functionVar
433 d_e = edges_added)
459 edges_added <- edges_graph_2 - edges_graph_1
472 d_e = edges_added)
H A Dadd_edge_df.R90 edges_added <- edges_graph_2 - edges_graph_1 functionVar
105 d_e = edges_added)
H A Dadd_forward_edges_ws.R127 edges_added <- edges_graph_2 - edges_graph_1 functionVar
139 d_e = edges_added)
H A Dtransform_to_complement_graph.R110 edges_added <- edges_graph_2 - edges_graph_1 functionVar
123 d_e = edges_added)
H A Dfully_connect_nodes_ws.R165 edges_added <- edges_graph_2 - edges_graph_1 functionVar
177 d_e = edges_added)
H A Dtransform_to_subgraph_ws.R175 edges_added <- edges_graph_2 - edges_graph_1 functionVar
188 d_e = edges_added)
H A Dadd_edges_w_string.R171 edges_added <- edges_graph_2 - edges_graph_1 functionVar
193 d_e = edges_added)
H A Dadd_node_clones_ws.R253 edges_added <- edges_graph_2 - edges_graph_1 functionVar
272 d_e = edges_added)
H A Dcombine_graphs.R212 edges_added <- edges_graph_2 - edges_graph_1 functionVar
225 d_e = edges_added)
H A Dadd_edges_from_table.R311 edges_added <- edges_graph_2 - edges_graph_1 functionVar
325 d_e = edges_added)
/dports/devel/git-p4/git-2.34.1/
H A Dgraph.c253 int edges_added;
372 graph->edges_added = 0;
561 graph->edges_added = graph->num_parents + graph->merge_layout - 2;
578 graph->edges_added = -1;
624 graph->prev_edges_added = graph->edges_added;
625 graph->edges_added = 0;
1014 } else if (seen_this && (graph->edges_added > 1)) {
1016 } else if (seen_this && (graph->edges_added == 1)) {
1102 if (graph->edges_added > 0 || j < graph->num_parents - 1)
1109 if (graph->edges_added == 0)
[all …]
/dports/devel/git-svn/git-2.34.1/
H A Dgraph.c253 int edges_added; member
372 graph->edges_added = 0; in graph_init()
561 graph->edges_added = graph->num_parents + graph->merge_layout - 2; in graph_insert_into_new_columns()
578 graph->edges_added = -1; in graph_insert_into_new_columns()
624 graph->prev_edges_added = graph->edges_added; in graph_update_columns()
625 graph->edges_added = 0; in graph_update_columns()
1014 } else if (seen_this && (graph->edges_added > 1)) { in graph_output_commit_line()
1016 } else if (seen_this && (graph->edges_added == 1)) { in graph_output_commit_line()
1102 if (graph->edges_added > 0 || j < graph->num_parents - 1) in graph_output_post_merge_line()
1109 if (graph->edges_added == 0) in graph_output_post_merge_line()
[all …]
/dports/devel/git-gui/git-2.34.1/
H A Dgraph.c253 int edges_added; member
372 graph->edges_added = 0; in graph_init()
561 graph->edges_added = graph->num_parents + graph->merge_layout - 2; in graph_insert_into_new_columns()
578 graph->edges_added = -1; in graph_insert_into_new_columns()
624 graph->prev_edges_added = graph->edges_added; in graph_update_columns()
625 graph->edges_added = 0; in graph_update_columns()
1014 } else if (seen_this && (graph->edges_added > 1)) { in graph_output_commit_line()
1016 } else if (seen_this && (graph->edges_added == 1)) { in graph_output_commit_line()
1102 if (graph->edges_added > 0 || j < graph->num_parents - 1) in graph_output_post_merge_line()
1109 if (graph->edges_added == 0) in graph_output_post_merge_line()
[all …]
/dports/devel/git/git-2.34.1/
H A Dgraph.c253 int edges_added; member
372 graph->edges_added = 0; in graph_init()
561 graph->edges_added = graph->num_parents + graph->merge_layout - 2; in graph_insert_into_new_columns()
578 graph->edges_added = -1; in graph_insert_into_new_columns()
624 graph->prev_edges_added = graph->edges_added; in graph_update_columns()
625 graph->edges_added = 0; in graph_update_columns()
1014 } else if (seen_this && (graph->edges_added > 1)) { in graph_output_commit_line()
1016 } else if (seen_this && (graph->edges_added == 1)) { in graph_output_commit_line()
1102 if (graph->edges_added > 0 || j < graph->num_parents - 1) in graph_output_post_merge_line()
1109 if (graph->edges_added == 0) in graph_output_post_merge_line()
[all …]
/dports/devel/git-cvs/git-2.34.1/
H A Dgraph.c253 int edges_added; member
372 graph->edges_added = 0; in graph_init()
561 graph->edges_added = graph->num_parents + graph->merge_layout - 2; in graph_insert_into_new_columns()
578 graph->edges_added = -1; in graph_insert_into_new_columns()
624 graph->prev_edges_added = graph->edges_added; in graph_update_columns()
625 graph->edges_added = 0; in graph_update_columns()
1014 } else if (seen_this && (graph->edges_added > 1)) { in graph_output_commit_line()
1016 } else if (seen_this && (graph->edges_added == 1)) { in graph_output_commit_line()
1102 if (graph->edges_added > 0 || j < graph->num_parents - 1) in graph_output_post_merge_line()
1109 if (graph->edges_added == 0) in graph_output_post_merge_line()
[all …]
/dports/devel/cgit/cgit-1.2.3/git/
H A Dgraph.c253 int edges_added; member
372 graph->edges_added = 0; in graph_init()
561 graph->edges_added = graph->num_parents + graph->merge_layout - 2; in graph_insert_into_new_columns()
578 graph->edges_added = -1; in graph_insert_into_new_columns()
624 graph->prev_edges_added = graph->edges_added; in graph_update_columns()
625 graph->edges_added = 0; in graph_update_columns()
1014 } else if (seen_this && (graph->edges_added > 1)) { in graph_output_commit_line()
1016 } else if (seen_this && (graph->edges_added == 1)) { in graph_output_commit_line()
1102 if (graph->edges_added > 0 || j < graph->num_parents - 1) in graph_output_post_merge_line()
1109 if (graph->edges_added == 0) in graph_output_post_merge_line()
[all …]
/dports/textproc/py-nltk/nltk-3.4.1/nltk/parse/
H A Dchart.py1479 edges_added = True
1480 while edges_added:
1481 edges_added = False
1484 edges_added = len(new_edges)
1623 edges_added = 1
1624 while edges_added > 0:
1625 edges_added = 0
1629 edges_added += 1