Make MessageQueue::pop return a unique_ptr

Avoids accidental memory leaks

libs/network/include/s25util/MessageQueue.h

@@ -4,13 +4,14 @@
 
 #pragma once
 
+#include "Message.h"
 #include "MessageHandler.h"
 #include <boost/ptr_container/ptr_deque.hpp>
 #include <cstddef>
 #include <deque>
+#include <memory>
 #include <queue>
 
-class Message;
 class Socket;
 
 // class Socket;
@@ -45,12 +46,9 @@ class MessageQueue : protected MessageHandler
     /// hängt ein Element hinten an.
     void push(Message* message);
     /// liefert das vorderste Element der Queue.
-    Message* front();
+    Message* peek();
     /// entfernt das vorderste Element aus der Queue.
-    void pop();
-    /// Returns the first element and removes it from the queue. Returns nullptr if there is none
-    /// Caller is responsible for deleting it!
-    Message* popFront();
+    std::unique_ptr<Message> pop();
 
 private:
     boost::ptr_deque<Message> messages;

libs/network/src/MessageQueue.cpp

@@ -25,25 +25,16 @@ void MessageQueue::push(Message* message)
     messages.push_back(message);
 }
 
-Message* MessageQueue::front()
+Message* MessageQueue::peek()
 {
-    return (!messages.empty() ? &messages.front() : nullptr);
+    return messages.empty() ? nullptr : &messages.front();
 }
 
-/**
- *  entfernt das vorderste Element aus der Queue.
- */
-void MessageQueue::pop()
-{
-    if(!messages.empty())
-        messages.pop_front();
-}
-
-Message* MessageQueue::popFront()
+std::unique_ptr<Message> MessageQueue::pop()
 {
     if(messages.empty())
         return nullptr;
-    return messages.pop_front().release();
+    return std::unique_ptr<Message>(messages.pop_front().release());
 }
 
 int MessageQueue::recv(Socket& sock, unsigned timeoutInMs)
@@ -98,7 +89,7 @@ bool MessageQueue::send(Socket& sock, int max, unsigned sizelimit)
     int count = 0;
     while(count <= max && !messages.empty())
     {
-        const Message& msg = *front(); //-V522
+        const Message& msg = *peek(); //-V522
 
         if(msg.getId() > 0)
         {