1 files changed, 158 insertions, 0 deletions
diff --git a/thirdparty/vhacd/inc/vhacdSArray.h b/thirdparty/vhacd/inc/vhacdSArray.h
new file mode 100644
index 0000000000..4d84d1ae26
--- /dev/null
+++ b/thirdparty/vhacd/inc/vhacdSArray.h
@@ -0,0 +1,158 @@
+/* Copyright (c) 2011 Khaled Mamou (kmamou at gmail dot com)
+ All rights reserved.
+ 
+ 
+ Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+ 
+ 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+ 
+ 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+ 
+ 3. The names of the contributors may not be used to endorse or promote products derived from this software without specific prior written permission.
+ 
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+#pragma once
+#ifndef VHACD_SARRAY_H
+#define VHACD_SARRAY_H
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#define SARRAY_DEFAULT_MIN_SIZE 16
+
+namespace VHACD {
+//!    SArray.
+template <typename T, size_t N = 64>
+class SArray {
+public:
+    T& operator[](size_t i)
+    {
+        T* const data = Data();
+        return data[i];
+    }
+    const T& operator[](size_t i) const
+    {
+        const T* const data = Data();
+        return data[i];
+    }
+    size_t Size() const
+    {
+        return m_size;
+    }
+    T* const Data()
+    {
+        return (m_maxSize == N) ? m_data0 : m_data;
+    }
+    const T* const Data() const
+    {
+        return (m_maxSize == N) ? m_data0 : m_data;
+    }
+    void Clear()
+    {
+        m_size = 0;
+        delete[] m_data;
+        m_data = 0;
+        m_maxSize = N;
+    }
+    void PopBack()
+    {
+        --m_size;
+    }
+    void Allocate(size_t size)
+    {
+        if (size > m_maxSize) {
+            T* temp = new T[size];
+            memcpy(temp, Data(), m_size * sizeof(T));
+            delete[] m_data;
+            m_data = temp;
+            m_maxSize = size;
+        }
+    }
+    void Resize(size_t size)
+    {
+        Allocate(size);
+        m_size = size;
+    }
+
+    void PushBack(const T& value)
+    {
+        if (m_size == m_maxSize) {
+            size_t maxSize = (m_maxSize << 1);
+            T* temp = new T[maxSize];
+            memcpy(temp, Data(), m_maxSize * sizeof(T));
+            delete[] m_data;
+            m_data = temp;
+            m_maxSize = maxSize;
+        }
+        T* const data = Data();
+        data[m_size++] = value;
+    }
+    bool Find(const T& value, size_t& pos)
+    {
+        T* const data = Data();
+        for (pos = 0; pos < m_size; ++pos)
+            if (value == data[pos])
+                return true;
+        return false;
+    }
+    bool Insert(const T& value)
+    {
+        size_t pos;
+        if (Find(value, pos))
+            return false;
+        PushBack(value);
+        return true;
+    }
+    bool Erase(const T& value)
+    {
+        size_t pos;
+        T* const data = Data();
+        if (Find(value, pos)) {
+            for (size_t j = pos + 1; j < m_size; ++j)
+                data[j - 1] = data[j];
+            --m_size;
+            return true;
+        }
+        return false;
+    }
+    void operator=(const SArray& rhs)
+    {
+        if (m_maxSize < rhs.m_size) {
+            delete[] m_data;
+            m_maxSize = rhs.m_maxSize;
+            m_data = new T[m_maxSize];
+        }
+        m_size = rhs.m_size;
+        memcpy(Data(), rhs.Data(), m_size * sizeof(T));
+    }
+    void Initialize()
+    {
+        m_data = 0;
+        m_size = 0;
+        m_maxSize = N;
+    }
+    SArray(const SArray& rhs)
+    {
+        m_data = 0;
+        m_size = 0;
+        m_maxSize = N;
+        *this = rhs;
+    }
+    SArray()
+    {
+        Initialize();
+    }
+    ~SArray()
+    {
+        delete[] m_data;
+    }
+
+private:
+    T m_data0[N];
+    T* m_data;
+    size_t m_size;
+    size_t m_maxSize;
+};
+}
+#endif
+\ No newline at end of file