Line data Source code
1 : /*
2 : * Copyright (c) 2011-2015: G-CSC, Goethe University Frankfurt
3 : * Author: Sebastian Reiter
4 : *
5 : * This file is part of UG4.
6 : *
7 : * UG4 is free software: you can redistribute it and/or modify it under the
8 : * terms of the GNU Lesser General Public License version 3 (as published by the
9 : * Free Software Foundation) with the following additional attribution
10 : * requirements (according to LGPL/GPL v3 §7):
11 : *
12 : * (1) The following notice must be displayed in the Appropriate Legal Notices
13 : * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
14 : *
15 : * (2) The following notice must be displayed at a prominent place in the
16 : * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
17 : *
18 : * (3) The following bibliography is recommended for citation and must be
19 : * preserved in all covered files:
20 : * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
21 : * parallel geometric multigrid solver on hierarchically distributed grids.
22 : * Computing and visualization in science 16, 4 (2013), 151-164"
23 : * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
24 : * flexible software system for simulating pde based models on high performance
25 : * computers. Computing and visualization in science 16, 4 (2013), 165-179"
26 : *
27 : * This program is distributed in the hope that it will be useful,
28 : * but WITHOUT ANY WARRANTY; without even the implied warranty of
29 : * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
30 : * GNU Lesser General Public License for more details.
31 : */
32 :
33 : #include "binary_buffer.h"
34 :
35 : namespace ug
36 : {
37 :
38 0 : BinaryBuffer::BinaryBuffer() :
39 0 : m_readPos(0), m_writePos(0)
40 : {
41 0 : }
42 :
43 0 : BinaryBuffer::BinaryBuffer(size_t bufSize) :
44 0 : m_data(bufSize), m_readPos(0), m_writePos(0)
45 : {
46 0 : }
47 :
48 0 : void BinaryBuffer::clear()
49 : {
50 : // PLEASE NOTE: There are classes and algorithms that rely on the
51 : // fact, that clear does not release the memory in m_data.
52 : // Please do not change this behavior - or severe performance
53 : // drawbacks will be the result. (Note that this behavior can
54 : // also be found in the stl::vector implementations).
55 0 : m_readPos = m_writePos = 0;
56 0 : }
57 :
58 0 : void BinaryBuffer::reserve(size_t newSize)
59 : {
60 0 : if(newSize > m_data.size())
61 0 : m_data.resize(newSize);
62 0 : }
63 :
64 0 : void BinaryBuffer::set_read_pos(size_t pos)
65 : {
66 0 : m_readPos = pos;
67 0 : }
68 :
69 0 : void BinaryBuffer::set_write_pos(size_t pos)
70 : {
71 0 : m_writePos = pos;
72 0 : }
73 :
74 : }// end of namespace
|