forked from glennhickey/sg2vg
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sg2vgjson.cpp
187 lines (164 loc) · 5.06 KB
/
sg2vgjson.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
/*
* Copyright (C) 2015 by Glenn Hickey (hickey@soe.ucsc.edu)
*
* Released under the MIT license, see LICENSE.cactus
*/
#include <iostream>
#include <sstream>
#include "rapidjson/document.h"
#include "rapidjson/writer.h"
#include "rapidjson/stringbuffer.h"
#include "sg2vgjson.h"
using namespace std;
using namespace rapidjson;
SG2VGJSON::SG2VGJSON() : _os(0), _sg(0), _bases(0), _paths(0), _doc(0)
{
}
SG2VGJSON::~SG2VGJSON()
{
delete _doc;
}
void SG2VGJSON::init(ostream* os)
{
_os = os;
delete _doc;
_doc = new Document();
_doc->Parse("{\"node\": [], \"edge\": [], \"path\": []}");
assert(_doc->IsObject());
assert(nodes().IsArray());
assert(edges().IsArray());
assert(paths().IsArray());
}
void SG2VGJSON::writeGraph(const SideGraph* sg,
const vector<string>& bases,
const vector<pair<string, vector<SGSegment> > >&
paths)
{
_sg = sg;
_bases = &bases;
_paths = &paths;
*_os << "{";
// add every node to json doc
for (int i = 0; i < _sg->getNumSequences(); ++i)
{
addNode(_sg->getSequence(i));
}
// add every edge to json doc
const SideGraph::JoinSet* joinSet = _sg->getJoinSet();
for (SideGraph::JoinSet::const_iterator i = joinSet->begin();
i != joinSet->end(); ++i)
{
addEdge(*i);
}
// add every path to json doc
for (int i = 0; i < paths.size(); ++i)
{
addPath(paths[i].first, paths[i].second);
}
// after this we'll have added 2 copies of the graph to memory
// 1) json doc 2) this buffer
StringBuffer buffer;
Writer<StringBuffer> writer(buffer);
_doc->Accept(writer);
// make that a 3rd time -- strip outer nesting {}'s.
string temp(buffer.GetString());
*_os << temp.substr(1, temp.length()-1);
}
void SG2VGJSON::addNode(const SGSequence* seq)
{
Value node;
node.SetObject();
addString(node, "sequence", _bases->at(seq->getID()));
addString(node, "name", seq->getName());
// node id's are 1-based in VG!
addInt(node, "id", seq->getID() + 1);
nodes().PushBack(node, allocator());
}
void SG2VGJSON::addEdge(const SGJoin* join)
{
Value edge;
edge.SetObject();
// node id's are 1-based in VG!
addInt(edge, "from", join->getSide1().getBase().getSeqID() + 1);
addInt(edge, "to", join->getSide2().getBase().getSeqID() + 1);
addBool(edge, "from_start", join->getSide1().getForward() == true);
addBool(edge, "to_end", join->getSide2().getForward() == false);
edges().PushBack(edge, allocator());
}
void SG2VGJSON::addPath(const string& name, const vector<SGSegment>& path)
{
Value jpath;
jpath.SetObject();
addString(jpath, "name", name);
Value mappings;
mappings.SetArray();
int inputPathLength = 0;
int outputPathLength = 0;
for (int i = 0; i < path.size(); ++i)
{
sg_int_t sgSeqID = path[i].getSide().getBase().getSeqID();
if (i > 0 && i < path.size() - 1 &&
path[i].getLength() != _sg->getSequence(sgSeqID)->getLength())
{
stringstream ss;
ss << "Sanity check fail for Mapping " << i << " of path " << name
<< ": Segment size " << path[i].getLength() << " does not span "
<< "all of node " << (sgSeqID + 1) << " which has length "
<< _sg->getSequence(sgSeqID)->getLength();
throw runtime_error(ss.str());
}
inputPathLength += path[i].getLength();
Value position;
position.SetObject();
// node id's are 1-based in VG!
addInt(position, "node_id", sgSeqID + 1);
if (path[i].getSide().getForward())
{
addInt(position, "offset", 0);
}
else
{
addInt(position, "offset", _sg->getSequence(sgSeqID)->getLength() - 1);
}
outputPathLength += _sg->getSequence(sgSeqID)->getLength();
Value mapping;
mapping.SetObject();
mapping.AddMember("position", position, allocator());
addBool(mapping, "is_reverse", !path[i].getSide().getForward());
addInt(mapping, "rank", i + 1);
mappings.PushBack(mapping, allocator());
}
if (inputPathLength != outputPathLength)
{
stringstream ss;
ss << "Sanity check fail for path " << name << ": input length ("
<< inputPathLength << ") != output length (" << outputPathLength << ")";
throw runtime_error(ss.str());
}
jpath.AddMember("mapping", mappings, allocator());
paths().PushBack(jpath, allocator());
}
void SG2VGJSON::addInt(Value& value, const string& name, int v)
{
Value intValue;
intValue.SetInt(v);
Value nameValue;
nameValue.SetString(name.c_str(), name.length(), allocator());
value.AddMember(nameValue, intValue, allocator());
}
void SG2VGJSON::addString(Value& value, const string& name, const string& v)
{
Value stringValue;
stringValue.SetString(v.c_str(), v.length(), allocator());
Value nameValue;
nameValue.SetString(name.c_str(), name.length(), allocator());
value.AddMember(nameValue, stringValue, allocator());
}
void SG2VGJSON::addBool(Value& value, const string& name, bool v)
{
Value boolValue;
boolValue.SetBool(v);
Value nameValue;
nameValue.SetString(name.c_str(), name.length(), allocator());
value.AddMember(nameValue, boolValue, allocator());
}