UT/UT_Vector.h

Go to the documentation of this file.

/*
 * PROPRIETARY INFORMATION.  This software is proprietary to
 * Side Effects Software Inc., and is not to be reproduced,
 * transmitted, or disclosed in any way without written permission.
 *
 * Produced by:
 *      David Wong
 *      Side Effects
 *      477 Richmond Street West
 *      Toronto, Ontario
 *      Canada   M5V 3E7
 *      416-504-9876
 *
 * NAME:        Vector of arbitrary size (C++)
 *
 * COMMENTS:    From Numerical Recipes
 *              And contains a permutation vector class.
 *
 */

#ifndef __UT_Vector_H__
#define __UT_Vector_H__

#include "UT_API.h"
#include <stdlib.h>
#include <iostream.h>
#include <SYS/SYS_Types.h>
#include "UT_Assert.h"
#include "UT_ThreadedAlgorithm.h"

class UT_Vector2;
class UT_Vector3;
class UT_Vector4;


//////////////////////////////////////////////////////////////////////////////
//
// UT_VectorT
//

template <typename T>
class UT_VectorT
{
public:
     // Input the index range [nl..nh].
     UT_VectorT() { myVector = 0; myOwnData = 0; }
     UT_VectorT(int nl, int nh);
     UT_VectorT(const UT_VectorT<T> &v);
    ~UT_VectorT();

    // Initialize nl, nh and allocate space.
    void         init(int nl, int nh);

    // Steal from another vector, resulting vector has origin at 1.
    void         subvector(const UT_VectorT<T> &v, int nl, int nh);

    // Assign from a float array into the designated subvector, performing a
    // deep copy.
    void         assign(const fpreal32 *data, int nl, int nh);
    void         assign(const fpreal64 *data, int nl, int nh);

    int          isInit() const { return myVector ? 1 : 0; }

    // Initialize to zeros.
    void         zero(int nl, int nh);
    void         zero()
                    { zero(myNL, myNH); }

    /// These methods allow one to read out and write into subvectors
    /// of UT_Vector using our other vector classes.
    /// Keep in mind that the usual UT_Vector? methods are 0 based,
    /// while this class is usually 1 based.
    void         getSubvector2(UT_Vector2 &v, int idx) const;
    void         setSubvector2(int idx, const UT_Vector2 &v);
    void         getSubvector3(UT_Vector3 &v, int idx) const;
    void         setSubvector3(int idx, const UT_Vector3 &v);
    void         getSubvector4(UT_Vector4 &v, int idx) const;
    void         setSubvector4(int idx, const UT_Vector4 &v);

    // Get the low index.
    int          getNL() const { return myNL; }

    // Get the high index.
    int          getNH() const { return myNH; }

    // Get dimension of this vector
    int          length() const { return myNH - myNL + 1; }

    // Determines if we have a large enough vector to make micro
    // threading worthwhile.
    // Experimentation shows with 4 procs on NT, 5000 is a cut off for good
    // behaviour on the simplistic addScaledVec method.
    bool         shouldMultiThread() const
                 {
#ifdef CELLBE
                     return false;
#else
                     return (myNH - myNL) > 4999;
#endif
                 }

    // Determines the [start,end) interval that should be worked on
    void         getPartialRange(int &start, int &end, const UT_JobInfo &info) const;

    // Change the low index, and the high index will adjust itself.
    void         changeNL(int nl);

    // Change the indices in a very shallow manner, i.e. simply change
    // the index without shifting the data. This is highly dangerous, yet
    // very useful if used with care.
    void         setShallowNL(int nl)   { myNL = nl; }
    void         setShallowNH(int nh)   { myNH = nh; }

    // For retrieve data.
    T           &operator()(int i)
                 {
                     UT_ASSERT_P(i >= myNL && i <= myNH);
                     return myVector[i];
                 }
    T            operator()(int i) const
                 {
                     UT_ASSERT_P(i >= myNL && i <= myNH);
                     return myVector[i];
                 }

