diff options
author | danieldg <danieldg@e03df62e-2008-0410-955e-edbf42e46eb7> | 2009-09-02 00:49:36 +0000 |
---|---|---|
committer | danieldg <danieldg@e03df62e-2008-0410-955e-edbf42e46eb7> | 2009-09-02 00:49:36 +0000 |
commit | 86775e2e98f55b3b88befe2daff0ca23f02f3155 (patch) | |
tree | cbc3abf3f55ae6fd1112bcf6bf44e02b502ac2d6 /src/modules/m_spanningtree/override_map.cpp | |
parent | 3d8ec5dbd9cfde34fcbc63ad7b9b1369866f0a33 (diff) |
ModResult conversion: Change return type of all module functions
git-svn-id: http://svn.inspircd.org/repository/trunk/inspircd@11634 e03df62e-2008-0410-955e-edbf42e46eb7
Diffstat (limited to 'src/modules/m_spanningtree/override_map.cpp')
-rw-r--r-- | src/modules/m_spanningtree/override_map.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/modules/m_spanningtree/override_map.cpp b/src/modules/m_spanningtree/override_map.cpp index 989ee8900..e3f103cc8 100644 --- a/src/modules/m_spanningtree/override_map.cpp +++ b/src/modules/m_spanningtree/override_map.cpp @@ -80,7 +80,7 @@ void ModuleSpanningTree::ShowMap(TreeServer* Current, User* user, int depth, int // and divisons, we instead render the map onto a backplane of characters // (a character matrix), then draw the branches as a series of "L" shapes // from the nodes. This is not only friendlier on CPU it uses less stack. -int ModuleSpanningTree::HandleMap(const std::vector<std::string>& parameters, User* user) +bool ModuleSpanningTree::HandleMap(const std::vector<std::string>& parameters, User* user) { if (parameters.size() > 0) { @@ -104,7 +104,7 @@ int ModuleSpanningTree::HandleMap(const std::vector<std::string>& parameters, Us // Don't return if s == Utils->TreeRoot (us) if (ret) - return 1; + return true; } // These arrays represent a virtual screen which we will @@ -189,6 +189,6 @@ int ModuleSpanningTree::HandleMap(const std::vector<std::string>& parameters, Us delete[] names; delete[] stats; - return 1; + return true; } |