summaryrefslogtreecommitdiff
path: root/src/pdu_iterator.cpp
blob: 55cfa0047f41074d258e1820666bf492f40080fe (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
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
/*
 * Copyright (c) 2017, Matias Fontanini
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met:
 * 
 * * Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * * Redistributions in binary form must reproduce the above
 *   copyright notice, this list of conditions and the following disclaimer
 *   in the documentation and/or other materials provided with the
 *   distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 */

#include <tins/pdu_iterator.h>
#include <tins/pdu.h>
#include <tins/packet.h>

namespace Tins {

// PDUIterator
PDUIterator::PDUIterator(pointer pdu)
: pdu_(pdu) {

}

PDUIterator::pointer PDUIterator::operator->() {
    return pdu_;
}

PDUIterator::pointer PDUIterator::operator->() const {
    return pdu_;
}

PDUIterator::value_type PDUIterator::operator*() {
    return *pdu_;
}

const PDU& PDUIterator::operator*() const {
    return *pdu_;
}

// ConstPDUIterator

ConstPDUIterator::ConstPDUIterator(pointer pdu)
: pdu_(pdu) {

}

ConstPDUIterator::ConstPDUIterator(PDUIterator iterator) 
: pdu_(&*iterator) {

}

ConstPDUIterator::pointer ConstPDUIterator::operator->() const {
    return pdu_;
}

ConstPDUIterator::value_type ConstPDUIterator::operator*() const {
    return *pdu_;
}

// Helpers

PDUIteratorRange<PDUIterator> iterate_pdus(PDU* pdu) {
    return PDUIteratorRange<PDUIterator>(pdu, 0);
}

PDUIteratorRange<PDUIterator> iterate_pdus(PDU& pdu) {
    return PDUIteratorRange<PDUIterator>(&pdu, 0);
}

PDUIteratorRange<PDUIterator> iterate_pdus(Packet& packet) {
    return PDUIteratorRange<PDUIterator>(packet.pdu(), 0);
}

PDUIteratorRange<ConstPDUIterator> iterate_pdus(const PDU* pdu) {
    return PDUIteratorRange<ConstPDUIterator>(pdu, 0);
}

PDUIteratorRange<ConstPDUIterator> iterate_pdus(const PDU& pdu) {
    return PDUIteratorRange<ConstPDUIterator>(&pdu, 0);
}

PDUIteratorRange<ConstPDUIterator> iterate_pdus(const Packet& packet) {
    return PDUIteratorRange<ConstPDUIterator>(packet.pdu(), 0);
}

} // Tins