    // Lp-norm
    // type: 0  L-infinity norm (ie. max)
    //       1  L1-norm         (ie. sum of abs)
    //       2  L2-norm         (ie. Euclidean distance)
    T            norm(int type=2) const;

    // Square of L2-norm
    T            norm2() const;

    T            distance2(const UT_VectorT<T> &v) const;

    // Negate
    THREADED_METHOD(UT_VectorT, shouldMultiThread(), neg)
    void         negPartial(const UT_JobInfo &info);
    THREADED_METHOD1(UT_VectorT, shouldMultiThread(), negPlus,
                    const UT_VectorT<T> &, v)
    void         negPlusPartial(const UT_VectorT<T> &v, const UT_JobInfo &info);

    // Add scaled vector
    THREADED_METHOD2(UT_VectorT, shouldMultiThread(), addScaledVec,
                        T, s,
                        const UT_VectorT<T> &, v)
    void         addScaledVecPartial(T s, const UT_VectorT<T> &v,
                                    const UT_JobInfo &info);

    // Add scaled vector and compute the Norm2
    THREADED_METHOD3(UT_VectorT, shouldMultiThread(), addScaledVecNorm2,
                        T, s,
                        const UT_VectorT<T> &, v,
                        fpreal64 *, norm2)
    void         addScaledVecNorm2Partial(T s, const UT_VectorT<T> &v,
                                    fpreal64 *norm2,
                                    const UT_JobInfo &info);

    // Scale itself than add vector
    THREADED_METHOD2(UT_VectorT<T>, shouldMultiThread(), scaleAddVec,
                        T, s,
                        const UT_VectorT<T> &, v)
    void         scaleAddVecPartial(T s, const UT_VectorT<T> &v,
                                    const UT_JobInfo &info);

    // Multiply two sources together, save to this.  Requires
    // that three vectors already have the same size.
    THREADED_METHOD2(UT_VectorT<T>, shouldMultiThread(), multAndSet,
                        const UT_VectorT<T> &, a,
                        const UT_VectorT<T> &, b)
    void        multAndSetPartial(const UT_VectorT<T> &a,
                            const UT_VectorT<T> &b,
                            const UT_JobInfo &info);

    T            dot(const UT_VectorT<T> &v) const;

    // Operators
    UT_VectorT  &operator= (const UT_VectorT<T> &v);
    UT_VectorT  &operator+= (const UT_VectorT<T> &v);
    UT_VectorT  &operator-= (const UT_VectorT<T> &v);

    // Componentwise multiplication & division.
    UT_VectorT  &operator*= (const UT_VectorT<T> &v);
    UT_VectorT  &operator/= (const UT_VectorT<T> &v);

    // Scalar multiplication and division.
    UT_VectorT  &operator*= (T scalar);
    UT_VectorT  &operator/= (T scalar);

    // Equals
    //   upls is the number of representable fpreal64's to accept between
    //   each individual component. If you deal in fpreal32's and assign into
    //   this fpreal64 class, then you will want a ulps that is scaled by
    //   2^32. eg. for 50upls at fpreal32 precision, you will need 50*2^32
    //   or approximately 1e+11.
    bool         isEqual(const UT_VectorT<T> &v, int64 ulps);

    // Output
    ostream             &save(ostream &os) const;
    friend ostream      &operator<<(ostream &os, const UT_VectorT<T> &v)
                         { v.save(os); return os; }

    T           *getData() const        { return &myVector[myNL]; }

protected:
    // A multithreaded norm function that returns the non-normalized
    // norm (Ie, squared in the L2 case.) and is mulithreaded.
    THREADED_METHOD2_CONST(UT_VectorT, shouldMultiThread(), normInternal,
                    fpreal64 *, result,
                    int, type)
    void normInternalPartial(fpreal64 *result, int type, const UT_JobInfo &info) const;

