UT/UT_IntArray.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:
 *      Cristin Barghiel
 *      Side Effects Software Inc.
 *      123 Front Street West, Suite 1401
 *      Toronto, Ontario
 *      Canada   M5J 2M2
 *      416-504-9876
 *
 * NAME:        Utility Library (C++)
 *
 * COMMENTS:
 *      This is a class that is used by UT_IntArray to do all the work...
 *
 */

#ifndef __UT_IntArray_h__
#define __UT_IntArray_h__

#include "UT_API.h"
#include <malloc.h>
#include <vector>
#include "UT_Assert.h"
#include "UT_Algorithm.h"
#include "UT_ArrayHelp.h"

class UT_API UT_IntArray {
public:

public:
    UT_IntArray(const UT_IntArray &a);
    explicit UT_IntArray(unsigned int sz = 0, unsigned int count = 0)
        : arrSize(sz),
        nbrEntries(count < sz ? count : sz)
    {
        arr = (sz) ? (int *)calloc(sizeof(int), sz) : 0;
    }
    ~UT_IntArray(void);

    void swap( UT_IntArray &other );

    // Merge the given array into us.
    // If direction is -1, then it assumes us and 'other' are both already
    // sorted in descending order. Similarly, +1 means ascending.
    // If allow_dups is false, then it further assumes that both arrays have no
    // duplicates and will produce a result that also has no duplicates.
    // More work will be needed if you want allow_dups to mean remove duplicates
    void merge( const UT_IntArray &other, int direction, bool allow_dups );

    void sortedUnion(           const UT_IntArray &other );
    void sortedUnion(           const UT_IntArray &other,
                                UT_IntArray &result ) const;
    void sortedIntersection(    const UT_IntArray &other );
    void sortedIntersection(    const UT_IntArray &other,
                                UT_IntArray &result ) const;
    void sortedSetDifference(   const UT_IntArray &other );
    void sortedSetDifference(   const UT_IntArray &other,
                                UT_IntArray &result ) const;

    // Convert from and to a vector of strings.
    void                 fromStdVectorOfInts(const std::vector<int> &vec);
    void                 toStdVectorOfInts(std::vector<int> &vec) const;

    // Assuming that the array is sorted without duplicates in ascending order,
    // it inserts the given item provided that it does not already exist in
    // the array.
    // Returns the index of the inserted item, or the index of the existing
    // item if found.
    unsigned int        uniqueSortedInsertAscending(int item);

    // Convenience method to perform binary search of a ascending sorted array
    // with no duplicates.  Returns the index of the specified item, -1 if not
    // found.
    int                 uniqueSortedFindAscending(int item) const;

    // Assuming the array is already a heap, it inserts item t maintaining
    // the heap. It returns the index of the inserted item.
    unsigned int        heapPush(int t);
    // Assuming the array is already a heap, extracts the top (maximum)
    // element from the heap and returns it.
    int                 heapPop();
    // Assuming the array is already a heap, return the top (maximum)
    // element.
    int                 heapMax() const
                        {
                             UT_ASSERT_P(nbrEntries > 0);
                             return arr[0];
                        }

    // Append an element to the current entries and return its index in the
    // array, or insert the element at a specified position; if necessary,
    // insert() grows the array to accommodate the element. The insert
    // methods use the assignment operator '=' to place the Thing into the
    // right spot; be aware that '=' works differently on objects and pointers.
    // The test for duplicates uses the logical equal operator '=='; as with
    // '=', the behaviour of the equality operator on pointers versus objects
    // is not the same.
    // Use the subscript operators instead of insert() if you are appending
    // to the array, or if  you don't mind overwriting the element already 
    // inserted at the given index.
    unsigned int        append(void)            { return insert(nbrEntries); }
    unsigned int        append(int t);
    unsigned int        insert(unsigned index);
    unsigned int        insert(int t, unsigned index);

    // Takes another pointer array and concatenate it onto my end
    unsigned int        concat(const UT_IntArray &a);

    // Insert an element "count" times at the given index. Return the index.
    unsigned  int       multipleInsert(unsigned int index, unsigned int count);

    // An alias for unique element insertion at a certain index. Also used by
    // the other insertion methods.
    unsigned int         insertAt(int t, unsigned int index);

    // Remove one element from the array given the element itself or its 
    // position in the list, and fill the gap by shifting the elements down
    // by one position. Both methods return the index if successful, 
    // If dupliCheck is 1, both methods search for all objects that match t or 
    // arr[index] respectively.
    int         findAndRemove(int t);
    int         removeIndex(unsigned int index)
                { return (index < nbrEntries) ? removeAt(index) : -1; }
    int         removeLast()
                { return nbrEntries ? removeAt(nbrEntries-1) : -1; }

