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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>QuickFIX: /home/omiller/Development/autobuild/quickfix/src/C++/MessageSorters.cpp Source File</title>
<link href="quickfix.css" rel="stylesheet" type="text/css">
<table cellspacing="0" cellpadding="0" border="0">
<tr>
<td>
<img src="images/QuickFIX.jpg" align="middle" border=0>
<a href="index.html">Index</a>
<a href="files.html">Source Files</a>
<a href="annotated.html">Annotated Class List</a>
<a href="classes.html">Alphabetical Class List</a>
<a href="hierarchy.html">Class Hierarchy</a>
<a href="inherits.html">Graphical Class Hierarchy</a>
</td>
</tr>
</table>
</head><body bgcolor="#ffffff">
<!-- Generated by Doxygen 1.6.1 -->
<div class="navpath"><a class="el" href="dir_a9003438d6daff57482a26b22b6121a1.html">src</a> » <a class="el" href="dir_348ef16cf184025134029522e7f02883.html">C++</a>
</div>
<div class="contents">
<h1>MessageSorters.cpp</h1><a href="_message_sorters_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/****************************************************************************</span>
<a name="l00002"></a>00002 <span class="comment">** Copyright (c) quickfixengine.org All rights reserved.</span>
<a name="l00003"></a>00003 <span class="comment">**</span>
<a name="l00004"></a>00004 <span class="comment">** This file is part of the QuickFIX FIX Engine</span>
<a name="l00005"></a>00005 <span class="comment">**</span>
<a name="l00006"></a>00006 <span class="comment">** This file may be distributed under the terms of the quickfixengine.org</span>
<a name="l00007"></a>00007 <span class="comment">** license as defined by quickfixengine.org and appearing in the file</span>
<a name="l00008"></a>00008 <span class="comment">** LICENSE included in the packaging of this file.</span>
<a name="l00009"></a>00009 <span class="comment">**</span>
<a name="l00010"></a>00010 <span class="comment">** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE</span>
<a name="l00011"></a>00011 <span class="comment">** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.</span>
<a name="l00012"></a>00012 <span class="comment">**</span>
<a name="l00013"></a>00013 <span class="comment">** See http://www.quickfixengine.org/LICENSE for licensing information.</span>
<a name="l00014"></a>00014 <span class="comment">**</span>
<a name="l00015"></a>00015 <span class="comment">** Contact ask@quickfixengine.org if any conditions of this licensing are</span>
<a name="l00016"></a>00016 <span class="comment">** not clear to you.</span>
<a name="l00017"></a>00017 <span class="comment">**</span>
<a name="l00018"></a>00018 <span class="comment">****************************************************************************/</span>
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <span class="preprocessor">#ifdef _MSC_VER</span>
<a name="l00021"></a>00021 <span class="preprocessor"></span><span class="preprocessor">#include "stdafx.h"</span>
<a name="l00022"></a>00022 <span class="preprocessor">#else</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#include "config.h"</span>
<a name="l00024"></a>00024 <span class="preprocessor">#endif</span>
<a name="l00025"></a>00025 <span class="preprocessor"></span><span class="preprocessor">#include "<a class="code" href="_call_stack_8h.html">CallStack.h</a>"</span>
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="preprocessor">#include "<a class="code" href="_message_sorters_8h.html">MessageSorters.h</a>"</span>
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="keyword">namespace </span>FIX
<a name="l00030"></a>00030 {
<a name="l00031"></a><a class="code" href="struct_f_i_x_1_1message__order.html#a02a563964f19cabac50d0826ae669aaf">00031</a> <a class="code" href="struct_f_i_x_1_1message__order.html#a80f502cd48b4ae081c33894a2109586b">message_order::message_order</a>( <span class="keywordtype">int</span> first, ... )
<a name="l00032"></a>00032 : m_mode( group ), m_delim( 0 ), m_groupOrder( 0 ), m_largest( 0 )
<a name="l00033"></a>00033 {
<a name="l00034"></a>00034 <span class="keywordtype">int</span> field = first;
<a name="l00035"></a>00035 <span class="keywordtype">int</span> size = 0;
<a name="l00036"></a>00036
<a name="l00037"></a>00037 va_list arguments;
<a name="l00038"></a>00038 va_start( arguments, first );
<a name="l00039"></a>00039 <span class="keywordflow">while</span>( field != 0 )
<a name="l00040"></a>00040 {
<a name="l00041"></a>00041 size++;
<a name="l00042"></a>00042 field = va_arg( arguments, <span class="keywordtype">int</span> );
<a name="l00043"></a>00043 }
<a name="l00044"></a>00044
<a name="l00045"></a>00045 va_start( arguments, first );
<a name="l00046"></a>00046 <span class="keywordtype">int</span>* order = <span class="keyword">new</span> <span class="keywordtype">int</span>[size];
<a name="l00047"></a>00047 order[0] = first;
<a name="l00048"></a>00048 <span class="keywordflow">for</span> ( <span class="keywordtype">int</span> i = 1; i < size; ++i )
<a name="l00049"></a>00049 order[ i ] = va_arg( arguments, <span class="keywordtype">int</span> );
<a name="l00050"></a>00050 <a class="code" href="struct_f_i_x_1_1message__order.html#ae1839f7649b2adcc3a41578183866b38">setOrder</a>(size, order);
<a name="l00051"></a>00051 <span class="keyword">delete</span> [] order;
<a name="l00052"></a>00052
<a name="l00053"></a>00053 va_end( arguments );
<a name="l00054"></a>00054 }
<a name="l00055"></a>00055
<a name="l00056"></a><a class="code" href="struct_f_i_x_1_1message__order.html#ae9196449dd50c2e2416da56a79303f34">00056</a> <a class="code" href="struct_f_i_x_1_1message__order.html#a80f502cd48b4ae081c33894a2109586b">message_order::message_order</a>( <span class="keyword">const</span> <span class="keywordtype">int</span> order[] )
<a name="l00057"></a>00057 : m_mode( group ), m_delim( 0 ), m_groupOrder( 0 ), m_largest( 0 )
<a name="l00058"></a>00058 {
<a name="l00059"></a>00059 <span class="keywordtype">int</span> size = 0;
<a name="l00060"></a>00060 <span class="keywordflow">while</span>( order[size] != 0 ) { ++size; }
<a name="l00061"></a>00061 <a class="code" href="struct_f_i_x_1_1message__order.html#ae1839f7649b2adcc3a41578183866b38">setOrder</a>(size, order);
<a name="l00062"></a>00062 }
<a name="l00063"></a>00063
<a name="l00064"></a><a class="code" href="struct_f_i_x_1_1message__order.html#a17a7b872957786a92103370e61346e27">00064</a> <a class="code" href="struct_f_i_x_1_1message__order.html" title="Sorts fields in header, normal, or trailer order.">message_order</a>& <a class="code" href="struct_f_i_x_1_1message__order.html#a17a7b872957786a92103370e61346e27">message_order::operator=</a>( <span class="keyword">const</span> <a class="code" href="struct_f_i_x_1_1message__order.html" title="Sorts fields in header, normal, or trailer order.">message_order</a>& rhs )
<a name="l00065"></a>00065 { <a class="code" href="_call_stack_8h.html#a3b1ffd24ab4b24161008f4867150f4c8">QF_STACK_PUSH</a>(message_order::operator=)
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <a class="code" href="struct_f_i_x_1_1message__order.html#afd8cbd0a25b855bb760fba0af7697c9b">m_mode</a> = rhs.<a class="code" href="struct_f_i_x_1_1message__order.html#afd8cbd0a25b855bb760fba0af7697c9b">m_mode</a>;
<a name="l00068"></a>00068 <a class="code" href="struct_f_i_x_1_1message__order.html#a4290b3ea1c28919763ff128d84247334">m_delim</a> = rhs.<a class="code" href="struct_f_i_x_1_1message__order.html#a4290b3ea1c28919763ff128d84247334">m_delim</a>;
<a name="l00069"></a>00069 <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> = rhs.<a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a>;
<a name="l00070"></a>00070 <span class="keywordflow">if</span> ( rhs.<a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a> )
<a name="l00071"></a>00071 {
<a name="l00072"></a>00072 <span class="keywordflow">if</span> ( <a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a> ) <span class="keyword">delete</span> [] <a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a>;
<a name="l00073"></a>00073 <a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[ <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> + 1 ];
<a name="l00074"></a>00074 memcpy( <a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a>, rhs.<a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a>,
<a name="l00075"></a>00075 ( <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> + 1 ) * <span class="keyword">sizeof</span>( <span class="keywordtype">int</span> ) );
<a name="l00076"></a>00076 }
<a name="l00077"></a>00077 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00078"></a>00078
<a name="l00079"></a>00079 <a class="code" href="_call_stack_8h.html#ac6b0115ca0a0988c881219c711c9c57e">QF_STACK_POP</a>
<a name="l00080"></a>00080 }
<a name="l00081"></a>00081
<a name="l00082"></a><a class="code" href="struct_f_i_x_1_1message__order.html#ae1839f7649b2adcc3a41578183866b38">00082</a> <span class="keywordtype">void</span> <a class="code" href="struct_f_i_x_1_1message__order.html#ae1839f7649b2adcc3a41578183866b38">message_order::setOrder</a>( <span class="keywordtype">int</span> size, <span class="keyword">const</span> <span class="keywordtype">int</span> order[] )
<a name="l00083"></a>00083 { <a class="code" href="_call_stack_8h.html#a3b1ffd24ab4b24161008f4867150f4c8">QF_STACK_PUSH</a>(message_order::operator=)
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="keywordflow">if</span>(size < 1) <span class="keywordflow">return</span>;
<a name="l00086"></a>00086 <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> = <a class="code" href="struct_f_i_x_1_1message__order.html#a4290b3ea1c28919763ff128d84247334">m_delim</a> = order[0];
<a name="l00087"></a>00087
<a name="l00088"></a>00088 <span class="keywordtype">int</span>* fields = <span class="keyword">new</span> <span class="keywordtype">int</span>[ size + 1 ];
<a name="l00089"></a>00089 fields[ 1 ] = <a class="code" href="struct_f_i_x_1_1message__order.html#a4290b3ea1c28919763ff128d84247334">m_delim</a>;
<a name="l00090"></a>00090 <span class="comment">// collect all fields and find the largest field number</span>
<a name="l00091"></a>00091 <span class="keywordtype">int</span> i;
<a name="l00092"></a>00092 <span class="keywordflow">for</span> ( i = 2; i <= size; ++i )
<a name="l00093"></a>00093 {
<a name="l00094"></a>00094 <span class="keywordtype">int</span> field = order[i-1];
<a name="l00095"></a>00095 <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> = <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> > field ? <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> : field;
<a name="l00096"></a>00096 fields[ i ] = field;
<a name="l00097"></a>00097 }
<a name="l00098"></a>00098
<a name="l00099"></a>00099 <span class="comment">// populate array with field number as key and position as value</span>
<a name="l00100"></a>00100 <a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a> = <span class="keyword">new</span> <span class="keywordtype">int</span>[ <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> + 1 ];
<a name="l00101"></a>00101 memset( <a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a>, 0, ( <a class="code" href="struct_f_i_x_1_1message__order.html#ab7e2ef5dfa42ba170427d322aae4ff8c">m_largest</a> + 1 ) * <span class="keyword">sizeof</span>( <span class="keywordtype">int</span> ) );
<a name="l00102"></a>00102 <span class="keywordflow">for</span> ( i = 1; i <= size; ++i )
<a name="l00103"></a>00103 <a class="code" href="struct_f_i_x_1_1message__order.html#a287bfb8bc28b9084cd9ce94b475a5a34">m_groupOrder</a>[ fields[ i ] ] = i;
<a name="l00104"></a>00104 <span class="keyword">delete</span> [] fields;
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <a class="code" href="_call_stack_8h.html#ac6b0115ca0a0988c881219c711c9c57e">QF_STACK_POP</a>
<a name="l00107"></a>00107 }
<a name="l00108"></a>00108 }
</pre></div></div>
<hr><address><small>
Generated on Mon Apr 5 20:59:50 2010 for QuickFIX by <a href="http://www.doxygen.org/index.html">
<img src="doxygen.gif" alt="doxygen" align="middle" border=0 width=110 height=53>
</a> 1.6.1 written by <a href="mailto:dimitri@stack.nl">Dimitri van Heesch</a>,
© 1997-2001</small></address>
</body>
</html>
|
