New helpers is utilities_containers

Change-Id: Ibb653c89a556c3bb32ce891e786719f70b56431f

runtime/utilities/range.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2017-2018 Intel Corporation
+ * Copyright (C) 2017-2019 Intel Corporation
  *
  * SPDX-License-Identifier: MIT
  *
@@ -7,28 +7,77 @@
 
 #pragma once
 
+#include <iterator>
+
 namespace OCLRT {
 
-template <typename T>
+template <typename DataType>
 struct Range {
-    Range(T *base, size_t count)
-        : Beg(base), End(base + count) {
+    using iterator = DataType *;
+    using const_iterator = const DataType *;
+    using reverse_iterator = std::reverse_iterator<iterator>;
+    using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+
+    Range(DataType *base, size_t count)
+        : begIt(base), endIt(base + count) {
     }
 
-    T *begin() {
-        return Beg;
+    template <typename SequentialContainerT, typename BeginT = decltype(((SequentialContainerT *)nullptr)->size())>
+    Range(SequentialContainerT &container)
+        : Range(&*container.begin(), container.size()) {
     }
 
-    T *end() {
-        return End;
+    template <typename T, size_t S>
+    Range(T (&base)[S])
+        : Range(&base[0], S) {
     }
 
-    T *Beg;
-    T *End;
+    iterator begin() {
+        return begIt;
+    }
+
+    iterator end() {
+        return endIt;
+    }
+
+    const_iterator begin() const {
+        return begIt;
+    }
+
+    const_iterator end() const {
+        return endIt;
+    }
+
+    reverse_iterator rbegin() {
+        return reverse_iterator(end());
+    }
+
+    const_reverse_iterator rbegin() const {
+        return const_reverse_iterator(end());
+    }
+
+    reverse_iterator rend() {
+        return reverse_iterator(end()) + (endIt - begIt);
+    }
+
+    const_reverse_iterator rend() const {
+        return const_reverse_iterator(end()) + (endIt - begIt);
+    }
+
+    bool empty() const {
+        return begIt == endIt;
+    }
+
+    size_t size() const {
+        return endIt - begIt;
+    }
+
+    iterator begIt;
+    iterator endIt;
 };
 
 template <typename T>
-Range<T> CreateRange(T *base, size_t count) {
+inline Range<T> CreateRange(T *base, size_t count) {
     return Range<T>(base, count);
 }
 } // namespace OCLRT

runtime/utilities/stackvec.h

@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 2018 Intel Corporation
+ * Copyright (C) 2018-2019 Intel Corporation
  *
  * SPDX-License-Identifier: MIT
  *
@@ -11,6 +11,7 @@
 
 #include <cinttypes>
 #include <cstddef>
+#include <iterator>
 #include <vector>
 
 template <typename DataType, size_t OnStackCapacity>
@@ -58,6 +59,13 @@ class StackVec {
         resize(initialSize);
     }
 
+    StackVec(std::initializer_list<DataType> init) {
+        reserve(init.size());
+        for (const auto &obj : init) {
+            push_back(obj);
+        }
+    }
+
     StackVec &operator=(const StackVec &rhs) {
         clear();
 
@@ -321,3 +329,9 @@ bool operator==(const StackVec<T, LhsStackCaps> &lhs,
 
     return true;
 }
+
+template <typename T, size_t LhsStackCaps, size_t RhsStackCaps>
+bool operator!=(const StackVec<T, LhsStackCaps> &lhs,
+                const StackVec<T, RhsStackCaps> &rhs) {
+    return false == (lhs == rhs);
+}