    void                reverse();

    // Move howMany objects starting at index srcIndex to destIndex;
    // Method returns 0 if OK, -1 if overflow.
    int                 shift(unsigned int srcIdx,
                              unsigned int destIdx,
                              unsigned int howMany);

    // Cyclically shifts the entire array by howMany
    void                cycle(int howMany);

    // Quickly set the array to a single value
    void                constant(int v=0);

    // Search for t in one of two ways: linearly using the '==' operator, or
    // binary using the function specified in the parameter list respectively.
    // find() returns the index of the matching element or (int)-1.
    // Parameter s indicates the index the search should start at.
    int          find(int t, unsigned int s = 0) const;
    int          find(int t, int (*compare)(const int *, const int *)) const;

    // Sort the array using a comparison function that you must provide. t1 and
    // t2 are pointers to Thing.
    void                sort(int (*compare)(const int *t1, const int *t2));
    void                sortAscending();

    // Resize the array, ie. grow it or shrink it. If copyFlag is 1, the 
    // function copies the data after reallocating space for the array.
    void                resize(unsigned int sz, unsigned short copyFlag=1);
    void                resizeIfNeeded(uint sz, bool copyFlag=true)
                        {
                            if (sz > capacity())
                                resize(sz, copyFlag);
                        }

    // Query the allocated length of the array or the number of elements
    // in the array: capacity() >= entries().
    uint        capacity(void) const    { return arrSize;       }
    int64       getMemoryUsage() const  { return capacity()*sizeof(int); }
    uint        entries(void) const     { return nbrEntries;    }
    bool        isEmpty(void) const     { return nbrEntries==0; }

    // Set the number of entries. Normally, you should not have to use it.
    void         entries(unsigned int ne)       { nbrEntries = ne; }
    void         truncate( uint ne ) { if( entries()>ne ) entries( ne ); }

    // Assign array a to this array by copying each of a's Things with the
    // '=' operator. The size of this array must be greater or equal to the 
    // entry count of array a.
    UT_IntArray &operator=(const UT_IntArray &a);

    // Compare two array and return 1 if they are equal and 0 otherwise.
    // Two Things are checked against each other using operator '==' or
    // compare() respectively. Arrays of different size but equal number of
    // entries are checked for member-wise equality.
    // t1 and t2 must point to Things.
    bool                operator!=(const UT_IntArray &a) const;
    int                 operator==(const UT_IntArray &a) const;
    int                 isEqual(const UT_IntArray &a,
                                int (*compare)(const int *t1, const int *t2)
                               ) const;
     
    // Subscript operators. operator() does NOT do any bound checking, while
    // the non-const operator[] grows the array to accommodate the given index.
    int         &operator()(unsigned int i)
                 {
                     UT_ASSERT_P(i < nbrEntries);
                     return arr[i];
                 }
    int          operator()(unsigned int i) const
                 {
                     UT_ASSERT_P(i < nbrEntries);
                     return arr[i];
                 }
    int         &operator[](unsigned int i)
                 {
                    if (i >= arrSize   ) resize(bumpAlloc(i+1));
                    if (i >= nbrEntries) nbrEntries = i+1;
                    return arr[i];
                 }
    int          operator[](unsigned int i) const
                 {
                    UT_ASSERT_P(i < nbrEntries);
                    return (i < nbrEntries) ? arr[i] : 0; 
                 }
    int         &last()
                 {
                     UT_ASSERT_P(nbrEntries);
                     return arr[nbrEntries-1];
                 }
    int          last() const
                 {
                     return nbrEntries ? arr[nbrEntries-1] : 0;
                 }

    void         copyMemory(const UT_IntArray &from)    { *this = from; }

    // Apply a user-defined function to each element of the array 
    // as int as the function returns zero. If applyFct returns
    // 1, apply() stops traversing the list and returns the current
    // index; otherwise, apply() returns the number of entries.
    unsigned int        apply(int (*applyFct)(int &t, void *d), void *d);

    const int   *getRawArray(void) const        { return arr;      }
    int         *array(void)                    { return arr;      }
    void         setCapacity(unsigned int sz)   { arrSize    = sz; }

    void         display() const;
    
private:
    // Pointer to a list of elements of type Thing:
    int         *arr;

    // The number of elements we have allocated space for versus the actual
    // number of entries in the array:
    unsigned int         arrSize;
    unsigned int         nbrEntries;

    // The guts of the remove() methods.
    int                 removeAt(unsigned int index);
    // The guts of the popHeap() method.
    void                heapify(unsigned int index);
};

UT_SWAPPER_CLASS( UT_IntArray );

UT_API extern int UTcompareInts(const int *a, const int *b);

#endif

---