/usr/include/Ice/Buffer.h is in libzeroc-ice-dev 3.7.0-5.
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 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 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 | // **********************************************************************
//
// Copyright (c) 2003-2017 ZeroC, Inc. All rights reserved.
//
// This copy of Ice is licensed to you under the terms described in the
// ICE_LICENSE file included in this distribution.
//
// **********************************************************************
#ifndef ICE_BUFFER_H
#define ICE_BUFFER_H
#include <Ice/Config.h>
namespace IceInternal
{
class ICE_API Buffer : private IceUtil::noncopyable
{
public:
Buffer() : i(b.begin()) { }
Buffer(const Ice::Byte* beg, const Ice::Byte* end) : b(beg, end), i(b.begin()) { }
Buffer(const std::vector<Ice::Byte>& v) : b(v), i(b.begin()) { }
Buffer(Buffer& o, bool adopt) : b(o.b, adopt), i(b.begin()) { }
void swapBuffer(Buffer&);
class ICE_API Container : private IceUtil::noncopyable
{
public:
//
// Standard vector-like operations.
//
typedef Ice::Byte value_type;
typedef Ice::Byte* iterator;
typedef const Ice::Byte* const_iterator;
typedef Ice::Byte& reference;
typedef const Ice::Byte& const_reference;
typedef Ice::Byte* pointer;
typedef size_t size_type;
Container();
Container(const_iterator, const_iterator);
Container(const std::vector<value_type>&);
Container(Container&, bool);
~Container();
iterator begin()
{
return _buf;
}
const_iterator begin() const
{
return _buf;
}
iterator end()
{
return _buf + _size;
}
const_iterator end() const
{
return _buf + _size;
}
size_type size() const
{
return _size;
}
bool empty() const
{
return !_size;
}
void swap(Container&);
void clear();
void resize(size_type n) // Inlined for performance reasons.
{
if(n == 0)
{
clear();
}
else if(n > _capacity)
{
reserve(n);
}
_size = n;
}
void reset()
{
if(_size > 0 && _size * 2 < _capacity)
{
//
// If the current buffer size is smaller than the
// buffer capacity, we shrink the buffer memory to the
// current size. This is to avoid holding onto too much
// memory if it's not needed anymore.
//
if(++_shrinkCounter > 2)
{
reserve(_size);
_shrinkCounter = 0;
}
}
else
{
_shrinkCounter = 0;
}
_size = 0;
}
void push_back(value_type v)
{
resize(_size + 1);
_buf[_size - 1] = v;
}
reference operator[](size_type n)
{
assert(n < _size);
return _buf[n];
}
const_reference operator[](size_type n) const
{
assert(n < _size);
return _buf[n];
}
private:
Container(const Container&);
void operator=(const Container&);
void reserve(size_type);
pointer _buf;
size_type _size;
size_type _capacity;
int _shrinkCounter;
bool _owned;
};
Container b;
Container::iterator i;
};
}
#endif
|