#ifndef _CEGOORDERNODE_H_INCLUDED_
#define _CEGOORDERNODE_H_INCLUDED_
///////////////////////////////////////////////////////////////////////////////
//                                                         
// CegoOrderNode.h
// ---------------
// Cego order node class definition
//     
// Design and Implementation by Bjoern Lemke
//
// (C)opyright 2000-2010 Bjoern Lemke
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2, or (at your option)
// any later version.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; see the file COPYING.  If not, write to
// the Free Software Foundation, 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
//
// INTERFACE MODULE
//
// Class: CegoOrderNode
// 
// Description: 
//
// Status: QG-2.6
//
///////////////////////////////////////////////////////////////////////////////

#include <lfc/ListT.h>

// cego includes

#include "CegoField.h"

class CegoOrderNode {

 public:
    
    enum Ordering { ASC, DESC };
    
    CegoOrderNode();
    CegoOrderNode(ListT<CegoFieldValue>& key, ListT<CegoField>& tuple, ListT<Ordering>* pOrdering);
    ~CegoOrderNode();
    
    ListT<CegoFieldValue>& getKey();
    ListT<CegoField>& getTuple();

    CegoOrderNode& operator = ( const CegoOrderNode& n);
    bool operator == ( const CegoOrderNode& n);
    bool operator > ( const CegoOrderNode& n);
    bool operator < ( const CegoOrderNode& n);

 private:
    
    ListT<Ordering>* _pOrdering;
    ListT<CegoFieldValue> _key;
    ListT<CegoField> _tuple;
    
};

#endif
