Added const variants.

Author: peterpolidoro

README.org

@@ -4,7 +4,7 @@
 
 * Library Information
   - Name :: Vector
-  - Version :: 1.0.1
+  - Version :: 1.1.0
   - License :: BSD
   - URL :: https://github.com/janelia-arduino/Vector
   - Author :: Peter Polidoro

library.properties

@@ -1,5 +1,5 @@
 name=Vector
-version=1.0.1
+version=1.1.0
 author=Peter Polidoro <peterpolidoro@gmail.com>
 maintainer=Peter Polidoro <peterpolidoro@gmail.com>
 sentence=An array container similar to the C++ std::vector

src/Vector.h

@@ -24,8 +24,10 @@ class Vector
   template <size_t MAX_SIZE>
   void setStorage(T (&values)[MAX_SIZE], size_t size=0);
   void setStorage(T * values, size_t max_size, size_t size);
-  T & operator[](const size_t index);
-  T & at(const size_t index);
+  const T & operator[](size_t index) const;
+  T & operator[](size_t index);
+  const T & at(size_t index) const;
+  T & at(size_t index);
   T & front();
   T & back();
   void clear();
@@ -34,20 +36,21 @@ class Vector
   template <typename U, size_t N>
   void fill(const U (&values)[N]);
   template <typename U>
-  void fill(Vector<U> & values);
+  void fill(const Vector<U> & values);
   template <typename U>
-  void assign(const size_t n, const U & value);
+  void assign(size_t n, const U & value);
   template <typename U, size_t N>
-  void assign(const size_t n, const U (&values)[N]);
+  void assign(size_t n, const U (&values)[N]);
   template <typename U>
-  void assign(const size_t n, Vector<U> & values);
+  void assign(size_t n, const Vector<U> & values);
   void push_back(const T & value);
   void pop_back();
-  void remove(const size_t index);
+  void remove(size_t index);
   size_t size() const;
   size_t max_size() const;
   bool empty() const;
   bool full() const;
+  const T * data() const;
   T * data();
 
 private:
@@ -57,7 +60,7 @@ class Vector
 };
 
 template <typename T>
-inline Print & operator <<(Print & stream, Vector<T> & vector)
+inline Print & operator <<(Print & stream, const Vector<T> & vector)
 {
   stream.print("[");
   for (size_t i=0; i<vector.size(); ++i)

src/Vector/VectorDefinitions.h

@@ -45,13 +45,25 @@ void Vector<T>::setStorage(T * values, size_t max_size, size_t size)
 }
 
 template <typename T>
-T & Vector<T>::operator[](const size_t index)
+const T & Vector<T>::operator[](size_t index) const
 {
   return values_[index];
 }
 
 template <typename T>
-T & Vector<T>::at(const size_t index)
+T & Vector<T>::operator[](size_t index)
+{
+  return values_[index];
+}
+
+template <typename T>
+T & Vector<T>::at(size_t index)
+{
+  return values_[index];
+}
+
+template <typename T>
+const T & Vector<T>::at(size_t index) const
 {
   return values_[index];
 }
@@ -90,14 +102,14 @@ void Vector<T>::fill(const U (&values)[N])
 
 template <typename T>
 template <typename U>
-void Vector<T>::fill(Vector<U> & values)
+void Vector<T>::fill(const Vector<U> & values)
 {
   assign(values.size(),values);
 }
 
 template <typename T>
 template <typename U>
-void Vector<T>::assign(const size_t n, const U & value)
+void Vector<T>::assign(size_t n, const U & value)
 {
   size_t assign_size = ((n < max_size_) ? n : max_size_);
   size_ = assign_size;
@@ -109,7 +121,7 @@ void Vector<T>::assign(const size_t n, const U & value)
 
 template <typename T>
 template <typename U, size_t N>
-void Vector<T>::assign(const size_t n, const U (&values)[N])
+void Vector<T>::assign(size_t n, const U (&values)[N])
 {
   size_t n_smallest = ((n < N) ? n : N);
   size_t assign_size = ((n_smallest < max_size_) ? n_smallest : max_size_);
@@ -122,7 +134,7 @@ void Vector<T>::assign(const size_t n, const U (&values)[N])
 
 template <typename T>
 template <typename U>
-void Vector<T>::assign(const size_t n, Vector<U> & values)
+void Vector<T>::assign(size_t n, const Vector<U> & values)
 {
   size_t n_smallest = ((n < values.size()) ? n : values.size());
   size_t assign_size = ((n_smallest < max_size_) ? n_smallest : max_size_);
@@ -152,7 +164,7 @@ void Vector<T>::pop_back()
 }
 
 template <typename T>
-void Vector<T>::remove(const size_t index)
+void Vector<T>::remove(size_t index)
 {
   if (size_ > index)
   {
@@ -194,4 +206,10 @@ T * Vector<T>::data()
   return values_;
 }
 
+template <typename T>
+const T * Vector<T>::data() const
+{
+  return values_;
+}
+
 #endif