Add vector with allocator rules

Author: joaotgouveia

rules/vector/src.cpp

@@ -10,6 +10,16 @@ template <typename T1> using t2 = typename std::vector<T1>::iterator;
 template <typename T1> using t3 = std::vector<std::vector<T1>>;
 template <typename T1> using t4 = typename std::vector<T1>::const_iterator;
 
+template <typename T1, typename T2 = std::allocator<T1>>
+using t5 = std::vector<T1, T2>;
+
+#if defined(__linux__)
+template <typename T1, typename T2 = std::allocator<T1>>
+using t6 = typename std::vector<T1, T2>::iterator;
+template <typename T1, typename T2 = std::allocator<T1>>
+using t7 = typename std::vector<T1, T2>::const_iterator;
+#endif
+
 template <typename T1>
 typename std::vector<T1>::iterator
 f1(std::vector<T1> &o, typename std::vector<T1>::const_iterator it) {
@@ -171,8 +181,7 @@ std::vector<T1> f36(const std::initializer_list<T1> &a0) {
   return std::vector<T1>(a0);
 }
 
-template <typename T1, typename T2>
-std::vector<T1> f37(T2 *first, T2 *last) {
+template <typename T1, typename T2> std::vector<T1> f37(T2 *first, T2 *last) {
   return std::vector<T1>(first, last);
 }
 
@@ -260,3 +269,261 @@ std::vector<T1> &f58(std::vector<T1> &dst, const std::vector<T1> &src) {
 template <typename T1> void f59(std::vector<T1> &o) {
   return o.shrink_to_fit();
 }
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator
+f60(std::vector<T1, T2> &o, typename std::vector<T1, T2>::const_iterator it) {
+  return o.erase(it);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::size_t f61(const std::vector<T1, T2> &o) {
+  return o.size();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+bool f62(const std::vector<T1, T2> &o) {
+  return o.empty();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::vector<T1, T2> f63() {
+  return std::vector<T1, T2>();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f64(std::vector<T1, T2> &o) {
+  return o.pop_back();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+T1 *f65(std::vector<T1, T2> &o) {
+  return o.data();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+T1 &f66(std::vector<T1, T2> &o, std::size_t idx) {
+  return o.at(idx);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::vector<T1, T2> f67(std::size_t n) {
+  return std::vector<T1, T2>(n);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+T1 &f68(std::vector<T1, T2> &o) {
+  return o.front();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+T1 &f69(std::vector<T1, T2> &o) {
+  return o.back();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::size_t f70(const std::vector<T1, T2> &o) {
+  return o.capacity();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f71(std::vector<T1, T2> &o, std::size_t n) {
+  return o.reserve(n);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator f72(std::vector<T1, T2> &o) {
+  return o.begin();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f73(std::vector<T1, T2> &o, T1 &&value) {
+  return o.push_back(std::move(value));
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f74(std::vector<T1, T2> &o, std::size_t n) {
+  return o.resize(n);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f75(std::vector<T1, T2> &o) {
+  return o.clear();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator f76(std::vector<T1, T2> &o) {
+  return o.end();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator
+f77(std::vector<T1, T2> &o, typename std::vector<T1, T2>::const_iterator it,
+    T1 &&value) {
+  return o.insert(it, std::move(value));
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::vector<T1, T2> f78(std::size_t n, const T1 &value) {
+  return std::vector<T1, T2>(n, value);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator
+f79(std::vector<T1, T2> &o, typename std::vector<T1, T2>::const_iterator it,
+    const T1 &value) {
+  return o.insert(it, value);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f80(std::vector<T1, T2> &o, const T1 &value) {
+  return o.push_back(value);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::reference
+f81(typename std::vector<T1, T2>::iterator it) {
+  return it.operator*();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator
+f82(const typename std::vector<T1, T2>::iterator &it) {
+  return typename std::vector<T1, T2>::iterator(it);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::const_iterator
+f83(const typename std::vector<T1, T2>::iterator &it) {
+  return typename std::vector<T1, T2>::const_iterator(it);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator
+f84(typename std::vector<T1, T2>::iterator it, std::size_t n) {
+  return it.operator+(n);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+bool f85(const typename std::vector<T1, T2>::iterator &it1,
+         const typename std::vector<T1, T2>::iterator &it2) {
+  return operator!=(it1, it2);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+bool f86(const typename std::vector<T1, T2>::iterator &it1,
+         const typename std::vector<T1, T2>::iterator &it2) {
+  return operator==(it1, it2);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator
+f87(typename std::vector<T1, T2>::iterator a0, int a1) {
+  return a0.operator++(a1);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator::difference_type
+f88(const typename std::vector<T1, T2>::iterator &it1,
+    const typename std::vector<T1, T2>::iterator &it2) {
+  return operator-(it1, it2);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator &
+f89(typename std::vector<T1, T2>::iterator &it) {
+  return it.operator++();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::vector<T1, T2> f90(const T1 *first, const T1 *last) {
+  return std::vector<T1, T2>(first, last);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::vector<T1, T2> f91(const std::initializer_list<T1> &a0) {
+  return std::vector<T1, T2>(a0);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>, typename T3>
+std::vector<T1, T2> f92(T3 *first, T3 *last) {
+  return std::vector<T1, T2>(first, last);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+const T1 *f93(const std::vector<T1, T2> &o) {
+  return o.data();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::const_iterator
+f94(typename std::vector<T1, T2>::const_iterator first,
+    typename std::vector<T1, T2>::const_iterator last) {
+  return std::max_element(first, last);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::const_iterator f95(const std::vector<T1, T2> &o) {
+  return o.begin();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::const_iterator f96(const std::vector<T1, T2> &o) {
+  return o.end();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f97(std::vector<T1, T2> &o, std::vector<T1, T2> &a0) {
+  return o.swap(a0);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+const T1 &f98(const std::vector<T1, T2> &o, std::size_t idx) {
+  return o.at(idx);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+const T1 &f99(const std::vector<T1, T2> &o) {
+  return o.back();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f100(std::vector<std::vector<T1, T2>> &o,
+          const std::vector<T1, T2> &value) {
+  return o.push_back(value);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::iterator
+f101(std::vector<T1, T2> &o, typename std::vector<T1, T2>::const_iterator pos,
+     const T1 *first, const T1 *last) {
+  return o.insert(pos, first, last);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f102(std::vector<T1, T2> &o, std::size_t n,
+          const typename std::vector<T1, T2>::value_type &value) {
+  return o.resize(n, value);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::vector<T1, T2> &f103(std::vector<T1, T2> &dst, std::vector<T1, T2> &&src) {
+  return dst.operator=(std::move(src));
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+typename std::vector<T1, T2>::const_iterator
+f104(const std::vector<T1, T2> &o) {
+  return o.cend();
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+std::vector<T1, T2> &f105(std::vector<T1, T2> &dst,
+                          const std::vector<T1, T2> &src) {
+  return dst.operator=(src);
+}
+
+template <typename T1, typename T2 = std::allocator<T1>>
+void f106(std::vector<T1, T2> &o) {
+  return o.shrink_to_fit();
+}