| ... |
... |
@@ -495,61 +495,61 @@
|
| 495 |
495 |
|
| 496 |
496 |
int line_num;
|
| 497 |
497 |
std::istringstream line;
|
| 498 |
498 |
|
| 499 |
499 |
public:
|
| 500 |
500 |
|
| 501 |
501 |
/// \brief Constructor
|
| 502 |
502 |
///
|
| 503 |
503 |
/// Construct a directed graph reader, which reads from the given
|
| 504 |
504 |
/// input stream.
|
| 505 |
505 |
DigraphReader(std::istream& is, Digraph& digraph)
|
| 506 |
506 |
: _is(&is), local_is(false), _digraph(digraph),
|
| 507 |
507 |
_use_nodes(false), _use_arcs(false),
|
| 508 |
508 |
_skip_nodes(false), _skip_arcs(false) {}
|
| 509 |
509 |
|
| 510 |
510 |
/// \brief Constructor
|
| 511 |
511 |
///
|
| 512 |
512 |
/// Construct a directed graph reader, which reads from the given
|
| 513 |
513 |
/// file.
|
| 514 |
514 |
DigraphReader(const std::string& fn, Digraph& digraph)
|
| 515 |
515 |
: _is(new std::ifstream(fn.c_str())), local_is(true),
|
| 516 |
516 |
_filename(fn), _digraph(digraph),
|
| 517 |
517 |
_use_nodes(false), _use_arcs(false),
|
| 518 |
518 |
_skip_nodes(false), _skip_arcs(false) {
|
| 519 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
519 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 520 |
520 |
}
|
| 521 |
521 |
|
| 522 |
522 |
/// \brief Constructor
|
| 523 |
523 |
///
|
| 524 |
524 |
/// Construct a directed graph reader, which reads from the given
|
| 525 |
525 |
/// file.
|
| 526 |
526 |
DigraphReader(const char* fn, Digraph& digraph)
|
| 527 |
527 |
: _is(new std::ifstream(fn)), local_is(true),
|
| 528 |
528 |
_filename(fn), _digraph(digraph),
|
| 529 |
529 |
_use_nodes(false), _use_arcs(false),
|
| 530 |
530 |
_skip_nodes(false), _skip_arcs(false) {
|
| 531 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
531 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 532 |
532 |
}
|
| 533 |
533 |
|
| 534 |
534 |
/// \brief Destructor
|
| 535 |
535 |
~DigraphReader() {
|
| 536 |
536 |
for (typename NodeMaps::iterator it = _node_maps.begin();
|
| 537 |
537 |
it != _node_maps.end(); ++it) {
|
| 538 |
538 |
delete it->second;
|
| 539 |
539 |
}
|
| 540 |
540 |
|
| 541 |
541 |
for (typename ArcMaps::iterator it = _arc_maps.begin();
|
| 542 |
542 |
it != _arc_maps.end(); ++it) {
|
| 543 |
543 |
delete it->second;
|
| 544 |
544 |
}
|
| 545 |
545 |
|
| 546 |
546 |
for (typename Attributes::iterator it = _attributes.begin();
|
| 547 |
547 |
it != _attributes.end(); ++it) {
|
| 548 |
548 |
delete it->second;
|
| 549 |
549 |
}
|
| 550 |
550 |
|
| 551 |
551 |
if (local_is) {
|
| 552 |
552 |
delete _is;
|
| 553 |
553 |
}
|
| 554 |
554 |
|
| 555 |
555 |
}
|
| ... |
... |
@@ -858,87 +858,87 @@
|
| 858 |
858 |
return;
|
| 859 |
859 |
}
|
| 860 |
860 |
line.putback(c);
|
| 861 |
861 |
|
| 862 |
862 |
{
|
| 863 |
863 |
std::map<std::string, int> maps;
|
| 864 |
864 |
|
| 865 |
865 |
std::string map;
|
| 866 |
866 |
int index = 0;
|
| 867 |
867 |
while (_reader_bits::readToken(line, map)) {
|
| 868 |
868 |
if (maps.find(map) != maps.end()) {
|
| 869 |
869 |
std::ostringstream msg;
|
| 870 |
870 |
msg << "Multiple occurence of node map: " << map;
|
| 871 |
871 |
throw FormatError(msg.str());
|
| 872 |
872 |
}
|
| 873 |
873 |
maps.insert(std::make_pair(map, index));
|
| 874 |
874 |
++index;
|
| 875 |
875 |
}
|
| 876 |
876 |
|
| 877 |
877 |
for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
|
| 878 |
878 |
std::map<std::string, int>::iterator jt =
|
| 879 |
879 |
maps.find(_node_maps[i].first);
|
| 880 |
880 |
if (jt == maps.end()) {
|
| 881 |
881 |
std::ostringstream msg;
|
| 882 |
|
msg << "Map not found in file: " << _node_maps[i].first;
|
|
882 |
msg << "Map not found: " << _node_maps[i].first;
|
| 883 |
883 |
throw FormatError(msg.str());
|
| 884 |
884 |
}
|
| 885 |
885 |
map_index[i] = jt->second;
|
| 886 |
886 |
}
|
| 887 |
887 |
|
| 888 |
888 |
{
|
| 889 |
889 |
std::map<std::string, int>::iterator jt = maps.find("label");
|
| 890 |
890 |
if (jt != maps.end()) {
|
| 891 |
891 |
label_index = jt->second;
|
| 892 |
892 |
} else {
|
| 893 |
893 |
label_index = -1;
|
| 894 |
894 |
}
|
| 895 |
895 |
}
|
| 896 |
896 |
map_num = maps.size();
|
| 897 |
897 |
}
|
| 898 |
898 |
|
| 899 |
899 |
while (readLine() && line >> c && c != '@') {
|
| 900 |
900 |
line.putback(c);
|
| 901 |
901 |
|
| 902 |
902 |
std::vector<std::string> tokens(map_num);
|
| 903 |
903 |
for (int i = 0; i < map_num; ++i) {
|
| 904 |
904 |
if (!_reader_bits::readToken(line, tokens[i])) {
|
| 905 |
905 |
std::ostringstream msg;
|
| 906 |
906 |
msg << "Column not found (" << i + 1 << ")";
|
| 907 |
907 |
throw FormatError(msg.str());
|
| 908 |
908 |
}
|
| 909 |
909 |
}
|
| 910 |
910 |
if (line >> std::ws >> c)
|
| 911 |
|
throw FormatError("Extra character on the end of line");
|
|
911 |
throw FormatError("Extra character at the end of line");
|
| 912 |
912 |
|
| 913 |
913 |
Node n;
|
| 914 |
914 |
if (!_use_nodes) {
|
| 915 |
915 |
n = _digraph.addNode();
|
| 916 |
916 |
if (label_index != -1)
|
| 917 |
917 |
_node_index.insert(std::make_pair(tokens[label_index], n));
|
| 918 |
918 |
} else {
|
| 919 |
919 |
if (label_index == -1)
|
| 920 |
|
throw FormatError("Label map not found in file");
|
|
920 |
throw FormatError("Label map not found");
|
| 921 |
921 |
typename std::map<std::string, Node>::iterator it =
|
| 922 |
922 |
_node_index.find(tokens[label_index]);
|
| 923 |
923 |
if (it == _node_index.end()) {
|
| 924 |
924 |
std::ostringstream msg;
|
| 925 |
925 |
msg << "Node with label not found: " << tokens[label_index];
|
| 926 |
926 |
throw FormatError(msg.str());
|
| 927 |
927 |
}
|
| 928 |
928 |
n = it->second;
|
| 929 |
929 |
}
|
| 930 |
930 |
|
| 931 |
931 |
for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
|
| 932 |
932 |
_node_maps[i].second->set(n, tokens[map_index[i]]);
|
| 933 |
933 |
}
|
| 934 |
934 |
|
| 935 |
935 |
}
|
| 936 |
936 |
if (readSuccess()) {
|
| 937 |
937 |
line.putback(c);
|
| 938 |
938 |
}
|
| 939 |
939 |
}
|
| 940 |
940 |
|
| 941 |
941 |
void readArcs() {
|
| 942 |
942 |
|
| 943 |
943 |
std::vector<int> map_index(_arc_maps.size());
|
| 944 |
944 |
int map_num, label_index;
|
| ... |
... |
@@ -951,215 +951,212 @@
|
| 951 |
951 |
return;
|
| 952 |
952 |
}
|
| 953 |
953 |
line.putback(c);
|
| 954 |
954 |
|
| 955 |
955 |
{
|
| 956 |
956 |
std::map<std::string, int> maps;
|
| 957 |
957 |
|
| 958 |
958 |
std::string map;
|
| 959 |
959 |
int index = 0;
|
| 960 |
960 |
while (_reader_bits::readToken(line, map)) {
|
| 961 |
961 |
if (maps.find(map) != maps.end()) {
|
| 962 |
962 |
std::ostringstream msg;
|
| 963 |
963 |
msg << "Multiple occurence of arc map: " << map;
|
| 964 |
964 |
throw FormatError(msg.str());
|
| 965 |
965 |
}
|
| 966 |
966 |
maps.insert(std::make_pair(map, index));
|
| 967 |
967 |
++index;
|
| 968 |
968 |
}
|
| 969 |
969 |
|
| 970 |
970 |
for (int i = 0; i < static_cast<int>(_arc_maps.size()); ++i) {
|
| 971 |
971 |
std::map<std::string, int>::iterator jt =
|
| 972 |
972 |
maps.find(_arc_maps[i].first);
|
| 973 |
973 |
if (jt == maps.end()) {
|
| 974 |
974 |
std::ostringstream msg;
|
| 975 |
|
msg << "Map not found in file: " << _arc_maps[i].first;
|
|
975 |
msg << "Map not found: " << _arc_maps[i].first;
|
| 976 |
976 |
throw FormatError(msg.str());
|
| 977 |
977 |
}
|
| 978 |
978 |
map_index[i] = jt->second;
|
| 979 |
979 |
}
|
| 980 |
980 |
|
| 981 |
981 |
{
|
| 982 |
982 |
std::map<std::string, int>::iterator jt = maps.find("label");
|
| 983 |
983 |
if (jt != maps.end()) {
|
| 984 |
984 |
label_index = jt->second;
|
| 985 |
985 |
} else {
|
| 986 |
986 |
label_index = -1;
|
| 987 |
987 |
}
|
| 988 |
988 |
}
|
| 989 |
989 |
map_num = maps.size();
|
| 990 |
990 |
}
|
| 991 |
991 |
|
| 992 |
992 |
while (readLine() && line >> c && c != '@') {
|
| 993 |
993 |
line.putback(c);
|
| 994 |
994 |
|
| 995 |
995 |
std::string source_token;
|
| 996 |
996 |
std::string target_token;
|
| 997 |
997 |
|
| 998 |
998 |
if (!_reader_bits::readToken(line, source_token))
|
| 999 |
999 |
throw FormatError("Source not found");
|
| 1000 |
1000 |
|
| 1001 |
1001 |
if (!_reader_bits::readToken(line, target_token))
|
| 1002 |
1002 |
throw FormatError("Target not found");
|
| 1003 |
1003 |
|
| 1004 |
1004 |
std::vector<std::string> tokens(map_num);
|
| 1005 |
1005 |
for (int i = 0; i < map_num; ++i) {
|
| 1006 |
1006 |
if (!_reader_bits::readToken(line, tokens[i])) {
|
| 1007 |
1007 |
std::ostringstream msg;
|
| 1008 |
1008 |
msg << "Column not found (" << i + 1 << ")";
|
| 1009 |
1009 |
throw FormatError(msg.str());
|
| 1010 |
1010 |
}
|
| 1011 |
1011 |
}
|
| 1012 |
1012 |
if (line >> std::ws >> c)
|
| 1013 |
|
throw FormatError("Extra character on the end of line");
|
|
1013 |
throw FormatError("Extra character at the end of line");
|
| 1014 |
1014 |
|
| 1015 |
1015 |
Arc a;
|
| 1016 |
1016 |
if (!_use_arcs) {
|
| 1017 |
1017 |
|
| 1018 |
1018 |
typename NodeIndex::iterator it;
|
| 1019 |
1019 |
|
| 1020 |
1020 |
it = _node_index.find(source_token);
|
| 1021 |
1021 |
if (it == _node_index.end()) {
|
| 1022 |
1022 |
std::ostringstream msg;
|
| 1023 |
1023 |
msg << "Item not found: " << source_token;
|
| 1024 |
1024 |
throw FormatError(msg.str());
|
| 1025 |
1025 |
}
|
| 1026 |
1026 |
Node source = it->second;
|
| 1027 |
1027 |
|
| 1028 |
1028 |
it = _node_index.find(target_token);
|
| 1029 |
1029 |
if (it == _node_index.end()) {
|
| 1030 |
1030 |
std::ostringstream msg;
|
| 1031 |
1031 |
msg << "Item not found: " << target_token;
|
| 1032 |
1032 |
throw FormatError(msg.str());
|
| 1033 |
1033 |
}
|
| 1034 |
1034 |
Node target = it->second;
|
| 1035 |
1035 |
|
| 1036 |
1036 |
a = _digraph.addArc(source, target);
|
| 1037 |
1037 |
if (label_index != -1)
|
| 1038 |
1038 |
_arc_index.insert(std::make_pair(tokens[label_index], a));
|
| 1039 |
1039 |
} else {
|
| 1040 |
1040 |
if (label_index == -1)
|
| 1041 |
|
throw FormatError("Label map not found in file");
|
|
1041 |
throw FormatError("Label map not found");
|
| 1042 |
1042 |
typename std::map<std::string, Arc>::iterator it =
|
| 1043 |
1043 |
_arc_index.find(tokens[label_index]);
|
| 1044 |
1044 |
if (it == _arc_index.end()) {
|
| 1045 |
1045 |
std::ostringstream msg;
|
| 1046 |
1046 |
msg << "Arc with label not found: " << tokens[label_index];
|
| 1047 |
1047 |
throw FormatError(msg.str());
|
| 1048 |
1048 |
}
|
| 1049 |
1049 |
a = it->second;
|
| 1050 |
1050 |
}
|
| 1051 |
1051 |
|
| 1052 |
1052 |
for (int i = 0; i < static_cast<int>(_arc_maps.size()); ++i) {
|
| 1053 |
1053 |
_arc_maps[i].second->set(a, tokens[map_index[i]]);
|
| 1054 |
1054 |
}
|
| 1055 |
1055 |
|
| 1056 |
1056 |
}
|
| 1057 |
1057 |
if (readSuccess()) {
|
| 1058 |
1058 |
line.putback(c);
|
| 1059 |
1059 |
}
|
| 1060 |
1060 |
}
|
| 1061 |
1061 |
|
| 1062 |
1062 |
void readAttributes() {
|
| 1063 |
1063 |
|
| 1064 |
1064 |
std::set<std::string> read_attr;
|
| 1065 |
1065 |
|
| 1066 |
1066 |
char c;
|
| 1067 |
1067 |
while (readLine() && line >> c && c != '@') {
|
| 1068 |
1068 |
line.putback(c);
|
| 1069 |
1069 |
|
| 1070 |
1070 |
std::string attr, token;
|
| 1071 |
1071 |
if (!_reader_bits::readToken(line, attr))
|
| 1072 |
1072 |
throw FormatError("Attribute name not found");
|
| 1073 |
1073 |
if (!_reader_bits::readToken(line, token))
|
| 1074 |
1074 |
throw FormatError("Attribute value not found");
|
| 1075 |
1075 |
if (line >> c)
|
| 1076 |
|
throw FormatError("Extra character on the end of line");
|
|
1076 |
throw FormatError("Extra character at the end of line");
|
| 1077 |
1077 |
|
| 1078 |
1078 |
{
|
| 1079 |
1079 |
std::set<std::string>::iterator it = read_attr.find(attr);
|
| 1080 |
1080 |
if (it != read_attr.end()) {
|
| 1081 |
1081 |
std::ostringstream msg;
|
| 1082 |
|
msg << "Multiple occurence of attribute " << attr;
|
|
1082 |
msg << "Multiple occurence of attribute: " << attr;
|
| 1083 |
1083 |
throw FormatError(msg.str());
|
| 1084 |
1084 |
}
|
| 1085 |
1085 |
read_attr.insert(attr);
|
| 1086 |
1086 |
}
|
| 1087 |
1087 |
|
| 1088 |
1088 |
{
|
| 1089 |
1089 |
typename Attributes::iterator it = _attributes.lower_bound(attr);
|
| 1090 |
1090 |
while (it != _attributes.end() && it->first == attr) {
|
| 1091 |
1091 |
it->second->set(token);
|
| 1092 |
1092 |
++it;
|
| 1093 |
1093 |
}
|
| 1094 |
1094 |
}
|
| 1095 |
1095 |
|
| 1096 |
1096 |
}
|
| 1097 |
1097 |
if (readSuccess()) {
|
| 1098 |
1098 |
line.putback(c);
|
| 1099 |
1099 |
}
|
| 1100 |
1100 |
for (typename Attributes::iterator it = _attributes.begin();
|
| 1101 |
1101 |
it != _attributes.end(); ++it) {
|
| 1102 |
1102 |
if (read_attr.find(it->first) == read_attr.end()) {
|
| 1103 |
1103 |
std::ostringstream msg;
|
| 1104 |
|
msg << "Attribute not found in file: " << it->first;
|
|
1104 |
msg << "Attribute not found: " << it->first;
|
| 1105 |
1105 |
throw FormatError(msg.str());
|
| 1106 |
1106 |
}
|
| 1107 |
1107 |
}
|
| 1108 |
1108 |
}
|
| 1109 |
1109 |
|
| 1110 |
1110 |
public:
|
| 1111 |
1111 |
|
| 1112 |
1112 |
/// \name Execution of the reader
|
| 1113 |
1113 |
/// @{
|
| 1114 |
1114 |
|
| 1115 |
1115 |
/// \brief Start the batch processing
|
| 1116 |
1116 |
///
|
| 1117 |
1117 |
/// This function starts the batch processing
|
| 1118 |
1118 |
void run() {
|
| 1119 |
1119 |
LEMON_ASSERT(_is != 0, "This reader assigned to an other reader");
|
| 1120 |
|
if (!*_is) {
|
| 1121 |
|
throw FormatError("Cannot find file");
|
| 1122 |
|
}
|
| 1123 |
1120 |
|
| 1124 |
1121 |
bool nodes_done = _skip_nodes;
|
| 1125 |
1122 |
bool arcs_done = _skip_arcs;
|
| 1126 |
1123 |
bool attributes_done = false;
|
| 1127 |
1124 |
|
| 1128 |
1125 |
line_num = 0;
|
| 1129 |
1126 |
readLine();
|
| 1130 |
1127 |
skipSection();
|
| 1131 |
1128 |
|
| 1132 |
1129 |
while (readSuccess()) {
|
| 1133 |
1130 |
try {
|
| 1134 |
1131 |
char c;
|
| 1135 |
1132 |
std::string section, caption;
|
| 1136 |
1133 |
line >> c;
|
| 1137 |
1134 |
_reader_bits::readToken(line, section);
|
| 1138 |
1135 |
_reader_bits::readToken(line, caption);
|
| 1139 |
1136 |
|
| 1140 |
1137 |
if (line >> c)
|
| 1141 |
|
throw FormatError("Extra character on the end of line");
|
|
1138 |
throw FormatError("Extra character at the end of line");
|
| 1142 |
1139 |
|
| 1143 |
1140 |
if (section == "nodes" && !nodes_done) {
|
| 1144 |
1141 |
if (_nodes_caption.empty() || _nodes_caption == caption) {
|
| 1145 |
1142 |
readNodes();
|
| 1146 |
1143 |
nodes_done = true;
|
| 1147 |
1144 |
}
|
| 1148 |
1145 |
} else if ((section == "arcs" || section == "edges") &&
|
| 1149 |
1146 |
!arcs_done) {
|
| 1150 |
1147 |
if (_arcs_caption.empty() || _arcs_caption == caption) {
|
| 1151 |
1148 |
readArcs();
|
| 1152 |
1149 |
arcs_done = true;
|
| 1153 |
1150 |
}
|
| 1154 |
1151 |
} else if (section == "attributes" && !attributes_done) {
|
| 1155 |
1152 |
if (_attributes_caption.empty() || _attributes_caption == caption) {
|
| 1156 |
1153 |
readAttributes();
|
| 1157 |
1154 |
attributes_done = true;
|
| 1158 |
1155 |
}
|
| 1159 |
1156 |
} else {
|
| 1160 |
1157 |
readLine();
|
| 1161 |
1158 |
skipSection();
|
| 1162 |
1159 |
}
|
| 1163 |
1160 |
} catch (FormatError& error) {
|
| 1164 |
1161 |
error.line(line_num);
|
| 1165 |
1162 |
error.file(_filename);
|
| ... |
... |
@@ -1287,61 +1284,61 @@
|
| 1287 |
1284 |
|
| 1288 |
1285 |
int line_num;
|
| 1289 |
1286 |
std::istringstream line;
|
| 1290 |
1287 |
|
| 1291 |
1288 |
public:
|
| 1292 |
1289 |
|
| 1293 |
1290 |
/// \brief Constructor
|
| 1294 |
1291 |
///
|
| 1295 |
1292 |
/// Construct an undirected graph reader, which reads from the given
|
| 1296 |
1293 |
/// input stream.
|
| 1297 |
1294 |
GraphReader(std::istream& is, Graph& graph)
|
| 1298 |
1295 |
: _is(&is), local_is(false), _graph(graph),
|
| 1299 |
1296 |
_use_nodes(false), _use_edges(false),
|
| 1300 |
1297 |
_skip_nodes(false), _skip_edges(false) {}
|
| 1301 |
1298 |
|
| 1302 |
1299 |
/// \brief Constructor
|
| 1303 |
1300 |
///
|
| 1304 |
1301 |
/// Construct an undirected graph reader, which reads from the given
|
| 1305 |
1302 |
/// file.
|
| 1306 |
1303 |
GraphReader(const std::string& fn, Graph& graph)
|
| 1307 |
1304 |
: _is(new std::ifstream(fn.c_str())), local_is(true),
|
| 1308 |
1305 |
_filename(fn), _graph(graph),
|
| 1309 |
1306 |
_use_nodes(false), _use_edges(false),
|
| 1310 |
1307 |
_skip_nodes(false), _skip_edges(false) {
|
| 1311 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
1308 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 1312 |
1309 |
}
|
| 1313 |
1310 |
|
| 1314 |
1311 |
/// \brief Constructor
|
| 1315 |
1312 |
///
|
| 1316 |
1313 |
/// Construct an undirected graph reader, which reads from the given
|
| 1317 |
1314 |
/// file.
|
| 1318 |
1315 |
GraphReader(const char* fn, Graph& graph)
|
| 1319 |
1316 |
: _is(new std::ifstream(fn)), local_is(true),
|
| 1320 |
1317 |
_filename(fn), _graph(graph),
|
| 1321 |
1318 |
_use_nodes(false), _use_edges(false),
|
| 1322 |
1319 |
_skip_nodes(false), _skip_edges(false) {
|
| 1323 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
1320 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 1324 |
1321 |
}
|
| 1325 |
1322 |
|
| 1326 |
1323 |
/// \brief Destructor
|
| 1327 |
1324 |
~GraphReader() {
|
| 1328 |
1325 |
for (typename NodeMaps::iterator it = _node_maps.begin();
|
| 1329 |
1326 |
it != _node_maps.end(); ++it) {
|
| 1330 |
1327 |
delete it->second;
|
| 1331 |
1328 |
}
|
| 1332 |
1329 |
|
| 1333 |
1330 |
for (typename EdgeMaps::iterator it = _edge_maps.begin();
|
| 1334 |
1331 |
it != _edge_maps.end(); ++it) {
|
| 1335 |
1332 |
delete it->second;
|
| 1336 |
1333 |
}
|
| 1337 |
1334 |
|
| 1338 |
1335 |
for (typename Attributes::iterator it = _attributes.begin();
|
| 1339 |
1336 |
it != _attributes.end(); ++it) {
|
| 1340 |
1337 |
delete it->second;
|
| 1341 |
1338 |
}
|
| 1342 |
1339 |
|
| 1343 |
1340 |
if (local_is) {
|
| 1344 |
1341 |
delete _is;
|
| 1345 |
1342 |
}
|
| 1346 |
1343 |
|
| 1347 |
1344 |
}
|
| ... |
... |
@@ -1694,87 +1691,87 @@
|
| 1694 |
1691 |
return;
|
| 1695 |
1692 |
}
|
| 1696 |
1693 |
line.putback(c);
|
| 1697 |
1694 |
|
| 1698 |
1695 |
{
|
| 1699 |
1696 |
std::map<std::string, int> maps;
|
| 1700 |
1697 |
|
| 1701 |
1698 |
std::string map;
|
| 1702 |
1699 |
int index = 0;
|
| 1703 |
1700 |
while (_reader_bits::readToken(line, map)) {
|
| 1704 |
1701 |
if (maps.find(map) != maps.end()) {
|
| 1705 |
1702 |
std::ostringstream msg;
|
| 1706 |
1703 |
msg << "Multiple occurence of node map: " << map;
|
| 1707 |
1704 |
throw FormatError(msg.str());
|
| 1708 |
1705 |
}
|
| 1709 |
1706 |
maps.insert(std::make_pair(map, index));
|
| 1710 |
1707 |
++index;
|
| 1711 |
1708 |
}
|
| 1712 |
1709 |
|
| 1713 |
1710 |
for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
|
| 1714 |
1711 |
std::map<std::string, int>::iterator jt =
|
| 1715 |
1712 |
maps.find(_node_maps[i].first);
|
| 1716 |
1713 |
if (jt == maps.end()) {
|
| 1717 |
1714 |
std::ostringstream msg;
|
| 1718 |
|
msg << "Map not found in file: " << _node_maps[i].first;
|
|
1715 |
msg << "Map not found: " << _node_maps[i].first;
|
| 1719 |
1716 |
throw FormatError(msg.str());
|
| 1720 |
1717 |
}
|
| 1721 |
1718 |
map_index[i] = jt->second;
|
| 1722 |
1719 |
}
|
| 1723 |
1720 |
|
| 1724 |
1721 |
{
|
| 1725 |
1722 |
std::map<std::string, int>::iterator jt = maps.find("label");
|
| 1726 |
1723 |
if (jt != maps.end()) {
|
| 1727 |
1724 |
label_index = jt->second;
|
| 1728 |
1725 |
} else {
|
| 1729 |
1726 |
label_index = -1;
|
| 1730 |
1727 |
}
|
| 1731 |
1728 |
}
|
| 1732 |
1729 |
map_num = maps.size();
|
| 1733 |
1730 |
}
|
| 1734 |
1731 |
|
| 1735 |
1732 |
while (readLine() && line >> c && c != '@') {
|
| 1736 |
1733 |
line.putback(c);
|
| 1737 |
1734 |
|
| 1738 |
1735 |
std::vector<std::string> tokens(map_num);
|
| 1739 |
1736 |
for (int i = 0; i < map_num; ++i) {
|
| 1740 |
1737 |
if (!_reader_bits::readToken(line, tokens[i])) {
|
| 1741 |
1738 |
std::ostringstream msg;
|
| 1742 |
1739 |
msg << "Column not found (" << i + 1 << ")";
|
| 1743 |
1740 |
throw FormatError(msg.str());
|
| 1744 |
1741 |
}
|
| 1745 |
1742 |
}
|
| 1746 |
1743 |
if (line >> std::ws >> c)
|
| 1747 |
|
throw FormatError("Extra character on the end of line");
|
|
1744 |
throw FormatError("Extra character at the end of line");
|
| 1748 |
1745 |
|
| 1749 |
1746 |
Node n;
|
| 1750 |
1747 |
if (!_use_nodes) {
|
| 1751 |
1748 |
n = _graph.addNode();
|
| 1752 |
1749 |
if (label_index != -1)
|
| 1753 |
1750 |
_node_index.insert(std::make_pair(tokens[label_index], n));
|
| 1754 |
1751 |
} else {
|
| 1755 |
1752 |
if (label_index == -1)
|
| 1756 |
|
throw FormatError("Label map not found in file");
|
|
1753 |
throw FormatError("Label map not found");
|
| 1757 |
1754 |
typename std::map<std::string, Node>::iterator it =
|
| 1758 |
1755 |
_node_index.find(tokens[label_index]);
|
| 1759 |
1756 |
if (it == _node_index.end()) {
|
| 1760 |
1757 |
std::ostringstream msg;
|
| 1761 |
1758 |
msg << "Node with label not found: " << tokens[label_index];
|
| 1762 |
1759 |
throw FormatError(msg.str());
|
| 1763 |
1760 |
}
|
| 1764 |
1761 |
n = it->second;
|
| 1765 |
1762 |
}
|
| 1766 |
1763 |
|
| 1767 |
1764 |
for (int i = 0; i < static_cast<int>(_node_maps.size()); ++i) {
|
| 1768 |
1765 |
_node_maps[i].second->set(n, tokens[map_index[i]]);
|
| 1769 |
1766 |
}
|
| 1770 |
1767 |
|
| 1771 |
1768 |
}
|
| 1772 |
1769 |
if (readSuccess()) {
|
| 1773 |
1770 |
line.putback(c);
|
| 1774 |
1771 |
}
|
| 1775 |
1772 |
}
|
| 1776 |
1773 |
|
| 1777 |
1774 |
void readEdges() {
|
| 1778 |
1775 |
|
| 1779 |
1776 |
std::vector<int> map_index(_edge_maps.size());
|
| 1780 |
1777 |
int map_num, label_index;
|
| ... |
... |
@@ -1787,213 +1784,213 @@
|
| 1787 |
1784 |
return;
|
| 1788 |
1785 |
}
|
| 1789 |
1786 |
line.putback(c);
|
| 1790 |
1787 |
|
| 1791 |
1788 |
{
|
| 1792 |
1789 |
std::map<std::string, int> maps;
|
| 1793 |
1790 |
|
| 1794 |
1791 |
std::string map;
|
| 1795 |
1792 |
int index = 0;
|
| 1796 |
1793 |
while (_reader_bits::readToken(line, map)) {
|
| 1797 |
1794 |
if (maps.find(map) != maps.end()) {
|
| 1798 |
1795 |
std::ostringstream msg;
|
| 1799 |
1796 |
msg << "Multiple occurence of edge map: " << map;
|
| 1800 |
1797 |
throw FormatError(msg.str());
|
| 1801 |
1798 |
}
|
| 1802 |
1799 |
maps.insert(std::make_pair(map, index));
|
| 1803 |
1800 |
++index;
|
| 1804 |
1801 |
}
|
| 1805 |
1802 |
|
| 1806 |
1803 |
for (int i = 0; i < static_cast<int>(_edge_maps.size()); ++i) {
|
| 1807 |
1804 |
std::map<std::string, int>::iterator jt =
|
| 1808 |
1805 |
maps.find(_edge_maps[i].first);
|
| 1809 |
1806 |
if (jt == maps.end()) {
|
| 1810 |
1807 |
std::ostringstream msg;
|
| 1811 |
|
msg << "Map not found in file: " << _edge_maps[i].first;
|
|
1808 |
msg << "Map not found: " << _edge_maps[i].first;
|
| 1812 |
1809 |
throw FormatError(msg.str());
|
| 1813 |
1810 |
}
|
| 1814 |
1811 |
map_index[i] = jt->second;
|
| 1815 |
1812 |
}
|
| 1816 |
1813 |
|
| 1817 |
1814 |
{
|
| 1818 |
1815 |
std::map<std::string, int>::iterator jt = maps.find("label");
|
| 1819 |
1816 |
if (jt != maps.end()) {
|
| 1820 |
1817 |
label_index = jt->second;
|
| 1821 |
1818 |
} else {
|
| 1822 |
1819 |
label_index = -1;
|
| 1823 |
1820 |
}
|
| 1824 |
1821 |
}
|
| 1825 |
1822 |
map_num = maps.size();
|
| 1826 |
1823 |
}
|
| 1827 |
1824 |
|
| 1828 |
1825 |
while (readLine() && line >> c && c != '@') {
|
| 1829 |
1826 |
line.putback(c);
|
| 1830 |
1827 |
|
| 1831 |
1828 |
std::string source_token;
|
| 1832 |
1829 |
std::string target_token;
|
| 1833 |
1830 |
|
| 1834 |
1831 |
if (!_reader_bits::readToken(line, source_token))
|
| 1835 |
1832 |
throw FormatError("Node u not found");
|
| 1836 |
1833 |
|
| 1837 |
1834 |
if (!_reader_bits::readToken(line, target_token))
|
| 1838 |
1835 |
throw FormatError("Node v not found");
|
| 1839 |
1836 |
|
| 1840 |
1837 |
std::vector<std::string> tokens(map_num);
|
| 1841 |
1838 |
for (int i = 0; i < map_num; ++i) {
|
| 1842 |
1839 |
if (!_reader_bits::readToken(line, tokens[i])) {
|
| 1843 |
1840 |
std::ostringstream msg;
|
| 1844 |
1841 |
msg << "Column not found (" << i + 1 << ")";
|
| 1845 |
1842 |
throw FormatError(msg.str());
|
| 1846 |
1843 |
}
|
| 1847 |
1844 |
}
|
| 1848 |
1845 |
if (line >> std::ws >> c)
|
| 1849 |
|
throw FormatError("Extra character on the end of line");
|
|
1846 |
throw FormatError("Extra character at the end of line");
|
| 1850 |
1847 |
|
| 1851 |
1848 |
Edge e;
|
| 1852 |
1849 |
if (!_use_edges) {
|
| 1853 |
1850 |
|
| 1854 |
1851 |
typename NodeIndex::iterator it;
|
| 1855 |
1852 |
|
| 1856 |
1853 |
it = _node_index.find(source_token);
|
| 1857 |
1854 |
if (it == _node_index.end()) {
|
| 1858 |
1855 |
std::ostringstream msg;
|
| 1859 |
1856 |
msg << "Item not found: " << source_token;
|
| 1860 |
1857 |
throw FormatError(msg.str());
|
| 1861 |
1858 |
}
|
| 1862 |
1859 |
Node source = it->second;
|
| 1863 |
1860 |
|
| 1864 |
1861 |
it = _node_index.find(target_token);
|
| 1865 |
1862 |
if (it == _node_index.end()) {
|
| 1866 |
1863 |
std::ostringstream msg;
|
| 1867 |
1864 |
msg << "Item not found: " << target_token;
|
| 1868 |
1865 |
throw FormatError(msg.str());
|
| 1869 |
1866 |
}
|
| 1870 |
1867 |
Node target = it->second;
|
| 1871 |
1868 |
|
| 1872 |
1869 |
e = _graph.addEdge(source, target);
|
| 1873 |
1870 |
if (label_index != -1)
|
| 1874 |
1871 |
_edge_index.insert(std::make_pair(tokens[label_index], e));
|
| 1875 |
1872 |
} else {
|
| 1876 |
1873 |
if (label_index == -1)
|
| 1877 |
|
throw FormatError("Label map not found in file");
|
|
1874 |
throw FormatError("Label map not found");
|
| 1878 |
1875 |
typename std::map<std::string, Edge>::iterator it =
|
| 1879 |
1876 |
_edge_index.find(tokens[label_index]);
|
| 1880 |
1877 |
if (it == _edge_index.end()) {
|
| 1881 |
1878 |
std::ostringstream msg;
|
| 1882 |
1879 |
msg << "Edge with label not found: " << tokens[label_index];
|
| 1883 |
1880 |
throw FormatError(msg.str());
|
| 1884 |
1881 |
}
|
| 1885 |
1882 |
e = it->second;
|
| 1886 |
1883 |
}
|
| 1887 |
1884 |
|
| 1888 |
1885 |
for (int i = 0; i < static_cast<int>(_edge_maps.size()); ++i) {
|
| 1889 |
1886 |
_edge_maps[i].second->set(e, tokens[map_index[i]]);
|
| 1890 |
1887 |
}
|
| 1891 |
1888 |
|
| 1892 |
1889 |
}
|
| 1893 |
1890 |
if (readSuccess()) {
|
| 1894 |
1891 |
line.putback(c);
|
| 1895 |
1892 |
}
|
| 1896 |
1893 |
}
|
| 1897 |
1894 |
|
| 1898 |
1895 |
void readAttributes() {
|
| 1899 |
1896 |
|
| 1900 |
1897 |
std::set<std::string> read_attr;
|
| 1901 |
1898 |
|
| 1902 |
1899 |
char c;
|
| 1903 |
1900 |
while (readLine() && line >> c && c != '@') {
|
| 1904 |
1901 |
line.putback(c);
|
| 1905 |
1902 |
|
| 1906 |
1903 |
std::string attr, token;
|
| 1907 |
1904 |
if (!_reader_bits::readToken(line, attr))
|
| 1908 |
1905 |
throw FormatError("Attribute name not found");
|
| 1909 |
1906 |
if (!_reader_bits::readToken(line, token))
|
| 1910 |
1907 |
throw FormatError("Attribute value not found");
|
| 1911 |
1908 |
if (line >> c)
|
| 1912 |
|
throw FormatError("Extra character on the end of line");
|
|
1909 |
throw FormatError("Extra character at the end of line");
|
| 1913 |
1910 |
|
| 1914 |
1911 |
{
|
| 1915 |
1912 |
std::set<std::string>::iterator it = read_attr.find(attr);
|
| 1916 |
1913 |
if (it != read_attr.end()) {
|
| 1917 |
1914 |
std::ostringstream msg;
|
| 1918 |
|
msg << "Multiple occurence of attribute " << attr;
|
|
1915 |
msg << "Multiple occurence of attribute: " << attr;
|
| 1919 |
1916 |
throw FormatError(msg.str());
|
| 1920 |
1917 |
}
|
| 1921 |
1918 |
read_attr.insert(attr);
|
| 1922 |
1919 |
}
|
| 1923 |
1920 |
|
| 1924 |
1921 |
{
|
| 1925 |
1922 |
typename Attributes::iterator it = _attributes.lower_bound(attr);
|
| 1926 |
1923 |
while (it != _attributes.end() && it->first == attr) {
|
| 1927 |
1924 |
it->second->set(token);
|
| 1928 |
1925 |
++it;
|
| 1929 |
1926 |
}
|
| 1930 |
1927 |
}
|
| 1931 |
1928 |
|
| 1932 |
1929 |
}
|
| 1933 |
1930 |
if (readSuccess()) {
|
| 1934 |
1931 |
line.putback(c);
|
| 1935 |
1932 |
}
|
| 1936 |
1933 |
for (typename Attributes::iterator it = _attributes.begin();
|
| 1937 |
1934 |
it != _attributes.end(); ++it) {
|
| 1938 |
1935 |
if (read_attr.find(it->first) == read_attr.end()) {
|
| 1939 |
1936 |
std::ostringstream msg;
|
| 1940 |
|
msg << "Attribute not found in file: " << it->first;
|
|
1937 |
msg << "Attribute not found: " << it->first;
|
| 1941 |
1938 |
throw FormatError(msg.str());
|
| 1942 |
1939 |
}
|
| 1943 |
1940 |
}
|
| 1944 |
1941 |
}
|
| 1945 |
1942 |
|
| 1946 |
1943 |
public:
|
| 1947 |
1944 |
|
| 1948 |
1945 |
/// \name Execution of the reader
|
| 1949 |
1946 |
/// @{
|
| 1950 |
1947 |
|
| 1951 |
1948 |
/// \brief Start the batch processing
|
| 1952 |
1949 |
///
|
| 1953 |
1950 |
/// This function starts the batch processing
|
| 1954 |
1951 |
void run() {
|
| 1955 |
1952 |
|
| 1956 |
1953 |
LEMON_ASSERT(_is != 0, "This reader assigned to an other reader");
|
| 1957 |
1954 |
|
| 1958 |
1955 |
bool nodes_done = _skip_nodes;
|
| 1959 |
1956 |
bool edges_done = _skip_edges;
|
| 1960 |
1957 |
bool attributes_done = false;
|
| 1961 |
1958 |
|
| 1962 |
1959 |
line_num = 0;
|
| 1963 |
1960 |
readLine();
|
| 1964 |
1961 |
skipSection();
|
| 1965 |
1962 |
|
| 1966 |
1963 |
while (readSuccess()) {
|
| 1967 |
1964 |
try {
|
| 1968 |
1965 |
char c;
|
| 1969 |
1966 |
std::string section, caption;
|
| 1970 |
1967 |
line >> c;
|
| 1971 |
1968 |
_reader_bits::readToken(line, section);
|
| 1972 |
1969 |
_reader_bits::readToken(line, caption);
|
| 1973 |
1970 |
|
| 1974 |
1971 |
if (line >> c)
|
| 1975 |
|
throw FormatError("Extra character on the end of line");
|
|
1972 |
throw FormatError("Extra character at the end of line");
|
| 1976 |
1973 |
|
| 1977 |
1974 |
if (section == "nodes" && !nodes_done) {
|
| 1978 |
1975 |
if (_nodes_caption.empty() || _nodes_caption == caption) {
|
| 1979 |
1976 |
readNodes();
|
| 1980 |
1977 |
nodes_done = true;
|
| 1981 |
1978 |
}
|
| 1982 |
1979 |
} else if ((section == "edges" || section == "arcs") &&
|
| 1983 |
1980 |
!edges_done) {
|
| 1984 |
1981 |
if (_edges_caption.empty() || _edges_caption == caption) {
|
| 1985 |
1982 |
readEdges();
|
| 1986 |
1983 |
edges_done = true;
|
| 1987 |
1984 |
}
|
| 1988 |
1985 |
} else if (section == "attributes" && !attributes_done) {
|
| 1989 |
1986 |
if (_attributes_caption.empty() || _attributes_caption == caption) {
|
| 1990 |
1987 |
readAttributes();
|
| 1991 |
1988 |
attributes_done = true;
|
| 1992 |
1989 |
}
|
| 1993 |
1990 |
} else {
|
| 1994 |
1991 |
readLine();
|
| 1995 |
1992 |
skipSection();
|
| 1996 |
1993 |
}
|
| 1997 |
1994 |
} catch (FormatError& error) {
|
| 1998 |
1995 |
error.line(line_num);
|
| 1999 |
1996 |
error.file(_filename);
|
| ... |
... |
@@ -2074,58 +2071,58 @@
|
| 2074 |
2071 |
bool local_is;
|
| 2075 |
2072 |
std::string _filename;
|
| 2076 |
2073 |
|
| 2077 |
2074 |
typedef std::map<std::string, _reader_bits::Section*> Sections;
|
| 2078 |
2075 |
Sections _sections;
|
| 2079 |
2076 |
|
| 2080 |
2077 |
int line_num;
|
| 2081 |
2078 |
std::istringstream line;
|
| 2082 |
2079 |
|
| 2083 |
2080 |
public:
|
| 2084 |
2081 |
|
| 2085 |
2082 |
/// \brief Constructor
|
| 2086 |
2083 |
///
|
| 2087 |
2084 |
/// Construct a section reader, which reads from the given input
|
| 2088 |
2085 |
/// stream.
|
| 2089 |
2086 |
SectionReader(std::istream& is)
|
| 2090 |
2087 |
: _is(&is), local_is(false) {}
|
| 2091 |
2088 |
|
| 2092 |
2089 |
/// \brief Constructor
|
| 2093 |
2090 |
///
|
| 2094 |
2091 |
/// Construct a section reader, which reads from the given file.
|
| 2095 |
2092 |
SectionReader(const std::string& fn)
|
| 2096 |
2093 |
: _is(new std::ifstream(fn.c_str())), local_is(true),
|
| 2097 |
2094 |
_filename(fn) {
|
| 2098 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
2095 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 2099 |
2096 |
}
|
| 2100 |
2097 |
|
| 2101 |
2098 |
/// \brief Constructor
|
| 2102 |
2099 |
///
|
| 2103 |
2100 |
/// Construct a section reader, which reads from the given file.
|
| 2104 |
2101 |
SectionReader(const char* fn)
|
| 2105 |
2102 |
: _is(new std::ifstream(fn)), local_is(true),
|
| 2106 |
2103 |
_filename(fn) {
|
| 2107 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
2104 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 2108 |
2105 |
}
|
| 2109 |
2106 |
|
| 2110 |
2107 |
/// \brief Destructor
|
| 2111 |
2108 |
~SectionReader() {
|
| 2112 |
2109 |
for (Sections::iterator it = _sections.begin();
|
| 2113 |
2110 |
it != _sections.end(); ++it) {
|
| 2114 |
2111 |
delete it->second;
|
| 2115 |
2112 |
}
|
| 2116 |
2113 |
|
| 2117 |
2114 |
if (local_is) {
|
| 2118 |
2115 |
delete _is;
|
| 2119 |
2116 |
}
|
| 2120 |
2117 |
|
| 2121 |
2118 |
}
|
| 2122 |
2119 |
|
| 2123 |
2120 |
private:
|
| 2124 |
2121 |
|
| 2125 |
2122 |
friend SectionReader sectionReader(std::istream& is);
|
| 2126 |
2123 |
friend SectionReader sectionReader(const std::string& fn);
|
| 2127 |
2124 |
friend SectionReader sectionReader(const char* fn);
|
| 2128 |
2125 |
|
| 2129 |
2126 |
SectionReader(SectionReader& other)
|
| 2130 |
2127 |
: _is(other._is), local_is(other.local_is) {
|
| 2131 |
2128 |
|
| ... |
... |
@@ -2240,53 +2237,53 @@
|
| 2240 |
2237 |
/// @{
|
| 2241 |
2238 |
|
| 2242 |
2239 |
/// \brief Start the batch processing
|
| 2243 |
2240 |
///
|
| 2244 |
2241 |
/// This function starts the batch processing.
|
| 2245 |
2242 |
void run() {
|
| 2246 |
2243 |
|
| 2247 |
2244 |
LEMON_ASSERT(_is != 0, "This reader assigned to an other reader");
|
| 2248 |
2245 |
|
| 2249 |
2246 |
std::set<std::string> extra_sections;
|
| 2250 |
2247 |
|
| 2251 |
2248 |
line_num = 0;
|
| 2252 |
2249 |
readLine();
|
| 2253 |
2250 |
skipSection();
|
| 2254 |
2251 |
|
| 2255 |
2252 |
while (readSuccess()) {
|
| 2256 |
2253 |
try {
|
| 2257 |
2254 |
char c;
|
| 2258 |
2255 |
std::string section, caption;
|
| 2259 |
2256 |
line >> c;
|
| 2260 |
2257 |
_reader_bits::readToken(line, section);
|
| 2261 |
2258 |
_reader_bits::readToken(line, caption);
|
| 2262 |
2259 |
|
| 2263 |
2260 |
if (line >> c)
|
| 2264 |
|
throw FormatError("Extra character on the end of line");
|
|
2261 |
throw FormatError("Extra character at the end of line");
|
| 2265 |
2262 |
|
| 2266 |
2263 |
if (extra_sections.find(section) != extra_sections.end()) {
|
| 2267 |
2264 |
std::ostringstream msg;
|
| 2268 |
|
msg << "Multiple occurence of section " << section;
|
|
2265 |
msg << "Multiple occurence of section: " << section;
|
| 2269 |
2266 |
throw FormatError(msg.str());
|
| 2270 |
2267 |
}
|
| 2271 |
2268 |
Sections::iterator it = _sections.find(section);
|
| 2272 |
2269 |
if (it != _sections.end()) {
|
| 2273 |
2270 |
extra_sections.insert(section);
|
| 2274 |
2271 |
it->second->process(*_is, line_num);
|
| 2275 |
2272 |
}
|
| 2276 |
2273 |
readLine();
|
| 2277 |
2274 |
skipSection();
|
| 2278 |
2275 |
} catch (FormatError& error) {
|
| 2279 |
2276 |
error.line(line_num);
|
| 2280 |
2277 |
error.file(_filename);
|
| 2281 |
2278 |
throw;
|
| 2282 |
2279 |
}
|
| 2283 |
2280 |
}
|
| 2284 |
2281 |
for (Sections::iterator it = _sections.begin();
|
| 2285 |
2282 |
it != _sections.end(); ++it) {
|
| 2286 |
2283 |
if (extra_sections.find(it->first) == extra_sections.end()) {
|
| 2287 |
2284 |
std::ostringstream os;
|
| 2288 |
2285 |
os << "Cannot find section: " << it->first;
|
| 2289 |
2286 |
throw FormatError(os.str());
|
| 2290 |
2287 |
}
|
| 2291 |
2288 |
}
|
| 2292 |
2289 |
}
|
| ... |
... |
@@ -2366,58 +2363,58 @@
|
| 2366 |
2363 |
std::vector<std::vector<std::string> > _node_maps;
|
| 2367 |
2364 |
std::vector<std::vector<std::string> > _edge_maps;
|
| 2368 |
2365 |
|
| 2369 |
2366 |
std::vector<std::vector<std::string> > _attributes;
|
| 2370 |
2367 |
|
| 2371 |
2368 |
|
| 2372 |
2369 |
int line_num;
|
| 2373 |
2370 |
std::istringstream line;
|
| 2374 |
2371 |
|
| 2375 |
2372 |
public:
|
| 2376 |
2373 |
|
| 2377 |
2374 |
/// \brief Constructor
|
| 2378 |
2375 |
///
|
| 2379 |
2376 |
/// Construct an \e LGF contents reader, which reads from the given
|
| 2380 |
2377 |
/// input stream.
|
| 2381 |
2378 |
LgfContents(std::istream& is)
|
| 2382 |
2379 |
: _is(&is), local_is(false) {}
|
| 2383 |
2380 |
|
| 2384 |
2381 |
/// \brief Constructor
|
| 2385 |
2382 |
///
|
| 2386 |
2383 |
/// Construct an \e LGF contents reader, which reads from the given
|
| 2387 |
2384 |
/// file.
|
| 2388 |
2385 |
LgfContents(const std::string& fn)
|
| 2389 |
2386 |
: _is(new std::ifstream(fn.c_str())), local_is(true) {
|
| 2390 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
2387 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 2391 |
2388 |
}
|
| 2392 |
2389 |
|
| 2393 |
2390 |
/// \brief Constructor
|
| 2394 |
2391 |
///
|
| 2395 |
2392 |
/// Construct an \e LGF contents reader, which reads from the given
|
| 2396 |
2393 |
/// file.
|
| 2397 |
2394 |
LgfContents(const char* fn)
|
| 2398 |
2395 |
: _is(new std::ifstream(fn)), local_is(true) {
|
| 2399 |
|
if (!(*_is)) throw IoError(fn, "Cannot open file");
|
|
2396 |
if (!(*_is)) throw IoError("Cannot open file", fn);
|
| 2400 |
2397 |
}
|
| 2401 |
2398 |
|
| 2402 |
2399 |
/// \brief Destructor
|
| 2403 |
2400 |
~LgfContents() {
|
| 2404 |
2401 |
if (local_is) delete _is;
|
| 2405 |
2402 |
}
|
| 2406 |
2403 |
|
| 2407 |
2404 |
private:
|
| 2408 |
2405 |
|
| 2409 |
2406 |
LgfContents(const LgfContents&);
|
| 2410 |
2407 |
LgfContents& operator=(const LgfContents&);
|
| 2411 |
2408 |
|
| 2412 |
2409 |
public:
|
| 2413 |
2410 |
|
| 2414 |
2411 |
|
| 2415 |
2412 |
/// \name Node sections
|
| 2416 |
2413 |
/// @{
|
| 2417 |
2414 |
|
| 2418 |
2415 |
/// \brief Gives back the number of node sections in the file.
|
| 2419 |
2416 |
///
|
| 2420 |
2417 |
/// Gives back the number of node sections in the file.
|
| 2421 |
2418 |
int nodeSectionNum() const {
|
| 2422 |
2419 |
return _node_sections.size();
|
| 2423 |
2420 |
}
|