Commit information:
Commit id: 1bbadd5e8118e5509eef035914aa8adebba604b7
Commit message:
fixed include statements in graohviz
Committed by Kasper Daniel Hansen <kasperdanielhansen at gmail.com>
Commit date: 2014-03-03T15:29:19-08:00
Commit id: 9a4b223568b7ed5c5146ccc21c48b9f1e66c41d3
Commit message:
updated NEWS
Committed by Kasper Daniel Hansen <kasperdanielhansen at gmail.com>
Commit date: 2014-03-03T15:30:41-08:00
Commit id: 3f3e2d33e7d802925296559b9a0d2e37f5a70fe9
Commit message:
Merge branch 'master' of github.com:kasperdanielhansen/Rgraphviz
Committed by Kasper Daniel Hansen <kasperdanielhansen at gmail.com>
Commit date: 2014-03-03T15:30:53-08:00
From: Bioconductor Git-SVN Bridge <bioc-sync@bioconductor.org>
git-svn-id: https://hedgehog.fhcrc.org/bioconductor/trunk/madman/Rpacks/Rgraphviz@86991 bc3139a8-67e5-0310-9ffc-ced21a209358
... | ... |
@@ -2,7 +2,7 @@ Package: Rgraphviz |
2 | 2 |
Title: Provides plotting capabilities for R graph objects |
3 | 3 |
Description: Interfaces R with the AT and T graphviz library for |
4 | 4 |
plotting R graph objects from the graph package. |
5 |
-Version: 2.7.0 |
|
5 |
+Version: 2.7.1 |
|
6 | 6 |
Author: Jeff Gentry, Li Long, Robert Gentleman, Seth Falcon, |
7 | 7 |
Florian Hahne, Deepayan Sarkar, Kasper Daniel Hansen |
8 | 8 |
Maintainer: Kasper Daniel Hansen <khansen@jhsph.edu> |
8 | 15 |
new file mode 100755 |
... | ... |
@@ -0,0 +1,21 @@ |
1 |
+#!/bin/bash -e |
|
2 |
+ |
|
3 |
+## Find all #include <XX> |
|
4 |
+grep -R "#include <" * > all_includes.txt |
|
5 |
+ |
|
6 |
+## Clean, and sort the include statements, so only the header remains |
|
7 |
+cut -f2 -d: all_includes.txt | sort | uniq | sed 's:.*#include <::' | sed 's:\.h>.*:.h:' | grep -v ">$" | grep -v "all_includes.txt" | sort -b > all_include_statements.txt |
|
8 |
+ |
|
9 |
+## Find all header files |
|
10 |
+find . -iname "*.h" | sed 's:.*/::' | sort | uniq | sort -b > all_header_files.txt |
|
11 |
+ |
|
12 |
+## Find intersection between header files and #include <XX>; these needs to be fixed |
|
13 |
+join all_include_statements.txt all_header_files.txt > need_fixes.txt |
|
14 |
+ |
|
15 |
+cat need_fixes.txt | while read include |
|
16 |
+do |
|
17 |
+ FIXFILES=`grep -R -l "#include <$include>" * | grep -v all_include` |
|
18 |
+ sed -i "_tmp" "s:#include <$include>:#include \"$include\":" $FIXFILES |
|
19 |
+done |
|
20 |
+ |
|
21 |
+ |
... | ... |
@@ -18,7 +18,7 @@ extern "C" { |
18 | 18 |
#ifndef BLOCKPATH_H |
19 | 19 |
#define BLOCKPATH_H |
20 | 20 |
|
21 |
-#include <circular.h> |
|
21 |
+#include "circular.h" |
|
22 | 22 |
|
23 | 23 |
extern nodelist_t *layout_block(Agraph_t * g, block_t * sn, double); |
24 | 24 |
extern int cmpNodeDegree(Dt_t *, Agnode_t **, Agnode_t **, Dtdisc_t *); |
... | ... |
@@ -18,8 +18,8 @@ extern "C" { |
18 | 18 |
#ifndef BLOCKTREE_H |
19 | 19 |
#define BLOCKTREE_H |
20 | 20 |
|
21 |
-#include <render.h> |
|
22 |
-#include <circular.h> |
|
21 |
+#include "render.h" |
|
22 |
+#include "circular.h" |
|
23 | 23 |
|
24 | 24 |
extern block_t *createBlocktree(Agraph_t * g, circ_state * state); |
25 | 25 |
extern void freeBlocktree(block_t *); |
... | ... |
@@ -12,9 +12,9 @@ |
12 | 12 |
*************************************************************************/ |
13 | 13 |
|
14 | 14 |
|
15 |
-#include <deglist.h> |
|
16 |
-#include <circular.h> |
|
17 |
-#include <blockpath.h> |
|
15 |
+#include "deglist.h" |
|
16 |
+#include "circular.h" |
|
17 |
+#include "blockpath.h" |
|
18 | 18 |
#include <assert.h> |
19 | 19 |
|
20 | 20 |
typedef struct { |
... | ... |
@@ -24,9 +24,9 @@ |
24 | 24 |
/* uses PRIVATE interface for NOTUSED */ |
25 | 25 |
#define FDP_PRIVATE 1 |
26 | 26 |
|
27 |
-#include <fdp.h> |
|
28 |
-#include <grid.h> |
|
29 |
-#include <macros.h> |
|
27 |
+#include "fdp.h" |
|
28 |
+#include "grid.h" |
|
29 |
+#include "macros.h" |
|
30 | 30 |
|
31 | 31 |
/* structure for maintaining a free list of cells */ |
32 | 32 |
typedef struct _block { |
... | ... |
@@ -27,9 +27,9 @@ Increase less between tries |
27 | 27 |
/* uses PRIVATE interface */ |
28 | 28 |
#define FDP_PRIVATE 1 |
29 | 29 |
|
30 |
-#include <xlayout.h> |
|
31 |
-#include <adjust.h> |
|
32 |
-#include <dbg.h> |
|
30 |
+#include "xlayout.h" |
|
31 |
+#include "adjust.h" |
|
32 |
+#include "dbg.h" |
|
33 | 33 |
#include <ctype.h> |
34 | 34 |
|
35 | 35 |
/* Use bbox based force function */ |
... | ... |
@@ -11,9 +11,9 @@ |
11 | 11 |
* Contributors: See CVS logs. Details at http://www.graphviz.org/ |
12 | 12 |
*************************************************************************/ |
13 | 13 |
|
14 |
-#include <multispline.h> |
|
15 |
-#include <delaunay.h> |
|
16 |
-#include <neatoprocs.h> |
|
14 |
+#include "multispline.h" |
|
15 |
+#include "delaunay.h" |
|
16 |
+#include "neatoprocs.h" |
|
17 | 17 |
#include <math.h> |
18 | 18 |
|
19 | 19 |
|
... | ... |
@@ -1238,7 +1238,7 @@ static void resetGraph(tgraph * g, int ncnt, int ecnt) |
1238 | 1238 |
#define PQVTYPE float |
1239 | 1239 |
|
1240 | 1240 |
#define PQ_TYPES |
1241 |
-#include <fPQ.h> |
|
1241 |
+#include "fPQ.h" |
|
1242 | 1242 |
#undef PQ_TYPES |
1243 | 1243 |
|
1244 | 1244 |
typedef struct { |
... | ... |
@@ -1251,7 +1251,7 @@ typedef struct { |
1251 | 1251 |
#define N_IDX(pq,n) ((PPQ*)pq)->idxs[n] |
1252 | 1252 |
|
1253 | 1253 |
#define PQ_CODE |
1254 |
-#include <fPQ.h> |
|
1254 |
+#include "fPQ.h" |
|
1255 | 1255 |
#undef PQ_CODE |
1256 | 1256 |
|
1257 | 1257 |
#define N_DAD(n) dad[n] |
... | ... |
@@ -19,10 +19,10 @@ |
19 | 19 |
#define DEBUG |
20 | 20 |
|
21 | 21 |
#include <stddef.h> |
22 |
-#include <maze.h> |
|
23 |
-#include <partition.h> |
|
24 |
-#include <memory.h> |
|
25 |
-#include <arith.h> |
|
22 |
+#include "maze.h" |
|
23 |
+#include "partition.h" |
|
24 |
+#include "memory.h" |
|
25 |
+#include "arith.h" |
|
26 | 26 |
/* #include <values.h> */ |
27 | 27 |
|
28 | 28 |
#define MARGIN 36; |
... | ... |
@@ -28,7 +28,7 @@ |
28 | 28 |
|
29 | 29 |
#define DEBUG |
30 | 30 |
#include <stddef.h> |
31 |
-#include <maze.h> |
|
31 |
+#include "maze.h" |
|
32 | 32 |
#include "fPQ.h" |
33 | 33 |
#include "memory.h" |
34 | 34 |
#include "geomprocs.h" |
... | ... |
@@ -512,7 +512,7 @@ addNodeEdges (sgraph* sg, cell* cp, snode* np) |
512 | 512 |
|
513 | 513 |
#ifdef DEBUG |
514 | 514 |
|
515 |
-#include <intset.h> |
|
515 |
+#include "intset.h" |
|
516 | 516 |
static char* bendToStr (bend b) |
517 | 517 |
{ |
518 | 518 |
char* s; |
... | ... |
@@ -1362,7 +1362,7 @@ orthoEdges (Agraph_t* g, int doLbls) |
1362 | 1362 |
} |
1363 | 1363 |
|
1364 | 1364 |
#ifdef DEBUG |
1365 |
-#include <arith.h> |
|
1365 |
+#include "arith.h" |
|
1366 | 1366 |
/* #include <values.h> */ |
1367 | 1367 |
#define TRANS 10 |
1368 | 1368 |
|
... | ... |
@@ -21,10 +21,10 @@ |
21 | 21 |
#include <stdio.h> |
22 | 22 |
#define __USE_ISOC99 |
23 | 23 |
#include <math.h> |
24 |
-#include <geom.h> |
|
25 |
-#include <logic.h> |
|
26 |
-#include <memory.h> |
|
27 |
-#include <trap.h> |
|
24 |
+#include "geom.h" |
|
25 |
+#include "logic.h" |
|
26 |
+#include "memory.h" |
|
27 |
+#include "trap.h" |
|
28 | 28 |
|
29 | 29 |
#ifdef WIN32 |
30 | 30 |
#define log2(x) (log(x)/log(2)) |
... | ... |
@@ -22,16 +22,16 @@ |
22 | 22 |
#include <values.h> |
23 | 23 |
#endif |
24 | 24 |
#endif |
25 |
-#include <sfdp.h> |
|
26 |
-#include <neato.h> |
|
27 |
-#include <adjust.h> |
|
28 |
-#include <pack.h> |
|
25 |
+#include "sfdp.h" |
|
26 |
+#include "neato.h" |
|
27 |
+#include "adjust.h" |
|
28 |
+#include "pack.h" |
|
29 | 29 |
#include <assert.h> |
30 | 30 |
#include <ctype.h> |
31 |
-#include <spring_electrical.h> |
|
32 |
-#include <overlap.h> |
|
33 |
-#include <uniform_stress.h> |
|
34 |
-#include <stress_model.h> |
|
31 |
+#include "spring_electrical.h" |
|
32 |
+#include "overlap.h" |
|
33 |
+#include "uniform_stress.h" |
|
34 |
+#include "stress_model.h" |
|
35 | 35 |
|
36 | 36 |
static void sfdp_init_edge(edge_t * e) |
37 | 37 |
{ |
... | ... |
@@ -24,9 +24,9 @@ |
24 | 24 |
* In particular, note that Verbose is declared but undefined. |
25 | 25 |
*/ |
26 | 26 |
#ifndef STANDALONE |
27 |
-#include <logic.h> |
|
28 |
-#include <arith.h> |
|
29 |
-#include <memory.h> |
|
27 |
+#include "logic.h" |
|
28 |
+#include "arith.h" |
|
29 |
+#include "memory.h" |
|
30 | 30 |
#endif |
31 | 31 |
|
32 | 32 |
#define real double |
... | ... |
@@ -17,10 +17,10 @@ |
17 | 17 |
|
18 | 18 |
|
19 | 19 |
#include <iostream> |
20 |
-#include <variable.h> |
|
21 |
-#include <constraint.h> |
|
22 |
-#include <generate-constraints.h> |
|
23 |
-#include <solve_VPSC.h> |
|
20 |
+#include "variable.h" |
|
21 |
+#include "constraint.h" |
|
22 |
+#include "generate-constraints.h" |
|
23 |
+#include "solve_VPSC.h" |
|
24 | 24 |
#include <cstdlib> |
25 | 25 |
#include <cassert> |
26 | 26 |
#include "csolve_VPSC.h" |
... | ... |
@@ -11,7 +11,7 @@ |
11 | 11 |
* Contributors: See CVS logs. Details at http://www.graphviz.org/ |
12 | 12 |
*************************************************************************/ |
13 | 13 |
|
14 |
-#include <xdot.h> |
|
14 |
+#include "xdot.h" |
|
15 | 15 |
#include <stdlib.h> |
16 | 16 |
#include <string.h> |
17 | 17 |
#include <ctype.h> |