Public Member Functions
ibis::colUBytes Class Reference

A class to store unsigned 64-bit integer values. More...

#include <colValues.h>

Inheritance diagram for ibis::colUBytes:
ibis::colValues

List of all members.

Public Member Functions

virtual void bottomk (uint32_t k, array_t< uint32_t > &ind) const
 Return the positions of the k smallest elements.
 colUBytes (const ibis::column *c, const ibis::bitvector &hits)
 colUBytes (const ibis::column *c)
 colUBytes (const ibis::column *c, ibis::fileManager::storage *store, const uint32_t start, const uint32_t nelm)
virtual uint32_t elementSize () const
virtual bool empty () const
virtual void erase (uint32_t i, uint32_t j)
virtual void * getArray () const
 Return the pointer to the pointer to underlying array_t<T> object.
virtual double getDouble (uint32_t i) const
virtual float getFloat (uint32_t i) const
virtual int32_t getInt (uint32_t i) const
virtual int64_t getLong (uint32_t i) const
virtual double getMax () const
virtual double getMin () const
virtual double getSum () const
virtual ibis::TYPE_T getType () const
 Return the type of the data stored.
virtual uint32_t getUInt (uint32_t i) const
virtual uint64_t getULong (uint32_t i) const
virtual void nosharing ()
 Make sure the content of the underlying storage is not shared.
virtual void reduce (const array_t< uint32_t > &starts)
 Remove the duplicate elements according to the array starts.
virtual void reduce (const array_t< uint32_t > &starts, ibis::selectClause::AGREGADO func)
 Remove the duplicate elements according to the array starts.
virtual void reorder (const array_t< uint32_t > &ind)
 Reorder the values according to the specified indices.
virtual array_t< uint32_t > * segment (const array_t< uint32_t > *old=0) const
 Produce an array of the starting positions of values that are the same.
virtual uint32_t size () const
virtual void sort (uint32_t i, uint32_t j, array_t< uint32_t > &neworder) const
 Sort rows in the range [i, j).
virtual void sort (uint32_t i, uint32_t j, bundle *bdl)
 Sort rows in the range [i, j).
virtual void sort (uint32_t i, uint32_t j, bundle *bdl, colList::iterator head, colList::iterator tail)
 Sort rows in the range [i, j).
void swap (colUBytes &rhs)
virtual void swap (uint32_t i, uint32_t j)
virtual void topk (uint32_t k, array_t< uint32_t > &ind) const
 Return the positions of the k largest elements.
virtual long truncate (uint32_t keep)
 Truncate the number element to no more than keep.
virtual long truncate (uint32_t keep, uint32_t start)
 Truncate the number element to no more than keep.
virtual void write (std::ostream &out, uint32_t i) const
 Write the ith element as text.
virtual uint32_t write (FILE *fptr) const
 Write out the whole array as binary.

Detailed Description

A class to store unsigned 64-bit integer values.


Member Function Documentation

virtual void ibis::colUBytes::reorder ( const array_t< uint32_t > &  ind) [inline, virtual]

Reorder the values according to the specified indices.

New[i] = Old[ind[i]].

Implements ibis::colValues.

References ibis::util::reorder().

ibis::array_t< uint32_t > * ibis::colUBytes::segment ( const array_t< uint32_t > *  old = 0) const [virtual]

Produce an array of the starting positions of values that are the same.

Implements ibis::colValues.

References ibis::array_t< T >::push_back(), and ibis::array_t< T >::size().

void ibis::colUBytes::sort ( uint32_t  i,
uint32_t  j,
array_t< uint32_t > &  neworder 
) const [virtual]

Sort rows in the range [i, j).

Output the new order in array neworder.

Implements ibis::colValues.

References ibis::array_t< T >::clear(), ibis::array_t< T >::push_back(), and ibis::array_t< T >::reserve().

virtual void ibis::colUBytes::sort ( uint32_t  i,
uint32_t  j,
bundle bdl,
colList::iterator  head,
colList::iterator  tail 
) [virtual]

Sort rows in the range [i, j).

Also sort the columns between [head, tail).

Implements ibis::colValues.


The documentation for this class was generated from the following files:

Make It A Bit Faster
Contact us
Disclaimers
FastBit source code
FastBit mailing list archive