Skip to content

Instantly share code, notes, and snippets.

@Smerity
Last active August 29, 2015 13:56
Show Gist options
  • Save Smerity/9196981 to your computer and use it in GitHub Desktop.
Save Smerity/9196981 to your computer and use it in GitHub Desktop.
"Special" error in C++
smerity@pegasus:/tmp$ clang++ -std=c++0x Graph.hpp
Graph.hpp:268:32: error: expected ')'
if (n.uid_ == edges_[*it]node1 || n.uid_ == edges_[*it].node2) {
^
Graph.hpp:268:10: note: to match this '('
if (n.uid_ == edges_[*it]node1 || n.uid_ == edges_[*it].node2) {
^
Graph.hpp:272:7: error: expected ')'
}
^
Graph.hpp:269:20: note: to match this '('
remove_edge(Node(this,edges_[*it].node1), Node(this,edges_[*it].node2)
^
Graph.hpp:758:7: error: expected '}'
#endif
^
Graph.hpp:259:35: note: to match this '{'
void remove_node(const Node& n) {
Graph.hpp:756:2: error: expected ';' after class
};
^
;
smerity@pegasus:~/cs207$ make viewer
/usr/bin/g++ -std=gnu++0x -fopenmp -funroll-loops -O3 -W -Wall -Wextra -Wfatal-errors -I. -MD -MF .deps/viewer.d -c -o viewer.o viewer.cpp
viewer.cpp:70:1: error: expected ‘}’ at end of input
compilation terminated due to -Wfatal-errors.
make: *** [viewer.o] Error 1
smerity@pegasus:/tmp$ g++ -std=c++11 Graph.hpp
Graph.hpp:756:2: error: expected ‘}’ at end of input
Graph.hpp: In constructor ‘Graph<V>::Graph()’:
Graph.hpp:76:9: error: class ‘Graph<V>’ does not have any field named ‘size_’
Graph.hpp:76:19: error: class ‘Graph<V>’ does not have any field named ‘size_nodes_’
Graph.hpp:76:35: error: class ‘Graph<V>’ does not have any field named ‘nodes_’
Graph.hpp:76:45: error: class ‘Graph<V>’ does not have any field named ‘i2u_’
Graph.hpp:76:53: error: class ‘Graph<V>’ does not have any field named ‘i2ue_’
Graph.hpp:76:62: error: class ‘Graph<V>’ does not have any field named ‘edges_’
Graph.hpp:76:72: error: class ‘Graph<V>’ does not have any field named ‘num_edges_’
Graph.hpp:76:87: error: class ‘Graph<V>’ does not have any field named ‘num_edges_all_’
Graph.hpp: In member function ‘Graph<V>::size_type Graph<V>::size() const’:
Graph.hpp:188:12: error: ‘size_’ was not declared in this scope
Graph.hpp: In member function ‘Graph<V>::size_type Graph<V>::num_nodes() const’:
Graph.hpp:193:12: error: ‘size_’ was not declared in this scope
Graph.hpp: In member function ‘Graph<V>::Node Graph<V>::add_node(const Point&, const node_value_type&)’:
Graph.hpp:205:5: error: ‘node_elements’ was not declared in this scope
Graph.hpp:205:19: error: expected ‘;’ before ‘new_node’
Graph.hpp:206:5: error: ‘new_node’ was not declared in this scope
Graph.hpp:207:23: error: ‘size_nodes_’ was not declared in this scope
Graph.hpp:210:5: error: ‘nodes_’ was not declared in this scope
Graph.hpp:212:5: error: ‘i2u_’ was not declared in this scope
Graph.hpp:215:7: error: ‘size_’ was not declared in this scope
Graph.hpp: In member function ‘bool Graph<V>::has_node(const Graph<V>::Node&) const’:
Graph.hpp:229:21: error: ‘size_’ was not declared in this scope
Graph.hpp: In member function ‘Graph<V>::Node Graph<V>::node(Graph<V>::size_type) const’:
Graph.hpp:245:5: error: ‘nodes_’ was not declared in this scope
Graph.hpp:246:23: error: ‘i2u_’ was not declared in this scope
Graph.hpp: In member function ‘void Graph<V>::remove_node(const Graph<V>::Node&)’:
Graph.hpp:263:5: error: ‘i2u_’ was not declared in this scope
Graph.hpp:267:20: error: ‘i2ue_’ was not declared in this scope
Graph.hpp:268:21: error: ‘edges_’ was not declared in this scope
Graph.hpp:268:32: error: expected ‘)’ before ‘node1’
Graph.hpp:272:7: error: expected ‘)’ before ‘}’ token
Graph.hpp:272:7: error: expected ‘;’ before ‘}’ token
Graph.hpp:286:5: error: ‘size_’ was not declared in this scope
Graph.hpp: At global scope:
Graph.hpp:287:3: error: expected unqualified-id at end of input
...
for (auto it = i2ue_.begin(); it != i2ue_.end();) {
if (n.uid_ == edges_[*it]node1 || n.uid_ == edges_[*it].node2) {
remove_edge(Node(this,edges_[*it].node1), Node(this,edges_[*it].node2)
}
...
should have been
...
for (auto it = i2ue_.begin(); it != i2ue_.end();) {
if (n.uid_ == edges_[*it].node1 || n.uid_ == edges_[*it].node2) {
remove_edge(Node(this,edges_[*it].node1), Node(this,edges_[*it].node2));
}
...
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment