AP_HAL: rename ringbuffer empty() to is_empty()

libraries/AP_HAL/utility/RingBuffer.cpp

@@ -71,7 +71,7 @@ uint32_t ByteBuffer::space(void) const
     return ret;
 }
 
-bool ByteBuffer::empty(void) const
+bool ByteBuffer::is_empty(void) const
 {
     return head == tail;
 }

libraries/AP_HAL/utility/RingBuffer.h

@@ -24,7 +24,7 @@ public:
     uint32_t space(void) const;
 
     // true if available() is zero
-    bool empty(void) const;
+    bool is_empty(void) const;
 
     // write bytes to ringbuffer. Returns number of bytes written
     uint32_t write(const uint8_t *data, uint32_t len);
@@ -142,8 +142,8 @@ public:
 
     // true is available() == 0
     // !!! Note ObjectBuffer_TS is a duplicate of this update, in both places !!!
-    bool empty(void) const {
-        return buffer->empty();
+    bool is_empty(void) const {
+        return buffer->is_empty();
     }
 
     // push one object onto the back of the queue
@@ -309,9 +309,9 @@ public:
 
     // true is available() == 0
     // !!! Note this is a duplicate of ObjectBuffer with semaphore, update in both places !!!
-    bool empty(void) {
+    bool is_empty(void) {
         WITH_SEMAPHORE(sem);
-        return buffer->empty();
+        return buffer->is_empty();
     }
 
     // push one object onto the back of the queue
@@ -459,7 +459,7 @@ public:
     }
 
     // true is available() == 0
-    bool empty(void) const {
+    bool is_empty(void) const {
         return _count == 0;
     }
 
@@ -477,7 +477,7 @@ public:
       throw away an object
      */
     bool pop(void) {
-        if (empty()) {
+        if (is_empty()) {
             return false;
         }
         _head = (_head+1) % _size;
@@ -495,7 +495,7 @@ public:
       pop earliest object off the queue
      */
     bool pop(T &object) {
-        if (empty()) {
+        if (is_empty()) {
             return false;
         }
         object = _buffer[_head];