blob: 0c22318b6765203178b9478c048c3fcb048731f0 (
plain)
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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/usr/diag/attn/attnlist.C $ */
/* */
/* IBM CONFIDENTIAL */
/* */
/* COPYRIGHT International Business Machines Corp. 2012,2013 */
/* */
/* p1 */
/* */
/* Object Code Only (OCO) source materials */
/* Licensed Internal Code Source Materials */
/* IBM HostBoot Licensed Internal Code */
/* */
/* The source code for this program is not published or otherwise */
/* divested of its trade secrets, irrespective of what has been */
/* deposited with the U.S. Copyright Office. */
/* */
/* Origin: 30 */
/* */
/* IBM_PROLOG_END_TAG */
/**
* @file attnlist.C
*
* @brief HBATTN AttentionList function definitions.
*/
#include "attnfwd.H"
#include "attnlist.H"
#include "attnops.H"
#include <algorithm>
using namespace std;
using namespace PRDF;
namespace ATTN
{
void AttentionList::getAttnList(PRDF::AttnList & o_dest) const
{
// convert AttentionList to PRDF::AttnList
const_iterator sit = begin();
AttnData d;
while(sit != end())
{
sit->getData(d);
o_dest.push_back(d);
++sit;
}
}
void AttentionList::add(const Attention & i_attn)
{
insert(lower_bound(begin(), end(), i_attn), i_attn);
}
}
|