|
|
@@ -1,290 +1,272 @@
|
|
|
//
|
|
|
-// vector.h
|
|
|
-//
|
|
|
-//
|
|
|
-// Created by Sam Jaffe on 8/21/15.
|
|
|
+// vector.hpp
|
|
|
+// vector
|
|
|
//
|
|
|
+// Created by Sam Jaffe on 8/15/16.
|
|
|
//
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
-namespace math { namespace vector {
|
|
|
- template <size_t, typename> class raw_vector;
|
|
|
-} }
|
|
|
+#include <cassert>
|
|
|
+#include <cmath>
|
|
|
+#include <cstddef>
|
|
|
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator +(T const&, math::vector::raw_vector<D, T> const&);
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator -(T const&, math::vector::raw_vector<D, T> const&);
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator *(T const&, math::vector::raw_vector<D, T> const&);
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator /(T const&, math::vector::raw_vector<D, T> const&);
|
|
|
+#include <array>
|
|
|
+#include <initializer_list>
|
|
|
+#include <stdexcept>
|
|
|
+#include <type_traits>
|
|
|
|
|
|
namespace math { namespace vector {
|
|
|
- struct fill_t {} fill;
|
|
|
+#define VECTOR_ENABLE_IF_LT_N(index, expr) \
|
|
|
+template <bool _ = true> \
|
|
|
+typename std::enable_if<std::size_t(index) < N && _, expr>::type
|
|
|
+
|
|
|
+#define VECTOR_ENABLE_IF_EQ_N(index, t, n) \
|
|
|
+template <bool _ = true> \
|
|
|
+typename std::enable_if<std::size_t(index) == N && _, vector<t, n> >::type
|
|
|
|
|
|
- template <size_t D, typename T>
|
|
|
- class raw_vector {
|
|
|
+#define VECTOR_ENABLE_IF_EQ_T(_type, t, n) \
|
|
|
+vector<typename std::enable_if<std::is_same<_type, T>::value,T>::type, N>
|
|
|
+
|
|
|
+#define VECTOR_ACCESS_FN(name, i) \
|
|
|
+VECTOR_ENABLE_IF_LT_N(i, value_type const &) name() const { return _data[i]; } \
|
|
|
+VECTOR_ENABLE_IF_LT_N(i, value_type &) name() { return _data[i]; }
|
|
|
+
|
|
|
+#define VECTOR_FOR_EACH(var) for (std::size_t var = 0; var < N; ++var)
|
|
|
+
|
|
|
+ struct {} fill;
|
|
|
+ using fill_t = decltype(fill);
|
|
|
+
|
|
|
+ template <typename T, std::size_t N>
|
|
|
+ struct vector {
|
|
|
+ public:
|
|
|
+ using value_type = T;
|
|
|
+ private:
|
|
|
+ using mag_t = decltype(std::sqrt(std::declval<T>()));
|
|
|
+ template <typename M>
|
|
|
+ using mul_t = decltype(std::declval<T>()*std::declval<M>());
|
|
|
+ template <typename M>
|
|
|
+ using div_t = decltype(std::declval<T>()/std::declval<M>());
|
|
|
public:
|
|
|
- typedef T value_type;
|
|
|
- typedef T& reference;
|
|
|
- typedef const T& const_reference;
|
|
|
- typedef raw_vector<D, T> this_type;
|
|
|
-
|
|
|
- typedef decltype(std::sqrt(std::declval<T>())) sqrt_type; // double or float
|
|
|
-
|
|
|
- T& operator [](size_t index) { return data[index]; }
|
|
|
-
|
|
|
- inline const T& operator [](size_t index) const { return data[index]; }
|
|
|
|
|
|
- T& at(size_t index) {
|
|
|
- if (index >= D) throw std::out_of_range(std::to_string(index) + " is out of range [0, " + std::to_string(D) + ")");
|
|
|
- return operator [](index);
|
|
|
+ // Constructors
|
|
|
+ vector() = default;
|
|
|
+ vector(std::initializer_list<T> && init) {
|
|
|
+ std::size_t idx = 0;
|
|
|
+ for ( auto it = init.begin(), end = init.end(); it != end && idx < N; ++it, ++idx ) {
|
|
|
+ _data[idx] = *it;
|
|
|
+ }
|
|
|
}
|
|
|
-
|
|
|
- const T& at(size_t index) const {
|
|
|
- if (index >= D) throw std::out_of_range(std::to_string(index) + " is out of range [0, " + std::to_string(D) + ")");
|
|
|
- return operator [](index);
|
|
|
+ vector(std::array<T, N> const & init) {
|
|
|
+ for (std::size_t i = 0; i < N && i < init.size(); ++i) {
|
|
|
+ _data[i] = init[i];
|
|
|
+ }
|
|
|
}
|
|
|
-
|
|
|
- template <std::size_t Idx, typename = typename std::enable_if<Idx < D>::type>
|
|
|
- inline const_reference get() const { return data[Idx]; }
|
|
|
-
|
|
|
- template <std::size_t Idx, typename = typename std::enable_if<Idx < D>::type>
|
|
|
- inline reference get() { return data[Idx]; }
|
|
|
-
|
|
|
- reference x() { return get<0>(); }
|
|
|
- const_reference x() const { return get<0>(); }
|
|
|
- reference y() { return get<1>(); }
|
|
|
- const_reference y() const { return get<1>(); }
|
|
|
- reference z() { return get<2>(); }
|
|
|
- const_reference z() const { return get<2>(); }
|
|
|
- reference w() { return get<3>(); }
|
|
|
- const_reference w() const { return get<3>(); }
|
|
|
- reference r() { return get<0>(); }
|
|
|
- const_reference r() const { return get<0>(); }
|
|
|
- reference g() { return get<1>(); }
|
|
|
- const_reference g() const { return get<1>(); }
|
|
|
- reference b() { return get<2>(); }
|
|
|
- const_reference b() const { return get<2>(); }
|
|
|
- reference a() { return get<3>(); }
|
|
|
- const_reference a() const { return get<3>(); }
|
|
|
-
|
|
|
- this_type& operator+=(const this_type& other) {
|
|
|
- for (size_t i = 0; i < D; ++i) at(i) += other.at(i);
|
|
|
- return *this;
|
|
|
+ vector(vector const & other) {
|
|
|
+ *this = other;
|
|
|
}
|
|
|
-
|
|
|
- this_type& operator-=(const this_type& other) {
|
|
|
- for (size_t i = 0; i < D; ++i) at(i) -= other.at(i);
|
|
|
- return *this;
|
|
|
+ vector(vector && other) {
|
|
|
+ *this = std::move(other);
|
|
|
}
|
|
|
|
|
|
- this_type& operator*=(const this_type& other) {
|
|
|
- for (size_t i = 0; i < D; ++i) at(i) *= other.at(i);
|
|
|
- return *this;
|
|
|
+ // Conversion
|
|
|
+ template <typename T2, std::size_t N2>
|
|
|
+ explicit vector(vector<T2, N2> const & other) {
|
|
|
+ for (std::size_t i = 0; i < N && i < N2; ++i) {
|
|
|
+ _data[i] = static_cast<T>(other[i]);
|
|
|
+ }
|
|
|
}
|
|
|
-
|
|
|
- this_type& operator/=(const this_type& other) {
|
|
|
- for (size_t i = 0; i < D; ++i) at(i) /= other.at(i);
|
|
|
- return *this;
|
|
|
+ vector(T const & v, fill_t) {
|
|
|
+ VECTOR_FOR_EACH(i) { _data[i] = v; }
|
|
|
}
|
|
|
|
|
|
- this_type& operator+=(const T& c) {
|
|
|
- return operator +=(this_type{c, fill});
|
|
|
+ // Assignment
|
|
|
+ vector& operator=(vector const & other) {
|
|
|
+ VECTOR_FOR_EACH(i) { _data[i] = other[i]; }
|
|
|
+ return *this;
|
|
|
}
|
|
|
-
|
|
|
- this_type& operator -=(const T& c) {
|
|
|
- return operator -=(this_type{c, fill});
|
|
|
+ vector& operator=(vector && other) {
|
|
|
+ VECTOR_FOR_EACH(i) { _data[i] = std::move(other._data[i]); }
|
|
|
+ return *this;
|
|
|
}
|
|
|
|
|
|
- this_type& operator *=(const T& c) {
|
|
|
- return operator *=(this_type{c, fill});
|
|
|
- }
|
|
|
+ // Named Accessors
|
|
|
+ // - Numeric Vector Accessors
|
|
|
+ VECTOR_ACCESS_FN(x, 0)
|
|
|
+ VECTOR_ACCESS_FN(y, 1)
|
|
|
+ VECTOR_ACCESS_FN(z, 2)
|
|
|
+ VECTOR_ACCESS_FN(w, 3)
|
|
|
|
|
|
- this_type& operator /=(const T& c) {
|
|
|
- return operator /=(this_type{c, fill});
|
|
|
- }
|
|
|
+ // - Color Vector Accessors
|
|
|
+ VECTOR_ACCESS_FN(r, 0)
|
|
|
+ VECTOR_ACCESS_FN(g, 1)
|
|
|
+ VECTOR_ACCESS_FN(b, 2)
|
|
|
+ VECTOR_ACCESS_FN(a, 3)
|
|
|
|
|
|
- this_type operator +(const this_type& other) const {
|
|
|
- return this_type(*this) += other;
|
|
|
- }
|
|
|
+ // Unnamed Accessors
|
|
|
+ value_type const & operator[](std::size_t idx) const { return _data[idx]; }
|
|
|
+ value_type & operator[](std::size_t idx) { return _data[idx]; }
|
|
|
|
|
|
- this_type operator -(const this_type& other) const {
|
|
|
- return this_type(*this) -= other;
|
|
|
+ value_type const & at(std::size_t idx) const {
|
|
|
+ if (idx >= N) throw std::out_of_range{"index out of range"};
|
|
|
+ assert(idx < N);
|
|
|
+ return operator[](idx);
|
|
|
}
|
|
|
-
|
|
|
- this_type operator *(const this_type& other) const {
|
|
|
- return this_type(*this) *= other;
|
|
|
+ value_type & at(std::size_t idx) {
|
|
|
+ if (idx >= N) throw std::out_of_range{"index out of range"};
|
|
|
+ assert(idx < N);
|
|
|
+ return operator[](idx);
|
|
|
}
|
|
|
|
|
|
- this_type operator /(const this_type& other) const {
|
|
|
- return this_type(*this) /= other;
|
|
|
+ // Mathematical Operations
|
|
|
+ vector& operator+=(vector const & other) {
|
|
|
+ VECTOR_FOR_EACH(i) {
|
|
|
+ _data[i] += other[i];
|
|
|
+ }
|
|
|
+ return *this;
|
|
|
}
|
|
|
|
|
|
- this_type operator +(const T& c) const {
|
|
|
- return operator +(this_type{c, fill});
|
|
|
+ vector& operator-=(vector const & other) {
|
|
|
+ VECTOR_FOR_EACH(i) {
|
|
|
+ _data[i] -= other[i];
|
|
|
+ }
|
|
|
+ return *this;
|
|
|
}
|
|
|
|
|
|
- this_type operator -(const T& c) const {
|
|
|
- return operator -(this_type{c, fill});
|
|
|
+ template <typename M>
|
|
|
+ VECTOR_ENABLE_IF_EQ_T(mul_t<M>, T, N)& operator*=(M c) {
|
|
|
+ VECTOR_FOR_EACH(i) {
|
|
|
+ _data[i] *= c;
|
|
|
+ }
|
|
|
+ return *this;
|
|
|
}
|
|
|
|
|
|
- this_type operator *(const T& c) const {
|
|
|
- return operator *(this_type{c, fill});
|
|
|
+ template <typename M>
|
|
|
+ VECTOR_ENABLE_IF_EQ_T(div_t<M>, T, N)& operator/=(M c) {
|
|
|
+ VECTOR_FOR_EACH(i) {
|
|
|
+ _data[i] /= c;
|
|
|
+ }
|
|
|
+ return *this;
|
|
|
}
|
|
|
|
|
|
- this_type operator /(const T& c) const {
|
|
|
- return operator /(this_type{c, fill});
|
|
|
+ template <typename M>
|
|
|
+ VECTOR_ENABLE_IF_EQ_T(mul_t<M>, T, N)& operator*=(vector<M, N> c) {
|
|
|
+ VECTOR_FOR_EACH(i) {
|
|
|
+ _data[i] *= c[i];
|
|
|
+ }
|
|
|
+ return *this;
|
|
|
}
|
|
|
|
|
|
- this_type operator -() const { return -1 * (*this); }
|
|
|
-
|
|
|
- bool operator ==(const this_type& other) const {
|
|
|
- return !memcmp(data, other.data, D * sizeof(T));
|
|
|
- } // technically wrong on float/double
|
|
|
-
|
|
|
- bool operator !=(const this_type& other) const {
|
|
|
- return !operator==(other);
|
|
|
+ template <typename M>
|
|
|
+ VECTOR_ENABLE_IF_EQ_T(div_t<M>, T, N)& operator/=(vector<M, N> c) {
|
|
|
+ VECTOR_FOR_EACH(i) {
|
|
|
+ _data[i] /= c[i];
|
|
|
+ }
|
|
|
+ return *this;
|
|
|
}
|
|
|
-
|
|
|
- bool operator <=(const this_type& other) const {
|
|
|
- for (size_t i = 0; i < D; ++i) { if (at(i) > other.at(i)) return false; }
|
|
|
- return true;
|
|
|
+
|
|
|
+ vector operator+(vector const & other) const {
|
|
|
+ return vector{*this} += other;
|
|
|
}
|
|
|
|
|
|
- bool operator <(const this_type& other) const {
|
|
|
- for (size_t i = 0; i < D; ++i) { if (at(i) >= other.at(i)) return false; }
|
|
|
- return true;
|
|
|
+ vector operator-(vector const & other) const {
|
|
|
+ return vector{*this} -= other;
|
|
|
}
|
|
|
|
|
|
- bool operator >=(const this_type& other) const {
|
|
|
- for (size_t i = 0; i < D; ++i) { if (at(i) < other.at(i)) return false; }
|
|
|
- return true;
|
|
|
+ template <typename M>
|
|
|
+ vector<mul_t<M>, N> scaled(vector<M, N> const & other) const {
|
|
|
+ return vector<mul_t<M>, N>{*this} *= other;
|
|
|
}
|
|
|
|
|
|
- bool operator >(const this_type& other) const {
|
|
|
- for (size_t i = 0; i < D; ++i) { if (at(i) <= other.at(i)) return false; }
|
|
|
- return true;
|
|
|
+ template <typename M>
|
|
|
+ vector<mul_t<M>, N> operator*(M c) const {
|
|
|
+ return vector<mul_t<M>, N>{*this} *= c;
|
|
|
}
|
|
|
|
|
|
- template <size_t D2>
|
|
|
- typename std::enable_if<(D == 2 || D == 3) && D == D2, raw_vector<3, T> >::type cross(const raw_vector<D2, T>& v) const {
|
|
|
- return D == 2
|
|
|
- ? raw_vector<3, T>{0, 0, at(0)*v.at(1) - at(1)*v.at(0)}
|
|
|
- : raw_vector<3, T>{
|
|
|
- at(1)*v.at(2) - at(2)*v.at(1),
|
|
|
- at(2)*v.at(0) - at(0)*v.at(2),
|
|
|
- at(0)*v.at(1) - at(1)*v.at(0)
|
|
|
- };
|
|
|
+ template <typename M>
|
|
|
+ friend vector<mul_t<M>, N> operator*(M c, vector<T, N> const & v) {
|
|
|
+ return v * c;
|
|
|
}
|
|
|
|
|
|
- T dot(const this_type& v) const {
|
|
|
- T accum{};
|
|
|
- for (size_t i = 0; i < D; ++i) accum += data[i] * v[i];
|
|
|
- return accum;
|
|
|
+ template <typename M>
|
|
|
+ vector<div_t<M>, N> invscaled(vector<M, N> const & other) const {
|
|
|
+ return vector<div_t<M>, N>{*this} /= other;
|
|
|
}
|
|
|
|
|
|
- T lengthSquared() const {
|
|
|
- return dot(*this);
|
|
|
+ template <typename M>
|
|
|
+ vector<div_t<M>, N> operator/(M c) const {
|
|
|
+ return vector<div_t<M>, N>{*this} /= c;
|
|
|
}
|
|
|
|
|
|
- sqrt_type length() const {
|
|
|
- return std::sqrt(lengthSquared());
|
|
|
+ vector operator-() const {
|
|
|
+ return vector{} -= *this;
|
|
|
}
|
|
|
|
|
|
- T distanceSquared(const this_type& other) const {
|
|
|
- return operator -(other).lengthSquared();
|
|
|
+ // Vector Operations
|
|
|
+ value_type dot(vector const & other) const {
|
|
|
+ value_type accum{};
|
|
|
+ VECTOR_FOR_EACH(i) {
|
|
|
+ accum += at(i) * other.at(i);
|
|
|
+ }
|
|
|
+ return accum;
|
|
|
}
|
|
|
|
|
|
- sqrt_type distance(const this_type& other) const {
|
|
|
- return std::sqrt(distanceSquared(other));
|
|
|
+ mag_t magnitude() const {
|
|
|
+ return std::sqrt(dot(*this));
|
|
|
}
|
|
|
|
|
|
- raw_vector<D, sqrt_type> unit() const { return raw_vector<D, sqrt_type>(*this)/length(); }
|
|
|
-
|
|
|
- void swap(raw_vector& that) {
|
|
|
- using std::swap;
|
|
|
- for (size_t i = 0; i < D; ++i) swap(data[i], that.data[i]);
|
|
|
+ vector<mag_t, N> unit() const {
|
|
|
+ return *this / magnitude();
|
|
|
}
|
|
|
|
|
|
- constexpr raw_vector() = default;
|
|
|
-
|
|
|
- raw_vector(const this_type& that) {
|
|
|
- for (size_t i = 0; i < D; ++i) data[i] = that.data[i];
|
|
|
+ friend vector abs(vector const & self) {
|
|
|
+ vector tmp(self);
|
|
|
+ using std::abs;
|
|
|
+ for (std::size_t i = 0; i < N; ++i) {
|
|
|
+ tmp._data[i] = abs(tmp._data[i]);
|
|
|
+ }
|
|
|
+ return tmp;
|
|
|
}
|
|
|
|
|
|
- raw_vector(this_type&& that) {
|
|
|
- for (size_t i = 0; i < D; ++i) data[i] = that.data[i];
|
|
|
+ friend void swap(vector & lhs, vector & rhs) {
|
|
|
+ vector tmp(lhs);
|
|
|
+ lhs = rhs;
|
|
|
+ rhs = tmp;
|
|
|
}
|
|
|
|
|
|
- raw_vector& operator=(const this_type& other) {
|
|
|
- for (size_t i = 0; i < D; ++i) data[i] = other.data[i];
|
|
|
- return *this;
|
|
|
+ VECTOR_ENABLE_IF_EQ_N(3, T, N) cross(vector const & other) const {
|
|
|
+ return {
|
|
|
+ y()*other.z() - z()*other.y(),
|
|
|
+ z()*other.x() - x()*other.z(),
|
|
|
+ x()*other.y() - y()*other.x()
|
|
|
+ };
|
|
|
}
|
|
|
-
|
|
|
- raw_vector& operator=(this_type&& other) {
|
|
|
- for (size_t i = 0; i < D; ++i) data[i] = other.data[i];
|
|
|
- return *this;
|
|
|
+ VECTOR_ENABLE_IF_EQ_N(2, T, 3) cross(vector const & other) const {
|
|
|
+ return { 0, 0, x()*other.y() - y()*other.x() };
|
|
|
}
|
|
|
|
|
|
- raw_vector(std::initializer_list<T> vals) {
|
|
|
- const size_t D2 = vals.size();
|
|
|
- const T* ptr = vals.begin();
|
|
|
- for (size_t i = 0; i < std::min(D, D2); ++i) data[i] = *ptr++;
|
|
|
- for (size_t j = std::min(D, D2); j < std::max(D, D2); ++j) data[j] = T();
|
|
|
+ vector<mag_t, N> projection(vector const & other) const {
|
|
|
+ vector<mag_t, N> b_p = other.unit();
|
|
|
+ return b_p * vector<mag_t, N>{*this}.dot(b_p);
|
|
|
}
|
|
|
|
|
|
- template <std::size_t D2, typename T2,
|
|
|
- typename = typename std::enable_if<D2 != D || !std::is_same<T, T2>::value>::type>
|
|
|
- explicit raw_vector(const raw_vector<D2, T2>& that) {
|
|
|
- for (size_t i = 0; i < std::min(D, D2); ++i) data[i] = static_cast<T>(that[i]);
|
|
|
- for (size_t j = std::min(D, D2); j < std::max(D, D2); ++j) data[j] = T();
|
|
|
- }
|
|
|
+ friend bool operator==(vector const & lhs, vector const & rhs) { return lhs.compare(rhs) == 0; }
|
|
|
+ friend bool operator!=(vector const & lhs, vector const & rhs) { return lhs.compare(rhs) != 0; }
|
|
|
+ friend bool operator< (vector const & lhs, vector const & rhs) { return lhs.compare(rhs) < 0; }
|
|
|
+ friend bool operator<=(vector const & lhs, vector const & rhs) { return lhs.compare(rhs) <= 0; }
|
|
|
+ friend bool operator> (vector const & lhs, vector const & rhs) { return lhs.compare(rhs) > 0; }
|
|
|
+ friend bool operator>=(vector const & lhs, vector const & rhs) { return lhs.compare(rhs) >= 0; }
|
|
|
|
|
|
- raw_vector(T const& t, fill_t) {
|
|
|
- for (size_t i = 0; i < D; ++i) data[i] = t;
|
|
|
+ private:
|
|
|
+ int compare(vector const & other) const {
|
|
|
+ int rv = 0;
|
|
|
+ for (std::size_t i = 0; i < N && rv == 0; ++i) {
|
|
|
+ if (_data[i] < other[i]) rv = -1;
|
|
|
+ else if (_data[i] > other[i]) rv = 1;
|
|
|
+ }
|
|
|
+ return rv;
|
|
|
}
|
|
|
|
|
|
- private:
|
|
|
- value_type data[D] = {0};
|
|
|
+ value_type _data[N] = {value_type()};
|
|
|
};
|
|
|
} }
|
|
|
-
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator +(T const& lhs, math::vector::raw_vector<D, T> const& rhs) {
|
|
|
- return rhs + lhs;
|
|
|
-}
|
|
|
-
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator -(T const& lhs, math::vector::raw_vector<D, T> const& rhs) {
|
|
|
- return math::vector::raw_vector<D, T>(lhs, math::vector::fill) - rhs;
|
|
|
-}
|
|
|
-
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator *(T const& lhs, math::vector::raw_vector<D, T> const& rhs) {
|
|
|
- return rhs * lhs;
|
|
|
-}
|
|
|
-
|
|
|
-template <size_t D, typename T>
|
|
|
-math::vector::raw_vector<D, T> operator /(T const& lhs, math::vector::raw_vector<D, T> const& rhs) {
|
|
|
- return math::vector::raw_vector<D, T>(lhs, math::vector::fill) / rhs;
|
|
|
-}
|
|
|
-
|
|
|
-template <typename CharT, typename Traits, size_t N, typename T>
|
|
|
-std::basic_ostream<CharT, Traits>& operator<<(std::basic_ostream<CharT, Traits>& out, const math::vector::raw_vector<N, T>& v) {
|
|
|
- out << '(' << v[0];
|
|
|
- for (size_t i = 1; i < N; ++i) { out << ',' << v[i]; }
|
|
|
- out << ')';
|
|
|
- return out;
|
|
|
-}
|
|
|
-
|
|
|
-namespace std {
|
|
|
- template <size_t D, typename T>
|
|
|
- math::vector::raw_vector<D, T> abs(math::vector::raw_vector<D, T> const& data) {
|
|
|
- math::vector::raw_vector<D, T> rval;
|
|
|
- for (size_t i = 0; i < D; ++i) rval[i] = std::abs(data[i]);
|
|
|
- return rval;
|
|
|
- }
|
|
|
-}
|