    THREADED_METHOD2_CONST(UT_VectorT, shouldMultiThread(), distance2Internal,
                    fpreal64 *, result,
                    const UT_VectorT<T> &, v)
    void distance2InternalPartial(fpreal64 *result, const UT_VectorT<T> &v, const UT_JobInfo &info) const;

    // A multithreaded dot method
    THREADED_METHOD2_CONST(UT_VectorT, shouldMultiThread(), dotInternal,
                    fpreal64 *, result,
                    const UT_VectorT<T> &, v)
    void dotInternalPartial(fpreal64 *result,
                            const UT_VectorT<T> &v, 
                            const UT_JobInfo &info) const;      

private:
    int          myNL, myNH;
    int          myOwnData;
    T           *myVector;
};


//////////////////////////////////////////////////////////////////////////////
//
// UT_Permutation
//


template <typename T>
class UT_PermutationT
{
public:
     // Input the index range [nl..nh].
     UT_PermutationT(int nl, int nh);
    ~UT_PermutationT();

    // Assignment
    UT_PermutationT(const UT_PermutationT<T> &p);
    UT_PermutationT<T> &operator=(const UT_PermutationT<T> &p);

    // Initialize to zeros.
    void         zero();

    // Get the low index.
    int          getNL() const { return myNL; }

    // Get the high index.
    int          getNH() const { return myNH; }

    int          length() const { return myNH - myNL + 1; }

    // Change the low index, and the high index will adjust itself.
    void         changeNL(int nl);

    // Change the indices in a very shallow manner, i.e. simply change
    // the index without shifting the data. This is highly dangerous, yet
    // very useful if used with care.
    void         setShallowNL(int nl)   { myNL = nl; }
    void         setShallowNH(int nh)   { myNH = nh; }

    // For retrieve data.
    T           &operator()(int i)
                 {
                     UT_ASSERT_P(i >= myNL && i <= myNH);
                     return myVector[i];
                 }
    T            operator()(int i) const
                 {
                     UT_ASSERT_P(i >= myNL && i <= myNH);
                     return myVector[i];
                 }

private:
    void         clone(const UT_PermutationT<T> &p);
    int          myNL, myNH;
    T           *myVector;
};

#if defined( WIN32 ) || defined( LINUX ) || defined( MBSD ) || defined(GAMEOS)
    #include "UT_Vector.C"
#endif


//////////////////////////////////////////////////////////////////////////////
//
// UT_Vector typedefs
//

typedef UT_PermutationT<int>            UT_Permutation;
typedef UT_VectorT<fpreal32>            UT_VectorF;
typedef UT_VectorT<fpreal64>            UT_VectorD;
typedef UT_VectorT<fpreal64>            UT_Vector;

//////////////////////////////////////////////////////////////////////////////
//
// UT_Vector inline binary operators 
//

// Free floating functions
inline fpreal64 dot(const UT_VectorD &v1, const UT_VectorD &v2);
inline fpreal64 distance2(const UT_VectorD &v1, const UT_VectorD &v2);
inline fpreal32 dot(const UT_VectorF &v1, const UT_VectorF &v2);
inline fpreal32 distance2(const UT_VectorF &v1, const UT_VectorF &v2);

/// Dot product
inline fpreal64  
dot(const UT_VectorD &v1, const UT_VectorD &v2)
{
    return v1.dot(v2);
}

/// Distance squared (L2) aka quadrance
inline fpreal64
distance2(const UT_VectorD &v1, const UT_VectorD &v2)
{
    return v1.distance2(v2);
}

inline fpreal32  
dot(const UT_VectorF &v1, const UT_VectorF &v2)
{
    return v1.dot(v2);
}

/// Distance squared (L2) aka quadrance
inline fpreal32
distance2(const UT_VectorF &v1, const UT_VectorF &v2)
{
    return v1.distance2(v2);
}


#endif

---