rename Vector to vector

c_os/user/demo/SmartPointerDemo.cc

@@ -110,7 +110,7 @@ void SmartPointerDemo::run() {
 
     {
         log.info() << "ArrayList<bse::unique_ptr<int>>..." << endl;
-        bse::Vector<bse::unique_ptr<int>> vec;
+        bse::vector<bse::unique_ptr<int>> vec;
         log.info() << "2x insertion" << endl;
         vec.push_back(bse::make_unique<int>(1));
         vec.push_back(bse::make_unique<int>(2));

c_os/user/demo/VectorDemo.cc

@@ -1,6 +1,6 @@
 #include "user/demo/VectorDemo.h"
 
-void print(bse::Vector<int> list) {
+void print(bse::vector<int> list) {
     kout << "Printing List: ";
     for (int i : list) {
         kout << i << " ";
@@ -9,7 +9,7 @@ void print(bse::Vector<int> list) {
 }
 
 void VectorDemo::run() {
-    bse::Vector<int> list;
+    bse::vector<int> list;
 
     kout.lock();
     kout.clear();

c_os/user/event/KeyEventManager.cc

@@ -8,7 +8,7 @@ void KeyEventManager::subscribe(KeyEventListener& sub) {
 
 void KeyEventManager::unsubscribe(KeyEventListener& unsub) {
     log.debug() << "Unsubscribe, Thread ID: " << dec << unsub.tid << endl;
-    for (bse::Vector<KeyEventListener*>::Iterator it = listeners.begin(); it != listeners.end(); ++it) {
+    for (bse::vector<KeyEventListener*>::Iterator it = listeners.begin(); it != listeners.end(); ++it) {
         if ((*it)->tid == unsub.tid) {
             this->listeners.erase(it);
             return;

c_os/user/event/KeyEventManager.h

@@ -14,7 +14,7 @@ private:
 
     NamedLogger log;
 
-    bse::Vector<KeyEventListener*> listeners;
+    bse::vector<KeyEventListener*> listeners;
 
 public:
     KeyEventManager() : log("KEvMan") {}

c_os/user/lib/Vector.h

@@ -13,7 +13,7 @@
 namespace bse {
 
     template<typename T>
-    class Vector {
+    class vector {
     public:
         using Iterator = ContinuousIterator<T>;
 
@@ -27,8 +27,8 @@ namespace bse {
         std::size_t buf_cap = 0;
 
         void init() {
-            buf = new T[Vector::default_cap];
-            buf_cap = Vector::default_cap;
+            buf = new T[vector::default_cap];
+            buf_cap = vector::default_cap;
         }
 
         std::size_t get_rem_cap() const {
@@ -98,7 +98,7 @@ namespace bse {
         }
 
     public:
-        ~Vector() {
+        ~vector() {
             for (std::size_t i; i < size(); ++i) {
                 buf[i].~T();  // TODO: I think delete[] buf calls these, verify that
             }
@@ -237,9 +237,9 @@ namespace bse {
     // NOTE: pred is no real predicate as one would need closures for this, but we don't have <functional> available
     //       This means the result has to be passed separately and the function differs from the c++20 std::erase_if
     template<typename T, typename arg>
-    std::size_t erase_if(Vector<T>& vec, arg (*pred)(const T&), arg result) {
+    std::size_t erase_if(vector<T>& vec, arg (*pred)(const T&), arg result) {
         std::size_t erased_els = 0;
-        for (typename Vector<T>::Iterator it = vec.begin(); it != vec.end(); /*Do nothing*/) {
+        for (typename vector<T>::Iterator it = vec.begin(); it != vec.end(); /*Do nothing*/) {
             if (pred(*it) == result) {
                 it = vec.erase(it);  // erase returns the iterator to the next element
                 ++erased_els;