array_t.h

//File: $Id$
// Author: K. John Wu <John.Wu at acm.org>
//         Lawrence Berkeley National Laboratory
// Copyright 2000-2009 University of California
#ifndef IBIS_ARRAY_T_H
#define IBIS_ARRAY_T_H
#include "fileManager.h"
#include "horometer.h"
#include <iomanip>      // std::setw
#include <cstddef>      // ptrdiff_t

#ifdef __GNUC__
#pragma interface
#endif
template<class T> class ibis::array_t {
public:
    typedef       T* iterator; 
    typedef const T* const_iterator; 
    typedef       T* pointer; 
    typedef const T* const_pointer; 
    typedef       T& reference; 
    typedef const T& const_reference; 
    typedef       T  value_type; 
    typedef  size_t  size_type; 
    typedef std::ptrdiff_t difference_type; 

    // constructor and destructor
    ~array_t<T>() {freeMemory();}
    array_t<T>();
    explicit array_t<T>(size_t n); // donot convert integer to array_t
    array_t<T>(size_t n, const T& val);
    array_t<T>(const array_t<T>& rhs);
    array_t<T>(const std::vector<T>& rhs);
    array_t<T>(const array_t<T>& rhs, const size_t offset,
               const size_t nelm=0);
    array_t<T>(ibis::fileManager::storage* rhs);
    array_t<T>(ibis::fileManager::storage* rhs, const size_t start,
               const size_t nelm);
    array_t<T>(const int fdes, const off_t begin, const off_t end);
    array_t<T>(const char *fn, const off_t begin, const off_t end);

    array_t<T>& operator=(const array_t<T>& rhs);
    void copy(const array_t<T>& rhs);
    void deepCopy(const array_t<T>& rhs);

    // functions for the iterators
    T* begin() {return m_begin;};
    T* end() {return m_end;};
    T& front() {return *m_begin;};
    T& back() {return m_end[-1];};
    const T* begin() const {return m_begin;};
    const T* end() const {return m_end;};
    const T& front() const {return *m_begin;};
    const T& back() const {return m_end[-1];};

    bool empty() const {return (m_begin == 0 || m_begin >= m_end);};
    size_t size() const {       
        return (m_begin > 0 && m_end > m_begin ? m_end - m_begin : 0);
    };
    void clear() {m_end = m_begin;};    

    void pop_back() {--m_end;};         
    void resize(size_t n);      
    void reserve(size_t n);     
    size_t capacity() const;
    inline void swap(array_t<T>& rhs);  
    inline void push_back(const T& elm);

    void sort(array_t<uint32_t> &ind) const;
    void topk(uint32_t k, array_t<uint32_t> &ind) const;
    void bottomk(uint32_t k, array_t<uint32_t> &ind) const;
    uint32_t find(const array_t<uint32_t>& ind, const T& val) const;
    size_t find(const T& val) const;
    size_t find_upper(const T& val) const;
    void stableSort(array_t<T>& tmp);
    void stableSort(array_t<uint32_t>& ind) const;
    void stableSort(array_t<uint32_t>& ind, array_t<T>& sorted) const;
    static void stableSort(array_t<T>& val, array_t<uint32_t>& ind,
                           array_t<T>& tmp, array_t<uint32_t>& itmp);

    const T& operator[](size_t i) const {return m_begin[i];}
    T& operator[](size_t i) {return m_begin[i];};
    void nosharing();
    bool incore() const {return(actual != 0 ? actual->unnamed() != 0 : false);}

    iterator insert(iterator pos, const T& val);
    void insert(iterator p, size_t n, const T& val);
    void insert(iterator p, const_iterator i, const_iterator j);

    // erase one value or a range of values
    iterator erase(iterator p);
    iterator erase(iterator i, iterator j);

    // the IO functions
    void read(const char*); 
    off_t read(const int fdes, const off_t begin,
               const off_t end); 
    void write(const char*) const; 
    void write(FILE* fptr) const;  

    // print internal pointer addresses
    void printStatus(std::ostream& out) const;

    ibis::fileManager::storage* getStorage() {return actual;}

private:
    ibis::fileManager::storage *actual; 
    T* m_begin; 
    T* m_end;   
    // ibis::horometer timer; // a timer to track usage

    void freeMemory(); 

    uint32_t partition(array_t<uint32_t>& ind, uint32_t front,
                     uint32_t back) const;
    void isort(array_t<uint32_t>& ind, uint32_t front, uint32_t back) const;
    void hsort(array_t<uint32_t>& ind, uint32_t front, uint32_t back) const;
    void qsort(array_t<uint32_t>& ind, uint32_t front, uint32_t back,
               uint32_t lvl=0) const;
};

template<class T>
inline void ibis::array_t<T>::swap(array_t<T>& rhs) {
    ibis::fileManager::storage *a = rhs.actual;
    rhs.actual = actual;
    actual = a;
    T* b = rhs.m_begin;
    rhs.m_begin = m_begin;
    m_begin = b;
    T* e = rhs.m_end;
    rhs.m_end = m_end;
    m_end = e;
} // ibis::array_t<T>::swap

template<class T> 
inline void ibis::array_t<T>::push_back(const T& elm) {
    if (actual == 0) { // allocate storage
        actual = new ibis::fileManager::storage(3*sizeof(T));
        actual->beginUse();
        m_begin = (T*)(actual->begin());
        m_end = m_begin + 1;
        *m_begin = elm;
    }
    else if (m_begin != 0 && m_end != 0 && actual->begin() > 0 &&
             actual->end() > actual->begin() && actual->inUse() <= 1 &&
             (char*)(m_end+1) <= actual->end()) { // simply add value
        *m_end = elm;
        ++ m_end;
    }
    else { // copy-and-swap
        const difference_type nexist = (m_end - m_begin);
        const size_t newsize = (nexist >= 7 ? nexist : 7) + nexist;
        if ((long long) newsize < nexist) {
            throw "array_t must have less than 2^31 elements";
        }

        array_t<T> tmp(newsize); // allocate new array
        tmp.resize(static_cast<size_t>(nexist+1));
        for (difference_type j = 0; j < nexist; ++ j) // copy
            tmp.m_begin[j] = m_begin[j];
        tmp.m_begin[nexist] = elm;
        swap(tmp); // swap
    }
} // ibis::array_t<T>::push_back

template <class T>
inline size_t ibis::array_t<T>::capacity() const {
    return (actual != 0 ? (const T*)actual->end() - m_begin : 0);
} // ibis::array_t<T>::capacity
#endif // IBIS_ARRAY_T_H

	Contact us Disclaimers FastBit source code FastBit mailing list archive