project DManager (Data Management)

Classes
class	STK::DataFrame
	DataFrame is a List and a 2D container containing Variables. More...
class	STK::ExportToCsv
	Export data to a Csv stream. More...
class	STK::ImportFromCsv
	import data from a Csv File. More...
class	STK::IVariable
	IVariable is an Interface class for all Variables classes. More...
class	STK::ReadWriteCsv
	the ReadWriteCsv class : allow to write and/or to read a csv file. More...
Enumerations
enum	STK::CSV::readflags { STK::CSV::RF_APPEND_DATA = 0x00000004, STK::CSV::RF_REPLACE_DATA = 0x00000008 }
Functions
template<class TYPE , class TContainer1D >
void	STK::heapSort (ITContainer1D< TYPE, TContainer1D > &T)
	Sort the container T in ascending order.
istream &	STK::operator>> (istream &is, ReadWriteCsv &df)
ostream &	STK::operator<< (ostream &os, const ReadWriteCsv &df)

---

Enumeration Type Documentation

enum STK::CSV::readflags

enumeration of read flags These flags determine the behavior of the reading methods.

Enumerator:

RF_APPEND_DATA
RF_REPLACE_DATA

Definition at line 69 of file STK_ReadWriteCsv.h.

  {
    RF_APPEND_DATA    = 0x00000004,
    RF_REPLACE_DATA   = 0x00000008
  };

---

Function Documentation

template<class TYPE , class TContainer1D >

void STK::heapSort

(

ITContainer1D< TYPE, TContainer1D > &

T

)

[inline]

Parameters:

T

the container to sort

Definition at line 59 of file STK_HeapSort.h.

References STK::ITContainer1D< TYPE, TContainer1D >::first(), and STK::ITContainer1D< TYPE, TContainer1D >::size().

Referenced by STK::Stat::Univariate< Real, TContainer1D >::compOrderStatistics().

{
  // number of elements
  Integer nelt = T.size();
  // if the container is not base one
  Integer shift = T.first() - 1, shift1 = T.first();
  // Sort T using a heapsort
  // index first will be decreased until it reach 1,
  // then  last will be decremented until it reach 1
  for (Integer first = nelt/2 + 1, last = nelt;;)
  { // the current value to sort
    TYPE current;
    if (first>1)
    { // Decrease first and get the next
      current = T[shift + (--first)];
    }
    else  // first == 1
    { // get current at the end of the array
      current = T[shift + last];
      // Put the top of the heap at the end
      T[shift + last] = T[shift1];
      // decrease last.  last==1 : we end the job
      if (--last == 1)
      { T[shift1] = current;
        break;
      }
    }
    // organize the heap
    Integer i=first, j=first+1;
    while (j <= last)
    { // j+1 is greatest child
      if ( j < last && T[shift + j] < T[shift1 + j] ) j++;
      // we have find a child gt current
      if (current >= T[shift + j]) break;
      // else shift the inner value
      T[shift + i] = T[shift + j];
      // go down in the tree
      i = j;
      j*= 2;
    }
    // plug current in its final location
    T[shift + i] = current;
  }
}

istream& STK::operator>>	(	istream &	is,
		ReadWriteCsv &	df
	)

Read the data from the stream and returns the stream when done.

Parameters:

	is	input stream
	df	the ReadWriteCsv to read

ostream & STK::operator<<	(	ostream &	os,
		const ReadWriteCsv &	df
	)

write the data into the stream and returns the stream when done.

Parameters:

	os	output stream
	df	the ReadWriteCsv to write

Definition at line 770 of file STK_ReadWriteCsv.cpp.

References STK::ITContainer1D< TYPE, TContainer1D >::first(), STK::ReadWriteCsv::getLargestLastVe(), STK::ReadWriteCsv::getLowerFirstVe(), STK::ITContainer1D< TYPE, TContainer1D >::last(), STK::ReadWriteCsv::str_data_, and STK::ReadWriteCsv::writeSelection().

{
  try
  {
    df.writeSelection( os
                     , df.getLowerFirstVe()
                     , df.getLargestLastVe()
                     , df.str_data_.first()
                     , df.str_data_.last()
                     );
  }
  // catch and re-throw any exceptions
  catch(const std::exception& e) { throw e; }
  catch(...) { throw std::exception(); }
  return os;
}