Index  Source Files  Annotated Class List  Alphabetical Class List  Class Hierarchy  Graphical Class Hierarchy

FIX::message_order Struct Reference

Sorts fields in header, normal, or trailer order. More...

#include <MessageSorters.h>

List of all members.

Public Types
enum	cmp_mode { header, trailer, normal, group }
Public Member Functions
	message_order (cmp_mode mode=normal)
	message_order (int first,...)
	message_order (const int order[])
	message_order (const message_order &copy)
virtual	~message_order ()
bool	operator() (const int &x, const int &y) const
message_order &	operator= (const message_order &rhs)
Private Member Functions
void	setOrder (int size, const int order[])
Private Attributes
cmp_mode	m_mode
int	m_delim
int *	m_groupOrder
int	m_largest

---

Detailed Description

Sorts fields in header, normal, or trailer order.

Used as a dynamic sorter to create Header, Trailer, and Message FieldMaps while maintaining the same base type.

Definition at line 112 of file MessageSorters.h.

---

Member Enumeration Documentation

enum FIX::message_order::cmp_mode

Enumeration values: header  trailer  normal  group  Definition at line 115 of file MessageSorters.h. { header, trailer, normal, group };

---

Constructor & Destructor Documentation

FIX::message_order::message_order (  cmp_mode  mode = normal  )  [inline]

Definition at line 117 of file MessageSorters.h. References m_groupOrder, and m_mode. : m_mode( mode ), m_groupOrder( 0 ) {}

FIX::message_order::message_order (  int  first,   ... )

Definition at line 31 of file MessageSorters.cpp. References setOrder(). : m_mode( group ), m_delim( 0 ), m_groupOrder( 0 ), m_largest( 0 ) { int field = first; int size = 0; va_list arguments; va_start( arguments, first ); while( field != 0 ) { size++; field = va_arg( arguments, int ); } va_start( arguments, first ); int* order = new int[size]; order[0] = first; for ( int i = 1; i < size; ++i ) order[ i ] = va_arg( arguments, int ); setOrder(size, order); delete [] order; va_end( arguments ); }

FIX::message_order::message_order (  const int  order[]  )

Definition at line 56 of file MessageSorters.cpp. References setOrder(). : m_mode( group ), m_delim( 0 ), m_groupOrder( 0 ), m_largest( 0 ) { int size = 0; while( order[size] != 0 ) { ++size; } setOrder(size, order); }

FIX::message_order::message_order (  const message_order &  copy  )  [inline]

Definition at line 120 of file MessageSorters.h. References m_groupOrder. : m_groupOrder( 0 ) { *this = copy; }

virtual FIX::message_order::~message_order (   )  [inline, virtual]

Definition at line 123 of file MessageSorters.h. References m_groupOrder. { if ( m_groupOrder ) delete [] m_groupOrder; }

---

Member Function Documentation

bool FIX::message_order::operator() (  const int &  x, const int &  y )  const [inline]

Definition at line 129 of file MessageSorters.h. References group, m_groupOrder, m_largest, m_mode, and normal. { switch ( m_mode ) { case header: return header_order::compare( x, y ); case trailer: return trailer_order::compare( x, y ); case group: return group_order::compare( x, y, m_groupOrder, m_largest ); case normal: default: return x < y; } }

message_order & FIX::message_order::operator= (  const message_order &  rhs  )

Definition at line 64 of file MessageSorters.cpp. References m_delim, m_groupOrder, m_largest, m_mode, QF_STACK_POP, and QF_STACK_PUSH. { QF_STACK_PUSH(message_order::operator=) m_mode = rhs.m_mode; m_delim = rhs.m_delim; m_largest = rhs.m_largest; if ( rhs.m_groupOrder ) { if ( m_groupOrder ) delete [] m_groupOrder; m_groupOrder = new int[ m_largest + 1 ]; memcpy( m_groupOrder, rhs.m_groupOrder, ( m_largest + 1 ) * sizeof( int ) ); } return *this; QF_STACK_POP }

void FIX::message_order::setOrder (  int  size, const int  order[] )  [private]

Definition at line 82 of file MessageSorters.cpp. References m_groupOrder, m_largest, QF_STACK_POP, and QF_STACK_PUSH. Referenced by message_order(). { QF_STACK_PUSH(message_order::operator=) if(size < 1) return; m_largest = m_delim = order[0]; int* fields = new int[ size + 1 ]; fields[ 1 ] = m_delim; // collect all fields and find the largest field number int i; for ( i = 2; i <= size; ++i ) { int field = order[i-1]; m_largest = m_largest > field ? m_largest : field; fields[ i ] = field; } // populate array with field number as key and position as value m_groupOrder = new int[ m_largest + 1 ]; memset( m_groupOrder, 0, ( m_largest + 1 ) * sizeof( int ) ); for ( i = 1; i <= size; ++i ) m_groupOrder[ fields[ i ] ] = i; delete [] fields; QF_STACK_POP }

---

Member Data Documentation

int FIX::message_order::m_delim [private]

Definition at line 150 of file MessageSorters.h. Referenced by operator=().

int* FIX::message_order::m_groupOrder [private]

Definition at line 151 of file MessageSorters.h. Referenced by message_order(), operator()(), operator=(), setOrder(), and ~message_order().

int FIX::message_order::m_largest [private]

Definition at line 152 of file MessageSorters.h. Referenced by operator()(), operator=(), and setOrder().

cmp_mode FIX::message_order::m_mode [private]

Definition at line 149 of file MessageSorters.h. Referenced by message_order(), operator()(), and operator=().

---

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

• /home/orenmnero/autobuild/quickfix/src/C++/MessageSorters.h
• /home/orenmnero/autobuild/quickfix/src/C++/MessageSorters.cpp

---