10000 fixed indentation a bit · davinash/arangodb@b067d73 · GitHub
[go: up one dir, main page]

Skip to content

Commit b067d73

Browse files
committed
fixed indentation a bit
1 parent 319c05c commit b067d73

File tree

1 file changed

+16
-16
lines changed

1 file changed

+16
-16
lines changed

arangod/Agency/Node.cpp

Lines changed: 16 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -920,11 +920,11 @@ double Node::getDouble() const {
920920
}
921921

922922

923-
std::pair<Node const &, bool> Node::hasAsNode (
923+
std::pair<Node const &, bool> Node::hasAsNode(
924924
std::string const & url) const {
925925

926926
// *this is bogus initializer
927-
std::pair<Node const &, bool> fail_pair={*this, false};
927+
std::pair<Node const &, bool> fail_pair= {*this, false};
928928

929929
// retrieve node, throws if does not exist
930930
try {
@@ -941,11 +941,11 @@ std::pair<Node const &, bool> Node::hasAsNode (
941941
} // hasAsNode
942942

943943

944-
std::pair<Node &, bool> Node::hasAsWritableNode (
944+
std::pair<Node &, bool> Node::hasAsWritableNode(
945945
std::string const & url) {
946946

947947
// *this is bogus initializer
948-
std::pair<Node &, bool> fail_pair={*this, false};
948+
std::pair<Node &, bool> fail_pair= {*this, false};
949949

950950
// retrieve node, throws if does not exist
951951
try {
@@ -962,7 +962,7 @@ std::pair<Node &, bool> Node::hasAsWritableNode (
962962
} // hasAsWritableNode
963963

964964

965-
std::pair<NodeType, bool> Node::hasAsType (
965+
std::pair<NodeType, bool> Node::hasAsType(
966966
std::string const & url) const {
967967

968968
std::pair<NodeType, bool> ret_pair={NODE, false};
@@ -1004,14 +1004,14 @@ std::pair<Slice, bool> Node::hasAsSlice(
10041004
} // hasAsSlice
10051005

10061006

1007-
std::pair<uint64_t, bool> Node::hasAsUInt (
1007+
std::pair<uint64_t, bool> Node::hasAsUInt(
10081008
std::string const & url) const {
10091009
std::pair<uint64_t, bool> ret_pair(0, false);
10101010

10111011
// retrieve node, throws if does not exist
10121012
try {
10131013
Node const & target(operator()(url));
1014-
ret_pair.first=target.getUInt();
1014+
ret_pair.first = target.getUInt();
10151015
ret_pair.second = true;
10161016
} catch (...) {
10171017
// do nothing, ret_pair second already false
@@ -1023,14 +1023,14 @@ std::pair<uint64_t, bool> Node::hasAsUInt (
10231023
} // hasAsUInt
10241024

10251025

1026-
std::pair<bool, bool> Node::hasAsBool (
1026+
std::pair<bool, bool> Node::hasAsBool(
10271027
std::string const & url) const {
10281028
std::pair<bool, bool> ret_pair(false, false);
10291029

10301030
// retrieve node, throws if does not exist
10311031
try {
10321032
Node const & target(operator()(url));
1033-
ret_pair.first=target.getBool();
1033+
ret_pair.first = target.getBool();
10341034
ret_pair.second = true;
10351035
} catch (...) {
10361036
// do nothing, ret_pair second already false
@@ -1042,16 +1042,16 @@ std::pair<bool, bool> Node::hasAsBool (
10421042
} // hasAsBool
10431043

10441044

1045-
std::pair<std::string, bool> Node::hasAsString (
1045+
std::pair<std::string, bool> Node::hasAsString(
10461046
std::string const & url) const {
10471047
std::pair<std::string, bool> ret_pair;
10481048

1049-
ret_pair.second=false;
1049+
ret_pair.second = false;
10501050

10511051
// retrieve node, throws if does not exist
10521052
try {
10531053
Node const & target(operator()(url));
1054-
ret_pair.first=target.getString();
1054+
ret_pair.first = target.getString();
10551055
ret_pair.second = true;
10561056
} catch (...) {
10571057
// do nothing, ret_pair second already false
@@ -1063,7 +1063,7 @@ std::pair<std::string, bool> Node::hasAsString (
10631063
} // hasAsString
10641064

10651065

1066-
std::pair<Node::Children, bool> Node::hasAsChildren (
1066+
std::pair<Node::Children, bool> Node::hasAsChildren(
10671067
std::string const & url) const {
10681068
std::pair<Children, bool> ret_pair;
10691069

@@ -1072,7 +1072,7 @@ std::pair<Node::Children, bool> Node::hasAsChildren (
10721072
// retrieve node, throws if does not exist
10731073
try {
10741074
Node const & target(operator()(url));
1075-
ret_pair.first=target.children();
1075+
ret_pair.first = target.children();
10761076
ret_pair.second = true;
10771077
} catch (...) {
10781078
// do nothing, ret_pair second already false
@@ -1084,7 +1084,7 @@ std::pair<Node::Children, bool> Node::hasAsChildren (
10841084
} // hasAsChildren
10851085

10861086

1087-
std::pair<void *, bool> Node::hasAsBuilder (
1087+
std::pair<void *, bool> Node::hasAsBuilder(
10881088
std::string const & url, Builder & builder, bool showHidden) const {
10891089
std::pair<void *, bool> ret_pair(nullptr, false);
10901090

@@ -1103,7 +1103,7 @@ std::pair<void *, bool> Node::hasAsBuilder (
11031103
} // hasAsBuilder
11041104

11051105

1106-
std::pair<Builder, bool> Node::hasAsBuilder (
1106+
std::pair<Builder, bool> Node::hasAsBuilder(
11071107
std::string const & url) const {
11081108
Builder builder;
11091109
std::pair<Builder, bool> ret_pair(builder, false);

0 commit comments

Comments
 (0)
0