/usr/include/quickfix/Group.h is in libquickfix-dev 1.13.3+dfsg-9ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 | /* -*- C++ -*- */
/****************************************************************************
** Copyright (c) quickfixengine.org All rights reserved.
**
** This file is part of the QuickFIX FIX Engine
**
** This file may be distributed under the terms of the quickfixengine.org
** license as defined by quickfixengine.org and appearing in the file
** LICENSE included in the packaging of this file.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.quickfixengine.org/LICENSE for licensing information.
**
** Contact ask@quickfixengine.org if any conditions of this licensing are
** not clear to you.
**
****************************************************************************/
#ifndef FIX_GROUP
#define FIX_GROUP
#ifdef _MSC_VER
#pragma warning( disable: 4786 )
#endif
#include "FieldMap.h"
#include "Fields.h"
#include <vector>
namespace FIX
{
/**
* Base class for all %FIX repeating groups.
*
* A group consists of a count field, deliminator, and a sorting order.
*/
class Group : public FieldMap
{
public:
Group( int field, int delim )
: FieldMap( message_order( delim, 0 ) ),
m_field( field ), m_delim( delim ) {}
Group( int field, int delim, const int order[] )
: FieldMap( order ), m_field( field ), m_delim( delim ) {}
Group( int field, int delim, const message_order& order )
: FieldMap( order ), m_field( field ), m_delim( delim ) {}
Group( const Group& copy )
: FieldMap( copy ), m_field( copy.m_field ), m_delim( copy.m_delim ) {}
int field() const { return m_field; }
int delim() const { return m_delim; }
void addGroup( Group& group );
void replaceGroup( unsigned num, Group& group );
Group& getGroup( unsigned num, Group& group ) const throw( FieldNotFound );
void removeGroup( unsigned num, Group& group );
void removeGroup( Group& group );
bool hasGroup( const Group& group );
bool hasGroup( unsigned num, Group& group );
private:
int m_field;
int m_delim;
};
}
#endif //FIX_GROUP
|